HomeSort by: relevance | last modified time | path
    Searched defs:reserve (Results 1 - 25 of 63) sorted by relevancy

1 2 3

  /src/sys/dev/pcmcia/
pcmciadevs_data.h 52 int reserve; member in struct:pcmcia_knowndev
  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
IndexedMap.h 55 void reserve(typename StorageT::size_type s) { function in class:llvm::IndexedMap
56 storage_.reserve(s);
PackedVector.h 111 void reserve(unsigned N) { Bits.reserve(N << (BitNum-1)); } function in class:llvm::PackedVector
DenseSet.h 90 void reserve(size_t Size) { TheMap.reserve(Size); } function in class:llvm::detail::DenseSetImpl
MapVector.h 64 void reserve(size_type NumEntries) { function in class:llvm::MapVector
65 Map.reserve(NumEntries);
66 Vector.reserve(NumEntries);
BitVector.h 31 /// Iterators get invalidated when resize / reserve is called.
340 void reserve(unsigned N) { Bits.reserve(NumBitWords(N)); } function in namespace:llvm
  /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/InstCombine/
InstCombineWorklist.h 81 void reserve(size_t Size) { function in class:llvm::InstCombineWorklist
82 Worklist.reserve(Size + 16);
83 WorklistMap.reserve(Size);
  /src/external/apache2/llvm/dist/clang/include/clang/AST/
ASTUnresolvedSet.h 79 void reserve(ASTContext &C, unsigned N) { function in class:clang::ASTUnresolvedSet
80 Decls.reserve(C, N);
105 void reserve(ASTContext &C, unsigned N) { Impl.reserve(C, N); } function in class:clang::LazyASTUnresolvedSet
ASTVector.h 61 reserve(C, N);
173 void reserve(const ASTContext &C, unsigned N) { function in class:clang::ASTVector
242 // Convert iterator to elt# to avoid invalidating iterator when we reserve()
251 reserve(C, static_cast<unsigned>(this->size() + NumToInsert));
290 // Convert iterator to elt# to avoid invalidating iterator when we reserve()
301 reserve(C, static_cast<unsigned>(this->size() + NumToInsert));
  /src/external/apache2/llvm/dist/clang/include/clang/Analysis/Analyses/
ThreadSafetyUtil.h 112 // Reserve space for at least Ncp items, reallocating if necessary.
113 void reserve(size_t Ncp, MemRegionRef A) { function in class:clang::threadSafety::til::SimpleArray
122 // Reserve space for at least N more items.
125 reserve(u_max(InitialCapacity, N), A);
127 reserve(u_max(Size + N, Capacity * 2), A);
  /src/external/apache2/llvm/dist/clang/lib/Sema/
TypeLocBuilder.h 56 void reserve(size_t Requested) { function in class:clang::TypeLocBuilder
  /src/external/gpl3/gcc.old/dist/gcc/d/dmd/root/
array.h 70 reserve(1);
79 void reserve(d_size_t nentries) function in struct:Array
81 //printf("Array::reserve: length = %d, data.length = %d, nentries = %d\n", (int)length, (int)data.length, (int)nentries);
129 reserve(d);
139 reserve(1);
149 reserve(newdim - length);
192 reserve(1);
  /src/external/public-domain/xz/dist/src/liblzma/lz/
lz_encoder.c 212 // increases, we reserve more space when a large dictionary is
221 uint32_t reserve = lz_options->dict_size / 2; local
222 if (reserve > (UINT32_C(1) << 30))
223 reserve /= 2;
225 reserve += (lz_options->before_size + lz_options->match_len_max
229 mf->size = mf->keep_size_before + reserve + mf->keep_size_after;
  /src/crypto/external/apache2/openssl/dist/test/
priority_queue_test.c 51 static int test_size_t_priority_queue_int(int reserve, int order, int count,
61 count, orders[order], reserve ? "reserve" : "grow",
86 if (reserve && !TEST_true(ossl_pqueue_size_t_reserve(pq, count)))
135 int reserve, order, count, remove, random, popfree; local
143 reserve = n % 2;
150 return test_size_t_priority_queue_int(reserve, order, count, remove,
254 * 2 /* reserve */
  /src/crypto/external/bsd/openssh/dist/
bitmap.c 83 reserve(struct bitmap *b, u_int n) function
107 if ((r = reserve(b, n)) != 0)
198 if ((r = reserve(b, l * 8)) != 0)
  /src/external/apache2/llvm/dist/clang/include/clang/Analysis/Support/
BumpVector.h 67 reserve(C, N);
188 void reserve(BumpVectorContext &C, unsigned N) { function in class:clang::BumpVector
  /src/external/bsd/tcpdump/dist/missing/
snprintf.c 64 int (*reserve)(struct state *, size_t); member in struct:state
485 state.reserve = as_reserve;
  /src/external/apache2/llvm/dist/llvm/lib/Support/
FoldingSet.cpp 91 Bits.reserve(Bits.size() + NumInserts);
314 void FoldingSetBase::reserve(unsigned EltCount, const FoldingSetInfo &Info) { function in class:FoldingSetBase
  /src/external/gpl3/gcc/dist/gcc/
vec.h 52 be more efficient to use the reserve operation before adding the
55 increase if there are too few spare slots. If you want reserve a
155 allocation must reserve enough space for all the elements
248 /* Calculate the number of slots to reserve a vector, making sure that
249 RESERVE slots are free. If EXACT grow exactly, otherwise grow
253 vec_prefix::calculate_allocation (vec_prefix *pfx, unsigned reserve,
257 return (pfx ? pfx->m_num : 0) + reserve;
259 return MAX (4, reserve);
260 return calculate_allocation_1 (pfx->m_alloc, pfx->m_num + reserve);
289 static void reserve (vec<T, va_heap, vl_embed> *&, unsigned, boo
304 va_heap::reserve (vec<T, va_heap, vl_embed> *&v, unsigned reserve, bool exact function in class:va_heap
394 va_gc::reserve (vec<T, A, vl_embed> *&v, unsigned reserve, bool exact function in class:va_gc
    [all...]
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/
unordered_map.h 1134 reserve(size_type __n) function in class:unordered_map
1135 { _M_h.reserve(__n); }
2034 reserve(size_type __n) function in class:unordered_multimap
2035 { _M_h.reserve(__n); }
unordered_set.h 867 reserve(size_type __n) function in class:unordered_set
868 { _M_h.reserve(__n); }
1712 reserve(size_type __n) function in class:unordered_multiset
1713 { _M_h.reserve(__n); }
  /src/external/gpl3/gcc.old/dist/gcc/
vec.h 52 be more efficient to use the reserve operation before adding the
55 increase if there are too few spare slots. If you want reserve a
137 allocation must reserve enough space for all the elements
220 /* Calculate the number of slots to reserve a vector, making sure that
221 RESERVE slots are free. If EXACT grow exactly, otherwise grow
225 vec_prefix::calculate_allocation (vec_prefix *pfx, unsigned reserve,
229 return (pfx ? pfx->m_num : 0) + reserve;
231 return MAX (4, reserve);
232 return calculate_allocation_1 (pfx->m_alloc, pfx->m_num + reserve);
261 static void reserve (vec<T, va_heap, vl_embed> *&, unsigned, boo
276 va_heap::reserve (vec<T, va_heap, vl_embed> *&v, unsigned reserve, bool exact function in class:va_heap
363 va_gc::reserve (vec<T, A, vl_embed> *&v, unsigned reserve, bool exact function in class:va_gc
    [all...]
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/
unordered_map.h 1128 reserve(size_type __n) function in class:unordered_map
1129 { _M_h.reserve(__n); }
2028 reserve(size_type __n) function in class:unordered_multimap
2029 { _M_h.reserve(__n); }
unordered_set.h 862 reserve(size_type __n) function in class:unordered_set
863 { _M_h.reserve(__n); }
1707 reserve(size_type __n) function in class:unordered_multiset
1708 { _M_h.reserve(__n); }
  /src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
ExplodedGraph.h 388 void reserve(unsigned NodeCount) { Nodes.reserve(NodeCount); } function in class:clang::ento::ExplodedGraph

Completed in 52 milliseconds

1 2 3