Searched refs:newCapacity (Results 1 - 8 of 8) sorted by relevance
| /haiku/src/bin/bfs_tools/lib/ |
| H A D | Hashtable.cpp | 247 int newCapacity,i; local
249 newCapacity = oldCapacity * 2 + 1;
250 if (!(newtable = (struct Entry **)malloc(newCapacity * sizeof(struct Entry *))))
252 memset(newtable,0,newCapacity*sizeof(struct Entry *));
255 fThreshold = (int)(newCapacity * fLoadFactor);
257 fCapacity = newCapacity;
266 index = hashCode(entry->key) % newCapacity;
|
| /haiku/headers/private/shared/ |
| H A D | Array.h | 250 int32 newCapacity = kMinCapacity; local
251 while (newCapacity < newSize)
252 newCapacity *= 2;
254 if (newCapacity == fCapacity) {
272 Element* elements = (Element*)malloc(newCapacity * sizeof(Element));
292 fCapacity = newCapacity;
|
| /haiku/src/system/kernel/messaging/ |
| H A D | KMessage.cpp | 977 int32 newCapacity = _CapacityFor(newSize); local
978 void* newBuffer = MEMALIGN(kMessageBufferAlignment, newCapacity);
982 fBufferCapacity = newCapacity;
998 int32 newCapacity = _CapacityFor(newSize); local
999 void* newBuffer = realloc(fBuffer, newCapacity);
1003 fBufferCapacity = newCapacity;
|
| /haiku/src/preferences/keymap/ |
| H A D | KeyboardLayout.cpp | 359 int32 newCapacity = fKeyCapacity + 32; local
360 Key* newKeys = (Key*)realloc((void*)fKeys, newCapacity * sizeof(Key));
365 fKeyCapacity = newCapacity;
|
| /haiku/src/kits/debugger/dwarf/ |
| H A D | DwarfExpressionEvaluator.cpp | 89 size_t newCapacity = fStackCapacity + kStackCapacityIncrement; local
91 newCapacity * sizeof(target_addr_t));
96 fStackCapacity = newCapacity;
|
| /haiku/src/system/boot/loader/ |
| H A D | menu.cpp | 887 size_t newCapacity = std::max(fCapacity, size_t(32)); local
888 while (newLength >= newCapacity)
889 newCapacity *= 2;
891 char* buffer = (char*)realloc(fBuffer, newCapacity);
896 fCapacity = newCapacity;
|
| /haiku/src/add-ons/kernel/file_systems/userlandfs/server/fuse/ |
| H A D | FUSEVolume.cpp | 60 uint32 newCapacity = std::max(fEntryCapacity * 2, (uint32)8); local
62 newCapacity * sizeof(Entry));
67 fEntryCapacity = newCapacity;
73 size_t newCapacity = std::max(fNamesCapacity * 2, (size_t)256); local
74 while (newCapacity < fNamesSize + nameSize)
75 newCapacity *= 2;
77 char* names = (char*)realloc(fNames, newCapacity);
82 fNamesCapacity = newCapacity;
|
| /haiku/src/system/kernel/cache/ |
| H A D | block_cache.cpp | 1130 size_t newCapacity = max_c(256, fCapacity * 2); local
1132 newBlocks = (cached_block**)malloc(newCapacity * sizeof(void*));
1135 newCapacity * sizeof(void*));
1147 fCapacity = newCapacity;
|
Completed in 322 milliseconds