| /external/OpenCL-CTS/test_conformance/SVM/ |
| D | test_cross_buffer_pointers.cpp | 8 // http://www.apache.org/licenses/LICENSE-2.0
21 "typedef struct Node {\n"
24 " __global struct Node* pNext;\n"
25 "} Node;\n"
27 …"__global Node* allocate_node(__global Node* pNodes1, __global Node* pNodes2, volatile __global in…
36 // The allocation_index parameter must be initialized on the host to N work-items
38 …"__kernel void create_linked_lists(__global Node* pNodes, __global Node* pNodes2, volatile __globa…
41 " __global Node *pNode = &pNodes[i];\n"
43 " pNode->global_id = i;\n"
44 " pNode->position_in_list = 0;\n"
[all …]
|
| D | test_shared_address_space_coarse_grain.cpp | 8 // http://www.apache.org/licenses/LICENSE-2.0
19 cl_int create_linked_lists_on_host(cl_command_queue cmdq, cl_mem nodes, Node *pNodes2, cl_int ListL… in create_linked_lists_on_host()
25 Node *pNodes; in create_linked_lists_on_host()
28 …pNodes = (Node*) clEnqueueMapBuffer(cmdq, nodes, CL_TRUE, CL_MAP_READ | CL_MAP_WRITE, 0, sizeof(No… in create_linked_lists_on_host()
34 …error = clEnqueueSVMMap(cmdq, CL_TRUE, CL_MAP_READ | CL_MAP_WRITE, pNodes2, sizeof(Node)*ListLengt… in create_linked_lists_on_host()
57 cl_int verify_linked_lists_on_host(int ci, cl_command_queue cmdq, cl_mem nodes, Node *pNodes2, cl_i… in verify_linked_lists_on_host() argument
61 Node *pNodes; in verify_linked_lists_on_host()
64 …pNodes = (Node*) clEnqueueMapBuffer(cmdq, nodes, CL_TRUE, CL_MAP_READ | CL_MAP_WRITE, 0, sizeof(No… in verify_linked_lists_on_host()
70 …error = clEnqueueSVMMap(cmdq, CL_TRUE, CL_MAP_READ | CL_MAP_WRITE, pNodes2, sizeof(Node)*ListLengt… in verify_linked_lists_on_host()
75 if(error) return -1; in verify_linked_lists_on_host()
[all …]
|
| D | test_shared_sub_buffers.cpp | 8 // http://www.apache.org/licenses/LICENSE-2.0
19 "typedef struct Node {\n"
22 " __global struct Node* pNext;\n"
23 "} Node;\n"
26 …"__global Node* allocate_node(__global Node* pNodes1, __global Node* pNodes2, volatile __global in…
35 // The allocation_index parameter must be initialized on the host to N work-items
37 // This tests passing 4 different sub-buffers that come from two parent buffers.
38 … to be unused, but they are required so that system knows to get all the sub-buffers on to the dev…
39 …id create_linked_lists(__global Node* pNodes_sub1, __global Node* pNodes2_sub1, __global Node* pNo…
42 " __global Node *pNode = &pNodes_sub1[i];\n"
[all …]
|
| D | test_shared_address_space_fine_grain_buffers.cpp | 8 // http://www.apache.org/licenses/LICENSE-2.0
21 cl_int create_linked_lists_on_device_no_map(int ci, cl_command_queue cmdq, size_t* pAllocator, cl_k… in create_linked_lists_on_device_no_map() argument
24 log_info("SVM: creating linked list on device: %d ", ci); in create_linked_lists_on_device_no_map()
26 // reset allocator index in create_linked_lists_on_device_no_map()
51 error = -1; in verify_linked_lists_on_device_no_map()
60 // This tests that all devices and the host share a common address space; using only the fine-grain…
74 if(error < 0) return -1; // fail test. in test_svm_shared_address_space_fine_grain_buffers()
86 …Node* pNodes = (Node*) clSVMAlloc(context, CL_MEM_READ_WRITE | CL_MEM_SVM_FINE_GRAIN_BUFFER, sizeo… in test_svm_shared_address_space_fine_grain_buffers()
88 // this buffer holds an index into the nodes buffer, it is used for node allocation in test_svm_shared_address_space_fine_grain_buffers()
105 …for (int ci=0; ci<(int)num_devices+1; ci++) // ci is CreationIndex, index of device/q to create l… in test_svm_shared_address_space_fine_grain_buffers() local
[all …]
|
| D | test_shared_address_space_fine_grain.cpp | 8 // http://www.apache.org/licenses/LICENSE-2.0
19 // This tests that all devices and the host share a common address space using fine-grain mode with…
33 if(error < 0) return -1; // fail test. in test_svm_shared_address_space_fine_grain()
46 Node* pNodes = (Node*) align_malloc(numLists*ListLength*sizeof(Node),128); in test_svm_shared_address_space_fine_grain()
49 // this allocation holds an index into the nodes buffer, it is used for node allocation in test_svm_shared_address_space_fine_grain()
69 …for (int ci=0; ci<(int)num_devices+1; ci++) // ci is CreationIndex, index of device/q to create l… in test_svm_shared_address_space_fine_grain() local
71 …for (int vi=0; vi<(int)num_devices+1; vi++) // vi is VerificationIndex, index of device/q to veri… in test_svm_shared_address_space_fine_grain()
73 if(ci == num_devices) // last device index represents the host, note the num_device+1 above. in test_svm_shared_address_space_fine_grain()
80 …error = create_linked_lists_on_device_no_map(ci, queues[ci], pAllocator, kernel_create_lists, numL… in test_svm_shared_address_space_fine_grain()
81 if(error) return -1; in test_svm_shared_address_space_fine_grain()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/ |
| D | LowerExpectIntrinsic.cpp | 1 //===- LowerExpectIntrinsic.cpp - Lower expect intrinsic ------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
11 //===----------------------------------------------------------------------===//
34 #define DEBUG_TYPE "lower-expect-intrinsic"
52 "likely-branch-weight", cl::Hidden, cl::init(2000),
55 "unlikely-branch-weight", cl::Hidden, cl::init(1),
59 CallInst *CI = dyn_cast<CallInst>(SI.getCondition()); in handleSwitchExpect() local
60 if (!CI) in handleSwitchExpect()
63 Function *Fn = CI->getCalledFunction(); in handleSwitchExpect()
[all …]
|
| /external/ltp/testcases/kernel/controllers/cpuset/cpuset_lib/ |
| D | cpuinfo.c | 34 int ci = 0; in get_cpu_baseinfo() local
41 return -1; in get_cpu_baseinfo()
52 return -1; in get_cpu_baseinfo()
57 return -1; in get_cpu_baseinfo()
69 warnx("Warn: wrong cpu index"); in get_cpu_baseinfo()
71 return -1; in get_cpu_baseinfo()
73 ci = data; in get_cpu_baseinfo()
74 cpus[ci].online = 1; in get_cpu_baseinfo()
85 * return value: 0 - success
86 * -1 - failed
[all …]
|
| /external/swiftshader/third_party/llvm-16.0/llvm/lib/Transforms/Scalar/ |
| D | LowerExpectIntrinsic.cpp | 1 //===- LowerExpectIntrinsic.cpp - Lower expect intrinsic ------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
11 //===----------------------------------------------------------------------===//
34 #define DEBUG_TYPE "lower-expect-intrinsic"
48 // They should not be exposed to the outside of the pass, front-end codegen
52 "likely-branch-weight", cl::Hidden, cl::init(2000),
55 "unlikely-branch-weight", cl::Hidden, cl::init(1),
59 getBranchWeight(Intrinsic::ID IntrinsicID, CallInst *CI, int BranchCount) { in getBranchWeight() argument
66 assert(CI->getNumOperands() >= 3 && in getBranchWeight()
[all …]
|
| /external/cn-cbor/ |
| D | README.md | 1 [](https://travis-ci.org/cabo/…
3 # cn-cbor: A constrained node implementation of CBOR in C
5 Below is the original README for cn-cbor, a Proof of Concept
11 repo](https://github.com/jimsch/cn-cbor) as your upstream.
17 ARM-mbed's [SUIT manifest
18 generator](https://github.com/ARMmbed/suit-manifest-generator) (Apache
19 2.0). SUIT implementers report (CBOR-specific) code sizes in the low
22 # cn-cbor: A constrained node implementation of CBOR in C
24 This is a constrained node implementation of [CBOR](http://cbor.io) in
45 There is a `Simple-Makefile` for playing around, as well as a complete
[all …]
|
| /external/llvm/include/llvm/Support/ |
| D | GenericDomTreeConstruction.h | 1 //===- GenericDomTreeConstruction.h - Dominator Calculation ------*- C++ -*-==//
8 //===----------------------------------------------------------------------===//
11 /// Generic dominator tree construction - This file provides routines to
12 /// construct immediate dominator information for a flow-graph based on the
16 /// T. Lengauer & R. Tarjan, ACM TOPLAS July 1979, pgs 121-141.
20 /// faster than the almost-linear O(n*alpha(n)) version, even for large CFGs.
22 //===----------------------------------------------------------------------===//
78 // store the DFS number of the current BB - the reference to BBInfo might in DFSPass()
165 // Step #1: Number blocks in depth-first order and initialize variables used in Calculate()
172 // infinite loops). In these cases an artificial exit node is required. in Calculate()
[all …]
|
| /external/mesa3d/.gitlab-ci/ |
| D | lava-gitlab-ci.yml | 2 DISTRIBUTION_TAG: "2020-11-09-kmod-fix"
5 stage: container-2
7 - .ci-run-policy
10 …L: "https://gitlab.freedesktop.org/tomeu/linux/-/archive/v5.10-rc2-for-mesa-ci/linux-v5.10-rc2-for…
14 - .gitlab-ci/container/lava_build.sh
18 - .use-x86_build-base
19 - .kernel+rootfs
20 image: "$CI_REGISTRY_IMAGE/debian/x86_build-base:$BASE_TAG"
26 - .use-arm_build
27 - .kernel+rootfs
[all …]
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| D | StatepointLowering.cpp | 1 //===-- StatepointLowering.cpp - SDAGBuilder's statepoint code -----------===//
8 //===----------------------------------------------------------------------===//
13 //===----------------------------------------------------------------------===//
34 #define DEBUG_TYPE "statepoint-lowering"
56 // Need to resize this on each safepoint - we need the two to stay in sync and in startNewStatepoint()
86 // added in this instance of StatepointLoweringState, and cannot be re-used. in allocateStackSlot()
93 if (MFI->getObjectSize(FI) == SpillSize) { in allocateStackSlot()
103 const unsigned FI = cast<FrameIndexSDNode>(SpillSlot)->getIndex(); in allocateStackSlot()
104 MFI->markAsStatepointSpillSlotObjectIndex(FI); in allocateStackSlot()
115 /// stack slot index to which we have spilled value for previous statepoints.
[all …]
|
| D | FunctionLoweringInfo.cpp | 1 //===-- FunctionLoweringInfo.cpp ------------------------------------------===//
8 //===----------------------------------------------------------------------===//
13 //===----------------------------------------------------------------------===//
45 #define DEBUG_TYPE "function-lowering-info"
47 /// isUsedOutsideOfDefiningBlock - Return true if this instruction is used by
51 if (I->use_empty()) return false; in isUsedOutsideOfDefiningBlock()
53 const BasicBlock *BB = I->getParent(); in isUsedOutsideOfDefiningBlock()
54 for (const User *U : I->users()) in isUsedOutsideOfDefiningBlock()
55 if (cast<Instruction>(U)->getParent() != BB || isa<PHINode>(U)) in isUsedOutsideOfDefiningBlock()
71 for (const User *U : V->users()) { in getPreferredExtendForValue()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/SelectionDAG/ |
| D | StatepointLowering.cpp | 1 //===- StatepointLowering.cpp - SDAGBuilder's statepoint code -------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
12 //===----------------------------------------------------------------------===//
56 #define DEBUG_TYPE "statepoint-lowering"
78 // Need to resize this on each safepoint - we need the two to stay in sync and in startNewStatepoint()
126 const unsigned FI = cast<FrameIndexSDNode>(SpillSlot)->getIndex(); in allocateStackSlot()
142 /// stack slot index to which we have spilled value for previous statepoints.
147 // Can not look any further - give up now in findPreviousSpillSlot()
154 Builder.FuncInfo.StatepointSpillMaps[Relocate->getStatepoint()]; in findPreviousSpillSlot()
[all …]
|
| D | FunctionLoweringInfo.cpp | 1 //===-- FunctionLoweringInfo.cpp ------------------------------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
12 //===----------------------------------------------------------------------===//
43 #define DEBUG_TYPE "function-lowering-info"
45 /// isUsedOutsideOfDefiningBlock - Return true if this instruction is used by
49 if (I->use_empty()) return false; in isUsedOutsideOfDefiningBlock()
51 const BasicBlock *BB = I->getParent(); in isUsedOutsideOfDefiningBlock()
52 for (const User *U : I->users()) in isUsedOutsideOfDefiningBlock()
53 if (cast<Instruction>(U)->getParent() != BB || isa<PHINode>(U)) in isUsedOutsideOfDefiningBlock()
[all …]
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| D | LoopUtils.h | 1 //===- llvm/Transforms/Utils/LoopUtils.h - Loop utilities -*- C++ -*-=========//
8 //===----------------------------------------------------------------------===//
12 //===----------------------------------------------------------------------===//
97 bool Signed, SmallPtrSetImpl<Instruction *> &CI) in RecurrenceDescriptor() argument
100 CastInsts.insert(CI.begin(), CI.end()); in RecurrenceDescriptor()
179 /// Returns true if Phi is a first-order recurrence. A first-order recurrence
180 /// is a non-reduction recurrence relation in which the value of the
195 /// floating-point model.
198 /// Returns first unsafe algebra instruction in the PHI node's use-chain.
210 /// Determines if Phi may have been type-promoted. If Phi has a single user
[all …]
|
| /external/swiftshader/third_party/llvm-16.0/llvm/lib/CodeGen/SelectionDAG/ |
| D | FunctionLoweringInfo.cpp | 1 //===-- FunctionLoweringInfo.cpp ------------------------------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
12 //===----------------------------------------------------------------------===//
41 #define DEBUG_TYPE "function-lowering-info"
43 /// isUsedOutsideOfDefiningBlock - Return true if this instruction is used by
47 if (I->use_empty()) return false; in isUsedOutsideOfDefiningBlock()
49 const BasicBlock *BB = I->getParent(); in isUsedOutsideOfDefiningBlock()
50 for (const User *U : I->users()) in isUsedOutsideOfDefiningBlock()
51 if (cast<Instruction>(U)->getParent() != BB || isa<PHINode>(U)) in isUsedOutsideOfDefiningBlock()
[all …]
|
| D | StatepointLowering.cpp | 1 //===- StatepointLowering.cpp - SDAGBuilder's statepoint code -------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
12 //===----------------------------------------------------------------------===//
57 #define DEBUG_TYPE "statepoint-lowering"
66 "use-registers-for-deopt-values", cl::Hidden, cl::init(false),
70 "use-registers-for-gc-values-in-landing-pad", cl::Hidden, cl::init(false),
74 "max-registers-for-gc-values", cl::Hidden, cl::init(0),
93 // Need to resize this on each safepoint - we need the two to stay in sync and in startNewStatepoint()
115 (-8u & (7 + ValueType.getSizeInBits())) && // Round up modulo 8. in allocateStackSlot()
[all …]
|
| /external/mesa3d/docs/relnotes/ |
| D | 20.0.5.rst | 1 Mesa 20.0.5 Release Notes / 2020-04-22
20 ---------------
24 2c56a82a28cc924e40ea49752abdf1d701c9952481f53cbc7a080271597f572e mesa-20.0.5.tar.xz
27 ------------
30 ---------
32 - nir: nir_lower_returns can't handle nested loops
33 - Graphic artifacts with Mesa 20.0.4 on intel HD 510 GPU
34 - Mesa 20 regression makes Lightsprint demos crash
35 - Build Fails with Clang Shared Library
36 - dri_common.h:58:8: error: unknown type name '__GLXDRIdrawable'
[all …]
|
| /external/skia/modules/canvaskit/ |
| D | Makefile | 2 - rm -rf ../../out/canvaskit_wasm
3 - rm -rf ./npm_build/bin
4 - rm -rf ./build/
10 - rm -rf build/
18 - rm -rf build/
26 - rm -rf build/
34 - rm -rf build/
42 - rm -rf build/
50 - rm -rf build/
58 - rm -rf build/
[all …]
|
| /external/llvm/lib/Transforms/Utils/ |
| D | LoopUtils.cpp | 1 //===-- LoopUtils.cpp - Loop Utility functions -------------------------===//
8 //===----------------------------------------------------------------------===//
12 //===----------------------------------------------------------------------===//
34 #define DEBUG_TYPE "loop-utils"
38 for (User::op_iterator Use = I->op_begin(), E = I->op_end(); Use != E; ++Use) in areAllUsesIn()
79 SmallPtrSetImpl<Instruction *> &CI) { in lookThroughAnd() argument
80 if (!Phi->hasOneUse()) in lookThroughAnd()
84 Instruction *I, *J = cast<Instruction>(Phi->use_begin()->getUser()); in lookThroughAnd()
86 // Matches either I & 2^x-1 or 2^x-1 & I. If we find a match, we update RT in lookThroughAnd()
92 RT = IntegerType::get(Phi->getContext(), Bits); in lookThroughAnd()
[all …]
|
| /external/rust/crates/drm/ |
| D | README.md | 1 # drm-rs
5 …ttps://github.com/Smithay/drm-rs/actions/workflows/ci.yml/badge.svg)](https://github.com/Smithay/d…
11 The Direct Rendering Manager is a subsystem found on multiple Unix-based
26 device through the [AsFd](https://doc.rust-lang.org/std/os/fd/trait.AsFd.html)
30 /// A simple wrapper for a device node.
37 fn as_fd(&self) -> BorrowedFd<'_> {
44 pub fn open(path: &str) -> Self {
68 as well as our mode-setting examples: [`atomic_modeset`](https://github.com/Smithay/drm-rs/blob/dev…
69 and [`legacy_modeset`](https://github.com/Smithay/drm-rs/blob/develop/examples/legacy_modeset.rs)
74 …ice.html#method.page_flip) [framebuffers](https://docs.rs/drm/*/drm/control/framebuffer/index.html)
[all …]
|
| /external/llvm/lib/Transforms/Vectorize/ |
| D | LoopVectorize.cpp | 1 //===- LoopVectorize.cpp - A Loop Vectorizer ------------------------------===//
8 //===----------------------------------------------------------------------===//
11 // and generates target-independent LLVM-IR.
16 // 'wide' iteration. After this transformation the index is incremented
21 // 2. LoopVectorizationLegality - A unit that checks for the legality
23 // 3. InnerLoopVectorizer - A unit that performs the actual
25 // 4. LoopVectorizationCostModel - A unit that checks for the profitability
29 //===----------------------------------------------------------------------===//
31 // The reduction-variable vectorization is based on the paper:
32 // D. Nuzman and R. Henderson. Multi-platform Auto-vectorization.
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/ |
| D | HexagonCommonGEP.cpp | 1 //===- HexagonCommonGEP.cpp -----------------------------------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
53 static cl::opt<bool> OptSpeculate("commgep-speculate", cl::init(true),
56 static cl::opt<bool> OptEnableInv("commgep-inv", cl::init(true), cl::Hidden,
59 static cl::opt<bool> OptEnableConst("commgep-const", cl::init(true),
89 return F1->second < F2->second; in operator ()()
129 BasicBlock *recalculatePlacement(GepNode *Node, NodeChildrenMap &NCM,
131 BasicBlock *recalculatePlacementRec(GepNode *Node, NodeChildrenMap &NCM,
134 bool isInvariantIn(GepNode *Node, Loop *L);
[all …]
|
| /external/llvm/lib/Target/Hexagon/ |
| D | HexagonCommonGEP.cpp | 1 //===--- HexagonCommonGEP.cpp ---------------------------------------------===//
8 //===----------------------------------------------------------------------===//
38 static cl::opt<bool> OptSpeculate("commgep-speculate", cl::init(true),
41 static cl::opt<bool> OptEnableInv("commgep-inv", cl::init(true), cl::Hidden,
44 static cl::opt<bool> OptEnableConst("commgep-const", cl::init(true),
71 return F1->second < F2->second; in operator ()()
111 BasicBlock *recalculatePlacement(GepNode *Node, NodeChildrenMap &NCM,
113 BasicBlock *recalculatePlacementRec(GepNode *Node, NodeChildrenMap &NCM,
116 bool isInvariantIn(GepNode *Node, Loop *L);
118 BasicBlock *adjustForInvariance(GepNode *Node, NodeChildrenMap &NCM,
[all …]
|