/haiku-fatelf/headers/private/kernel/ |
H A D | wait_for_objects.h | 18 struct select_info* next; // next in the object's list 41 extern void notify_select_events_list(select_info* list, uint16 events);
|
/haiku-fatelf/headers/private/storage/ |
H A D | AddOnMonitor.h | 9 #include <list>
|
/haiku-fatelf/headers/private/storage/sniffer/ |
H A D | Rule.h | 25 /*! \brief A priority and a list of expressions to be used for sniffing out the 41 void SetTo(double priority, std::vector<DisjList*>* list); 44 std::vector<DisjList*> *fConjList; // A list of DisjLists to be ANDed
|
/haiku-fatelf/src/add-ons/accelerants/ati/ |
H A D | accelerant.h | 37 display_mode* modeList; // list of standard display modes 38 area_id modeListArea; // mode list area ID 63 void (*FillSpan)(engine_token*, uint32 color, uint16* list, 143 fill_rect_params* list, uint32 count); 144 void Mach64_FillSpan(engine_token* et, uint32 color, uint16* list, 146 void Mach64_InvertRectangle(engine_token* et, fill_rect_params* list, 148 void Mach64_ScreenToScreenBlit(engine_token* et, blit_params* list, 152 fill_rect_params* list, uint32 count); 153 void Rage128_FillSpan(engine_token* et, uint32 color, uint16* list, 155 void Rage128_InvertRectangle(engine_token* et, fill_rect_params* list, [all...] |
/haiku-fatelf/src/add-ons/kernel/drivers/bluetooth/h2/h2generic/ |
H A D | h2util.cpp | 127 init_room(struct list* l) 134 alloc_room(struct list* l, size_t size) 148 reuse_room(struct list* l, void* room) 155 purge_room(struct list* l)
|
/haiku-fatelf/src/add-ons/kernel/file_systems/ntfs/libntfs/ |
H A D | list.h | 2 * list.h - Linked list implementation. Originated from the Linux-NTFS project. 26 * struct list_head - Simple doubly linked list implementation. 56 * This is only for internal list manipulation where we know the prev/next 71 * @head: list head to add it after 84 * @head: list head to add it before 99 * Delete a list entry by making the prev/next entries point to each other. 101 * This is only for internal list manipulation where we know the prev/next 112 * list_del - deletes entry from list. 113 * @entry: the element to delete from the list 147 list_splice(struct list_head *list, struct list_head *head) argument [all...] |
/haiku-fatelf/src/add-ons/kernel/network/stack/ |
H A D | domains.h | 13 #include <util/list.h>
|
/haiku-fatelf/src/add-ons/print/drivers/gutenprint/ |
H A D | GPParameterVisitor.cpp | 64 stp_parameter_list_t list = stp_get_parameter_list(variables); local 65 int size = stp_parameter_list_count(list); 68 const stp_parameter_t* parameter = stp_parameter_list_param(list, i); 71 VisitParameter(list, parameter, &description); 82 stp_parameter_list_destroy(list); 123 GPParameterVisitor::VisitParameter(stp_parameter_list_t list, argument 177 stp_string_list_t* list = parameter->bounds.str; local 178 int count = stp_string_list_count(list); 191 const stp_param_string_t* entry = stp_string_list_param(list, i);
|
/haiku-fatelf/src/apps/processcontroller/ |
H A D | PCWorld.cpp | 116 BList list; local 117 be_roster->GetAppList(kSignature, &list); 118 int32 count = list.CountItems(); 121 BMessenger* otherme = new BMessenger(NULL, (addr_t)list.ItemAt(i));
|
/haiku-fatelf/src/bin/gdb/ |
H A D | ltcf-cxx.sh | 189 # underscore (_), so it is better to generate a list of symbols to export. 288 output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | egrep "\-L"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; echo $list' 357 output_verbose_link_cmd='templist=`$CC $CFLAGS -v conftest.$objext -o libconftest.so 2>&1 | egrep "ld"`; rm -f libconftest.so; list=""; for z in $templist; do case $z in conftest.$objext) list="$list [all...] |
/haiku-fatelf/src/bin/network/atftpd/ |
H A D | tftpd_pcre.h | 62 struct tftpd_pcre_pattern *list; member in struct:tftpd_pcre_self
|
/haiku-fatelf/src/libs/print/libgutenprint/include/gutenprint/ |
H A D | Makefile.am | 40 list.h \ 47 string-list.h \
|
/haiku-fatelf/src/servers/media_addon/ |
H A D | MediaFilePlayer.cpp | 14 BObjectList<MediaFilePlayer> list; variable 33 MediaFilePlayer *player = list.EachElement(FindMediaFilePlayer, (void *)media_name); 40 list.RemoveItem(player); 48 list.AddItem(player);
|
/haiku-fatelf/src/system/boot/platform/bios_ia32/ |
H A D | debug.cpp | 62 va_list list; local 68 va_start(list, format); 69 vprintf(format, list); 70 va_end(list);
|
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/beserved/BeManager/ |
H A D | Groups.h | 16 ColumnListView *list; member in class:GroupItem
|
H A D | Servers.h | 16 ColumnListView *list; member in class:ServerItem
|
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/beserved/server-Windows/ |
H A D | ubi_AVLtree.h | 233 int ubi_avlModuleID( int size, char *list[] );
237 * Input: size - The number of elements in the array <list>.
238 * list - An array of pointers of type (char *). This array
241 * Output: The number of elements of <list> that were used. If this value
|
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/fs_shell/ |
H A D | stub.c | 33 va_list list; local 34 va_start(list, format); 35 vfprintf(stderr, format, list); 36 va_end(list);
|
/haiku-fatelf/src/tests/add-ons/print/ppd/model/ |
H A D | StatementListVisitor.h | 22 virtual void Visit(StatementList* list);
|
/haiku-fatelf/src/tools/docbook/libxslt/libxslt/ |
H A D | pattern.c | 189 * @comp: an XSLT comp list 463 xmlXPathObjectPtr list; local 478 list = (xmlXPathObjectPtr) 481 if ((list == NULL) || (prevdoc != doc)) { 506 if (list != NULL) 507 xmlXPathFreeObject(list); 508 list = newlist; 511 (void *) list; 519 list = newlist; 521 if ((list 771 xmlNodeSetPtr list; local 2058 xsltCompMatchPtr pat, list, *top = NULL, next; local 2294 xsltCompMatchPtr list = NULL; local [all...] |
/haiku-fatelf/src/apps/cortex/TipManager/ |
H A D | TipManagerImpl.cpp | 10 * notice, this list of conditions, and the following disclaimer. 13 * notice, this list of conditions, and the following disclaimer in the 70 for(list<_ViewEntry*>::iterator it = m_childViews.begin(); 88 // hierarchy list and looking for my target view. 89 // The list should be in descending order: the last 92 list<BView*> parentOrder; 108 for(list<BView*>::iterator itView = parentOrder.begin(); 112 list<_ViewEntry*>::iterator itEntry = 158 // hierarchy list and looking for my target view. 159 // The list shoul [all...] |
/haiku-fatelf/src/apps/devices/ |
H A D | ResourceUsageWindow.cpp | 191 ResourceUsageWindow::ResourceUsageWindow(BRect frame, BList &list) argument 195 InitWindow(list); 211 void ResourceUsageWindow::InitWindow(BList &list) argument 272 for (int32 j=0; j<list.CountItems(); j++) { 273 DevicesInfo *deviceInfo = (DevicesInfo *)list.ItemAt(j); 304 for (int32 j=0; j<list.CountItems(); j++) { 305 DevicesInfo *deviceInfo = (DevicesInfo *)list.ItemAt(j); 331 for (int32 j=0; j<list.CountItems(); j++) { 332 DevicesInfo *deviceInfo = (DevicesInfo *)list.ItemAt(j); 352 for (int32 j=0; j<list [all...] |
/haiku-fatelf/src/bin/gdb/gdb/ |
H A D | tracepoint.c | 84 info trace : list all debugger-defined tracepoints. 361 so that a list of tracepoints will come out in order 596 /* Utility: parse a tracepoint number and look it up in the list. 639 /* Utility: parse a list of tracepoint numbers, and call a func for each. */ 751 within a tracepoint action list. If the actual function is ever called, 764 error ("This command can only be used in a tracepoint actions list."); 770 error ("This command can only be used in a tracepoint actions list."); 773 /* Enter a list of actions for a tracepoint. */ 887 this tracepoint has no actions. Discard empty list. */ 938 { /* repeat over a comma-separated list */ 1064 struct memrange *list; member in struct:collection_list 1339 clear_collection_list(struct collection_list *list) argument 1355 stringify_collection_list(struct collection_list *list, char *string) argument [all...] |
/haiku-fatelf/src/libs/edit/ |
H A D | history.c | 12 * notice, this list of conditions and the following disclaimer. 14 * notice, this list of conditions and the following disclaimer in the 65 history_vfun_t h_clear; /* Clear the history list */ 118 hentry_t list; /* Fake list header element */ member in struct:history_t 119 hentry_t *cursor; /* Current element in the list */ 164 "empty list", 202 h->cursor = h->list.next; 203 if (h->cursor != &h->list) 222 h->cursor = h->list [all...] |
/haiku-fatelf/headers/os/interface/ |
H A D | Input.h | 40 status_t get_input_devices(BList* list); 63 friend status_t get_input_devices(BList* list);
|