/haiku/src/kits/interface/ |
H A D | Icon.cpp | 123 BitmapList& list = (which & B_DISABLED_ICON_BITMAP) == 0 local 127 int32 count = list.CountItems(); 129 list.ReplaceItem(which, bitmap); 133 while (list.CountItems() < (int32)which) { 134 if (!list.AddItem((BBitmap*)NULL)) 138 return list.AddItem(bitmap); 145 const BitmapList& list = (which & B_DISABLED_ICON_BITMAP) == 0 local 147 return list.ItemAt(which & ~uint32(B_DISABLED_ICON_BITMAP));
|
H A D | Input.cpp | 56 get_input_devices(BList *list) argument 58 list->MakeEmpty(); 78 list->AddItem(dev);
|
/haiku/src/bin/debug/strace/ |
H A D | TypeHandler.h | 12 #include <list> 59 typedef std::list<FlagInfo> FlagsList;
|
/haiku/src/add-ons/print/drivers/gutenprint/ |
H A D | GPParameterVisitor.h | 39 void VisitParameter(stp_parameter_list_t list,
|
/haiku/src/apps/cortex/RouteApp/ |
H A D | RouteWindow.h | 10 * notice, this list of conditions, and the following disclaimer. 13 * notice, this list of conditions, and the following disclaimer in the 46 #include <list> 184 // list<InspectorWindow*> m_nodeInspectorWindows;
|
H A D | RouteApp.cpp | 10 * notice, this list of conditions, and the following disclaimer. 13 * notice, this list of conditions, and the following disclaimer in the 446 list<BString> errors; 455 for(list<BString>::iterator it = errors.begin(); 524 list<BString>& errors, 565 list<BString> errors; 577 for(list<BString>::iterator it = errors.begin();
|
/haiku/src/tests/kits/game/chart/ |
H A D | ChartRender.h | 171 star *list; member in struct:__anon5796
|
H A D | ChartRender_d.h | 192 star *list; member in struct:__anon2043
|
/haiku/headers/private/mail/ |
H A D | mail_util.h | 102 void get_address_list(BList &list, const char *string,
|
/haiku/src/preferences/keymap/ |
H A D | KeymapWindow.h | 67 bool _SelectCurrentMap(BListView* list);
|
/haiku/headers/private/kernel/boot/ |
H A D | partitions.h | 33 static Partition *Lookup(partition_id id, NodeList *list = NULL);
|
/haiku/src/add-ons/mail_daemon/inbound_protocols/imap/imap_lib/ |
H A D | Protocol.cpp | 101 ArgumentList& list = response.ListAt(1); local 102 for (int32 i = 0; i < list.CountItems(); i += 2) { 104 list.ItemAt(i)->ToString().String(), 105 list.ItemAt(i + 1)->ToString().String());
|
/haiku/src/system/boot/loader/ |
H A D | partitions.cpp | 144 Partition::Lookup(partition_id id, NodeList *list) argument 148 if (list == NULL) 149 list = &gPartitions; 151 NodeIterator iterator = list->GetIterator(); 409 // list 443 All created partitions are added to the gPartitions list. 457 // add this partition to the list of partitions
|
/haiku/src/tests/add-ons/kernel/partitioning_systems/ |
H A D | PartitioningSystemsTest.cpp | 145 void* list = open_module_list("partitioning_systems"); local 148 while (read_next_module_name(list, name, &nameSize) == B_OK) { 322 void* list = open_module_list("partitioning_systems"); local 325 while (read_next_module_name(list, name, &nameSize) == B_OK) {
|
/haiku/src/add-ons/screen_savers/message/ |
H A D | Message.cpp | 61 get_lines(BString *message, BStringList& list, int *longestLine) argument 66 if (copy.Split("\n", false, list)) { 68 int32 count = list.CountStrings(); 70 int32 length = list.StringAt(i).Length();
|
/haiku/headers/private/kernel/ |
H A D | cpu.h | 83 struct list irqs;
|
/haiku/src/system/boot/platform/riscv/ |
H A D | video.cpp | 21 #include <util/list.h>
|
/haiku/src/tools/fs_shell/ |
H A D | unistd.cpp | 140 va_list list; local 144 va_start(list, op); 150 = va_arg(list, fssh_device_geometry*); 360 va_end(list);
|
/haiku/src/kits/device/ |
H A D | SerialPort.cpp | 28 // given list 30 scan_directory(const char *directory, BList *list) argument 36 ASSERT(list != NULL); 39 list->AddItem(strdup(buf)); 42 return list->CountItems(); 48 Query the driver, and builds a list of the available 76 Closes the port, if it's open, and deletes the devices list. 497 // Refresh devices list 535 /*! \brief Build a list of available serial ports. 537 and build a list o [all...] |
/haiku/src/add-ons/accelerants/3dfx/ |
H A D | mode.cpp | 96 // Obtain EDID info which is needed for for building the mode list. If 111 display_mode* list; local 118 (check_display_mode_hook)checkMode, &list, &count); 125 gInfo.modeList = list; 151 // Search the mode list for the specified mode. 161 return B_OK; // mode found in list 164 return B_BAD_VALUE; // mode not found in list 251 // Return the number of display modes in the mode list. 260 // Copy the list of supported video modes to the location pointed at
|
/haiku/src/add-ons/accelerants/intel_810/ |
H A D | mode.cpp | 90 // Obtain EDID info which is needed for for building the mode list. 117 display_mode* list; local 124 (check_display_mode_hook)checkMode, &list, &count); 131 gInfo.modeList = list; 147 // Search the mode list for the specified mode. 157 return B_OK; // mode found in list 160 return B_BAD_VALUE; // mode not found in list 248 // Return the number of display modes in the mode list. 257 // Copy the list of supported video modes to the location pointed at
|
/haiku/src/servers/app/stackandtile/ |
H A D | Stacking.cpp | 283 const SATWindowList& list = area->WindowList(); local 284 if (list.CountItems() > 0) 285 list.ItemAt(0)->DoGroupLayout();
|
/haiku/src/preferences/filetypes/ |
H A D | AttributeWindow.cpp | 427 BList list; local 442 list.AddItem(item); 445 list.AddItem(_NewItemFromCurrent()); 450 for (int32 i = 0; i < list.CountItems(); i++) { 451 AttributeItem* item = (AttributeItem*)list.ItemAt(i);
|
/haiku/src/system/libnetwork/netresolv/net/ |
H A D | nsdispatch.c | 14 * notice, this list of conditions and the following disclaimer. 16 * notice, this list of conditions and the following disclaimer in the 46 * notice, this list of conditions and the following disclaimer. 48 * notice, this list of conditions and the following disclaimer in the 171 LIST_ENTRY(_ns_drec) list; 634 LIST_FOREACH(ldrec, &_ns_drec, list) { 638 LIST_INSERT_HEAD(&_ns_drec, &drec, list); 642 LIST_REMOVE(&drec, list); 690 LIST_REMOVE(&drec, list);
|
/haiku/src/system/runtime_loader/ |
H A D | images.cpp | 276 // If all references to the image are gone, add it to the disposable list 663 /*! Returns a topologically sorted image list. 684 image_t** list; local 686 list = (image_t**)malloc(sLoadedImageCount * sizeof(image_t*)); 687 if (list == NULL) { 693 memset(list, 0, sLoadedImageCount * sizeof(image_t*)); 695 *_list = list; 698 return topological_sort(image, 0, list, sortFlag); 704 count = topological_sort(image, count, list, sortFlag);
|