Home
last modified time | relevance | path

Searched refs:element (Results 1 – 25 of 181) sorted by relevance

12345678

/haiku/headers/private/kernel/util/
H A DDoublyLinkedList.h56 inline Link* operator()(Element* element) const in operator()
58 return element->GetDoublyLinkedListLink(); in operator()
61 inline const Link* operator()(const Element* element) const in operator()
63 return element->GetDoublyLinkedListLink(); in operator()
75 inline Link* operator()(Element* element) const in operator()
77 return &(element->*LinkMember); in operator()
80 inline const Link* operator()(const Element* element) const in operator()
82 return &(element->*LinkMember); in operator()
93 inline Link* operator()(Element* element) const in operator()
95 return (Link*)&element->link; in operator()
[all …]
H A DDoublyLinkedQueue.h63 Element *element = fCurrent; in Remove() local
68 return element; in Remove()
112 Element *element = fNext; in Next() local
115 return element; in Next()
141 inline void Insert(Element *element);
142 inline void InsertBefore(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) const;
[all …]
H A DSinglyLinkedList.h52 inline Link* operator()(Element* element) const in operator()
54 return element->GetSinglyLinkedListLink(); in operator()
57 inline const Link* operator()(const Element* element) const in operator()
59 return element->GetSinglyLinkedListLink(); in operator()
71 inline Link* operator()(Element* element) const in operator()
73 return &(element->*LinkMember); in operator()
76 inline const Link* operator()(const Element* element) const in operator()
78 return &(element->*LinkMember); in operator()
118 Element* element = fNext; in Next() local
121 return element; in Next()
[all …]
H A DHeap.h43 inline Link* operator()(Element* element) const;
53 inline Link* operator()(Element* element) const;
83 static const Key& GetKey(Element* element);
85 inline void ModifyKey(Element* element, Key newKey);
88 inline status_t Insert(Element* element, Key key);
130 HeapStandardGetLink<Element, Key>::operator()(Element* element) const in operator()
132 return element->GetHeapLink(); in operator()
139 HeapMemberGetLink<Element, Key, LinkMember>::operator()(Element* element) const in operator()
141 return &(element->*LinkMember); in operator()
201 HEAP_CLASS_NAME::GetKey(Element* element) in GetKey() argument
[all …]
H A DMinMaxHeap.h44 inline Link* operator()(Element* element) const;
54 inline Link* operator()(Element* element) const;
79 static const Key& GetKey(Element* element);
81 inline void ModifyKey(Element* element, Key newKey);
86 inline status_t Insert(Element* element, Key key);
135 MinMaxHeapStandardGetLink<Element, Key>::operator()(Element* element) const in operator()
137 return element->GetMinMaxHeapLink(); in operator()
145 Element* element) const in operator()
147 return &(element->*LinkMember); in operator()
221 MIN_MAX_HEAP_CLASS_NAME::GetKey(Element* element) in GetKey() argument
[all …]
/haiku/headers/private/fs_shell/
H A DDoublyLinkedList.h55 inline Link *operator()(Element *element) const in operator()
57 return element->GetDoublyLinkedListLink(); in operator()
60 inline const Link *operator()(const Element *element) const in operator()
62 return element->GetDoublyLinkedListLink(); in operator()
74 inline Link *operator()(Element *element) const in operator()
76 return &(element->*LinkMember); in operator()
79 inline const Link *operator()(const Element *element) const in operator()
81 return &(element->*LinkMember); in operator()
92 inline Link *operator()(Element *element) const in operator()
94 return (Link *)&element->link; in operator()
[all …]
H A DSinglyLinkedList.h55 inline Link* operator()(Element* element) const in operator()
57 return element->GetSinglyLinkedListLink(); in operator()
60 inline const Link* operator()(const Element* element) const in operator()
62 return element->GetSinglyLinkedListLink(); in operator()
74 inline Link* operator()(Element* element) const in operator()
76 return &(element->*LinkMember); in operator()
79 inline const Link* operator()(const Element* element) const in operator()
81 return &(element->*LinkMember); in operator()
121 Element* element = fNext; in Next() local
124 return element; in Next()
[all …]
/haiku/src/tools/fs_shell/
H A Dhash.cpp51 next_element(hash_table *table, void *element) in next_element() argument
54 return (void *)(*(unsigned long *)NEXT_ADDR(table, element)); in next_element()
111 hash_insert(struct hash_table *table, void *element) in hash_insert() argument
115 ASSERT(table != NULL && element != NULL); in hash_insert()
116 TRACE(("hash_insert: table 0x%x, element 0x%x\n", table, element)); in hash_insert()
118 hash = table->hash_func(element, NULL, table->table_size); in hash_insert()
119 PUT_IN_NEXT(table, element, table->table[hash]); in hash_insert()
120 table->table[hash] = (struct hash_element *)element; in hash_insert()
133 void *element, *lastElement = NULL; in hash_remove() local
135 for (element = table->table[hash]; element != NULL; in hash_remove()
[all …]
/haiku/src/add-ons/kernel/file_systems/ext2/
H A DHashRevokeManager.cpp36 RevokeElement *element = fHash->Clear(true); in ~HashRevokeManager() local
38 while (element != NULL) { in ~HashRevokeManager()
39 RevokeElement* next = element->next; in ~HashRevokeManager()
40 delete element; in ~HashRevokeManager()
41 element = next; in ~HashRevokeManager()
65 RevokeElement* element = fHash->Lookup(block); in Insert() local
67 if (element != NULL) { in Insert()
69 if (element->commitID < commitID) { in Insert()
71 bool retValue = fHash->Remove(element); in Insert()
76 delete element; in Insert()
[all …]
/haiku/src/kits/interface/layouter/
H A DCollapsingLayouter.cpp40 SetElementPosition(int32 element, int32 position) in SetElementPosition() argument
42 fElements[element] = position; in SetElementPosition()
46 ElementLocation(int32 element) in ElementLocation() argument
48 if (element < 0 || element >= fElementCount || fElements[element] < 0) in ElementLocation()
50 return fTarget->ElementLocation(fElements[element]); in ElementLocation()
54 ElementSize(int32 element) in ElementSize() argument
56 if (element < 0 || element >= fElementCount || fElements[element] < 0) in ElementSize()
58 return fTarget->ElementSize(fElements[element]); in ElementSize()
62 ElementRangeSize(int32 element, int32 length) in ElementRangeSize() argument
64 if (element < 0 || element >= fElementCount || fElements[element] < 0) in ElementRangeSize()
[all …]
H A DSimpleLayouter.cpp93 virtual float ElementLocation(int32 element) in ElementLocation() argument
95 if (element < 0 || element >= fElementCount) { in ElementLocation()
100 return fElements[element].location; in ElementLocation()
103 virtual float ElementSize(int32 element) in ElementSize() argument
105 if (element < 0 || element >= fElementCount) { in ElementSize()
110 return fElements[element].size - 1; in ElementSize()
138 SimpleLayouter::AddConstraints(int32 element, int32 length, in AddConstraints() argument
141 if (element < 0 || element >= fElementCount) { in AddConstraints()
154 ElementInfo& info = fElements[element]; in AddConstraints()
164 SimpleLayouter::SetWeight(int32 element, float weight) in SetWeight() argument
[all …]
/haiku/src/add-ons/kernel/file_systems/netfs/headers/shared/
H A DSLList.h44 inline Link *operator()(Element *element) const in operator()
46 return element->GetSLListLink(); in operator()
49 inline const Link *operator()(const Element *element) const in operator()
51 return element->GetSLListLink(); in operator()
102 Element *element = fCurrent; in Remove() local
107 return element; in Remove()
146 Element *element = fNext; in Next() local
149 return element; in Next()
172 inline void Insert(Element *element, bool back = true);
173 inline void InsertAfter(Element *previous, Element *element);
[all …]
H A DBlockingQueue.h26 status_t Push(Element* element);
27 status_t Pop(Element** element,
29 status_t Peek(Element** element);
30 status_t Remove(Element* element);
88 BlockingQueue<Element>::Push(Element* element) in Push() argument
93 status_t error = fElements.PushBack(element); in Push()
105 BlockingQueue<Element>::Pop(Element** element, bigtime_t timeout) in Pop() argument
117 *element = fElements.ElementAt(0); in Pop()
125 BlockingQueue<Element>::Peek(Element** element) in Peek() argument
133 *element = fElements.ElementAt(0); in Peek()
[all …]
/haiku/src/add-ons/kernel/bus_managers/usb/
H A DStack.cpp352 usb_driver_info *element = fDriverList; in NotifyDeviceChange() local
353 while (element) { in NotifyDeviceChange()
354 status_t result = device->ReportDevice(element->support_descriptors, in NotifyDeviceChange()
355 element->support_descriptor_count, &element->notify_hooks, in NotifyDeviceChange()
356 &element->cookies, added, false); in NotifyDeviceChange()
359 const char *driverName = element->driver_name; in NotifyDeviceChange()
360 if (element->republish_driver_name) in NotifyDeviceChange()
361 driverName = element->republish_driver_name; in NotifyDeviceChange()
385 element = element->link; in NotifyDeviceChange()
422 usb_driver_info *element = fDriverList; in RegisterDriver() local
[all …]
/haiku/src/add-ons/translators/rtf/
H A DRTF.cpp104 dump(Element &element, int32 level = 0) in dump() argument
106 printf("%03" B_PRId32 " (%p):", level, &element); in dump()
110 if (RTF::Header *header = dynamic_cast<RTF::Header *>(&element)) { in dump()
112 } else if (RTF::Command *command = dynamic_cast<RTF::Command *>(&element)) { in dump()
117 } else if (RTF::Text *text = dynamic_cast<RTF::Text *>(&element)) { in dump()
120 } else if (RTF::Group *group = dynamic_cast<RTF::Group *>(&element)) in dump()
123 if (RTF::Group *group = dynamic_cast<RTF::Group *>(&element)) { in dump()
174 Element *element = NULL; in Parse() local
183 parent->AddElement(element = new Group()); in Parse()
184 parent = static_cast<Group *>(element); in Parse()
[all …]
/haiku/src/system/kernel/scheduler/
H A DRunQueue.h41 inline Link* operator()(Element* element) const;
50 inline Link* operator()(Element* element) const;
90 inline void PushFront(Element* element, unsigned int priority);
93 inline void Remove(Element* element);
138 RunQueueStandardGetLink<Element>::operator()(Element* element) const in operator()
140 return element->GetRunQueueLink(); in operator()
146 RunQueueMemberGetLink<Element, LinkMember>::operator()(Element* element) const in operator()
148 return &(element->*LinkMember); in operator()
267 Element* element = fHeads[priority]; in PeekMaximum() local
269 ASSERT(sGetLink(element)->fPriority == priority); in PeekMaximum()
[all …]
/haiku/src/system/kernel/
H A DTeamThreadTables.h78 void Insert(Element* element) in Insert()
80 element->serial_number = fNextSerialNumber++; in Insert()
81 fTable.InsertUnchecked(element); in Insert()
82 fList.Add(element); in Insert()
85 void Remove(Element* element) in Remove()
87 fTable.RemoveUnchecked(element); in Remove()
88 fList.Remove(element); in Remove()
93 Element* element = fTable.Lookup(id);
94 return element != NULL && (!visibleOnly || element->visible)
95 ? element : NULL;
[all …]
/haiku/src/apps/cortex/Persistence/
H A DXMLElementMapping.h56 const BString element;
62 element(_element) {} in XMLElementMapping()
75 const char* element) : in Mapping() argument
76 XMLElementMapping(element) {} in Mapping()
87 return a->element < b->element; in operator()
/haiku/headers/private/shared/
H A DHashSet.h246 Element* element = fTable.Lookup(key); in Add() local
247 if (element) { in Add()
253 element = new(std::nothrow) Element(key); in Add()
254 if (!element) in Add()
257 status_t error = fTable.Insert(element); in Add()
259 delete element; in Add() local
270 Element* element = fTable.Lookup(key); in Remove() local
271 if (element == NULL) in Remove()
274 fTable.Remove(element); in Remove()
275 delete element; in Remove() local
[all …]
H A DHashMap.h378 Element* element = fTable.Lookup(key); in Put() local
379 if (element) { in Put()
381 element->fValue = value; in Put()
386 element = new(std::nothrow) Element(key, value); in Put()
387 if (!element) in Put()
390 status_t error = fTable.Insert(element); in Put()
392 delete element; in Put() local
403 Element* element = fTable.Lookup(key); in Remove() local
404 if (element == NULL) in Remove()
407 fTable.Remove(element); in Remove()
[all …]
/haiku/src/system/libroot/os/
H A Dparsedate.cpp703 computeRelativeUnit(parsed_element& element, struct tm& tm, int* _flags) in computeRelativeUnit() argument
707 switch (element.unit) { in computeRelativeUnit()
721 if ((element.flags & FLAG_RELATIVE) != 0) { in computeRelativeUnit()
722 bigtime_t value = element.value; in computeRelativeUnit()
723 if (element.modifier == MODIFY_MINUS) in computeRelativeUnit()
724 value = -element.value; in computeRelativeUnit()
726 if (element.unit == UNIT_MONTH) in computeRelativeUnit()
728 else if (element.unit == UNIT_DAY) in computeRelativeUnit()
730 else if (element.unit == UNIT_SECOND) { in computeRelativeUnit()
733 } else if (element.unit == UNIT_YEAR) in computeRelativeUnit()
[all …]
/haiku/src/apps/installer/
H A DBlockingQueue.h29 status_t Push(Element* element);
30 status_t Pop(Element** element,
32 status_t Peek(Element** element);
33 status_t Remove(Element* element);
91 BlockingQueue<Element>::Push(Element* element) in Push() argument
97 fElements.push_back(element); in Push()
110 BlockingQueue<Element>::Pop(Element** element, bigtime_t timeout) in Pop() argument
122 *element = fElements[0]; in Pop()
130 BlockingQueue<Element>::Peek(Element** element) in Peek() argument
138 *element = fElements[0]; in Peek()
[all …]
/haiku/src/apps/cortex/Persistence/Wrappers/
H A DMessageIO.cpp254 if(strcmp(context.element(), s_element) != 0) { in xmlImportChild()
283 if(!_isValidMessageElement(context.element())) { in xmlImportChildBegin()
331 const char* element) const { in _isValidMessageElement()
333 if(!strcmp(element, _boolEl)) return true; in _isValidMessageElement()
334 if(!strcmp(element, _int8El)) return true; in _isValidMessageElement()
335 if(!strcmp(element, _int16El)) return true; in _isValidMessageElement()
336 if(!strcmp(element, _int32El)) return true; in _isValidMessageElement()
337 if(!strcmp(element, _int64El)) return true; in _isValidMessageElement()
338 if(!strcmp(element, _floatEl)) return true; in _isValidMessageElement()
339 if(!strcmp(element, _doubleEl)) return true; in _isValidMessageElement()
[all …]
/haiku/headers/private/package/hpkg/
H A DStacker.h19 Stacker(Type*& location, Type* element) in Stacker() argument
24 *fLocation = element; in Stacker()
27 Stacker(Type** location, Type* element) in Stacker() argument
32 *fLocation = element; in Stacker()
/haiku/src/system/libroot/posix/musl/search/
H A Dinsque.c8 void insque(void *element, void *pred) in insque() argument
10 struct node *e = element; in insque()
24 void remque(void *element) in remque() argument
26 struct node *e = element; in remque()

12345678