Searched refs:element (Results 26 - 50 of 107) sorted by relevance

12345

/haiku/src/system/kernel/arch/x86/paging/32bit/
H A DX86PagingStructures32Bit.cpp26 inline Link* operator()(X86PagingStructures32Bit* element) const
28 return (Link*)element->GetSinglyLinkedListLink();
32 const X86PagingStructures32Bit* element) const
34 return (const Link*)element->GetSinglyLinkedListLink();
/haiku/src/system/kernel/arch/ppc/paging/460/
H A DPPCPagingStructures460.cpp26 inline Link* operator()(PPCPagingStructures460* element) const
28 return (Link*)element->GetSinglyLinkedListLink();
32 const PPCPagingStructures460* element) const
34 return (const Link*)element->GetSinglyLinkedListLink();
/haiku/src/system/kernel/arch/ppc/paging/classic/
H A DPPCPagingStructuresClassic.cpp26 inline Link* operator()(PPCPagingStructuresClassic* element) const
28 return (Link*)element->GetSinglyLinkedListLink();
32 const PPCPagingStructuresClassic* element) const
34 return (const Link*)element->GetSinglyLinkedListLink();
/haiku/src/system/kernel/arch/arm/paging/32bit/
H A DARMPagingStructures32Bit.cpp26 inline Link* operator()(ARMPagingStructures32Bit* element) const
28 return (Link*)element->GetSinglyLinkedListLink();
32 const ARMPagingStructures32Bit* element) const
34 return (const Link*)element->GetSinglyLinkedListLink();
/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/headers/private/shared/
H A DHashMap.h378 Element* element = fTable.Lookup(key); local
379 if (element) {
381 element->fValue = value;
385 // does not contain the key yet: create an element and add it
386 element = new(std::nothrow) Element(key, value);
387 if (!element)
390 status_t error = fTable.Insert(element);
392 delete element;
403 Element* element = fTable.Lookup(key); local
404 if (element
420 Element* element = it.fElement; local
440 Element* element = fTable.Clear(true); local
[all...]
/haiku/src/apps/cortex/Persistence/Wrappers/
H A DMessageIO.cpp254 if(strcmp(context.element(), s_element) != 0) {
255 context.reportError("Unexpected child element.\n");
279 context.reportError("Unexpected parent element.\n");
283 if(!_isValidMessageElement(context.element())) {
284 context.reportError("Invalid message field element.\n");
331 const char* element) const {
333 if(!strcmp(element, _boolEl)) return true;
334 if(!strcmp(element, _int8El)) return true;
335 if(!strcmp(element, _int16El)) return true;
336 if(!strcmp(element, _int32E
347 _importField( BMessage* message, const char* element, const char* name, const char* data) argument
[all...]
H A DMessageIO.h158 const char* element) const;
162 const char* element,
/haiku/src/kits/interface/layouter/
H A DCollapsingLayouter.h27 virtual void AddConstraints(int32 element, int32 length,
29 virtual void SetWeight(int32 element, float weight);
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.h28 virtual void AddConstraints(int32 element, int32 length,
30 virtual void SetWeight(int32 element, float weight);
H A DSimpleLayouter.h6 * (restricting one element) only. It is
25 virtual void AddConstraints(int32 element, int32 length,
27 virtual void SetWeight(int32 element, float weight);
/haiku/src/tools/fs_shell/
H A Dhash.h22 int compare_func(void *element, const void *key),
23 uint32_t hash_func(void *element, const void *key, uint32_t range));
43 * compare function should compare the element with
/haiku/headers/posix/
H A Dsearch.h37 extern void insque(void *element, void *insertAfter);
42 extern void remque(void *element);
/haiku/src/system/kernel/arch/m68k/paging/040/
H A DM68KPagingStructures040.cpp26 inline Link* operator()(M68KPagingStructures040* element) const
28 return (Link*)element->GetSinglyLinkedListLink();
32 const M68KPagingStructures040* element) const
34 return (const Link*)element->GetSinglyLinkedListLink();
/haiku/src/tools/cppunit/cppunit/
H A DXmlOutputter.cpp73 string element = "<"; local
74 element += m_name;
75 element += " ";
76 element += attributesAsString();
77 element += " >\n";
83 element += node->toString();
86 element += m_content;
88 element += "</";
89 element += m_name;
90 element
[all...]
/haiku/headers/private/kernel/
H A Dsmp.h128 int32* element = (int32*)&fBitmap[cpu % kArraySize]; local
129 *element |= 1u << (cpu / kArraySize);
136 int32* element = (int32*)&fBitmap[cpu % kArraySize]; local
137 *element &= ~uint32(1u << (cpu / kArraySize));
144 int32* element = (int32*)&fBitmap[cpu % kArraySize]; local
145 atomic_or(element, 1u << (cpu / kArraySize));
152 int32* element = (int32*)&fBitmap[cpu % kArraySize]; local
153 atomic_and(element, ~uint32(1u << (cpu / kArraySize)));
160 int32* element = (int32*)&fBitmap[cpu % kArraySize]; local
161 return ((uint32)atomic_get(element)
[all...]
/haiku/src/add-ons/kernel/file_systems/netfs/headers/shared/
H A DRequestMemberArray.h66 Member* element = new(fElements + i) Member; local
68 unflattener->Visit(this, *element);
74 status_t Append(const Member& element) argument
79 new(fElements + fSize) Member(element);
/haiku/src/apps/cortex/RouteApp/
H A DLiveNodeIO.cpp223 err << "LiveNodeIO: unexpected element '" <<
224 context.element() << "'\n";
229 if(!strcmp(context.element(), _NAME_ELEMENT))
231 else if(!strcmp(context.element(), _KIND_ELEMENT))
235 err << "LiveNodeIO: unexpected element '" <<
236 context.element() << "'\n";
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/kits/package/solver/
H A DSolverResult.cpp107 BSolverResult::AppendElement(const BSolverResultElement& element) argument
110 = new(std::nothrow) BSolverResultElement(element);
/haiku/src/add-ons/kernel/file_systems/ext2/
H A DHashRevokeManager.h63 static int Compare(void* element, const void* key);
64 static uint32 Hash(void* element, const void* key, uint32 range);
/haiku/src/add-ons/kernel/file_systems/ramfs/
H A DNodeTable.cpp55 if (Node *element = fNodes.Lookup(id))
56 fNodes.Remove(element);
/haiku/headers/private/kernel/vm/
H A Dvm_types.h74 inline vm_page_mapping_link *operator()(vm_page_mapping *element) const
76 return &element->page_link;
80 const vm_page_mapping *element) const
82 return &element->page_link;
88 inline vm_page_mapping_link *operator()(vm_page_mapping *element) const
90 return &element->area_link;
94 const vm_page_mapping *element) const
96 return &element->area_link;
/haiku/src/tools/get_package_dependencies/
H A Dget_package_dependencies.cpp136 const BSolverProblemSolutionElement* element local
138 fprintf(stderr, " - %s\n", element->ToString().String());
153 for (int32 i = 0; const BSolverResultElement* element = result.ElementAt(i);
155 BSolverPackage* package = element->Package();
157 switch (element->Type()) {

Completed in 408 milliseconds

12345