/haiku-fatelf/headers/private/kernel/util/ |
H A D | kqueue.h | 21 #define kqueue_foreach(head, element) \ 22 for ((element) = (void *)(head)->next; (element) != (void *)(head); (element) = (void *)((struct quehead *)(element))->next) 36 /** Inserts an element (_element) to the queue (_head) */ 41 struct quehead *element = (struct quehead *)_element, local 44 element->next = head->next; 45 element->prev = head; 46 head->next = element; 56 struct quehead *element = (struct quehead *)_element; local [all...] |
H A D | DoublyLinkedList.h | 56 inline Link* operator()(Element* element) const 58 return element->GetDoublyLinkedListLink(); 61 inline const Link* operator()(const Element* element) const 63 return element->GetDoublyLinkedListLink(); 75 inline Link* operator()(Element* element) const 77 return &(element->*LinkMember); 80 inline const Link* operator()(const Element* element) const 82 return &(element->*LinkMember); 93 inline Link* operator()(Element* element) const 95 return (Link*)&element 156 Element* element = fCurrent; local 205 Element* element = fNext; local 257 Element* element = fCurrent; local 306 Element* element = fNext; local 389 Insert(Element* element, bool back) argument 424 InsertBefore(Element* before, Element* element) argument 454 InsertAfter(Element* insertAfter, Element* element) argument 492 Insert(Element* before, Element* element) argument 501 Add(Element* element, bool back) argument 509 Remove(Element* element) argument 586 Element* element = Head(); local 596 Element* element = Tail(); local [all...] |
H A D | DoublyLinkedQueue.h | 63 Element *element = fCurrent; local 68 return element; 112 Element *element = fNext; local 115 return element; 141 inline void Insert(Element *element); 142 inline void Insert(Element *before, Element *element); 143 inline void Add(Element *element); 144 inline void Remove(Element *element); 158 inline Element *GetPrevious(Element *element) const; 159 inline Element *GetNext(Element *element) cons 179 Insert(Element *element) argument 194 Insert(Element *before, Element *element) argument 219 Add(Element *element) argument 227 Remove(Element *element) argument 285 Element *element = fFirst; local 303 Element *element = fFirst; local 318 Element *element = Head(); local [all...] |
H A D | SinglyLinkedList.h | 49 inline Link* operator()(Element* element) const 51 return element->GetSinglyLinkedListLink(); 54 inline const Link* operator()(const Element* element) const 56 return element->GetSinglyLinkedListLink(); 68 inline Link* operator()(Element* element) const 70 return &(element->*LinkMember); 73 inline const Link* operator()(const Element* element) const 75 return &(element->*LinkMember); 115 Element* element = fNext; local 118 return element; 178 Add(Element* element) argument 196 Remove(Element* element) argument 223 Remove(Element* previous, Element* element) argument 267 Element* element = fFirst; local 281 Element* element = Head(); local [all...] |
/haiku-fatelf/src/bin/gdb/gdb/osf-share/ |
H A D | cma_list.h | 54 * Insert an element in a list following the specified item (or at the 58 #define cma__list_insert(element,list) (void)( \ 59 (element)->link = (list)->link, \ 60 (list)->link = (element)) 66 #define cma__list_next(element) ((element)->link)
|
/haiku-fatelf/src/add-ons/kernel/file_systems/ext2/ |
H A D | HashRevokeManager.cpp | 36 RevokeElement *element = local 39 while (element != NULL) { 40 delete element; 41 element = (RevokeElement*)hash_remove_first(fHash, NULL); 69 RevokeElement* element = (RevokeElement*)hash_lookup(fHash, &block); local 71 if (element != NULL) { 72 TRACE("HashRevokeManager::Insert(): Already has an element\n"); 73 if (element->commitID < commitID) { 74 TRACE("HashRevokeManager::Insert(): Deleting previous element\n"); 75 status_t retValue = hash_remove(fHash, element); 95 RevokeElement* element = (RevokeElement*)hash_lookup(fHash, &block); local 112 RevokeElement* element = (RevokeElement*)hash_lookup(fHash, &block); local 152 RevokeElement* element = new(std::nothrow) RevokeElement; local [all...] |
/haiku-fatelf/src/add-ons/kernel/file_systems/ramfs/ |
H A D | NodeTable.cpp | 32 NodeHashElement *element local 34 if (element) 35 element->fNode = node; 57 if (NodeHashElement *element = _FindElement(id)) 58 fNodes.Remove(element); 69 if (NodeHashElement *element = _FindElement(id)) 70 node = element->fNode; 87 NodeHashElement *element local 89 while (element && element [all...] |
H A D | NodeChildTable.h | 46 const Element &element = static_cast<const Element&>(_element); local 47 return Equals(element.fID, element.fChild->GetName()); 50 inline void Adopt(Element &element) argument 52 fID = element.fID; 53 fChild = element.fChild; 165 Element *element = fTable.Add(Element::HashFor(id, child->GetName())); local 166 if (element) { 167 element->fID = id; 168 element 231 Element *element = fTable.FindFirst(Element::HashFor(id, name)); local [all...] |
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/ramfs/ |
H A D | NodeTable.cpp | 32 NodeHashElement *element local 34 if (element) 35 element->fNode = node; 57 if (NodeHashElement *element = _FindElement(id)) 58 fNodes.Remove(element); 69 if (NodeHashElement *element = _FindElement(id)) 70 node = element->fNode; 87 NodeHashElement *element local 89 while (element && element [all...] |
H A D | NodeChildTable.h | 46 const Element &element = static_cast<const Element&>(_element); local 47 return Equals(element.fID, element.fChild->GetName()); 50 inline void Adopt(Element &element) argument 52 fID = element.fID; 53 fChild = element.fChild; 165 Element *element = fTable.Add(Element::HashFor(id, child->GetName())); local 166 if (element) { 167 element->fID = id; 168 element 231 Element *element = fTable.FindFirst(Element::HashFor(id, name)); local [all...] |
/haiku-fatelf/src/tools/fs_shell/ |
H A D | hash.cpp | 51 next_element(hash_table *table, void *element) argument 54 return (void *)(*(unsigned long *)NEXT_ADDR(table, element)); 111 hash_insert(struct hash_table *table, void *element) argument 115 ASSERT(table != NULL && element != NULL); 116 TRACE(("hash_insert: table 0x%x, element 0x%x\n", table, element)); 118 hash = table->hash_func(element, NULL, table->table_size); 119 PUT_IN_NEXT(table, element, table->table[hash]); 120 table->table[hash] = (struct hash_element *)element; 133 void *element, *lastElemen local 157 void *element; local 193 void *element = table->table[index]; local 212 void *element; local 227 void *element; local [all...] |
/haiku-fatelf/src/add-ons/kernel/file_systems/netfs/headers/shared/ |
H A D | SLList.h | 44 inline Link *operator()(Element *element) const 46 return element->GetSLListLink(); 49 inline const Link *operator()(const Element *element) const 51 return element->GetSLListLink(); 102 Element *element = fCurrent; local 107 return element; 146 Element *element = fNext; local 149 return element; 172 inline void Insert(Element *element, bool back = true); 173 inline void InsertAfter(Element *previous, Element *element); 218 Insert(Element *element, bool back) argument 226 InsertAfter(Element *previous, Element *element) argument 250 Remove(Element *element) argument 286 Element *element = fFirst; local 307 _Remove(Element *previous, Element *element) argument [all...] |
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/headers/shared/ |
H A D | SLList.h | 44 inline Link *operator()(Element *element) const 46 return element->GetSLListLink(); 49 inline const Link *operator()(const Element *element) const 51 return element->GetSLListLink(); 102 Element *element = fCurrent; local 107 return element; 146 Element *element = fNext; local 149 return element; 172 inline void Insert(Element *element, bool back = true); 173 inline void InsertAfter(Element *previous, Element *element); 218 Insert(Element *element, bool back) argument 226 InsertAfter(Element *previous, Element *element) argument 250 Remove(Element *element) argument 286 Element *element = fFirst; local 307 _Remove(Element *previous, Element *element) argument [all...] |
H A D | DLList.h | 70 inline Link *operator()(Element *element) const 72 return element->GetDLListLink(); 75 inline const Link *operator()(const Element *element) const 77 return element->GetDLListLink(); 122 Element *element = fCurrent; local 127 return element; 164 Element *element = fNext; local 167 return element; 190 inline void Insert(Element *element, bool back = true); 191 inline void Remove(Element *element); 232 Insert(Element *element, bool back) argument 262 Remove(Element *element) argument 340 Element *element = fFirst; local [all...] |
/haiku-fatelf/src/apps/cortex/Persistence/ |
H A D | XMLElementMapping.h | 36 // "make an object for this XML element." 56 const BString element; member in class:XMLElementMapping 62 element(_element) {} 75 const char* element) : 76 XMLElementMapping(element) {} 83 // compare pointers to Mappings by element name 87 return a->element < b->element; 74 Mapping( const char* element) argument
|
/haiku-fatelf/src/libs/print/libgutenprint/src/main/ |
H A D | mxml-attr.c | 35 * This function returns NULL if the node is not an element or the 58 for (i = node->value.element.num_attrs, attr = node->value.element.attrs; 77 * into the element node. This function does nothing if the node is 78 * not an element. 101 for (i = node->value.element.num_attrs, attr = node->value.element.attrs; 121 if (node->value.element.num_attrs == 0) 124 attr = realloc(node->value.element.attrs, 125 (node->value.element [all...] |
/haiku-fatelf/headers/private/fs_shell/ |
H A D | DoublyLinkedList.h | 55 inline Link *operator()(Element *element) const 57 return element->GetDoublyLinkedListLink(); 60 inline const Link *operator()(const Element *element) const 62 return element->GetDoublyLinkedListLink(); 74 inline Link *operator()(Element *element) const 76 return &(element->*LinkMember); 79 inline const Link *operator()(const Element *element) const 81 return &(element->*LinkMember); 92 inline Link *operator()(Element *element) const 94 return (Link *)&element 151 Element *element = fCurrent; local 200 Element *element = fNext; local 252 Element *element = fCurrent; local 301 Element *element = fNext; local 377 Insert(Element *element, bool back) argument 407 Insert(Element *before, Element *element) argument 432 Add(Element *element, bool back) argument 440 Remove(Element *element) argument 504 Element *element = fFirst; local 520 Element *element = Head(); local [all...] |
H A D | SinglyLinkedList.h | 55 inline Link* operator()(Element* element) const 57 return element->GetSinglyLinkedListLink(); 60 inline const Link* operator()(const Element* element) const 62 return element->GetSinglyLinkedListLink(); 74 inline Link* operator()(Element* element) const 76 return &(element->*LinkMember); 79 inline const Link* operator()(const Element* element) const 81 return &(element->*LinkMember); 121 Element* element = fNext; local 124 return element; 180 Add(Element* element) argument 191 Remove(Element* element) argument 217 Element* element = fFirst; local 231 Element* element = Head(); local [all...] |
/haiku-fatelf/headers/private/package/hpkg/ |
H A D | Stacker.h | 19 Stacker(Type*& location, Type* element) argument 24 *fLocation = element; 27 Stacker(Type** location, Type* element) argument 32 *fLocation = element;
|
/haiku-fatelf/src/kits/interface/layouter/ |
H A D | CollapsingLayouter.cpp | 40 SetElementPosition(int32 element, int32 position) argument 42 fElements[element] = position; 46 ElementLocation(int32 element) argument 48 if (element < 0 || element >= fElementCount || fElements[element] < 0) 50 return fTarget->ElementLocation(fElements[element]); 54 ElementSize(int32 element) argument 56 if (element < 0 || element > 62 ElementRangeSize(int32 element, int32 length) argument 134 AddConstraints(int32 element, int32 length, float min, float max, float preferred) argument 173 SetWeight(int32 element, float weight) argument 287 ElementInfo& element = fElements[i]; local 306 ElementInfo& element = fElements[i]; local [all...] |
H A D | Layouter.h | 18 virtual float ElementLocation(int32 element) = 0; 19 virtual float ElementSize(int32 element) = 0; 30 virtual void AddConstraints(int32 element, int32 length, 32 virtual void SetWeight(int32 element, float weight) = 0;
|
/haiku-fatelf/src/system/kernel/util/ |
H A D | khash.cpp | 68 next_element(hash_table *table, void *element) argument 71 return (void *)(*(unsigned long *)NEXT_ADDR(table, element)); 93 void *element; local 96 for (element = table->table[index]; element != NULL; element = next) { 97 uint32 hash = table->hash_func(element, NULL, newSize); 98 next = NEXT(table, element); 99 PUT_IN_NEXT(table, element, newTable[hash]); 100 newTable[hash] = (struct hash_element *)element; 172 hash_insert(struct hash_table *table, void *element) argument 189 hash_insert_grow(struct hash_table *table, void *element) argument 214 void *element, *lastElement = NULL; local 238 void *element; local 283 void *element = table->table[index]; local 302 void *element; local 317 void *element; local 431 struct hash_element* element = table->table[i]; local [all...] |
/haiku-fatelf/src/system/kernel/ |
H A D | TeamThreadTables.h | 78 void Insert(Element* element) argument 80 element->serial_number = fNextSerialNumber++; 81 fTable.InsertUnchecked(element); 82 fList.Add(element); 85 void Remove(Element* element) argument 87 fTable.RemoveUnchecked(element); 88 fList.Remove(element); 93 Element* element = fTable.Lookup(id); local 94 return element != NULL && (!visibleOnly || element 137 Element* element = static_cast<Element*>(nextEntry); local [all...] |
/haiku-fatelf/src/add-ons/kernel/bus_managers/usb/ |
H A D | Stack.cpp | 340 usb_driver_info *element = fDriverList; local 341 while (element) { 342 status_t result = device->ReportDevice(element->support_descriptors, 343 element->support_descriptor_count, &element->notify_hooks, 344 &element->cookies, added, false); 347 const char *driverName = element->driver_name; 348 if (element->republish_driver_name) 349 driverName = element->republish_driver_name; 373 element 458 usb_driver_info *element = fDriverList; local 476 usb_driver_info *element = fDriverList; local 511 usb_driver_info *element = fDriverList; local [all...] |
/haiku-fatelf/headers/private/userlandfs/shared/ |
H A D | HashSet.h | 251 Element* element = fTable.Lookup(key); local 252 if (element) { 257 // does not contain the key yet: create an element and add it 258 element = new(std::nothrow) Element(key); 259 if (!element) 262 status_t error = fTable.Insert(element); 264 delete element; 275 Element* element = fTable.Lookup(key); local 276 if (element == NULL) 279 fTable.Remove(element); 292 Element* element = fTable.Clear(true); local 331 Element* element = fTable.FindFirst(key.GetHashCode()); local [all...] |