| /oneTBB/src/tbbmalloc_proxy/ |
| H A D | function_replacement.cpp | 303 static void CorrectOffset( UINT_PTR address, const char* pattern, UINT distance ) in CorrectOffset() argument 305 const char* pos = strstr(pattern, "#*******"); in CorrectOffset() 307 address += (pos - pattern)/2; // compute the offset position in CorrectOffset() 332 bytesToMove = strlen(pattern)/2-1; // The last byte matching the pattern must not be copied in InsertTrampoline32() 345 CorrectOffset( trampAddr, pattern, offset32 ); in InsertTrampoline32() 394 bytesToMove = strlen(pattern)/2-1; // The last byte matching the pattern must not be copied in InsertTrampoline64() 407 CorrectOffset( trampAddr, pattern, offset32 ); in InsertTrampoline64() 443 const char* pattern = nullptr; in InsertTrampoline() local 456 pattern = opcodes[opcodeIdx-1]; // -1 compensates for +1 in CheckOpcodes in InsertTrampoline() 460 probeSize = InsertTrampoline32(inpAddr, targetAddr, pattern, origFunc); in InsertTrampoline() [all …]
|
| /oneTBB/doc/main/reference/scalable_memory_pools/ |
| H A D | malloc_replacement_log.rst | 34 … checks if each one has a known bytecode pattern. If any required function is not found or its byt… 49 search_status: function_name (dll_name), byte pattern: <bytecodes> 83 Success: free (ucrtbase.dll), byte pattern: <C7442410000000008B4424> 84 Fail: _msize (ucrtbase.dll), byte pattern: <E90B000000CCCCCCCCCCCC>
|
| /oneTBB/doc/main/tbb_userguide/design_patterns/ |
| H A D | Odd-Even_Communication.rst | 25 follow this pattern. For example, for a 2D grid with only 32 Time Domain (FDTD solvers, which naturally fit the pattern. 51 Apply the elementwise pattern to each subset.
|
| H A D | Design_Patterns.rst | 11 The description of each pattern has the following format: 20 - **Forces** - considerations that drive use of the pattern. 23 - **Solution** - describes how to implement the pattern.
|
| H A D | Elementwise.rst | 25 summary information is collected, use the Reduction pattern instead. 52 If the pattern is followed by a reduction on the same data, consider 90 The inner loop does not fit the elementwise pattern, because each 92 fits the elementwise pattern. It is straightforward to render it
|
| H A D | General_References.rst | 7 This section lists general references. References specific to a pattern 8 are listed at the end of the topic for the pattern.
|
| H A D | Divide_and_Conquer.rst | 121 The change is an instance of the Agglomeration pattern. 208 If parallel overhead is high, use the agglomeration pattern. For 216 pattern.
|
| H A D | Non-Preemptive_Priorities.rst | 118 Class ``ReadyPile`` contains the core pattern. It maintains a 174 The scalability of the pattern is limited by the scalability of
|
| H A D | Local_Serializer.rst | 195 pattern: 273 The pattern generalizes to constraints on work items more general
|
| H A D | Reduction.rst | 105 are a built in form of the agglomeration pattern. If there is an 171 The outer if-else is an instance of the agglomeration pattern for
|
| H A D | Wavefront.rst | 132 dependence pattern, but at a block scale. Hence scheduling overheads
|
| /oneTBB/test/common/ |
| H A D | memory_usage.h | 102 const char* pattern = stat == peakUsage ? "VmPeak: %lu" : "VmSize: %lu"; variable 104 if (1 == sscanf(buf_stat, pattern, &size)) {
|
| H A D | doctest.h | 6503 bool parseOptionImpl(int argc, const char* const* argv, const char* pattern, String* value) { 6507 auto temp = std::strstr(argv[index], pattern); 6521 temp += strlen(pattern); 6544 if(parseOptionImpl(argc, argv, pattern + strlen(DOCTEST_CONFIG_OPTIONS_PREFIX), value)) 6547 return parseOptionImpl(argc, argv, pattern, value); 6551 bool parseFlag(int argc, const char* const* argv, const char* pattern) { 6552 return parseOption(argc, argv, pattern); 6556 bool parseCommaSepArgs(int argc, const char* const* argv, const char* pattern, 6559 if(parseOption(argc, argv, pattern, &filtersString)) { 6608 bool parseIntOption(int argc, const char* const* argv, const char* pattern, optionType type, [all …]
|
| /oneTBB/doc/main/tbb_userguide/ |
| H A D | Summary_of_Loops_and_Pipelines.rst | 8 They let you design your software at a high task-pattern level and not worry about low-level manipu…
|
| H A D | Working_on_the_Assembly_Line_pipeline.rst | 7 *Pipelining* is a common parallel pattern that mimics a traditional 18 ``parallel_pipeline`` and filter implement the pipeline pattern. A
|
| /oneTBB/examples/concurrent_priority_queue/shortpath/ |
| H A D | README.md | 12 The generated graph follows a pattern in which the closer two pairs of node ids are together, the f…
|
| /oneTBB/doc/main/tbb_userguide/Migration_Guide/ |
| H A D | Task_API.rst | 92 completes only when all functors passed to the parallel pattern complete their execution. 96 parallel pattern. The ``tbb::parallel_do`` algorithm logic may be implemented using the task API as:
|
| /oneTBB/doc/ |
| H A D | Doxyfile.in | 891 # exclude all test directories for example use the pattern */test/* 902 # exclude all test directories use the pattern */test/* 913 # EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and 953 # The FILTER_PATTERNS tag can be used to specify filters on a per file pattern 954 # basis. Doxygen will compare the file name with each pattern and apply the 955 # filter if there is a match. The filters are a list of the form: pattern=filter 974 # pattern. A pattern will override the setting for FILTER_PATTERN (if any) and 975 # it is also possible to disable source filtering for a specific pattern using
|
| /oneTBB/ |
| H A D | third-party-programs.txt | 154 … aim of protecting users' freedom to change the software. The systematic pattern of such abuse occ…
|