Searched refs:Capacity (Results 1 - 25 of 36) sorted by relevance

12

/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/
H A DArrayRecycler.h49 __asan_unpoison_memory_region(Entry, Capacity::get(Idx).getSize());
51 __msan_allocated_memory(Entry, Capacity::get(Idx).getSize());
63 __asan_poison_memory_region(Ptr, Capacity::get(Idx).getSize());
67 /// The size of an allocated array is represented by a Capacity instance.
71 class Capacity { class in class:llvm::ArrayRecycler
73 explicit Capacity(uint8_t idx) : Index(idx) {} function in class:llvm::ArrayRecycler::Capacity
76 Capacity() : Index(0) {} function in class:llvm::ArrayRecycler::Capacity
79 static Capacity get(size_t N) {
80 return Capacity(N ? Log2_64_Ceil(N) : 0);
92 Capacity getNex
[all...]
/freebsd-11-stable/contrib/llvm-project/clang/lib/Sema/
H A DTypeLocBuilder.cpp45 assert(NewCapacity > Capacity);
49 unsigned NewIndex = Index + NewCapacity - Capacity;
52 Capacity - Index);
58 Capacity = NewCapacity;
74 size_t RequiredCapacity = Capacity + (LocalSize - Index);
75 size_t NewCapacity = Capacity * 2;
159 assert(Capacity - Index == TypeLoc::getFullDataSizeForType(T) &&
H A DTypeLocBuilder.h30 size_t Capacity; member in class:clang::TypeLocBuilder
47 : Buffer(InlineBuffer), Capacity(InlineCapacity), Index(InlineCapacity),
57 if (Requested > Capacity)
79 Index = Capacity;
106 size_t FullDataSize = Capacity - Index;
119 size_t FullDataSize = Capacity - Index;
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Analysis/Analyses/
H A DThreadSafetyUtil.h88 : Data(Dat), Size(Sz), Capacity(Cp) {}
90 : Data(Cp == 0 ? nullptr : A.allocateT<T>(Cp)), Capacity(Cp) {}
94 : Data(A.Data), Size(A.Size), Capacity(A.Capacity) {
97 A.Capacity = 0;
104 Capacity = RHS.Capacity;
107 RHS.Size = RHS.Capacity = 0;
114 if (Ncp <= Capacity)
118 Capacity
[all...]
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/AST/
H A DASTVector.h40 llvm::PointerIntPair<T *, 1, bool> Capacity; member in class:clang::ASTVector
47 bool getTag() const { return Capacity.getInt(); }
48 void setTag(bool B) { Capacity.setInt(B); }
52 ASTVector() : Capacity(nullptr, false) {}
54 ASTVector(ASTVector &&O) : Begin(O.Begin), End(O.End), Capacity(O.Capacity) {
56 O.Capacity.setPointer(nullptr);
57 O.Capacity.setInt(false);
60 ASTVector(const ASTContext &C, unsigned N) : Capacity(nullptr, false) {
71 swap(Capacity,
[all...]
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Analysis/Support/
H A DBumpVector.h62 T *Capacity = nullptr; member in class:clang::BumpVector
160 if (End < Capacity) {
175 if (End + Cnt <= Capacity) {
189 if (unsigned(Capacity-Begin) < N)
195 size_t capacity() const { return Capacity - Begin; }
226 size_t CurCapacity = Capacity-Begin;
251 Capacity = Begin+NewCapacity;
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Support/
H A DSmallVector.cpp64 this->Capacity = NewCapacity;
H A DIntervalMap.cpp119 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity, argument
122 assert(Elements + Grow <= Nodes * Capacity && "Not enough room for elements");
149 assert(NewSize[n] <= Capacity && "Overallocated node");
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Demangle/
H A DMicrosoftDemangle.h32 size_t Capacity = 0; member in struct:llvm::ms_demangle::ArenaAllocator::AllocatorNode
36 void addNode(size_t Capacity) { argument
38 NewHead->Buf = new uint8_t[Capacity];
40 NewHead->Capacity = Capacity;
64 if (Head->Used <= Head->Capacity)
83 if (Head->Used <= Head->Capacity)
102 if (Head->Used <= Head->Capacity)
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/DebugInfo/PDB/Native/
H A DHashTable.h106 support::ulittle32_t Capacity; member in struct:llvm::pdb::HashTable::Header
116 explicit HashTable(uint32_t Capacity) { argument
117 Buckets.resize(Capacity);
124 if (H->Capacity == 0)
126 "Invalid Hash Table Capacity");
127 if (H->Size > maxLoad(H->Capacity))
131 Buckets.resize(H->Capacity);
187 H.Capacity = capacity();
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSmallVector.h41 unsigned Size = 0, Capacity; member in class:llvm::SmallVectorBase
45 : BeginX(FirstEl), Capacity(TotalCapacity) {}
53 size_t capacity() const { return Capacity; }
108 Size = Capacity = 0; // FIXME: Setting Capacity to 0 is suspect.
253 this->Capacity = NewCapacity;
675 std::swap(this->Capacity, RHS.Capacity);
765 this->Capacity = RHS.Capacity;
[all...]
H A DIntervalMap.h222 enum { Capacity = N }; enumerator in enum:llvm::IntervalMapImpl::NodeBase::__anon1339
386 /// Elements + Grow <= Nodes * Capacity.
391 /// NewSize[i] <= Capacity.
399 /// Grow is set and NewSize[idx] == Capacity-1. The index points to the node
405 /// @param Capacity The capacity of each node.
411 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity,
508 assert(n <= NodeT::Capacity && "Size too big for node");
624 /// @return (insert position, new size), or (i, Capacity+1) on overflow.
1083 if (branched() || rootSize == RootLeaf::Capacity)
1171 const unsigned Nodes = RootLeaf::Capacity / Lea
[all...]
H A DBitVector.h139 size_t Capacity = NumBitWords(s); local
140 Bits = allocate(Capacity);
153 size_t Capacity = NumBitWords(RHS.size()); local
154 Bits = allocate(Capacity);
155 std::memcpy(Bits.data(), RHS.Bits.data(), Capacity * sizeof(BitWord));
/freebsd-11-stable/sys/dev/hptmv/
H A Dgui_lib.c522 pInfo->Capacity = pVDevice->VDeviceCapacity;
532 pInfo->Capacity = pVDevice->u.disk.dDeRealCapacity;
546 pInfo->Capacity.lo32 = pVDevice->VDeviceCapacity;
547 pInfo->Capacity.hi32 = sizeof(LBA_T)>4? (pVDevice->VDeviceCapacity>>32) : 0;
557 pInfo->Capacity.lo32 = pVDevice->u.disk.dDeRealCapacity;
558 pInfo->Capacity.hi32 = 0;
824 param2.Capacity.lo32 = param2.Capacity.hi32 = 0;
909 LBA_T Capacity; local
935 Capacity
[all...]
H A Dhptintf.h522 DWORD Capacity; /* array capacity */ member in struct:_LOGICAL_DEVICE_INFO
537 LBA64 Capacity; /* array capacity */ member in struct:_LOGICAL_DEVICE_INFO_V2
618 LBA64 Capacity; /* specify array capacity (0 for default) */ member in struct:_CREATE_ARRAY_PARAMS_V2
H A Darray.h126 ULONG Capacity; /* capacity for the array */ member in struct:_ArrayDescript::__anon10130
/freebsd-11-stable/sys/dev/hptrr/
H A Dhptintf.h792 HPT_U32 Capacity; /* array capacity */ member in struct:_LOGICAL_DEVICE_INFO
807 HPT_U64 Capacity; /* array capacity */ member in struct:_LOGICAL_DEVICE_INFO_V2
829 HPT_U64 Capacity; /* array capacity */ member in struct:_LOGICAL_DEVICE_INFO_V3
858 HPT_U64 Capacity; /* array capacity */ member in struct:_LOGICAL_DEVICE_INFO_V4
983 HPT_U64 Capacity; member in struct:_CREATE_ARRAY_PARAMS_V2
1005 HPT_U64 Capacity; member in struct:_CREATE_ARRAY_PARAMS_V3
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/
H A DCodeGenDAGPatterns.h59 static unsigned constexpr Capacity = std::numeric_limits<uint8_t>::max()+1; member in struct:llvm::MachineValueTypeSet
62 static unsigned constexpr NumWords = Capacity/WordWidth;
63 static_assert(NumWords*WordWidth == Capacity,
64 "Capacity should be a multiple of WordWidth");
119 assert(Pos != Capacity);
124 Pos = End ? Capacity : find_from_pos(0);
128 assert(Pos != Capacity);
165 return Capacity;
/freebsd-11-stable/sys/dev/hpt27xx/
H A Dhptintf.h984 HPT_U32 Capacity; /* array capacity */ member in struct:_LOGICAL_DEVICE_INFO
999 HPT_U64 Capacity; /* array capacity */ member in struct:_LOGICAL_DEVICE_INFO_V2
1021 HPT_U64 Capacity; /* array capacity */ member in struct:_LOGICAL_DEVICE_INFO_V3
1050 HPT_U64 Capacity; /* array capacity */ member in struct:_LOGICAL_DEVICE_INFO_V4
1182 HPT_U64 Capacity; member in struct:_CREATE_ARRAY_PARAMS_V2
1206 HPT_U64 Capacity; member in struct:_CREATE_ARRAY_PARAMS_V3
/freebsd-11-stable/sys/dev/hptnr/
H A Dhptintf.h980 HPT_U32 Capacity; /* array capacity */ member in struct:_LOGICAL_DEVICE_INFO
995 HPT_U64 Capacity; /* array capacity */ member in struct:_LOGICAL_DEVICE_INFO_V2
1017 HPT_U64 Capacity; /* array capacity */ member in struct:_LOGICAL_DEVICE_INFO_V3
1046 HPT_U64 Capacity; /* array capacity */ member in struct:_LOGICAL_DEVICE_INFO_V4
1178 HPT_U64 Capacity; member in struct:_CREATE_ARRAY_PARAMS_V2
1202 HPT_U64 Capacity; member in struct:_CREATE_ARRAY_PARAMS_V3
/freebsd-11-stable/contrib/llvm-project/clang/lib/CodeGen/
H A DCGCleanup.cpp109 unsigned Capacity = 1024; local
110 while (Capacity < Size) Capacity *= 2;
111 StartOfBuffer = new char[Capacity];
112 StartOfData = EndOfBuffer = StartOfBuffer + Capacity;
/freebsd-11-stable/sys/dev/aacraid/
H A Daacraid_cam.c718 scsi_ulto4b(co->co_mntobj.Capacity-1, p->addr);
742 scsi_ulto4b(co->co_mntobj.Capacity-1, &p->addr[4]);
784 if (co->co_mntobj.Capacity > 0xffffff ||
791 (co->co_mntobj.Capacity >> 16);
793 (co->co_mntobj.Capacity >> 8);
795 (co->co_mntobj.Capacity);
/freebsd-11-stable/sys/dev/aac/
H A Daac_disk.c376 sc->ad_size = sc->ad_container->co_mntobj.Capacity;
/freebsd-11-stable/lib/libefivar/
H A Defivar-dp-format.c112 if ((Str->Count + (Count + 1)) > Str->Capacity) {
113 Str->Capacity = (Str->Count + (Count + 1) * 2);
114 Str->Str = reallocf(Str->Str, Str->Capacity);
118 vsnprintf(Str->Str + Str->Count, Str->Capacity - Str->Count, Fmt, Args);
H A Duefi-dplib.h81 UINTN Capacity; member in struct:__anon4684

Completed in 508 milliseconds

12