HomeSort by: relevance | last modified time | path
    Searched refs:grow (Results 1 - 25 of 77) sorted by relevancy

1 2 3 4

  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
IntEqClasses.h 41 IntEqClasses(unsigned N = 0) : NumClasses(0) { grow(N); }
43 /// grow - Increase capacity to hold 0 .. N-1, putting new integers in unique
46 void grow(unsigned N);
48 /// clear - Clear all classes so that grow() will assign a unique class to
IndexedMap.h 13 // map. A member function grow() is provided that given the value of
32 // can grow very large and SmallVector grows more efficiently as long as T
67 void grow(IndexT n) { function in class:llvm::IndexedMap
  /src/external/apache2/llvm/dist/clang/lib/AST/Interp/
InterpStack.h 31 new (grow(aligned_size<T>())) T(std::forward<Tys>(Args)...);
73 void *grow(size_t Size);
InterpStack.cpp 29 void *InterpStack::grow(size_t Size) { function in class:InterpStack
  /src/external/gpl2/texinfo/dist/info/
info.h 62 array where POINTER should be added. GROW is the number of slots to grow
65 #define add_pointer_to_array(pointer, idx, array, slots, grow, type) \
68 array = (type *)(xrealloc (array, (slots += grow) * sizeof (type))); \
  /src/external/apache2/llvm/dist/clang/include/clang/Analysis/Support/
BumpVector.h 166 grow(C);
183 grow(C, size() + Cnt);
190 grow(C, N);
198 /// grow - double the size of the allocated memory, guaranteeing space for at
200 void grow(BumpVectorContext &C, size_type MinSize = 1);
225 void BumpVector<T>::grow(BumpVectorContext &C, size_t MinSize) { function in class:clang::BumpVector
  /src/external/apache2/llvm/dist/llvm/include/llvm/Demangle/
Utility.h 33 void grow(size_t N) { function in class:OutputStream
84 grow(Size);
91 grow(1);
  /src/external/apache2/llvm/dist/clang/include/clang/AST/
ASTVector.h 169 grow(C);
175 grow(C, N);
190 // Grow allocated space if needed.
192 this->grow(C, this->size()+NumInputs);
203 // Grow allocated space if needed.
205 this->grow(C, this->size()+NumInputs);
235 this->grow(C);
347 this->grow(C, N);
354 /// grow - double the size of the allocated memory, guaranteeing space for at
356 void grow(const ASTContext &C, size_type MinSize = 1)
380 void ASTVector<T>::grow(const ASTContext &C, size_t MinSize) { function in class:clang::ASTVector
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/Sema/
TypeLocBuilder.cpp 44 void TypeLocBuilder::grow(size_t NewCapacity) { function in class:TypeLocBuilder
72 // If we need to grow, grow by a factor of 2.
78 grow(NewCapacity);
TypeLocBuilder.h 59 grow(Requested);
129 /// Grow to the given capacity.
130 void grow(size_t NewCapacity);
  /src/external/bsd/openldap/dist/servers/slapd/back-sql/
util.c 76 ber_len_t cdlen, cslen, grow; local
96 grow = BACKSQL_MAX( BACKSQL_STR_GROW, cslen );
108 dest->bb_len + grow * sizeof( char ), memctx );
116 dest->bb_len += grow;
164 ber_len_t cslen, grow; local
203 grow = BACKSQL_MAX( BACKSQL_STR_GROW, cslen );
215 ( dest->bb_len ) + grow * sizeof( char ), memctx );
223 dest->bb_len += grow * sizeof( char );
  /src/external/mit/isl/dist/
isl_pw_add_disjoint_templ.c 19 static __isl_give PW *FN(PW,grow)(__isl_take PW *pw, int n)
77 pw1 = FN(PW,grow)(pw1, pw2->n);
  /src/external/apache2/llvm/dist/llvm/lib/Support/
IntEqClasses.cpp 25 void IntEqClasses::grow(unsigned N) { function in class:IntEqClasses
26 assert(NumClasses == 0 && "grow() called after compress().");
  /src/external/bsd/libevent/dist/
evport.c 50 * Helper functions are used: grow() grows the file descriptor array as
125 static int grow(struct evport_data *, int min_events);
156 if (grow(evpd, INITIAL_EVENTS_PER_GETN) < 0) {
170 grow(struct evport_data *data, int min_events) function
367 grow(epdp, epdp->ed_maxevents * 2);
  /src/external/bsd/ntp/dist/sntp/libevent/
evport.c 51 * Helper functions are used: grow() grows the file descriptor array as
124 static int grow(struct evport_data *, int min_events);
155 if (grow(evpd, INITIAL_EVENTS_PER_GETN) < 0) {
169 grow(struct evport_data *data, int min_events) function
366 grow(epdp, epdp->ed_maxevents * 2);
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
FunctionLoweringInfo.h 242 LiveOutRegInfo.grow(Reg);
265 LiveOutRegInfo.grow(Reg);
VirtRegMap.h 96 void grow();
142 grow();
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
EdgeBundles.cpp 44 EC.grow(2 * MF->getNumBlockIDs());
RegisterUsageInfo.cpp 47 RegMasks.grow(M.size());
  /src/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/
sanitizer_dense_map.h 38 /// Grow the densemap so that it can contain at least \p NumEntries items
43 grow(NumBuckets);
278 /// accommodate \p NumEntries without need to grow().
392 void grow(unsigned AtLeast) { static_cast<DerivedT *>(this)->grow(AtLeast); } function in class:__sanitizer::DenseMapBase
420 // grow the table.
430 this->grow(NumBuckets * 2);
435 this->grow(NumBuckets);
583 /// this number of elements can be inserted in the map without grow()
644 void grow(unsigned AtLeast) function in class:__sanitizer::DenseMap
    [all...]
  /src/external/bsd/jemalloc/dist/include/jemalloc/internal/
smoothstep.sh 68 * sigmoidal curves (https://en.wikipedia.org/wiki/Smoothstep) that grow from 0
  /src/external/bsd/jemalloc.old/dist/include/jemalloc/internal/
smoothstep.sh 68 * sigmoidal curves (https://en.wikipedia.org/wiki/Smoothstep) that grow from 0
  /src/external/gpl3/gcc/dist/gcc/
rtlanal.h 208 for REF_BEGIN. It has a grow () method that increases the amount
252 this->grow (count);
302 void grow (ptrdiff_t);
327 the cost of conditionally calling grow code at every site that
  /src/external/gpl3/gcc.old/dist/gcc/
rtlanal.h 208 for REF_BEGIN. It has a grow () method that increases the amount
252 this->grow (count);
302 void grow (ptrdiff_t);
327 the cost of conditionally calling grow code at every site that
  /src/crypto/external/bsd/heimdal/dist/kdc/
connect.c 581 * Grow `d' to handle at least `n'.
592 size_t grow; local
594 grow = max(1024, d->len + n);
595 if (d->size + grow > max_request_tcp) {
597 (unsigned long)d->size + grow);
601 tmp = realloc (d->buf, d->size + grow);
604 (unsigned long)d->size + grow);
608 d->size += grow;

Completed in 35 milliseconds

1 2 3 4