Searched refs:array (Results 1 - 25 of 103) sorted by last modified time

12345

/haiku/headers/private/shared/
H A DAutoDeleter.h11 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/kits/interface/
H A DTextView.cpp2895 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/headers/os/interface/
H A DTextView.h223 static void FreeRunArray(text_run_array* array);
/haiku/src/add-ons/kernel/file_systems/bfs/
H A DInode.cpp1982 // 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 DBPlusTree.cpp34 /*! Simple array used for the duplicate handling in the B+Tree. This is an
1061 // binary search in the key array
1179 duplicate_array* array = fragment->FragmentAt(j); local
1181 if (array->IsEmpty()) {
1218 duplicate_array* array = duplicate->FragmentAt(
1220 int32 arrayCount = array->Count();
1222 FATAL(("_InsertDuplicate: Invalid array[%d] size in fragment "
1231 array->Insert(value);
1240 memmove(duplicate->DuplicateArray(), array,
1245 array
1286 duplicate_array* array; local
1350 duplicate_array* array = fragment->FragmentAt(fragmentIndex); local
1844 duplicate_array* array = duplicate->FragmentAt( local
1885 duplicate_array* array = NULL; local
2420 duplicate_array* array; local
2986 duplicate_array* array = FragmentAt(i); local
[all...]
/haiku/src/apps/terminal/
H A DThemeView.cpp147 text_run_array *array = (text_run_array*)malloc(sizeof(text_run_array) local
151 array->count = 16;
152 array->runs[0].offset = offset;
153 array->runs[0].font = *be_fixed_font;
154 array->runs[0].color = prefHandler->getRGB(PREF_ANSI_BLACK_COLOR);
156 array->runs[1].offset = offset;
157 array->runs[1].font = *be_fixed_font;
158 array->runs[1].color = prefHandler->getRGB(PREF_ANSI_RED_COLOR);
160 array->runs[2].offset = offset;
161 array
[all...]
/haiku/src/system/boot/platform/atari_m68k/
H A Dtoscalls.h485 #define VsetRGB(index, count, array) toscallWWP(XBIOS_TRAP, 93, (int16)index, (int16)count, (void *)array)
H A Ddevices.cpp336 * array of uint32 values.
351 uint32 *array = (uint32 *)buffer; local
355 sum += array[i];
/haiku/src/system/kernel/posix/
H A Dxsi_semaphore.cpp482 XsiSemaphore *fSemaphores; // array of semaphores
898 if (user_memcpy(args.array + i, &value,
919 if (user_memcpy(&value, args.array + i,
/haiku/src/libs/icon/
H A DIconRenderer.cpp255 // Figure out how large to make the array
265 // Populate the array
302 ColorArray array(gradientColors);
314 GradientGenerator gradientGenerator(interpolator, function, array,
328 GradientGenerator gradientGenerator(interpolator, function, array,
/haiku/src/apps/diskprobe/
H A DTypeEditors.cpp1176 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/tools/restest/
H A DResourceFile.cpp168 AutoDeleter(C* object, bool array = false) : object(object), array(array)
174 if (array)
181 bool array; member in struct:AutoDeleter
/haiku/src/tests/system/kernel/cache/
H A Dpages_io_test.cpp51 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/tests/add-ons/kernel/file_systems/bfs/btree/
H A Dtest.cpp205 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/tests/add-ons/kernel/file_systems/bfs/dump_log/
H A Ddump_log.cpp128 off_t *array = (off_t *)block; local
132 count = array[0];
149 off_t value = array[arrayIndex];
/haiku/src/tests/add-ons/kernel/file_systems/bfs/array/
H A Darray.cpp18 printf(" items in array: %ld\n",gArray.CountItems());
29 // insert numbers in the array
39 printf("Could not insert entry in array, but it's not in there either...\n");
45 // check for numbers in the array
51 printf("could not found entry %ld in array!\n",num);
56 // iterate through the array
58 sorted_array *array = gArray.Array(); local
59 for (int32 i = 0;i < array->count;i++) {
60 if (!gList.HasItem((void *)array->values[i])) {
61 printf("Could not find entry %lld at %ld in list!\n",array
[all...]
/haiku/src/system/kernel/cache/
H A Dfile_map.cpp43 // 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/system/boot/platform/bios_ia32/
H A Ddevices.cpp386 * array of uint32 values.
401 uint32 *array = (uint32 *)buffer; local
405 sum += array[i];
/haiku/src/apps/mail/
H A DContent.cpp861 // update the text run array safely with new font
2409 text_run_array &array = style.Array();
2410 array.count = 1;
2411 array.runs[0].offset = 0;
2413 array.runs[0].color = isHyperLink ? ui_color(B_LINK_TEXT_COLOR) : kHeaderColor;
2416 array.runs[0].color = isHyperLink
2419 array.runs[0].font = font;
2988 // reset old text run array
3006 // reset old text run array
/haiku/src/servers/launch/
H A DJob.cpp550 Job::_AddStringList(std::vector<const char*>& array, const BStringList& list) argument
554 array.push_back(list.StringAt(index).String());
/haiku/src/servers/app/drawing/Painter/
H A DPainter.cpp1039 // Make sure the color array is no larger than the screen height.
2001 // current index into "colors" array
2008 // Make sure we fill the entire array in case the gradient is outside.
2056 // make sure we fill the entire array
2073 Painter::_MakeGradient(Array& array, const BGradient& gradient) const argument
2093 array[j] = toColor.gradient(fromColor, f);
2094 GTRACE("Painter::_MakeGradient> array[%d](%d, %d, %d, %d)\n",
2095 j, array[j].r, array[j].g, array[
[all...]
H A DPainter.h318 void _MakeGradient(Array& array,
/haiku/src/add-ons/kernel/drivers/input/i2c_hid/
H A DDriver.cpp69 acpi_object_type array[4]; local
72 acpi_objects.pointer = array;
74 array[0].object_type = ACPI_TYPE_BUFFER;
75 array[0].buffer.buffer = (void*)guid;
76 array[0].buffer.length = 16;
78 array[1].object_type = ACPI_TYPE_INTEGER;
79 array[1].integer.integer = revision;
81 array[2].object_type = ACPI_TYPE_INTEGER;
82 array[2].integer.integer = function;
84 array[
[all...]
/haiku/src/apps/debuganalyzer/gui/main_window/
H A DSchedulingPage.cpp149 DataArray& array = fDataArrays[thread->Index()]; local
150 if (!array.IsEmpty()) {
151 SchedulingEvent& lastEvent = array[array.Size() - 1];
165 array.Add(event);
170 IODataArray& array = fIODataArrays[thread->Index()]; local
171 array.Add(IOSchedulingEvent(time, state));
/haiku/src/system/kernel/fs/
H A Dvfs_boot.cpp122 array of uint32 values.
137 uint32* array = (uint32*)buffer; local
142 sum += array[i];

Completed in 375 milliseconds

12345