/freebsd-10-stable/contrib/llvm/include/llvm/ADT/ |
H A D | UniqueVector.h | 29 // Vector - ID ordered vector of entries. Entries can be indexed by ID - 1. 31 std::vector<T> Vector; member in class:llvm::UniqueVector 44 Val = static_cast<unsigned>(Vector.size()) + 1; 47 Vector.push_back(Entry); 68 return Vector[ID - 1]; 73 size_t size() const { return Vector.size(); } 77 bool empty() const { return Vector.empty(); } 83 Vector.resize(0, 0);
|
H A D | SmallSet.h | 35 SmallVector<T, N> Vector; member in class:llvm::SmallSet 42 bool empty() const { return Vector.empty() && Set.empty(); } 44 return isSmall() ? Vector.size() : Set.size(); 51 return vfind(V) != Vector.end(); 64 if (I != Vector.end()) // Don't reinsert if it already exists. 66 if (Vector.size() < N) { 67 Vector.push_back(V); 72 while (!Vector.empty()) { 73 Set.insert(Vector.back()); 74 Vector [all...] |
H A D | MapVector.h | 37 VectorType Vector; member in class:llvm::MapVector 44 return Vector.size(); 48 return Vector.begin(); 52 return Vector.begin(); 56 return Vector.end(); 60 return Vector.end(); 64 return Vector.empty(); 67 std::pair<KeyT, ValueT> &front() { return Vector.front(); } 68 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); } 69 std::pair<KeyT, ValueT> &back() { return Vector [all...] |
H A D | FoldingSet.h | 295 /// Bits - Vector of all the data bits that make the node unique. 578 VectorT Vector; member in class:llvm::FoldingSetVector 586 iterator begin() { return Vector.begin(); } 587 iterator end() { return Vector.end(); } 591 const_iterator begin() const { return Vector.begin(); } 592 const_iterator end() const { return Vector.end(); } 595 void clear() { Set.clear(); Vector.clear(); } 609 if (Result == N) Vector.push_back(N); 618 Vector.push_back(N); 625 Vector [all...] |
H A D | SetVector.h | 35 template <typename T, typename Vector = std::vector<T>, 44 typedef Vector vector_type;
|
/freebsd-10-stable/contrib/llvm/lib/Target/XCore/ |
H A D | XCoreTargetTransformInfo.cpp | 65 unsigned getNumberOfRegisters(bool Vector) const { 66 if (Vector) {
|
/freebsd-10-stable/contrib/llvm/tools/lldb/include/lldb/Core/ |
H A D | Value.h | 57 struct Vector struct in class:lldb_private::Value 64 Vector() : function in struct:lldb_private::Value::Vector 70 Vector(const Vector& vector) function in struct:lldb_private::Value::Vector 73 const Vector& 74 operator=(const Vector& vector) 103 // Returns a default constructed Scalar if the Vector data is internally inconsistent. 126 Value(const Vector& vector); 193 const Vector & 205 Vector [all...] |
/freebsd-10-stable/contrib/llvm/include/llvm/CodeGen/PBQP/ |
H A D | Math.h | 1 //===------ Math.h - PBQP Vector and Matrix classes -------------*- C++ -*-===// 21 /// \brief PBQP Vector class. 22 class Vector { class in namespace:PBQP 26 explicit Vector(unsigned length) : function in class:PBQP::Vector 31 Vector(unsigned length, PBQPNum initVal) : function in class:PBQP::Vector 37 Vector(const Vector &v) : function in class:PBQP::Vector 43 ~Vector() { delete[] data; } 46 Vector& operator=(const Vector [all...] |
H A D | Graph.h | 47 Vector costs; 52 NodeEntry(const Vector &costs) : costs(costs), data(0) {} 53 Vector& getCosts() { return costs; } 54 const Vector& getCosts() const { return costs; } 213 NodeId addNode(const Vector &costs) { 239 Vector& getNodeCosts(NodeId nId) { return getNode(nId).getCosts(); } 244 const Vector& getNodeCosts(NodeId nId) const { 400 const Vector& v = getNodeCosts(*nodeItr);
|
H A D | HeuristicSolver.h | 245 const Vector &xCosts = g.getNodeCosts(xnId); 250 Vector &yCosts = g.getNodeCosts(ynId); 263 Vector &yCosts = g.getNodeCosts(ynId); 291 const Vector &xCosts = g.getNodeCosts(xnId); 510 Vector &uCosts = g.getNodeCosts(g.getEdgeNode1(eId)), 563 Vector v(g.getNodeCosts(nId));
|
/freebsd-10-stable/contrib/llvm/lib/Target/PowerPC/ |
H A D | PPCTargetTransformInfo.cpp | 84 /// \name Vector TTI Implementations 87 virtual unsigned getNumberOfRegisters(bool Vector) const; 88 virtual unsigned getRegisterBitWidth(bool Vector) const; 141 unsigned PPCTTI::getNumberOfRegisters(bool Vector) const { 142 if (Vector && !ST->hasAltivec()) 147 unsigned PPCTTI::getRegisterBitWidth(bool Vector) const { 148 if (Vector) { 219 // Vector element insert/extract with Altivec is very expensive,
|
/freebsd-10-stable/contrib/llvm/tools/clang/include/clang/AST/ |
H A D | DeclContextInternals.h | 57 if (DeclsTy *Vector = getAsVector()) 58 delete Vector; 62 if (DeclsTy *Vector = getAsVector()) 63 delete Vector; 161 DeclsTy &Vector = *getAsVector(); local 164 return DeclContext::lookup_result(Vector.begin(), Vector.end());
|
H A D | APValue.h | 37 /// [Vector: N * APValue], [Array: N * APValue] 49 Vector, enumerator in enum:clang::APValue::ValueKind 188 bool isVector() const { return Kind == Vector; } 418 Kind = Vector;
|
/freebsd-10-stable/contrib/llvm/include/llvm/CodeGen/ |
H A D | RegAllocPBQP.h | 131 void addSpillCosts(PBQP::Vector &costVec, PBQP::PBQPNum spillCost); 151 void addPhysRegCoalesce(PBQP::Vector &costVec, unsigned pregOption,
|
/freebsd-10-stable/contrib/llvm/lib/Analysis/ |
H A D | TargetTransformInfo.cpp | 161 unsigned TargetTransformInfo::getNumberOfRegisters(bool Vector) const { 162 return PrevTTI->getNumberOfRegisters(Vector); 165 unsigned TargetTransformInfo::getRegisterBitWidth(bool Vector) const { 166 return PrevTTI->getRegisterBitWidth(Vector); 540 unsigned getNumberOfRegisters(bool Vector) const { 544 unsigned getRegisterBitWidth(bool Vector) const {
|
/freebsd-10-stable/contrib/llvm/include/llvm/Analysis/ |
H A D | TargetTransformInfo.h | 306 /// \name Vector Target Information 327 virtual unsigned getNumberOfRegisters(bool Vector) const; 330 virtual unsigned getRegisterBitWidth(bool Vector) const;
|
/freebsd-10-stable/contrib/llvm/include/llvm/IR/ |
H A D | Intrinsics.h | 81 Integer, Vector, Pointer, Struct, enumerator in enum:llvm::Intrinsic::IITDescriptor::IITDescriptorKind
|
/freebsd-10-stable/sys/boot/ia64/ski/ |
H A D | acpi_stub.c | 53 UINT32 Vector; /* interrupt base */ member in struct:__anon6463
|
/freebsd-10-stable/contrib/llvm/lib/IR/ |
H A D | Function.cpp | 506 OutputTable.push_back(IITDescriptor::get(IITDescriptor::Vector, 1)); 510 OutputTable.push_back(IITDescriptor::get(IITDescriptor::Vector, 2)); 514 OutputTable.push_back(IITDescriptor::get(IITDescriptor::Vector, 4)); 518 OutputTable.push_back(IITDescriptor::get(IITDescriptor::Vector, 8)); 522 OutputTable.push_back(IITDescriptor::get(IITDescriptor::Vector, 16)); 526 OutputTable.push_back(IITDescriptor::get(IITDescriptor::Vector, 32)); 629 case IITDescriptor::Vector:
|
/freebsd-10-stable/contrib/llvm/lib/Transforms/ObjCARC/ |
H A D | ObjCARCOpts.cpp | 55 /// Map keys to indices in Vector. 61 VectorTy Vector; member in class:__anon2750::MapVector 66 iterator begin() { return Vector.begin(); } 67 iterator end() { return Vector.end(); } 68 const_iterator begin() const { return Vector.begin(); } 69 const_iterator end() const { return Vector.end(); } 73 assert(Vector.size() >= Map.size()); // May differ due to blotting. 76 assert(I->second < Vector.size()); 77 assert(Vector[I->second].first == I->first); 79 for (typename VectorTy::const_iterator I = Vector [all...] |
/freebsd-10-stable/contrib/llvm/lib/CodeGen/ |
H A D | BasicTargetTransformInfo.cpp | 91 /// \name Vector TTI Implementations 94 virtual unsigned getNumberOfRegisters(bool Vector) const; 96 virtual unsigned getRegisterBitWidth(bool Vector) const; 217 unsigned BasicTTI::getNumberOfRegisters(bool Vector) const { 221 unsigned BasicTTI::getRegisterBitWidth(bool Vector) const {
|
/freebsd-10-stable/contrib/llvm/tools/clang/lib/AST/ |
H A D | APValue.cpp | 137 case Vector: 194 else if (Kind == Vector) 223 case Vector: 281 case Vector: 282 OS << "Vector: "; 357 case APValue::Vector: {
|
/freebsd-10-stable/contrib/llvm/include/llvm/CodeGen/PBQP/Heuristics/ |
H A D | Briggs.h | 64 const PBQP::Vector &cv1 = g->getNodeCosts(n1Id); 65 const PBQP::Vector &cv2 = g->getNodeCosts(n2Id); 420 const Vector& nCosts = getGraph().getNodeCosts(nId);
|
/freebsd-10-stable/contrib/llvm/lib/Target/X86/ |
H A D | X86TargetTransformInfo.cpp | 82 /// \name Vector TTI Implementations 85 virtual unsigned getNumberOfRegisters(bool Vector) const; 86 virtual unsigned getRegisterBitWidth(bool Vector) const; 137 unsigned X86TTI::getNumberOfRegisters(bool Vector) const { 138 if (Vector && !ST->hasSSE1()) 146 unsigned X86TTI::getRegisterBitWidth(bool Vector) const { 147 if (Vector) {
|
/freebsd-10-stable/contrib/llvm/lib/Target/R600/ |
H A D | R600InstrInfo.cpp | 448 int Vector[4][3]; 449 memset(Vector, -1, sizeof(Vector)); 467 if (Vector[Src.second][j] < 0) 468 Vector[Src.second][j] = Src.first; 469 if (Vector[Src.second][j] != Src.first) 481 if (Vector[Src.second][Cycle] < 0) 482 Vector[Src.second][Cycle] = Src.first; 483 if (Vector[Src.second][Cycle] != Src.first)
|