Searched refs:element (Results 1 - 25 of 107) sorted by last modified time

12345

/haiku/src/preferences/screen/
H A DScreenMode.cpp385 const pnp_id* element = std::find(kPNPIDs, lastElement, key); local
386 if (element == lastElement) {
391 return element->manufacturer;
/haiku/src/bin/pkgman/
H A DPackageManager.cpp90 const BSolverProblemSolutionElement* element local
92 printf(" - %s\n", element->ToString().String());
/haiku/src/add-ons/kernel/busses/usb/
H A Duhci.cpp414 // the list is empty, make this the first element
419 uhci_qh *element = fQueueTop; local
420 while (element->link_log != NULL)
421 element = (uhci_qh *)element->link_log;
423 element->link_log = transfer;
424 element->link_phy = transfer->this_phy | QH_NEXT_IS_QH;
440 // this was the top element
443 // this was the only element, terminate this queue
446 // there are elements left, adjust the element pointe
454 uhci_qh *element = fQueueTop; local
[all...]
/haiku/src/kits/locale/
H A DNumberFormat.cpp360 BNumberFormat::GetSeparator(BNumberElement element) argument
365 switch(element) {
/haiku/headers/os/locale/
H A DNumberFormat.h42 BString GetSeparator(BNumberElement element);
/haiku/src/servers/package/
H A DVolume.cpp508 const BSolverProblemSolutionElement* element local
510 INFORM(" - %s\n", element->ToString().String());
/haiku/src/kits/tracker/
H A DOpenWithWindow.cpp188 FindOne(const BString* element, void* castToString) argument
190 if (strcasecmp(element->String(), (const char*)castToString) == 0)
191 return element;
227 SetDefaultAppForOneType(const BString* element, void* castToEntryRef) argument
232 BMimeType mime(element->String());
261 debugPath.Path(), appSignature, element->String(), strerror(result)));
/haiku/src/apps/haikudepot/server/
H A DLocalPkgDataLoadProcess.cpp352 for (int32 i = 0; const BSolverResultElement* element
354 BSolverPackage* package = element->Package();
355 if (element->Type() == BSolverResultElement::B_TYPE_INSTALL) {
/haiku/
H A Dconfigure511 local element
512 for element in $2; do
513 if [ "$1" = "$element" ]; then
/haiku/src/add-ons/kernel/bus_managers/virtio/
H A DVirtioQueue.cpp260 struct vring_used_elem *element = &fRing.used->ring[usedIndex]; local
261 uint16 descriptorIndex = element->id;
263 *_usedLength = element->len;
/haiku/build/scripts/
H A Dbuild_haiku_image155 local element
156 for element in $2; do
157 if [ "$1" = "$element" ]; then
/haiku/src/apps/cortex/Persistence/
H A DXMLElementMapping.h36 // "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/headers/private/kernel/util/
H A DDoublyLinkedQueue.h63 Element *element = fCurrent; local
68 return element;
112 Element *element = fNext; local
115 return element;
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) cons
179 Insert(Element *element) argument
194 InsertBefore(Element *before, Element *element) argument
219 Add(Element *element) argument
227 Remove(Element *element) argument
291 Element *element = fFirst; local
309 Element *element = fFirst; local
324 Element *element = Head(); local
[all...]
H A DDoublyLinkedList.h56 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
395 Insert(Element* element, bool back) argument
429 InsertBefore(Element* before, Element* element) argument
459 InsertAfter(Element* after, Element* element) argument
489 Insert(Element* before, Element* element) argument
498 Add(Element* element, bool back) argument
506 Remove(Element* element) argument
588 Element* element = Head(); local
598 Element* element = Tail(); local
606 GetPrevious(Element* element) argument
617 GetNext(Element* element) argument
660 Element* element = tail; local
[all...]
H A DOpenHashTable.h278 ValueType* element = fTable[i]; local
279 if (element != NULL) {
281 *nextPointer = element;
284 // element in the bucket
285 while (element != NULL) {
286 nextPointer = &_Link(element);
287 element = *nextPointer;
349 The iterator is not invalidated when removing the current element from
/haiku/src/system/libroot/os/
H A Dparsedate.cpp581 // this counts for the next element
587 // this counts for the next element
703 computeRelativeUnit(parsed_element& element, struct tm& tm, int* _flags) argument
707 switch (element.unit) {
721 if ((element.flags & FLAG_RELATIVE) != 0) {
722 bigtime_t value = element.value;
723 if (element.modifier == MODIFY_MINUS)
724 value = -element.value;
726 if (element.unit == UNIT_MONTH)
728 else if (element
763 parsed_element* element = elements; local
953 parsed_element* element = elements; local
[all...]
/haiku/src/apps/packageinstaller/
H A DPackageInfo.cpp649 uint8 element = P_NONE; local
667 element = type; \
691 if (element == P_NONE) {
707 if (element == P_NONE) {
716 if (element == P_NONE) {
725 if (element == P_NONE) {
734 if (element == P_NONE) {
743 if (element == P_NONE) {
752 if (element == P_NONE) {
761 if (element
[all...]
/haiku/src/apps/cortex/RouteApp/
H A DDormantNodeIO.cpp270 // const char* element,
274 // context.beginElement(element);
533 err << "DormantNodeIO: unexpected element '" <<
534 context.element() << "'\n";
539 if(!strcmp(context.element(), _NAME_ELEMENT))
541 else if(!strcmp(context.element(), _KIND_ELEMENT))
543 else if(!strcmp(context.element(), _FLAVOR_ID_ELEMENT))
545 else if(!strcmp(context.element(), _FLAG_ELEMENT))
547 else if(!strcmp(context.element(), _RUN_MODE_ELEMENT))
549 else if(!strcmp(context.element(), _RECORDING_DELAY_ELEMEN
[all...]
/haiku/src/add-ons/kernel/file_systems/reiserfs/
H A DIterators.cpp90 Element *element = NULL; local
92 element = fElements + index;
93 return element;
133 \brief Store information about one element in a tree path.
478 const TreePath::Element *element = fPath->GetTopElement(); local
480 error = fTree->GetNode(element->GetBlockNumber(), &node);
485 fIndex = element->GetIndex();
/haiku/src/kits/interface/layouter/
H A DSimpleLayouter.cpp93 virtual float ElementLocation(int32 element) argument
95 if (element < 0 || element >= fElementCount) {
100 return fElements[element].location;
103 virtual float ElementSize(int32 element) argument
105 if (element < 0 || element >= fElementCount) {
110 return fElements[element].size - 1;
138 SimpleLayouter::AddConstraints(int32 element, int32 length, argument
141 if (element <
164 SetWeight(int32 element, float weight) argument
[all...]
H A DComplexLayouter.cpp42 // We also store the location of the virtual elementCountth element.
43 // Thus fLocation[i + 1] - fLocation[i] is the size of the ith element
60 virtual float ElementLocation(int32 element) argument
62 if (element < 0 || element >= fCount)
65 return fLocations[element];
68 virtual float ElementSize(int32 element) argument
70 if (element < 0 || element >= fCount)
73 return fLocations[element
218 AddConstraints(int32 element, int32 length, float _min, float _max, float _preferred) argument
260 SetWeight(int32 element, float weight) argument
[all...]
/haiku/src/system/kernel/
H A Dheap.cpp474 // walk the free list to see if this element is in use
582 // walk the free list to see if this element is in use
717 // walk the free list to see if this element is in use
981 addr_t *element = page->free_list; local
983 while (element) {
984 if ((addr_t)element < pageBase
985 || (addr_t)element >= pageBase + heap->page_size)
988 if (((addr_t)element - pageBase) % bin->element_size != 0)
989 panic("free list entry not on a element boundary\n");
991 element
[all...]
/haiku/src/kits/package/manager/
H A DPackageManager.cpp448 for (int32 i = 0; const BSolverResultElement* element = result.ElementAt(i);
450 BSolverPackage* package = element->Package();
452 switch (element->Type()) {
/haiku/src/add-ons/kernel/drivers/bus/usb/
H A Dusb_raw.cpp115 raw_device *element = gDeviceList; local
116 while (element) {
117 if (element->link == device) {
118 element->link = device->link;
122 element = (raw_device *)element->link;
202 raw_device *element = gDeviceList; local
203 while (element) {
204 if (strcmp(name, element->name) == 0) {
205 element
1006 raw_device *element = gDeviceList; local
[all...]
/haiku/src/add-ons/kernel/bus_managers/usb/
H A DStack.cpp337 usb_driver_info *element = fDriverList; local
338 while (element) {
339 status_t result = device->ReportDevice(element->support_descriptors,
340 element->support_descriptor_count, &element->notify_hooks,
341 &element->cookies, added, false);
344 const char *driverName = element->driver_name;
345 if (element->republish_driver_name)
346 driverName = element->republish_driver_name;
370 element
448 usb_driver_info *element = fDriverList; local
466 usb_driver_info *element = fDriverList; local
501 usb_driver_info *element = fDriverList; local
[all...]

Completed in 224 milliseconds

12345