Searched refs:list (Results 276 - 300 of 726) sorted by relevance

<<11121314151617181920>>

/haiku-fatelf/src/add-ons/print/drivers/pdf/source/
H A DXReferences.cpp119 Pattern* XRefDef::Matches(PatternList* list, const char* s, const char** start, int32* len) { argument
121 const int32 n = list->CountItems();
124 Pattern* p = list->ItemAt(i);
341 DestList* list = GetList(def); local
342 ASSERT(list != NULL);
343 if (!list->Find(label)) {
344 list->AddItem(new Destination(label, page, boundingBox));
352 DestList* list = GetList(def); local
353 ASSERT(list != NULL);
354 Destination* dest = list
[all...]
/haiku-fatelf/src/bin/bash/
H A Dassoc.c448 WORD_LIST *list; local
455 list = (WORD_LIST *)NULL;
461 list = make_word_list (make_bare_word(w), list);
463 return (REVERSE_LIST(list, WORD_LIST *));
489 WORD_LIST *list, *l; local
497 list = NULL;
499 by converting to a word list first, possibly quoting the data, then
508 list = make_word_list (make_bare_word(t), list);
[all...]
H A Darrayfunc.c346 assign_array_var_from_word_list (var, list, flags)
348 WORD_LIST *list;
358 for (l = list; l; l = l->next, i++)
372 WORD_LIST *list, *nlist; local
387 /* Expand the value string into a list of words, performing all the
391 list = parse_string_to_word_list (val, 1, "array assign");
395 if (list)
396 quote_array_assignment_chars (list);
399 word in the list. */
400 nlist = list
418 WORD_LIST *list; local
[all...]
H A Dgeneral.h128 #define REVERSE_LIST(list, type) \
129 ((list && list->next) ? (type)list_reverse ((GENERIC_LIST *)list) \
130 : (type)(list))
/haiku-fatelf/src/kits/media/
H A DMediaRoster.cpp20 * this list of conditions and the following disclaimer.
23 * in the binary, as well as this list of conditions and the following
296 BMediaRosterEx::GetAllOutputs(const media_node& node, List<media_output>* list) argument
313 list->MakeEmpty();
323 if (!list->Insert(reply.output)) {
324 ERROR("GetAllOutputs: list->Insert failed\n");
343 BMediaRosterEx::GetAllOutputs(BBufferProducer* node, List<media_output>* list) argument
353 list->MakeEmpty();
358 if (!list->Insert(output)) {
359 ERROR("GetAllOutputs: list
373 GetAllInputs(const media_node& node, List<media_input>* list) argument
420 GetAllInputs(BBufferConsumer* node, List<media_input>* list) argument
450 PublishOutputs(const media_node& node, List<media_output>* list) argument
2003 List<media_output> list; local
2010 List<media_input> list; local
[all...]
/haiku-fatelf/src/add-ons/mail_daemon/inbound_protocols/imap/imap_lib/
H A DIMAPHandler.cpp146 int32 message, MinMessageList* list, BPositionIO** data)
152 fMinMessageList(list),
159 int32 firstMessage, int32 lastMessage, MinMessageList* list,
166 fMinMessageList(list),
260 MinMessageList* list, int32 nextId)
264 fMinMessageList(list),
366 const MinMessageList& list = fIMAPMailbox.GetMessageList(); local
368 if (index < 0 || index >= (int32)list.size())
370 const MinMessage& minMessage = list[index];
643 MinMessageList& list
145 FetchMinMessageCommand(IMAPMailbox& mailbox, int32 message, MinMessageList* list, BPositionIO** data) argument
158 FetchMinMessageCommand(IMAPMailbox& mailbox, int32 firstMessage, int32 lastMessage, MinMessageList* list, BPositionIO** data) argument
259 FetchMessageListCommand(IMAPMailbox& mailbox, MinMessageList* list, int32 nextId) argument
[all...]
/haiku-fatelf/src/preferences/joysticks/
H A DJoyWin.cpp279 JoyWin::_AddToList(BListView *list, uint32 command, const char* rootPath, argument
294 _AddToList(list, command, rootPath, &entry);
300 list->AddItem(new PortItem(str.String()));
338 // try to open.. list those that suxesfully work
351 //Need a if !found then show this message. else list joysticks.
460 BString temp("# This is a list of disabled joystick devices.");
475 JoyWin::_GetSelectedItem(BListView* list) argument
477 int32 id = list->CurrentSelection();
479 //PortItem *item = dynamic_cast<PortItem*>(list->ItemAt(id));
480 return dynamic_cast<PortItem*>(list
497 _SelectDeselectJoystick(BListView* list, bool enable) argument
[all...]
/haiku-fatelf/src/add-ons/kernel/file_systems/netfs/headers/shared/
H A DSLList.h69 Iterator(List *list) argument
70 : fList(list),
128 ConstIterator(const List *list) argument
129 : fList(list),
130 fNext(list->GetFirst())
/haiku-fatelf/src/bin/coreutils/src/
H A Dtr.c58 list -- it indicates that get_next should make any necessary
130 to work with: a linked list of constructs (struct List_element).
135 `tail', which is first used to construct the list. After construction,
136 it is used by get_next to save its state when traversing the list.
140 /* Points to the head of the list of range elements.
642 character C to the specification list LIST. */
645 append_normal_char (struct Spec_list *list, unsigned char c)
653 assert (list->tail);
654 list->tail->next = new;
655 list
644 append_normal_char(struct Spec_list *list, unsigned char c) argument
663 append_range(struct Spec_list *list, unsigned char first, unsigned char last) argument
696 append_char_class(struct Spec_list *list, char const *char_class_str, size_t len) argument
721 append_repeated_char(struct Spec_list *list, unsigned char the_char, count repeat_count) argument
743 append_equiv_class(struct Spec_list *list, char const *equiv_class_str, size_t len) argument
[all...]
/haiku-fatelf/src/bin/gdb/gdb/
H A Dremote-utils.c492 /* Given a null terminated list of strings LIST, read the input until we find one of
500 gr_multi_scan (char *list[], int passthrough) argument
515 list[i] != NULL;
518 int length = strlen (list[i]);
532 /* and a list of pointers to current scan points. */
537 plist[i] = list[i];
558 plist[i] = list[i];
/haiku-fatelf/src/bin/
H A Dreindex.cpp34 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(0L))) != NULL) {
309 printf("usage: %s [-rvf] attr <list of filenames and/or directories>\n"
/haiku-fatelf/src/libs/print/libgutenprint/src/main/
H A Dmodule.c70 * A list of modules, for use when the modules are linked statically.
113 static int module_list_is_initialised = 0; /* Is the module list initialised? */
177 #else /* use a static module list */
197 /* destroy the module list (modules unloaded by callback) */
215 stp_list_t *list; /* List to return */ local
218 list = stp_list_create(); /* No freefunc, so it can be destroyed
220 if (!list)
226 /* Add modules of the same class to our list */
228 stp_list_item_create(list, NULL, stp_list_item_get_data(ln));
231 return list;
[all...]
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/beserved/BeManager/
H A DGroups.cpp41 list = listView;
147 ColumnListView *list = GetAssociatedList(); local
152 list->LockLooper();
154 list->InvalidateItem(index);
155 list->UnlockLooper();
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/headers/shared/
H A DSLList.h69 Iterator(List *list) argument
70 : fList(list),
128 ConstIterator(const List *list) argument
129 : fList(list),
130 fNext(list->GetFirst())
/haiku-fatelf/src/tools/docbook/libxml2/
H A DdebugXML.c311 "Attr has no prev and not first of attr list\n");
315 "Node has no prev and not first of parent list\n");
325 "Node has no next and not last of parent list\n");
852 * @attr: the attribute list
855 * Dumps debug information for the attribute list
1079 * @node: the node list
1082 * Dumps debug information for the list of element node, it is recursive
1408 * @attr: the attribute list
1411 * Dumps debug information for the attribute list
1472 * @node: the node list
1602 xmlNodePtr list = NULL; local
1925 xmlShellPrintXPathResultCtxt(xmlShellCtxtPtr ctxt,xmlXPathObjectPtr list) argument
1979 xmlShellPrintXPathResult(xmlXPathObjectPtr list) argument
2808 xmlXPathObjectPtr list; local
[all...]
/haiku-fatelf/src/kits/storage/sniffer/
H A DParser.cpp688 // 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-fatelf/src/add-ons/kernel/drivers/bluetooth/h2/h2generic/
H A Dsnet_buffer.cpp187 snb_park(struct list* l, snet_buffer* snb)
205 snb_fetch(struct list* l, uint16 size)
221 * as we fetched? => remove it from list
232 snb_packets(struct list* l)
/haiku-fatelf/src/libs/util/
H A Dlogin_ok.c11 * this list of conditions, and the following disclaimer.
13 * notice, this list of conditions and the following disclaimer in the
51 login_strinlist(const char **list, char const *str, int flags) argument
58 while (rc == 0 && list[i] != NULL)
59 rc = fnmatch(list[i++], str, flags) == 0;
67 * Locate either or two strings in a given list
86 * Returns an allocated list of time periods given an array
143 rc = 0; /* tty or ttygroup not in allow list */
148 rc = 0; /* tty or ttygroup in deny list */
188 rc = 0; /* host or IP not in allow list */
[all...]
/haiku-fatelf/src/preferences/filetypes/
H A DExtensionWindow.cpp102 BList list; local
103 list.AddItem((void *)newExtension);
105 return merge_extensions(type, list, oldExtension);
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/beserved/server-Windows/
H A Dubi_SplayTree.cpp485 int ubi_sptModuleID( int size, char *list[] )
489 * Input: size - The number of elements in the array <list>.
490 * list - An array of pointers of type (char *). This array
493 * Output: The number of elements of <list> that were used. If this value
505 list[0] = ModuleID;
507 return( 1 + ubi_btModuleID( --size, &(list[1]) ) );
/haiku-fatelf/src/tests/libs/linprog/
H A DProgram.cpp19 PrintResults(const VariableList& list) argument
21 for (int32 i = 0; i < list.CountItems(); i++)
22 printf("Variable %i = %f\n", (int)i, list.ItemAt(i)->Value());
/haiku-fatelf/src/kits/tracker/
H A DFSUndoRedo.cpp50 /** source - list of file(s) that were moved. Assumes ownership.
118 ChangeListSource(BObjectList<entry_ref> &list, BEntry &entry) argument
124 for (int32 index = 0; index < list.CountItems(); index++) {
125 entry_ref* ref = list.ItemAt(index);
294 BObjectList<entry_ref>* list = new BObjectList<entry_ref>(fSourceList); local
296 ChangeListSource(*list, entry);
299 FSMoveToFolder(list, new BEntry(&fSourceRef),
/haiku-fatelf/headers/compatibility/bsd/
H A Dlibutil.h16 * notice, this list of conditions and the following disclaimer.
18 * notice, this list of conditions and the following disclaimer in the
90 void properties_free(properties list);
91 char *property_find(properties list, const char *name);
/haiku-fatelf/headers/private/fs_shell/
H A DDoublyLinkedList.h85 // 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-fatelf/headers/private/kernel/util/
H A DDoublyLinkedList.h86 // 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)
394 "list
[all...]

Completed in 316 milliseconds

<<11121314151617181920>>