| /external/llvm-project/mlir/include/mlir/Reducer/ |
| D | ReductionTreePass.h | 93 ReductionNode *currNode = root.get(); in singlePathTraversal() local
94 ReductionNode *smallestNode = currNode; in singlePathTraversal()
95 int tSpaceSize = currNode->transformSpaceSize(); in singlePathTraversal()
98 ReductionTreeUtils::updateSmallestNode(currNode, smallestNode, path); in singlePathTraversal()
103 reducer.generateVariants(currNode, test, 1); in singlePathTraversal()
105 currNode->organizeVariants(test); in singlePathTraversal()
107 if (!currNode->variantsEmpty()) in singlePathTraversal()
108 return currNode->getVariant(0); in singlePathTraversal()
111 ReductionTreeUtils::updateSmallestNode(currNode, smallestNode, path); in singlePathTraversal()
117 reducer.generateVariants(currNode, test, 2); in singlePathTraversal()
[all …]
|
| D | ReductionTreeUtils.h | 35 void updateSmallestNode(ReductionNode *currNode, ReductionNode *&smallestNode,
|
| /external/angle/src/compiler/translator/TranslatorMetalDirect/ |
| D | IntermRebuild.cpp | 318 TIntermNode *currNode = preResult.mSingle; in traverseAny() local
320 const NodeType currNodeType = getNodeType(*currNode); in traverseAny()
322 currNode = traverseChildren(currNodeType, originalNode, *currNode, visit); in traverseAny()
323 if (!currNode) in traverseAny()
328 return traversePost(currNodeType, originalNode, *currNode, visit); in traverseAny()
390 TIntermNode &currNode, in traverseChildren() argument
395 return &currNode; in traverseChildren()
398 if (AnyBits(visit, VisitBits::ChildrenRequiresSame) && &originalNode != &currNode) in traverseChildren()
400 return &currNode; in traverseChildren()
404 mNodeStack = {&currNode, &guard.oldNodeStack}; in traverseChildren()
[all …]
|
| D | IntermRebuild.h | 289 TIntermNode &currNode,
293 TIntermNode &currNode,
|
| /external/xmp_toolkit/XMPCore/src/com/adobe/xmp/impl/ |
| D | XMPNodeUtils.java | 209 XMPNode currNode = null; in findNode() local
212 currNode = findSchemaNode(xmpTree, in findNode()
214 if (currNode == null) in findNode()
218 else if (currNode.isImplicit()) in findNode()
220 currNode.setImplicit(false); // Clear the implicit node bit. in findNode()
221 rootImplicitNode = currNode; // Save the top most implicit node. in findNode()
230 currNode = followXPathStep(currNode, xpath.getSegment(i), createNodes); in findNode()
231 if (currNode == null) in findNode()
240 else if (currNode.isImplicit()) in findNode()
243 currNode.setImplicit(false); in findNode()
[all …]
|
| D | XMPIteratorImpl.java | 399 protected String accumulatePath(XMPNode currNode, String parentPath, int currentIndex) in accumulatePath() argument
403 if (currNode.getParent() == null || currNode.getOptions().isSchemaNode()) in accumulatePath()
407 else if (currNode.getParent().getOptions().isArray()) in accumulatePath()
415 segmentName = currNode.getName(); in accumulatePath()
|
| /external/llvm-project/mlir/tools/mlir-reduce/ |
| D | ReductionTreeUtils.cpp | 31 void ReductionTreeUtils::updateSmallestNode(ReductionNode *currNode, in updateSmallestNode() argument
40 LLVM_DEBUG(llvm::dbgs() << "\nSize (chars): " << currNode->getSize()); in updateSmallestNode()
41 if (currNode->getSize() < smallestNode->getSize()) { in updateSmallestNode()
43 smallestNode = currNode; in updateSmallestNode()
|
| /external/vulkan-validation-layers/layers/ |
| D | vk_mem_alloc.h | 10670 Node* currNode = m_FreeList[currLevel].front; in Alloc() local
10671 VMA_ASSERT(currNode != VMA_NULL && currNode->type == Node::TYPE_FREE); in Alloc()
10672 while(currNode->offset != request.offset) in Alloc()
10674 currNode = currNode->free.next; in Alloc()
10675 VMA_ASSERT(currNode != VMA_NULL && currNode->type == Node::TYPE_FREE); in Alloc()
10683 RemoveFromFreeList(currLevel, currNode); in Alloc()
10691 leftChild->offset = currNode->offset; in Alloc()
10693 leftChild->parent = currNode; in Alloc()
10696 rightChild->offset = currNode->offset + LevelToNodeSize(childrenLevel); in Alloc()
10698 rightChild->parent = currNode; in Alloc()
[all …]
|
| /external/angle/third_party/vulkan_memory_allocator/src/ |
| D | vk_mem_alloc.h | 11814 Node* currNode = m_FreeList[currLevel].front; in Alloc() local
11815 VMA_ASSERT(currNode != VMA_NULL && currNode->type == Node::TYPE_FREE); in Alloc()
11816 while(currNode->offset != request.offset) in Alloc()
11818 currNode = currNode->free.next; in Alloc()
11819 VMA_ASSERT(currNode != VMA_NULL && currNode->type == Node::TYPE_FREE); in Alloc()
11827 RemoveFromFreeList(currLevel, currNode); in Alloc()
11835 leftChild->offset = currNode->offset; in Alloc()
11837 leftChild->parent = currNode; in Alloc()
11840 rightChild->offset = currNode->offset + LevelToNodeSize(childrenLevel); in Alloc()
11842 rightChild->parent = currNode; in Alloc()
[all …]
|
| /external/skia/third_party/vulkanmemoryallocator/include/ |
| D | vk_mem_alloc.h | 11795 Node* currNode = m_FreeList[currLevel].front; in Alloc() local
11796 VMA_ASSERT(currNode != VMA_NULL && currNode->type == Node::TYPE_FREE); in Alloc()
11797 while(currNode->offset != request.offset) in Alloc()
11799 currNode = currNode->free.next; in Alloc()
11800 VMA_ASSERT(currNode != VMA_NULL && currNode->type == Node::TYPE_FREE); in Alloc()
11808 RemoveFromFreeList(currLevel, currNode); in Alloc()
11816 leftChild->offset = currNode->offset; in Alloc()
11818 leftChild->parent = currNode; in Alloc()
11821 rightChild->offset = currNode->offset + LevelToNodeSize(childrenLevel); in Alloc()
11823 rightChild->parent = currNode; in Alloc()
[all …]
|