HomeSort by relevance Sort by last modified time
    Searched refs:NodeMemSize (Results 1 - 4 of 4) sorted by null

  /external/llvm/lib/Target/Hexagon/
RDFGraph.h 336 enum { NodeMemSize = 32 };
345 uint32_t Offset = (N1 & IndexMask) * NodeMemSize;
470 static_assert(sizeof(NodeBase) <= NodeAllocator::NodeMemSize,
471 "NodeBase must be at most NodeAllocator::NodeMemSize bytes");
RDFGraph.cpp 314 void *T = MemPool.Allocate(NodesPerBlock*NodeMemSize, NodeMemSize);
330 uint32_t Index = (ActiveEnd-ActiveBegin)/NodeMemSize;
339 uint32_t Index = (ActiveEnd - Blocks[ActiveB])/NodeMemSize;
342 ActiveEnd += NodeMemSize;
350 if (A < B || A >= B + NodesPerBlock*NodeMemSize)
352 uint32_t Idx = (A-B)/NodeMemSize;
    [all...]
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/Hexagon/
RDFGraph.h 376 enum { NodeMemSize = 32 };
387 uint32_t Offset = (N1 & IndexMask) * NodeMemSize;
510 static_assert(sizeof(NodeBase) <= NodeAllocator::NodeMemSize,
511 "NodeBase must be at most NodeAllocator::NodeMemSize bytes");
    [all...]
RDFGraph.cpp 364 void *T = MemPool.Allocate(NodesPerBlock*NodeMemSize, NodeMemSize);
380 uint32_t Index = (ActiveEnd-ActiveBegin)/NodeMemSize;
389 uint32_t Index = (ActiveEnd - Blocks[ActiveB])/NodeMemSize;
392 ActiveEnd += NodeMemSize;
400 if (A < B || A >= B + NodesPerBlock*NodeMemSize)
402 uint32_t Idx = (A-B)/NodeMemSize;
    [all...]

Completed in 94 milliseconds