Searched refs:list (Results 101 - 125 of 726) sorted by relevance

1234567891011>>

/haiku-fatelf/src/tests/system/kernel/util/
H A DAVLTreeMapTest.h16 void TestList(List &list, typename List::ValueType *values, int valueCount);
H A DSinglyLinkedListTest.h17 void TestList(List &list, typename List::ValueType *values, int valueCount);
/haiku-fatelf/src/add-ons/screen_savers/gravity/
H A DParticle.h17 static BList* list; member in class:Particle
H A DParticle.cpp17 BList* Particle::list; member in class:Particle
23 list = new BList();
78 list->AddItem(p);
86 for (int32 i = 0; i < list->CountItems(); i++)
87 delete (Particle*)list->ItemAt(i);
89 list->MakeEmpty();
90 delete list;
97 for (int32 i = 0; i < list->CountItems(); i++) {
98 Particle* p = (Particle*)list->ItemAt(i);
/haiku-fatelf/src/add-ons/kernel/drivers/bluetooth/h2/h2generic/
H A Dh2generic.h22 #include <util/list.h>
102 struct list eventRoom;
103 struct list aclRoom;
107 struct list nbuffersTx[BT_DRIVER_TXCOVERAGE];
115 struct list snetBufferRecycleTrash;
/haiku-fatelf/src/bin/gdb/gdb/
H A Dframe-unwind.c40 struct frame_unwind_table_entry *list; member in struct:frame_unwind_table
41 /* The head of the OSABI part of the search list. */
52 table->list = OBSTACK_ZALLOC (obstack, struct frame_unwind_table_entry);
53 table->list->unwinder = dummy_frame_unwind;
55 table->osabi_head = &table->list->next;
66 /* Find the end of the list and insert the new entry there. */
79 /* Insert the new entry at the start of the list. */
93 for (entry = table->list; entry != NULL; entry = entry->next)
/haiku-fatelf/src/add-ons/kernel/debugger/qrencode/
H A Dqrinput.c295 QRinput_List *list, *next; local
298 list = input->head;
299 while(list != NULL) {
300 next = list->next;
301 QRinput_List_freeEntry(list);
302 list = next;
311 QRinput_List *list; local
314 list = input->head;
315 while(list != NULL) {
316 if(list
330 QRinput_List *list, *e; local
961 QRinput_List *list; local
1129 QRinput_List *list; local
1358 QRinput_List *list; local
1512 QRinput_InputList *list, *next; local
1527 QRinput_InputList *list; local
1583 QRinput_List *list, *next, *prev; local
1676 QRinput_InputList *list; local
[all...]
/haiku-fatelf/src/add-ons/accelerants/et6x00/
H A DAcceleration.c71 * Move the specified list of rectangular regions from one location in
73 * blit_params *list. The list is uint32 count elements in length.
76 blit_params *list,
98 src_left = list->src_left;
99 src_top = list->src_top;
100 dest_left = list->dest_left;
101 dest_top = list->dest_top;
102 width = list->width;
103 height = list
75 SCREEN_TO_SCREEN_BLIT(engine_token *et, blit_params *list, uint32 count) argument
164 FILL_RECTANGLE(engine_token *et, uint32 color, fill_rect_params *list, uint32 count) argument
[all...]
/haiku-fatelf/src/servers/registrar/
H A DRecentEntries.cpp12 //! Recently launched apps list
41 keeping track of orderings when loading/storing the recent entries list
67 /*! \var std::list<std::string> RecentEntries::fEntryList
68 \brief The list of entries and their corresponding app sigs, most recent first
75 /*! \brief Creates a new list.
77 The list is initially empty.
93 the recent apps list.
95 If the app already exists elsewhere in the list, that item is
96 removed so only one instance exists in the list at any time.
101 application is \b not added to the list (bu
306 std::list<recent_entry*> &list = mapItem->second; local
[all...]
/haiku-fatelf/headers/cpp/
H A Dstl_list.h247 class list : protected _List_base<_Tp, _Alloc> { class in inherits:_List_base
310 explicit list(const allocator_type& __a = allocator_type()) : _Base(__a) {} function in class:list
341 void swap(list<_Tp, _Alloc>& __x) { __STD::swap(_M_node, __x._M_node); }
404 list(size_type __n, const _Tp& __value, function in class:list
408 explicit list(size_type __n) function in class:list
417 list(_InputIterator __first, _InputIterator __last, function in class:list
424 list(const _Tp* __first, const _Tp* __last, function in class:list
428 list(const_iterator __first, const_iterator __last, function in class:list
434 list(const list<_T argument
516 operator ==(const list<_Tp,_Alloc>& __x, const list<_Tp,_Alloc>& __y) argument
532 operator <(const list<_Tp,_Alloc>& __x, const list<_Tp,_Alloc>& __y) argument
615 operator =(const list<_Tp, _Alloc>& __x) argument
[all...]
/haiku-fatelf/src/add-ons/kernel/drivers/ports/usb_serial/
H A DProlific.cpp106 ProlificDevice::SendRequestList(request_item *list, size_t length) argument
112 USB_REQTYPE_VENDOR | (list[i].out ? USB_REQTYPE_DEVICE_OUT : USB_REQTYPE_DEVICE_IN),
114 list[i].value,
115 list[i].index,
116 list[i].out ? 0 : bufferLength,
117 list[i].out ? NULL : buffer,
121 TRACE_ALWAYS("sending request list failed:0x%08lx\n", status);
/haiku-fatelf/src/bin/gzip/
H A Dzgrep37 list=0
41 *l*) list=1
54 if test $list -eq 1; then
/haiku-fatelf/src/bin/unzip/
H A Dzipgrep27 list=0
31 *l*) list=1; opt=`echo $opt | sed s/l//`
42 if test $list -eq 1; then
/haiku-fatelf/src/libs/ncurses/form/
H A Dfty_int.c129 wchar_t *list = _nc_Widen_String((char *)bp, &len); local
131 if (list != 0)
138 if (list[n] != ' ')
144 else if (list[n] == ' ')
148 else if (!isDigit(list[n]))
154 free(list);
/haiku-fatelf/src/servers/registrar/mime/
H A DRegistrarThreadManager.cpp101 std::list<RegistrarThread*>::iterator i;
127 std::list<RegistrarThread*>::iterator i;
139 "pointer found in and removed from RegistrarThreadManager::fThreads list\n");
156 std::list<RegistrarThread*>::iterator i;
172 "pointer found in and removed from RegistrarThreadManager::fThreads list\n");
177 /*! \todo We may want to iterate back through the list at this point,
194 std::list<RegistrarThread*>::iterator i;
212 "pointer found in and removed from RegistrarThreadManager::fThreads list\n");
223 as threads may remain in the thread list that are finished and waiting
235 /*! \brief Deletes the given thread and removes it from the thread list
[all...]
/haiku-fatelf/src/tests/kits/storage/
H A DStatableTest.h9 #include <list>
30 for (list<C*>::iterator it = entries.begin();
77 list<C*> entries;
78 list<string> entryNames;
79 list<C*>::iterator entryIt;
80 list<string>::iterator entryNameIt;
/haiku-fatelf/src/bin/bash/
H A Dhashlib.c171 BUCKET_CONTENTS *list; local
180 for (list = table->bucket_array[bucket]; list; list = list->next)
182 if (hv == list->khash && STREQ (list->key, string))
184 list->times_found++;
185 return (list);
191 list
[all...]
H A Dpcomplete.c225 strvec_flush (sl->list);
227 free (sl->list);
267 any member of SL->list that does *not* match will be removed. This returns
269 non-matching members of SL->list are *freed*. */
279 if (sl == 0 || sl->list == 0 || sl->list_len == 0)
290 m = strmatch (t, sl->list[i], FNMATCH_EXTFLAG);
292 free (sl->list[i]);
294 ret->list[ret->list_len++] = sl->list[i];
297 ret->list[re
[all...]
/haiku-fatelf/src/add-ons/accelerants/s3/
H A Daccel.h38 display_mode* modeList; // list of standard display modes
39 area_id modeListArea; // mode list area ID
59 void (*FillSpan)(engine_token*, uint32 color, uint16* list, uint32 count);
139 void Savage_FillRectangle(engine_token* et, uint32 color, fill_rect_params* list, uint32 count);
140 void Savage_FillSpan(engine_token* et, uint32 color, uint16* list, uint32 count);
141 void Savage_InvertRectangle(engine_token* et, fill_rect_params* list, uint32 count);
142 void Savage_ScreenToScreenBlit(engine_token* et, blit_params* list, uint32 count);
144 void Trio64_FillRectangle(engine_token* et, uint32 color, fill_rect_params* list, uint32 count);
145 void Trio64_FillSpan(engine_token* et, uint32 color, uint16* list, uint32 count);
146 void Trio64_InvertRectangle(engine_token* et, fill_rect_params* list, uint3
[all...]
/haiku-fatelf/src/libs/ncurses/ncurses/tinfo/
H A Dcomp_hash.c180 * This filter reads from standard input a list of tab-delimited columns,
194 static char **list; local
198 if (list == 0 && (list = typeCalloc(char *, MAX_COLUMNS)) == 0)
215 list[col] = buffer;
226 return col ? list : 0;
263 char **list, *nlp = strchr(buffer, '\n'); local
266 list = parse_columns(buffer);
267 if (list == 0) /* blank or comment */
270 name_table[n].nte_name = strdup(list[colum
[all...]
/haiku-fatelf/headers/build/private/storage/mime/
H A DMimeUpdateThread.h18 #include <list>
51 std::list< std::pair<dev_t, bool> > fAttributeSupportList;
/haiku-fatelf/headers/libs/print/libprint/
H A DPrintProcess.h10 #include <list>
48 typedef list<PageData *> PageDataList;
/haiku-fatelf/headers/private/device/
H A DJoystickTweaker.h53 BList *list, BEntry *rootEntry = NULL);
55 void _EmpyList(BList *list);
/haiku-fatelf/src/bin/makeudfimage/
H A DAllocator.h16 #include <list>
45 list<Udf::extent_address> fChunkList;
/haiku-fatelf/src/kits/device/
H A DJoystickTweaker.cpp83 _BJoystickTweaker::_ScanIncludingDisabled(const char *rootPath, BList *list, argument
97 ASSERT(list != NULL);
100 status_t result = _ScanIncludingDisabled(rootPath, list, &entry);
117 if (!list->AddItem(deviceName)) {
137 _BJoystickTweaker::_EmpyList(BList *list) argument
139 for (int32 i = 0; i < list->CountItems(); i++)
140 delete (BString *)list->ItemAt(i);
142 list->MakeEmpty();

Completed in 409 milliseconds

1234567891011>>