/haiku/src/tests/add-ons/kernel/file_systems/bfs/btree/ |
H A D | test.cpp | 205 int32* array = (int32*)buffer; local 206 array[i] = start + i; 211 uint32* array = (uint32*)buffer; local 212 array[i] = start + i; 217 int64* array = (int64*)buffer; local 218 array[i] = start + i; 223 uint64* array = (uint64*)buffer; local 224 array[i] = start + i; 229 float* array = (float*)buffer; local 230 array[ 235 double* array = (double*)buffer; local [all...] |
/haiku/src/add-ons/kernel/file_systems/nfs4/ |
H A D | RPCCallbackServer.cpp | 107 CallbackSlot* array = reinterpret_cast<CallbackSlot*>(malloc(size)); local 108 if (array == NULL) 112 memcpy(array, fCallbackArray, fArraySize * sizeof(CallbackSlot)); 115 array[i].fNext = i + 1; 117 array[newSize - 1].fNext = -1; 119 fCallbackArray = array;
|
/haiku/src/tests/add-ons/print/pcl6/ |
H A D | disasm.h | 71 #define NUM_OF_ELEMS(array, type) (sizeof(array) / sizeof(type))
|
/haiku/src/add-ons/print/drivers/gutenprint/ |
H A D | GPCapabilityExtractor.h | 63 void AddCapability(GPArray<struct BaseCap>& array, EnumCap* capability,
|
/haiku/headers/private/shared/ |
H A D | AutoDeleter.h | 11 ArrayDeleter - deletes an array 132 inline void operator()(C *array) argument 134 delete[] array; 142 ArrayDeleter(C *array) : AutoDeleter<C, ArrayDelete<C> >(array) {} argument
|
/haiku/src/system/kernel/cache/ |
H A D | file_map.cpp | 43 // TODO: use a sparse array - eventually, the unused BlockMap would be something 59 file_extent* array; member in struct:file_extent_array 150 return &fIndirect.array[index]; 191 // the new size is smaller than the minimal array size 192 file_extent *array = fIndirect.array; local 193 memcpy(fDirect, array, sizeof(file_extent) * count); 194 free(array); 197 // resize array if needed 201 oldArray = fIndirect.array; [all...] |
/haiku/src/libs/compat/freebsd_network/compat/net/ |
H A D | vnet.h | 122 #define SYSCTL_VNET_PCPUSTAT(parent, nbr, name, type, array, desc) \ 124 array##_sysctl(SYSCTL_HANDLER_ARGS) \ 128 (sizeof(VNET(array)) / sizeof(counter_u64_t))); \ 129 COUNTER_ARRAY_COPY(VNET(array), &s, sizeof(type) / sizeof(uint64_t));\ 131 COUNTER_ARRAY_ZERO(VNET(array), \ 136 0, array ## _sysctl, "I", desc)
|
/haiku/src/add-ons/kernel/file_systems/reiserfs/ |
H A D | Settings.h | 119 contains(const char **array, size_t size, const char *value) argument 122 if (!strcmp(array[i], value))
|
/haiku/src/system/libroot/posix/string/arch/x86_64/ |
H A D | arch_string.cpp | 7 #include <array> 33 : std::array<decltype(Generator<0>::sValue), sizeof...(Index)> { 36 std::array<decltype(Generator<0>::sValue), sizeof...(Index)> {
|
/haiku/src/tests/add-ons/kernel/file_systems/bfs/dump_log/ |
H A D | dump_log.cpp | 128 off_t *array = (off_t *)block; local 132 count = array[0]; 149 off_t value = array[arrayIndex];
|
/haiku/src/tests/system/kernel/cache/ |
H A D | pages_io_test.cpp | 51 file_extent *array; member in union:file_map::__anon44 74 array = NULL; 99 return &array[index]; 118 file_extent *newMap = (file_extent *)realloc(array, 123 array = newMap; 160 free(array); 162 array = NULL; 378 // when we are here, the map has been stored in the array, and 379 // the array size was still too small to cover the whole file 468 bufferOverflow ? " (array to [all...] |
/haiku/src/add-ons/kernel/file_systems/bfs/ |
H A D | Inode.cpp | 1982 // distribute the blocks to the array and allocate 1983 // new array blocks when needed 1987 block_run* array = NULL; local 1991 // get the indirect array block 1992 if (array == NULL) { 2002 array = (block_run*)cached.Block(); 2006 // do we need a new array block? 2007 if (array[indirectIndex % runsPerBlock].IsZero()) { 2011 array[indirectIndex % runsPerBlock], 2018 fVolume->ToBlock(array[indirectInde 2113 block_run* array = (block_run*)cached.WritableBlock(); local 2153 _FreeStreamArray(Transaction& transaction, block_run* array, uint32 arrayLength, off_t size, off_t& offset, off_t& max) argument [all...] |
H A D | Journal.h | 55 status_t _CheckRunArray(const run_array* array);
|
/haiku/src/servers/launch/ |
H A D | Job.h | 111 void _AddStringList(std::vector<const char*>& array,
|
/haiku/src/kits/network/libnetservices2/ |
H A D | HttpBuffer.cpp | 23 static constexpr std::array<std::byte, 2> kNewLine = {std::byte('\r'), std::byte('\n')};
|
/haiku/headers/private/interface/ |
H A D | ViewPrivate.h | 187 // the max number of points in the array 189 // the current number of points in the array 191 // the array of points 192 ViewLineArrayInfo* array; member in struct:_array_data_
|
/haiku/src/kits/interface/ |
H A D | TextView.cpp | 2895 BTextView::FreeRunArray(text_run_array* array) argument 2897 if (array == NULL) 2901 for (int32 i = 0; i < array->count; i++) 2902 array->runs[i].font.~BFont(); 2904 free(array); 2916 flattened_text_run_array* array = (flattened_text_run_array*)malloc(size); local 2917 if (array == NULL) { 2923 array->magic = B_HOST_TO_BENDIAN_INT32(kFlattenedTextRunArrayMagic); 2924 array->version = B_HOST_TO_BENDIAN_INT32(kFlattenedTextRunArrayVersion); 2925 array 2957 flattened_text_run_array* array = (flattened_text_run_array*)data; local [all...] |
/haiku/src/add-ons/kernel/file_systems/userlandfs/kernel_add_on/ |
H A D | Settings.cpp | 72 contains(const char **array, size_t size, const char *value) argument 75 if (!strcmp(array[i], value))
|
/haiku/src/system/boot/platform/riscv/ |
H A D | devices.cpp | 151 uint32* array = (uint32*)buffer; local 156 sum += array[i];
|
/haiku/src/system/boot/platform/efi/ |
H A D | devices.cpp | 119 uint32 *array = (uint32*)buffer; local 123 sum += array[i];
|
/haiku/src/apps/diskprobe/ |
H A D | TypeEditors.cpp | 1176 text_run_array array; local 1177 array.count = 1; 1178 array.runs[0].offset = 0; 1179 array.runs[0].font.SetFace(B_BOLD_FACE); 1180 array.runs[0].color = (rgb_color){0, 0, 0, 255}; 1182 fTextView->Insert(name, &array); 1184 array.runs[0].font = be_plain_font; 1185 fTextView->Insert("\n", &array);
|
/haiku/src/kits/translation/ |
H A D | TranslatorRoster.cpp | 780 translator_info* array = new (std::nothrow) translator_info[arraySize]; local 781 if (array == NULL) 792 delete[] array; 806 array[count++] = info; 812 *_info = array; 814 qsort(array, count, sizeof(translator_info), 831 translator_id* array = new (std::nothrow) translator_id[arraySize]; local 832 if (array == NULL) 839 array[count++] = iterator->first; 843 *_ids = array; [all...] |
/haiku/src/add-ons/translators/rtf/ |
H A D | convert.cpp | 353 // create array 355 text_run_array *array = (text_run_array *)malloc(sizeof(text_run_array) local 357 if (array == NULL) 360 array->count = fRuns.CountItems(); 362 for (int32 i = 0; i < array->count; i++) { 364 array->runs[i] = *run; 368 void *flattenedRunArray = BTextView::FlattenRunArray(array, &_size); 370 free(array);
|
/haiku/src/system/boot/platform/pxe_ia32/ |
H A D | pxe_undi.h | 194 uint8 array[4]; member in union:__anon5317
|
/haiku/src/bin/rc/ |
H A D | lexer.l | 88 array return ARRAY;
|