/haiku/src/bin/ |
H A D | reindex.cpp | 34 BList gAttrList; // list of indices of that volume 196 BList list; local 198 // building list 224 if (!list.AddItem(attr)) { 241 for (int32 i = list.CountItems(); i-- > 0;) { 242 attr = static_cast<Attribute *>(list.ItemAt(i)); 249 // rewrite attrs and empty the list 250 while ((attr = static_cast<Attribute *>(list.RemoveItem((int32)0))) != NULL) { 309 printf("usage: %s [-rvf] attr <list of filenames and/or directories>\n"
|
/haiku/src/add-ons/kernel/drivers/audio/usb/ |
H A D | Device.cpp | 337 multi_buffer_list list; local 338 if (user_memcpy(&list, buffer, sizeof(multi_buffer_list)) != B_OK) 340 buffer_desc **original_playback_descs = list.playback_buffers; 341 buffer_desc **original_record_descs = list.record_buffers; 343 buffer_desc *playback_descs[list.request_playback_buffers]; 344 buffer_desc *record_descs[list.request_record_buffers]; 346 if (!IS_USER_ADDRESS(list.playback_buffers) 347 || user_memcpy(playback_descs, list.playback_buffers, 348 sizeof(buffer_desc*) * list.request_playback_buffers) 350 || !IS_USER_ADDRESS(list [all...] |
/haiku/src/kits/storage/sniffer/ |
H A D | Parser.cpp | 688 // return NULL; // Return NULL to signal end of list 987 std::vector<DisjList*>* list = ParseConjList(); local 989 result->SetTo(priority, list); 1009 std::vector<DisjList*> *list = new(std::nothrow) std::vector<DisjList*>; local 1010 if (!list) 1020 list->push_back(expr); 1027 delete list; 1030 return list; 1119 PatternList *list = new(std::nothrow) PatternList(range); local 1120 if (!list) 1149 RPatternList *list = new(std::nothrow) RPatternList(); local [all...] |
/haiku/src/tools/update_package_requires/ |
H A D | update_package_requires.cpp | 12 #include <list> 24 typedef std::list<BPackageResolvable*> ProvidesList; 43 "Updates the versions in the \"requires\" list of the given package\n" 114 // create a map for all provides (name -> resolvable list) 136 // clone the package info's requires list 137 typedef std::list<BPackageResolvableExpression> RequiresList; 143 // rebuild the requires list with updated versions
|
/haiku/src/kits/storage/ |
H A D | AddOnMonitorHandler.cpp | 220 // We might have this entry in the pending list multiple times, 221 // so we search entire list through, even after finding one. 398 // toDirectory list. 481 // TODO: Add the entry to the pending list, disable/enable it 598 AddOnMonitorHandler::_FindEntry(const node_ref& entry, const EntryList& list, argument 601 for (; EntryList::const_iterator(it) != list.end(); it++) { 610 AddOnMonitorHandler::_FindEntry(const char* name, const EntryList& list, argument 613 for (; EntryList::const_iterator(it) != list.end(); it++) { 622 AddOnMonitorHandler::_HasEntry(const node_ref& entry, EntryList& list) const 624 EntryList::iterator it = list 680 _AddNewEntry(EntryList& list, add_on_entry_info& info) argument [all...] |
/haiku/src/preferences/filetypes/ |
H A D | ExtensionWindow.cpp | 102 BList list; local 103 list.AddItem((void *)newExtension); 105 return merge_extensions(type, list, oldExtension);
|
/haiku/src/tests/libs/linprog/ |
H A D | Program.cpp | 18 PrintResults(const VariableList& list) argument 20 for (int32 i = 0; i < list.CountItems(); i++) 21 printf("Variable %i = %f\n", (int)i, list.ItemAt(i)->Value());
|
/haiku/src/add-ons/kernel/drivers/bluetooth/h2/h2generic/ |
H A D | snet_buffer.cpp | 188 snb_park(struct list* l, snet_buffer* snb) 206 snb_fetch(struct list* l, uint16 size) 222 * as we fetched? => remove it from list 233 snb_packets(struct list* l)
|
/haiku/headers/private/netservices2/ |
H A D | HttpFields.h | 9 #include <list> 35 using ConstIterator = std::list<Field>::const_iterator; 48 // Access list 70 std::list<Field> fFields;
|
/haiku/headers/private/tracker/ |
H A D | NavMenu.h | 78 BWindow* parentWindow = NULL, const BObjectList<BString>* list = NULL); 80 BWindow* parentWindow = NULL, const BObjectList<BString>* list = NULL); 98 void SetTypesList(const BObjectList<BString>* list);
|
/haiku/src/kits/tracker/ |
H A D | FSUndoRedo.cpp | 85 /** source - list of file(s) that were moved. Assumes ownership. 153 ChangeListSource(BObjectList<entry_ref> &list, BEntry &entry) argument 159 for (int32 index = 0; index < list.CountItems(); index++) { 160 entry_ref* ref = list.ItemAt(index); 329 BObjectList<entry_ref>* list = new BObjectList<entry_ref>(fSourceList); local 331 ChangeListSource(*list, entry); 334 FSMoveToFolder(list, new BEntry(&fSourceRef),
|
/haiku/src/tests/kits/game/chart/ |
H A D | ChartRender.cpp | 49 Those matrix are stored in packed format, as a the list of all pixel 117 uint8 *list, *color_offset; local 130 list = pattern_list[j*LEVEL_COUNT + i]; 144 *list++ = k; 149 *list++ = k; 156 *list++ = k; 175 *list++ = k; 289 /* In the other case, we need to go through the list of rectangle 325 /* Now, we have to go through the list of rectangle of the clipping region 540 as described in (geo), in the buffer (buf), for the list o [all...] |
/haiku/src/system/kernel/fs/ |
H A D | unused_vnodes.h | 12 #include <util/list.h> 32 static list sUnusedVnodeList;
|
/haiku/src/system/boot/loader/ |
H A D | stdio.cpp | 85 vfprintf(FILE *file, const char *format, va_list list) argument 91 int length = vsnprintf(buffer, sizeof(buffer), format, list);
|
/haiku/headers/compatibility/bsd/ |
H A D | libutil.h | 16 * notice, this list of conditions and the following disclaimer. 18 * notice, this list of conditions and the following disclaimer in the 95 void properties_free(properties list); 96 char *property_find(properties list, const char *name);
|
/haiku/src/apps/installer/ |
H A D | PackageViews.h | 114 void AddPackages(BList& list, BMessage* message); 117 void GetPackagesToInstall(BList* list, int32* size);
|
/haiku/src/system/boot/platform/pxe_ia32/ |
H A D | devices.cpp | 122 NodeList *list, NodeList *partitionList) 125 NodeIterator iterator = list->GetIterator(); 121 platform_get_boot_partitions(struct stage2_args *args, Node *device, NodeList *list, NodeList *partitionList) argument
|
/haiku/headers/private/fs_shell/ |
H A D | DoublyLinkedList.h | 85 // DoublyLinkedListCLink - interface to struct list 119 Iterator(List *list) argument 121 fList(list) 181 ConstIterator(const List *list) argument 183 fList(list) 225 ReverseIterator(List *list) argument 227 fList(list) 282 ConstReverseIterator(const List *list) argument 284 fList(list)
|
/haiku/headers/private/kernel/util/ |
H A D | DoublyLinkedList.h | 86 // DoublyLinkedListCLink - interface to struct list 120 Iterator(List* list) argument 122 fList(list) 186 ConstIterator(const List* list) argument 188 fList(list) 230 ReverseIterator(List* list) argument 232 fList(list) 287 ConstReverseIterator(const List* list) argument 289 fList(list) 400 "list [all...] |
/haiku/src/kits/interface/ |
H A D | OutlineListView.cpp | 14 //! BOutlineListView represents a "nestable" list view. 63 _DoSwap(BList& list, int32 firstIndex, int32 secondIndex, BList* firstItems, argument 66 BListItem* item = (BListItem*)list.ItemAt(firstIndex); 67 list.SwapItems(firstIndex, secondIndex); 68 list.RemoveItems(secondIndex + 1, secondItems->CountItems()); 69 list.RemoveItems(firstIndex + 1, firstItems->CountItems()); 70 list.AddList(secondItems, firstIndex + 1); 71 int32 newIndex = list.IndexOf(item); 72 if (newIndex + 1 < list.CountItems()) 73 list 1037 BList* list = new BList; local 1064 _CullInvisibleItems(BList& list) argument [all...] |
/haiku/src/bin/rc/ |
H A D | parser.y | 398 list_t list; list.count = 0; list.items = NULL; 399 $$ = make_type($1, list); 413 list_t list; list.count = 0; list.items = NULL; 414 $$ = make_type($1, list); 551 add_user_type(res_id_t id, type_code code, const char* name, list_t list) 559 type.count = list [all...] |
/haiku/headers/tools/cppunit/ |
H A D | ThreadedTestCaller.h | 168 std::vector<std::string> &list = fObject->AcquireUpdateList(); local 169 for (std::vector<std::string>::iterator i = list.begin(); 170 i != list.end(); 180 list.clear();
|
/haiku/src/add-ons/accelerants/3dfx/ |
H A D | accelerant.h | 41 display_mode* modeList; // list of standard display modes 42 area_id modeListArea; // mode list area ID 104 fill_rect_params* list, uint32 count); 105 void TDFX_FillSpan(engine_token* et, uint32 color, uint16* list, 107 void TDFX_InvertRectangle(engine_token* et, fill_rect_params* list, 109 void TDFX_ScreenToScreenBlit(engine_token* et, blit_params* list,
|
/haiku/src/apps/cortex/Persistence/ |
H A D | XML.cpp | 10 * notice, this list of conditions, and the following disclaimer. 13 * notice, this list of conditions, and the following disclaimer in the 92 list<BString>* outErrors) { 143 list<BString>* outErrors) { 187 list<BString>* outErrors) { 208 list<BString>* outErrors) {
|
/haiku/src/apps/cortex/TipManager/ |
H A D | TipManagerImpl.h | 10 * notice, this list of conditions, and the following disclaimer. 13 * notice, this list of conditions, and the following disclaimer in the 42 #include <list> 201 // [e.moon 13oct99] child view list now stores pointers 202 std::list<_ViewEntry*> m_childViews; 256 std::list<_ViewEntry*> m_views; 352 std::list<_WindowEntry*> m_windows;
|