headers/os/package/solver/SolverProblemSolution.h

75

const Element* ElementAt(int32 index) const;

headers/os/package/solver/SolverProblemSolution.h

77

bool AppendElement(const Element& element);

headers/private/fs_shell/DoublyLinkedList.h

105

template<typename Element, typename GetLink>

headers/private/fs_shell/DoublyLinkedList.h

106

#define DOUBLY_LINKED_LIST_CLASS_NAME DoublyLinkedList<Element, GetLink>

headers/private/fs_shell/DoublyLinkedList.h

109

template<typename Element,

headers/private/fs_shell/DoublyLinkedList.h

110

typename GetLink = DoublyLinkedListStandardGetLink<Element> >

headers/private/fs_shell/DoublyLinkedList.h

114

typedef DoublyLinkedListLink<Element> Link;

headers/private/fs_shell/DoublyLinkedList.h

136

Element *Next()

headers/private/fs_shell/DoublyLinkedList.h

144

Element *Current()

headers/private/fs_shell/DoublyLinkedList.h

149

Element *Remove()

headers/private/fs_shell/DoublyLinkedList.h

151

Element *element = fCurrent;

headers/private/fs_shell/DoublyLinkedList.h

175

Element *fCurrent;

headers/private/fs_shell/DoublyLinkedList.h

176

Element *fNext;

headers/private/fs_shell/DoublyLinkedList.h

19

template<typename Element>

headers/private/fs_shell/DoublyLinkedList.h

198

Element *Next()

headers/private/fs_shell/DoublyLinkedList.h

200

Element *element = fNext;

headers/private/fs_shell/DoublyLinkedList.h

220

Element *fNext;

headers/private/fs_shell/DoublyLinkedList.h

242

Element *Next()

headers/private/fs_shell/DoublyLinkedList.h

25

Element *next;

headers/private/fs_shell/DoublyLinkedList.h

250

Element *Remove()

headers/private/fs_shell/DoublyLinkedList.h

252

Element *element = fCurrent;

headers/private/fs_shell/DoublyLinkedList.h

26

Element *previous;

headers/private/fs_shell/DoublyLinkedList.h

276

Element *fCurrent;

headers/private/fs_shell/DoublyLinkedList.h

277

Element *fNext;

headers/private/fs_shell/DoublyLinkedList.h

299

Element *Next()

headers/private/fs_shell/DoublyLinkedList.h

30

template<typename Element>

headers/private/fs_shell/DoublyLinkedList.h

301

Element *element = fNext;

headers/private/fs_shell/DoublyLinkedList.h

321

Element *fNext;

headers/private/fs_shell/DoublyLinkedList.h

33

typedef DoublyLinkedListLink<Element> DLL_Link;

headers/private/fs_shell/DoublyLinkedList.h

330

inline void InsertBefore(Element* insertBefore, Element* element);

headers/private/fs_shell/DoublyLinkedList.h

331

inline void InsertAfter(Element* insertAfter, Element* element);

headers/private/fs_shell/DoublyLinkedList.h

332

inline void Insert(Element* element, bool back = true);

headers/private/fs_shell/DoublyLinkedList.h

333

inline void Add(Element *element, bool back = true);

headers/private/fs_shell/DoublyLinkedList.h

334

inline void Remove(Element *element);

headers/private/fs_shell/DoublyLinkedList.h

336

inline void Swap(Element *a, Element *b);

headers/private/fs_shell/DoublyLinkedList.h

343

inline Element *First() const { return fFirst; }

headers/private/fs_shell/DoublyLinkedList.h

344

inline Element *Last() const { return fLast; }

headers/private/fs_shell/DoublyLinkedList.h

346

inline Element *Head() const { return fFirst; }

headers/private/fs_shell/DoublyLinkedList.h

347

inline Element *Tail() const { return fLast; }

headers/private/fs_shell/DoublyLinkedList.h

349

inline Element *RemoveHead();

headers/private/fs_shell/DoublyLinkedList.h

351

inline Element *GetPrevious(Element *element) const;

headers/private/fs_shell/DoublyLinkedList.h

352

inline Element *GetNext(Element *element) const;

headers/private/fs_shell/DoublyLinkedList.h

366

inline void Insert(Element* before, Element* element);

headers/private/fs_shell/DoublyLinkedList.h

370

Element *fFirst;

headers/private/fs_shell/DoublyLinkedList.h

371

Element *fLast;

headers/private/fs_shell/DoublyLinkedList.h

382

DOUBLY_LINKED_LIST_CLASS_NAME::Insert(Element *element, bool back)

headers/private/fs_shell/DoublyLinkedList.h

412

DOUBLY_LINKED_LIST_CLASS_NAME::InsertBefore(Element* before, Element* element)

headers/private/fs_shell/DoublyLinkedList.h

437

DOUBLY_LINKED_LIST_CLASS_NAME::InsertAfter(Element* after, Element* element)

headers/private/fs_shell/DoublyLinkedList.h

462

DOUBLY_LINKED_LIST_CLASS_NAME::Insert(Element* before, Element* element)

headers/private/fs_shell/DoublyLinkedList.h

471

DOUBLY_LINKED_LIST_CLASS_NAME::Add(Element *element, bool back)

headers/private/fs_shell/DoublyLinkedList.h

479

DOUBLY_LINKED_LIST_CLASS_NAME::Remove(Element *element)

headers/private/fs_shell/DoublyLinkedList.h

49

template<typename Element>

headers/private/fs_shell/DoublyLinkedList.h

499

DOUBLY_LINKED_LIST_CLASS_NAME::Swap(Element *a, Element *b)

headers/private/fs_shell/DoublyLinkedList.h

502

Element *aNext = sGetLink(a)->next;

headers/private/fs_shell/DoublyLinkedList.h

503

Element *bNext = sGetLink(b)->next;

headers/private/fs_shell/DoublyLinkedList.h

52

typedef DoublyLinkedListLink<Element> Link;

headers/private/fs_shell/DoublyLinkedList.h

543

Element *element = fFirst;

headers/private/fs_shell/DoublyLinkedList.h

55

inline Link *operator()(Element *element) const

headers/private/fs_shell/DoublyLinkedList.h

556

Element *

headers/private/fs_shell/DoublyLinkedList.h

559

Element *element = Head();

headers/private/fs_shell/DoublyLinkedList.h

566

Element *

headers/private/fs_shell/DoublyLinkedList.h

567

DOUBLY_LINKED_LIST_CLASS_NAME::GetPrevious(Element *element) const

headers/private/fs_shell/DoublyLinkedList.h

569

Element *result = NULL;

headers/private/fs_shell/DoublyLinkedList.h

577

Element *

headers/private/fs_shell/DoublyLinkedList.h

578

DOUBLY_LINKED_LIST_CLASS_NAME::GetNext(Element *element) const

headers/private/fs_shell/DoublyLinkedList.h

580

Element *result = NULL;

headers/private/fs_shell/DoublyLinkedList.h

592

for (Element* element = First(); element; element = GetNext(element))

headers/private/fs_shell/DoublyLinkedList.h

60

inline const Link *operator()(const Element *element) const

headers/private/fs_shell/DoublyLinkedList.h

67

template<typename Element,

headers/private/fs_shell/DoublyLinkedList.h

68

DoublyLinkedListLink<Element> Element::* LinkMember = &Element::fLink>

headers/private/fs_shell/DoublyLinkedList.h

71

typedef DoublyLinkedListLink<Element> Link;

headers/private/fs_shell/DoublyLinkedList.h

74

inline Link *operator()(Element *element) const

headers/private/fs_shell/DoublyLinkedList.h

79

inline const Link *operator()(const Element *element) const

headers/private/fs_shell/DoublyLinkedList.h

86

template<typename Element>

headers/private/fs_shell/DoublyLinkedList.h

89

typedef DoublyLinkedListLink<Element> Link;

headers/private/fs_shell/DoublyLinkedList.h

92

inline Link *operator()(Element *element) const

headers/private/fs_shell/DoublyLinkedList.h

97

inline const Link *operator()(const Element *element) const

headers/private/fs_shell/SinglyLinkedList.h

119

Element* Next()

headers/private/fs_shell/SinglyLinkedList.h

121

Element* element = fNext;

headers/private/fs_shell/SinglyLinkedList.h

141

Element* fNext;

headers/private/fs_shell/SinglyLinkedList.h

150

inline void Add(Element* element);

headers/private/fs_shell/SinglyLinkedList.h

151

inline void Remove(Element* element);

headers/private/fs_shell/SinglyLinkedList.h

156

inline Element* First() const { return fFirst; }

headers/private/fs_shell/SinglyLinkedList.h

157

inline Element* Head() const { return fFirst; }

headers/private/fs_shell/SinglyLinkedList.h

159

inline Element* RemoveHead();

headers/private/fs_shell/SinglyLinkedList.h

161

inline Element* GetNext(Element* element) const;

headers/private/fs_shell/SinglyLinkedList.h

169

Element *fFirst;

headers/private/fs_shell/SinglyLinkedList.h

180

SINGLY_LINKED_LIST_CLASS_NAME::Add(Element* element)

headers/private/fs_shell/SinglyLinkedList.h

191

SINGLY_LINKED_LIST_CLASS_NAME::Remove(Element* element)

headers/private/fs_shell/SinglyLinkedList.h

196

Element* next = fFirst;

headers/private/fs_shell/SinglyLinkedList.h

197

Element* last = NULL;

headers/private/fs_shell/SinglyLinkedList.h

20

template<typename Element>

headers/private/fs_shell/SinglyLinkedList.h

217

Element* element = fFirst;

headers/private/fs_shell/SinglyLinkedList.h

228

Element*

headers/private/fs_shell/SinglyLinkedList.h

231

Element* element = Head();

headers/private/fs_shell/SinglyLinkedList.h

238

Element*

headers/private/fs_shell/SinglyLinkedList.h

239

SINGLY_LINKED_LIST_CLASS_NAME::GetNext(Element* element) const

headers/private/fs_shell/SinglyLinkedList.h

241

Element* result = NULL;

headers/private/fs_shell/SinglyLinkedList.h

253

for (Element* element = First(); element; element = GetNext(element))

headers/private/fs_shell/SinglyLinkedList.h

26

Element* next;

headers/private/fs_shell/SinglyLinkedList.h

30

template<typename Element>

headers/private/fs_shell/SinglyLinkedList.h

33

typedef SinglyLinkedListLink<Element> SLL_Link;

headers/private/fs_shell/SinglyLinkedList.h

49

template<typename Element>

headers/private/fs_shell/SinglyLinkedList.h

52

typedef SinglyLinkedListLink<Element> Link;

headers/private/fs_shell/SinglyLinkedList.h

55

inline Link* operator()(Element* element) const

headers/private/fs_shell/SinglyLinkedList.h

60

inline const Link* operator()(const Element* element) const

headers/private/fs_shell/SinglyLinkedList.h

67

template<typename Element,

headers/private/fs_shell/SinglyLinkedList.h

68

SinglyLinkedListLink<Element> Element::* LinkMember = &Element::fLink>

headers/private/fs_shell/SinglyLinkedList.h

71

typedef SinglyLinkedListLink<Element> Link;

headers/private/fs_shell/SinglyLinkedList.h

74

inline Link* operator()(Element* element) const

headers/private/fs_shell/SinglyLinkedList.h

79

inline const Link* operator()(const Element* element) const

headers/private/fs_shell/SinglyLinkedList.h

88

template<typename Element, typename GetLink>

headers/private/fs_shell/SinglyLinkedList.h

89

#define SINGLY_LINKED_LIST_CLASS_NAME SinglyLinkedList<Element, GetLink>

headers/private/fs_shell/SinglyLinkedList.h

92

template<typename Element,

headers/private/fs_shell/SinglyLinkedList.h

93

typename GetLink = SinglyLinkedListStandardGetLink<Element> >

headers/private/fs_shell/SinglyLinkedList.h

97

typedef SinglyLinkedListLink<Element> Link;

headers/private/kernel/util/Heap.h

106

template<typename Element, typename Key>

headers/private/kernel/util/Heap.h

107

HeapLink<Element, Key>::HeapLink()

headers/private/kernel/util/Heap.h

113

template<typename Element, typename Key>

headers/private/kernel/util/Heap.h

114

HeapLink<Element, Key>::HeapLink()

headers/private/kernel/util/Heap.h

120

template<typename Element, typename Key>

headers/private/kernel/util/Heap.h

121

HeapLink<Element, Key>*

headers/private/kernel/util/Heap.h

122

HeapLinkImpl<Element, Key>::GetHeapLink()

headers/private/kernel/util/Heap.h

128

template<typename Element, typename Key>

headers/private/kernel/util/Heap.h

129

HeapLink<Element, Key>*

headers/private/kernel/util/Heap.h

130

HeapStandardGetLink<Element, Key>::operator()(Element* element) const

headers/private/kernel/util/Heap.h

136

template<typename Element, typename Key,

headers/private/kernel/util/Heap.h

137

HeapLink<Element, Key> Element::*LinkMember>

headers/private/kernel/util/Heap.h

138

HeapLink<Element, Key>*

headers/private/kernel/util/Heap.h

139

HeapMemberGetLink<Element, Key, LinkMember>::operator()(Element* element) const

headers/private/kernel/util/Heap.h

17

template<typename Element, typename Key>

headers/private/kernel/util/Heap.h

190

Element*

headers/private/kernel/util/Heap.h

201

HEAP_CLASS_NAME::GetKey(Element* element)

headers/private/kernel/util/Heap.h

209

HEAP_CLASS_NAME::ModifyKey(Element* element, Key newKey)

headers/private/kernel/util/Heap.h

211

HeapLink<Element, Key>* link = sGetLink(element);

headers/private/kernel/util/Heap.h

231

Element* element = PeekRoot();

headers/private/kernel/util/Heap.h

232

HeapLink<Element, Key>* link = sGetLink(element);

headers/private/kernel/util/Heap.h

239

Element* lastElement = fElements[fLastElement];

headers/private/kernel/util/Heap.h

249

HEAP_CLASS_NAME::Insert(Element* element, Key key)

headers/private/kernel/util/Heap.h

25

template<typename Element, typename Key>

headers/private/kernel/util/Heap.h

259

HeapLink<Element, Key>* link = sGetLink(element);

headers/private/kernel/util/Heap.h

278

size_t arraySize = newSize * sizeof(Element*);

headers/private/kernel/util/Heap.h

279

Element** newBuffer

headers/private/kernel/util/Heap.h

280

= reinterpret_cast<Element**>(realloc(fElements, arraySize));

headers/private/kernel/util/Heap.h

293

HEAP_CLASS_NAME::_MoveUp(HeapLink<Element, Key>* link)

headers/private/kernel/util/Heap.h

302

Element* element = fElements[link->fIndex];

headers/private/kernel/util/Heap.h

315

HEAP_CLASS_NAME::_MoveDown(HeapLink<Element, Key>* link)

headers/private/kernel/util/Heap.h

340

Element* element = fElements[link->fIndex];

headers/private/kernel/util/Heap.h

37

template<typename Element, typename Key>

headers/private/kernel/util/Heap.h

43

inline Link* operator()(Element* element) const;

headers/private/kernel/util/Heap.h

46

template<typename Element, typename Key,

headers/private/kernel/util/Heap.h

47

HeapLink<Element, Key> Element::*LinkMember>

headers/private/kernel/util/Heap.h

53

inline Link* operator()(Element* element) const;

headers/private/kernel/util/Heap.h

69

template<typename Element, typename Key, typename Compare, typename GetLink>

headers/private/kernel/util/Heap.h

70

#define HEAP_CLASS_NAME Heap<Element, Key, Compare, GetLink>

headers/private/kernel/util/Heap.h

72

template<typename Element, typename Key,

headers/private/kernel/util/Heap.h

74

typename GetLink = HeapStandardGetLink<Element, Key> >

headers/private/kernel/util/Heap.h

81

inline Element* PeekRoot(int32 index = 0) const;

headers/private/kernel/util/Heap.h

83

static const Key& GetKey(Element* element);

headers/private/kernel/util/Heap.h

85

inline void ModifyKey(Element* element, Key newKey);

headers/private/kernel/util/Heap.h

88

inline status_t Insert(Element* element, Key key);

headers/private/kernel/util/Heap.h

93

void _MoveUp(HeapLink<Element, Key>* link);

headers/private/kernel/util/Heap.h

94

void _MoveDown(HeapLink<Element, Key>* link);

headers/private/kernel/util/Heap.h

96

Element** fElements;

headers/private/kernel/util/MinMaxHeap.h

100

Element** fMaxElements;

headers/private/kernel/util/MinMaxHeap.h

111

template<typename Element, typename Key>

headers/private/kernel/util/MinMaxHeap.h

112

MinMaxHeapLink<Element, Key>::MinMaxHeapLink()

headers/private/kernel/util/MinMaxHeap.h

118

template<typename Element, typename Key>

headers/private/kernel/util/MinMaxHeap.h

119

MinMaxHeapLink<Element, Key>::MinMaxHeapLink()

headers/private/kernel/util/MinMaxHeap.h

125

template<typename Element, typename Key>

headers/private/kernel/util/MinMaxHeap.h

126

MinMaxHeapLink<Element, Key>*

headers/private/kernel/util/MinMaxHeap.h

127

MinMaxHeapLinkImpl<Element, Key>::GetMinMaxHeapLink()

headers/private/kernel/util/MinMaxHeap.h

133

template<typename Element, typename Key>

headers/private/kernel/util/MinMaxHeap.h

134

MinMaxHeapLink<Element, Key>*

headers/private/kernel/util/MinMaxHeap.h

135

MinMaxHeapStandardGetLink<Element, Key>::operator()(Element* element) const

headers/private/kernel/util/MinMaxHeap.h

141

template<typename Element, typename Key,

headers/private/kernel/util/MinMaxHeap.h

142

MinMaxHeapLink<Element, Key> Element::*LinkMember>

headers/private/kernel/util/MinMaxHeap.h

143

MinMaxHeapLink<Element, Key>*

headers/private/kernel/util/MinMaxHeap.h

144

MinMaxHeapMemberGetLink<Element, Key, LinkMember>::operator()(

headers/private/kernel/util/MinMaxHeap.h

145

Element* element) const

headers/private/kernel/util/MinMaxHeap.h

17

template<typename Element, typename Key>

headers/private/kernel/util/MinMaxHeap.h

192

Element*

headers/private/kernel/util/MinMaxHeap.h

206

Element*

headers/private/kernel/util/MinMaxHeap.h

221

MIN_MAX_HEAP_CLASS_NAME::GetKey(Element* element)

headers/private/kernel/util/MinMaxHeap.h

229

MIN_MAX_HEAP_CLASS_NAME::ModifyKey(Element* element, Key newKey)

headers/private/kernel/util/MinMaxHeap.h

231

MinMaxHeapLink<Element, Key>* link = sGetLink(element);

headers/private/kernel/util/MinMaxHeap.h

257

Element* element = PeekMinimum();

headers/private/kernel/util/MinMaxHeap.h

258

MinMaxHeapLink<Element, Key>* link = sGetLink(element);

headers/private/kernel/util/MinMaxHeap.h

26

template<typename Element, typename Key>

headers/private/kernel/util/MinMaxHeap.h

278

Element* element = PeekMaximum();

headers/private/kernel/util/MinMaxHeap.h

279

MinMaxHeapLink<Element, Key>* link = sGetLink(element);

headers/private/kernel/util/MinMaxHeap.h

290

MIN_MAX_HEAP_CLASS_NAME::Insert(Element* element, Key key)

headers/private/kernel/util/MinMaxHeap.h

301

MinMaxHeapLink<Element, Key>* link = sGetLink(element);

headers/private/kernel/util/MinMaxHeap.h

308

Element** tree = link->fMinTree ? fMinElements : fMaxElements;

headers/private/kernel/util/MinMaxHeap.h

328

size_t arraySize = newSize * sizeof(Element*);

headers/private/kernel/util/MinMaxHeap.h

329

Element** newBuffer

headers/private/kernel/util/MinMaxHeap.h

330

= reinterpret_cast<Element**>(realloc(fMinElements, arraySize));

headers/private/kernel/util/MinMaxHeap.h

337

memcpy(newBuffer, fMinElements + fSize, fSize * sizeof(Element*));

headers/private/kernel/util/MinMaxHeap.h

347

MIN_MAX_HEAP_CLASS_NAME::_MoveUp(MinMaxHeapLink<Element, Key>* link)

headers/private/kernel/util/MinMaxHeap.h

349

Element** tree = link->fMinTree ? fMinElements : fMaxElements;

headers/private/kernel/util/MinMaxHeap.h

360

Element* element = tree[link->fIndex];

headers/private/kernel/util/MinMaxHeap.h

373

MIN_MAX_HEAP_CLASS_NAME::_MoveDown(MinMaxHeapLink<Element, Key>* link)

headers/private/kernel/util/MinMaxHeap.h

378

Element** tree = link->fMinTree ? fMinElements : fMaxElements;

headers/private/kernel/util/MinMaxHeap.h

38

template<typename Element, typename Key>

headers/private/kernel/util/MinMaxHeap.h

403

Element* element = tree[link->fIndex];

headers/private/kernel/util/MinMaxHeap.h

417

MIN_MAX_HEAP_CLASS_NAME::_ChangeTree(MinMaxHeapLink<Element, Key>* link)

headers/private/kernel/util/MinMaxHeap.h

421

Element** currentTree = link->fMinTree ? fMinElements : fMaxElements;

headers/private/kernel/util/MinMaxHeap.h

422

Element** otherTree = link->fMinTree ? fMaxElements : fMinElements;

headers/private/kernel/util/MinMaxHeap.h

431

Element* predecessor;

headers/private/kernel/util/MinMaxHeap.h

44

inline Link* operator()(Element* element) const;

headers/private/kernel/util/MinMaxHeap.h

442

MinMaxHeapLink<Element, Key>* predecessorLink = sGetLink(predecessor);

headers/private/kernel/util/MinMaxHeap.h

446

Element* element = currentTree[link->fIndex];

headers/private/kernel/util/MinMaxHeap.h

47

template<typename Element, typename Key,

headers/private/kernel/util/MinMaxHeap.h

471

Element** tree = deleteMin ? fMinElements : fMaxElements;

headers/private/kernel/util/MinMaxHeap.h

479

Element* element = tree[lastElement];

headers/private/kernel/util/MinMaxHeap.h

48

MinMaxHeapLink<Element, Key> Element::*LinkMember>

headers/private/kernel/util/MinMaxHeap.h

486

MinMaxHeapLink<Element, Key>* link = sGetLink(element);

headers/private/kernel/util/MinMaxHeap.h

54

inline Link* operator()(Element* element) const;

headers/private/kernel/util/MinMaxHeap.h

64

template<typename Element, typename Key, typename Compare, typename GetLink>

headers/private/kernel/util/MinMaxHeap.h

65

#define MIN_MAX_HEAP_CLASS_NAME MinMaxHeap<Element, Key, Compare, GetLink>

headers/private/kernel/util/MinMaxHeap.h

67

template<typename Element, typename Key,

headers/private/kernel/util/MinMaxHeap.h

69

typename GetLink = MinMaxHeapStandardGetLink<Element, Key> >

headers/private/kernel/util/MinMaxHeap.h

76

inline Element* PeekMinimum(int32 index = 0) const;

headers/private/kernel/util/MinMaxHeap.h

77

inline Element* PeekMaximum(int32 index = 0) const;

headers/private/kernel/util/MinMaxHeap.h

79

static const Key& GetKey(Element* element);

headers/private/kernel/util/MinMaxHeap.h

81

inline void ModifyKey(Element* element, Key newKey);

headers/private/kernel/util/MinMaxHeap.h

86

inline status_t Insert(Element* element, Key key);

headers/private/kernel/util/MinMaxHeap.h

91

void _MoveUp(MinMaxHeapLink<Element, Key>* link);

headers/private/kernel/util/MinMaxHeap.h

92

void _MoveDown(MinMaxHeapLink<Element, Key>* link);

headers/private/kernel/util/MinMaxHeap.h

93

bool _ChangeTree(MinMaxHeapLink<Element, Key>* link);

headers/private/kernel/util/MinMaxHeap.h

97

Element** fMinElements;

headers/private/kernel/util/Vector.h

181

inline Value *Element() const

headers/private/kernel/util/Vector.h

752

if (iterator.Element()) {

headers/private/kernel/util/Vector.h

753

int32 index = iterator.Element() - fItems;

headers/private/kernel/util/Vector.h

771

if (iterator.Element()) {

headers/private/kernel/util/Vector.h

772

int32 index = iterator.Element() - fItems;

headers/private/shared/Array.h

105

template<typename Element>

headers/private/shared/Array.h

107

Array<Element>::AddUninitialized(int32 elementCount)

headers/private/shared/Array.h

113

template<typename Element>

headers/private/shared/Array.h

115

Array<Element>::Insert(const Element& element, int32 index)

headers/private/shared/Array.h

129

template<typename Element>

headers/private/shared/Array.h

131

Array<Element>::InsertUninitialized(int32 index, int32 count)

headers/private/shared/Array.h

146

template<typename Element>

headers/private/shared/Array.h

148

Array<Element>::Remove(int32 index, int32 count)

headers/private/shared/Array.h

164

sizeof(Element) * (fSize - index - count));

headers/private/shared/Array.h

174

template<typename Element>

headers/private/shared/Array.h

176

Array<Element>::Clear()

headers/private/shared/Array.h

189

template<typename Element>

headers/private/shared/Array.h

191

Array<Element>::MakeEmpty()

headers/private/shared/Array.h

197

template<typename Element>

headers/private/shared/Array.h

198

Element&

headers/private/shared/Array.h

199

Array<Element>::ElementAt(int32 index)

headers/private/shared/Array.h

205

template<typename Element>

headers/private/shared/Array.h

206

const Element&

headers/private/shared/Array.h

207

Array<Element>::ElementAt(int32 index) const

headers/private/shared/Array.h

213

template<typename Element>

headers/private/shared/Array.h

214

Element&

headers/private/shared/Array.h

215

Array<Element>::operator[](int32 index)

headers/private/shared/Array.h

221

template<typename Element>

headers/private/shared/Array.h

222

const Element&

headers/private/shared/Array.h

223

Array<Element>::operator[](int32 index) const

headers/private/shared/Array.h

229

template<typename Element>

headers/private/shared/Array.h

23

template<typename Element>

headers/private/shared/Array.h

230

Array<Element>&

headers/private/shared/Array.h

231

Array<Element>::operator=(const Array<Element>& other)

headers/private/shared/Array.h

237

memcpy(fElements, other.fElements, fSize * sizeof(Element));

headers/private/shared/Array.h

244

template<typename Element>

headers/private/shared/Array.h

246

Array<Element>::_Resize(int32 index, int32 delta)

headers/private/shared/Array.h

260

(fSize - index) * sizeof(Element));

headers/private/shared/Array.h

264

(fSize - index + delta) * sizeof(Element));

headers/private/shared/Array.h

27

Array(const Array<Element>& other);

headers/private/shared/Array.h

272

Element* elements = (Element*)malloc(newCapacity * sizeof(Element));

headers/private/shared/Array.h

277

memcpy(elements, fElements, index * sizeof(Element));

headers/private/shared/Array.h

282

(fSize - index) * sizeof(Element));

headers/private/shared/Array.h

286

(fSize - index + delta) * sizeof(Element));

headers/private/shared/Array.h

33

inline Element* Elements() const { return fElements; }

headers/private/shared/Array.h

35

inline bool Add(const Element& element);

headers/private/shared/Array.h

37

inline bool Insert(const Element& element, int32 index);

headers/private/shared/Array.h

44

inline Element& ElementAt(int32 index);

headers/private/shared/Array.h

45

inline const Element& ElementAt(int32 index) const;

headers/private/shared/Array.h

47

inline Element& operator[](int32 index);

headers/private/shared/Array.h

48

inline const Element& operator[](int32 index) const;

headers/private/shared/Array.h

50

Array<Element>& operator=(const Array<Element>& other);

headers/private/shared/Array.h

58

Element* fElements;

headers/private/shared/Array.h

64

template<typename Element>

headers/private/shared/Array.h

65

Array<Element>::Array()

headers/private/shared/Array.h

74

template<typename Element>

headers/private/shared/Array.h

75

Array<Element>::Array(const Array<Element>& other)

headers/private/shared/Array.h

85

template<typename Element>

headers/private/shared/Array.h

86

Array<Element>::~Array()

headers/private/shared/Array.h

92

template<typename Element>

headers/private/shared/Array.h

94

Array<Element>::Add(const Element& element)

headers/private/shared/HashMap.h

127

Element* fElement;

headers/private/shared/HashMap.h

378

Element* element = fTable.Lookup(key);

headers/private/shared/HashMap.h

386

element = new(std::nothrow) Element(key, value);

headers/private/shared/HashMap.h

403

Element* element = fTable.Lookup(key);

headers/private/shared/HashMap.h

420

Element* element = it.fElement;

headers/private/shared/HashMap.h

440

Element* element = fTable.Clear(true);

headers/private/shared/HashMap.h

442

Element* next = element->fNext;

headers/private/shared/HashMap.h

454

if (Element* element = fTable.Lookup(key))

headers/private/shared/HashMap.h

465

if (Element* element = fTable.Lookup(key)) {

headers/private/shared/HashSet.h

113

Element* fElement;

headers/private/shared/HashSet.h

246

Element* element = fTable.Lookup(key);

headers/private/shared/HashSet.h

253

element = new(std::nothrow) Element(key);

headers/private/shared/HashSet.h

270

Element* element = fTable.Lookup(key);

headers/private/shared/HashSet.h

286

Element* element = it.fElement;

headers/private/shared/HashSet.h

304

Element* element = fTable.Clear(true);

headers/private/shared/HashSet.h

306

Element* next = element->fNext;

headers/private/userlandfs/shared/Vector.h

177

inline Value *Element() const

headers/private/userlandfs/shared/Vector.h

748

if (iterator.Element()) {

headers/private/userlandfs/shared/Vector.h

749

int32 index = iterator.Element() - fItems;

headers/private/userlandfs/shared/Vector.h

767

if (iterator.Element()) {

headers/private/userlandfs/shared/Vector.h

768

int32 index = iterator.Element() - fItems;

headers/private/util/DoublyLinkedList.h

107

template<typename Element, typename GetLink>

headers/private/util/DoublyLinkedList.h

108

#define DOUBLY_LINKED_LIST_CLASS_NAME DoublyLinkedList<Element, GetLink>

headers/private/util/DoublyLinkedList.h

111

template<typename Element,

headers/private/util/DoublyLinkedList.h

112

typename GetLink = DoublyLinkedListStandardGetLink<Element> >

headers/private/util/DoublyLinkedList.h

116

typedef DoublyLinkedListLink<Element> Link;

headers/private/util/DoublyLinkedList.h

142

Element* Next()

headers/private/util/DoublyLinkedList.h

150

Element* Current()

headers/private/util/DoublyLinkedList.h

155

Element* Remove()

headers/private/util/DoublyLinkedList.h

157

Element* element = fCurrent;

headers/private/util/DoublyLinkedList.h

181

Element* fCurrent;

headers/private/util/DoublyLinkedList.h

182

Element* fNext;

headers/private/util/DoublyLinkedList.h

204

Element* Next()

headers/private/util/DoublyLinkedList.h

206

Element* element = fNext;

headers/private/util/DoublyLinkedList.h

226

Element* fNext;

headers/private/util/DoublyLinkedList.h

248

Element* Next()

headers/private/util/DoublyLinkedList.h

256

Element* Remove()

headers/private/util/DoublyLinkedList.h

258

Element* element = fCurrent;

headers/private/util/DoublyLinkedList.h

26

template<typename Element>

headers/private/util/DoublyLinkedList.h

282

Element* fCurrent;

headers/private/util/DoublyLinkedList.h

283

Element* fNext;

headers/private/util/DoublyLinkedList.h

29

Element* next;

headers/private/util/DoublyLinkedList.h

30

Element* previous;

headers/private/util/DoublyLinkedList.h

305

Element* Next()

headers/private/util/DoublyLinkedList.h

307

Element* element = fNext;

headers/private/util/DoublyLinkedList.h

327

Element* fNext;

headers/private/util/DoublyLinkedList.h

336

inline void InsertBefore(Element* insertBefore, Element* element);

headers/private/util/DoublyLinkedList.h

337

inline void InsertAfter(Element* insertAfter, Element* element);

headers/private/util/DoublyLinkedList.h

338

inline void Insert(Element* element, bool back = true);

headers/private/util/DoublyLinkedList.h

339

inline void Add(Element* element, bool back = true);

headers/private/util/DoublyLinkedList.h

34

template<typename Element>

headers/private/util/DoublyLinkedList.h

340

inline void Remove(Element* element);

headers/private/util/DoublyLinkedList.h

342

inline void Swap(Element* a, Element* b);

headers/private/util/DoublyLinkedList.h

349

inline Element* First() const { return fFirst; }

headers/private/util/DoublyLinkedList.h

350

inline Element* Last() const { return fLast; }

headers/private/util/DoublyLinkedList.h

352

inline Element* Head() const { return fFirst; }

headers/private/util/DoublyLinkedList.h

353

inline Element* Tail() const { return fLast; }

headers/private/util/DoublyLinkedList.h

355

inline Element* RemoveHead();

headers/private/util/DoublyLinkedList.h

356

inline Element* RemoveTail();

headers/private/util/DoublyLinkedList.h

358

static inline Element* GetPrevious(Element* element);

headers/private/util/DoublyLinkedList.h

359

static inline Element* GetNext(Element* element);

headers/private/util/DoublyLinkedList.h

361

inline bool Contains(Element* element) const;

headers/private/util/DoublyLinkedList.h

37

typedef DoublyLinkedListLink<Element> DLL_Link;

headers/private/util/DoublyLinkedList.h

380

inline void Insert(Element* before, Element* element);

headers/private/util/DoublyLinkedList.h

384

Element* fFirst;

headers/private/util/DoublyLinkedList.h

385

Element* fLast;

headers/private/util/DoublyLinkedList.h

396

DOUBLY_LINKED_LIST_CLASS_NAME::Insert(Element* element, bool back)

headers/private/util/DoublyLinkedList.h

430

DOUBLY_LINKED_LIST_CLASS_NAME::InsertBefore(Element* before, Element* element)

headers/private/util/DoublyLinkedList.h

460

DOUBLY_LINKED_LIST_CLASS_NAME::InsertAfter(Element* after, Element* element)

headers/private/util/DoublyLinkedList.h

490

DOUBLY_LINKED_LIST_CLASS_NAME::Insert(Element* before, Element* element)

headers/private/util/DoublyLinkedList.h

499

DOUBLY_LINKED_LIST_CLASS_NAME::Add(Element* element, bool back)

headers/private/util/DoublyLinkedList.h

50

template<typename Element>

headers/private/util/DoublyLinkedList.h

507

DOUBLY_LINKED_LIST_CLASS_NAME::Remove(Element* element)

headers/private/util/DoublyLinkedList.h

53

typedef DoublyLinkedListLink<Element> Link;

headers/private/util/DoublyLinkedList.h

536

DOUBLY_LINKED_LIST_CLASS_NAME::Swap(Element* a, Element* b)

headers/private/util/DoublyLinkedList.h

539

Element* aNext = sGetLink(a)->next;

headers/private/util/DoublyLinkedList.h

540

Element* bNext = sGetLink(b)->next;

headers/private/util/DoublyLinkedList.h

56

inline Link* operator()(Element* element) const

headers/private/util/DoublyLinkedList.h

586

Element*

headers/private/util/DoublyLinkedList.h

589

Element* element = Head();

headers/private/util/DoublyLinkedList.h

596

Element*

headers/private/util/DoublyLinkedList.h

599

Element* element = Tail();

headers/private/util/DoublyLinkedList.h

606

Element*

headers/private/util/DoublyLinkedList.h

607

DOUBLY_LINKED_LIST_CLASS_NAME::GetPrevious(Element* element)

headers/private/util/DoublyLinkedList.h

609

Element* result = NULL;

headers/private/util/DoublyLinkedList.h

61

inline const Link* operator()(const Element* element) const

headers/private/util/DoublyLinkedList.h

617

Element*

headers/private/util/DoublyLinkedList.h

618

DOUBLY_LINKED_LIST_CLASS_NAME::GetNext(Element* element)

headers/private/util/DoublyLinkedList.h

620

Element* result = NULL;

headers/private/util/DoublyLinkedList.h

629

DOUBLY_LINKED_LIST_CLASS_NAME::Contains(Element* _element) const

headers/private/util/DoublyLinkedList.h

631

for (Element* element = First(); element; element = GetNext(element)) {

headers/private/util/DoublyLinkedList.h

646

for (Element* element = First(); element; element = GetNext(element))

headers/private/util/DoublyLinkedList.h

658

Element* tail = Head();

headers/private/util/DoublyLinkedList.h

660

Element* leastElement = tail;

headers/private/util/DoublyLinkedList.h

661

Element* element = tail;

headers/private/util/DoublyLinkedList.h

68

template<typename Element,

headers/private/util/DoublyLinkedList.h

69

DoublyLinkedListLink<Element> Element::* LinkMember = &Element::fLink>

headers/private/util/DoublyLinkedList.h

72

typedef DoublyLinkedListLink<Element> Link;

headers/private/util/DoublyLinkedList.h

75

inline Link* operator()(Element* element) const

headers/private/util/DoublyLinkedList.h

80

inline const Link* operator()(const Element* element) const

headers/private/util/DoublyLinkedList.h

87

template<typename Element, typename CLink = struct list_link,

headers/private/util/DoublyLinkedList.h

88

CLink Element::* LinkMember = &Element::link>

headers/private/util/DoublyLinkedList.h

91

typedef DoublyLinkedListLink<Element> Link;

headers/private/util/DoublyLinkedList.h

94

inline Link* operator()(Element* element) const

headers/private/util/DoublyLinkedList.h

99

inline const Link* operator()(const Element* element) const

headers/private/util/DoublyLinkedQueue.h

110

Element *Next()

headers/private/util/DoublyLinkedQueue.h

112

Element *element = fNext;

headers/private/util/DoublyLinkedQueue.h

132

Element *fNext;

headers/private/util/DoublyLinkedQueue.h

141

inline void Insert(Element *element);

headers/private/util/DoublyLinkedQueue.h

142

inline void InsertBefore(Element *before, Element *element);

headers/private/util/DoublyLinkedQueue.h

143

inline void Add(Element *element);

headers/private/util/DoublyLinkedQueue.h

144

inline void Remove(Element *element);

headers/private/util/DoublyLinkedQueue.h

146

inline void Swap(Element *a, Element *b);

headers/private/util/DoublyLinkedQueue.h

153

inline Element *First() const { return fFirst; }

headers/private/util/DoublyLinkedQueue.h

154

inline Element *Head() const { return fFirst; }

headers/private/util/DoublyLinkedQueue.h

156

inline Element *RemoveHead();

headers/private/util/DoublyLinkedQueue.h

158

inline Element *GetPrevious(Element *element) const;

headers/private/util/DoublyLinkedQueue.h

159

inline Element *GetNext(Element *element) const;

headers/private/util/DoublyLinkedQueue.h

168

Element *fFirst;

headers/private/util/DoublyLinkedQueue.h

179

DOUBLY_LINKED_QUEUE_CLASS_NAME::Insert(Element *element)

headers/private/util/DoublyLinkedQueue.h

194

DOUBLY_LINKED_QUEUE_CLASS_NAME::InsertBefore(Element *before, Element *element)

headers/private/util/DoublyLinkedQueue.h

219

DOUBLY_LINKED_QUEUE_CLASS_NAME::Add(Element *element)

headers/private/util/DoublyLinkedQueue.h

227

DOUBLY_LINKED_QUEUE_CLASS_NAME::Remove(Element *element)

headers/private/util/DoublyLinkedQueue.h

23

#define DOUBLY_LINKED_QUEUE_CLASS_NAME DoublyLinkedQueue<Element, GetLink>

headers/private/util/DoublyLinkedQueue.h

252

DOUBLY_LINKED_QUEUE_CLASS_NAME::Swap(Element *a, Element *b)

headers/private/util/DoublyLinkedQueue.h

257

Element *aPrev = aLink->previous;

headers/private/util/DoublyLinkedQueue.h

258

Element *bPrev = bLink->previous;

headers/private/util/DoublyLinkedQueue.h

259

Element *aNext = aLink->next;

headers/private/util/DoublyLinkedQueue.h

26

template<typename Element,

headers/private/util/DoublyLinkedQueue.h

260

Element *bNext = bLink->next;

headers/private/util/DoublyLinkedQueue.h

27

typename GetLink = DoublyLinkedListStandardGetLink<Element> >

headers/private/util/DoublyLinkedQueue.h

291

Element *element = fFirst;

headers/private/util/DoublyLinkedQueue.h

309

Element *element = fFirst;

headers/private/util/DoublyLinkedQueue.h

31

typedef DoublyLinkedListLink<Element> Link;

headers/private/util/DoublyLinkedQueue.h

321

Element *

headers/private/util/DoublyLinkedQueue.h

324

Element *element = Head();

headers/private/util/DoublyLinkedQueue.h

331

Element *

headers/private/util/DoublyLinkedQueue.h

332

DOUBLY_LINKED_QUEUE_CLASS_NAME::GetPrevious(Element *element) const

headers/private/util/DoublyLinkedQueue.h

334

Element *result = NULL;

headers/private/util/DoublyLinkedQueue.h

342

Element *

headers/private/util/DoublyLinkedQueue.h

343

DOUBLY_LINKED_QUEUE_CLASS_NAME::GetNext(Element *element) const

headers/private/util/DoublyLinkedQueue.h

345

Element *result = NULL;

headers/private/util/DoublyLinkedQueue.h

357

for (Element* element = First(); element; element = GetNext(element))

headers/private/util/DoublyLinkedQueue.h

53

Element *Next()

headers/private/util/DoublyLinkedQueue.h

61

Element *Remove()

headers/private/util/DoublyLinkedQueue.h

63

Element *element = fCurrent;

headers/private/util/DoublyLinkedQueue.h

87

Element *fCurrent;

headers/private/util/DoublyLinkedQueue.h

88

Element *fNext;

headers/private/util/SinglyLinkedList.h

116

Element* Next()

headers/private/util/SinglyLinkedList.h

118

Element* element = fNext;

headers/private/util/SinglyLinkedList.h

138

Element* fNext;

headers/private/util/SinglyLinkedList.h

147

inline void Add(Element* element);

headers/private/util/SinglyLinkedList.h

148

inline bool Remove(Element* element);

headers/private/util/SinglyLinkedList.h

149

inline void Remove(Element* previous, Element* element);

headers/private/util/SinglyLinkedList.h

157

inline Element* First() const { return fFirst; }

headers/private/util/SinglyLinkedList.h

158

inline Element* Head() const { return fFirst; }

headers/private/util/SinglyLinkedList.h

160

inline Element* RemoveHead();

headers/private/util/SinglyLinkedList.h

162

inline Element* GetNext(Element* element) const;

headers/private/util/SinglyLinkedList.h

17

template<typename Element>

headers/private/util/SinglyLinkedList.h

170

Element *fFirst;

headers/private/util/SinglyLinkedList.h

181

SINGLY_LINKED_LIST_CLASS_NAME::Add(Element* element)

headers/private/util/SinglyLinkedList.h

199

SINGLY_LINKED_LIST_CLASS_NAME::Remove(Element* element)

headers/private/util/SinglyLinkedList.h

204

Element* next = fFirst;

headers/private/util/SinglyLinkedList.h

205

Element* last = NULL;

headers/private/util/SinglyLinkedList.h

226

SINGLY_LINKED_LIST_CLASS_NAME::Remove(Element* previous, Element* element)

headers/private/util/SinglyLinkedList.h

23

Element* next;

headers/private/util/SinglyLinkedList.h

256

Element* tail = fFirst;

headers/private/util/SinglyLinkedList.h

257

while (Element* next = sGetLink(tail)->next)

headers/private/util/SinglyLinkedList.h

27

template<typename Element>

headers/private/util/SinglyLinkedList.h

270

Element* element = fFirst;

headers/private/util/SinglyLinkedList.h

281

Element*

headers/private/util/SinglyLinkedList.h

284

Element* element = Head();

headers/private/util/SinglyLinkedList.h

291

Element*

headers/private/util/SinglyLinkedList.h

292

SINGLY_LINKED_LIST_CLASS_NAME::GetNext(Element* element) const

headers/private/util/SinglyLinkedList.h

294

Element* result = NULL;

headers/private/util/SinglyLinkedList.h

30

typedef SinglyLinkedListLink<Element> SLL_Link;

headers/private/util/SinglyLinkedList.h

306

for (Element* element = First(); element; element = GetNext(element))

headers/private/util/SinglyLinkedList.h

46

template<typename Element>

headers/private/util/SinglyLinkedList.h

49

typedef SinglyLinkedListLink<Element> Link;

headers/private/util/SinglyLinkedList.h

52

inline Link* operator()(Element* element) const

headers/private/util/SinglyLinkedList.h

57

inline const Link* operator()(const Element* element) const

headers/private/util/SinglyLinkedList.h

64

template<typename Element,

headers/private/util/SinglyLinkedList.h

65

SinglyLinkedListLink<Element> Element::* LinkMember = &Element::fLink>

headers/private/util/SinglyLinkedList.h

68

typedef SinglyLinkedListLink<Element> Link;

headers/private/util/SinglyLinkedList.h

71

inline Link* operator()(Element* element) const

headers/private/util/SinglyLinkedList.h

76

inline const Link* operator()(const Element* element) const

headers/private/util/SinglyLinkedList.h

85

template<typename Element, typename GetLink>

headers/private/util/SinglyLinkedList.h

86

#define SINGLY_LINKED_LIST_CLASS_NAME SinglyLinkedList<Element, GetLink>

headers/private/util/SinglyLinkedList.h

89

template<typename Element,

headers/private/util/SinglyLinkedList.h

90

typename GetLink = SinglyLinkedListStandardGetLink<Element> >

headers/private/util/SinglyLinkedList.h

94

typedef SinglyLinkedListLink<Element> Link;

src/add-ons/kernel/bus_managers/acpi/acpica/components/dispatcher/dspkginit.c

169

ACPI_OPERAND_OBJECT **Element);

src/add-ons/kernel/bus_managers/acpi/acpica/components/dispatcher/dspkginit.c

550

ACPI_OPERAND_OBJECT *Element = *ElementPtr;

src/add-ons/kernel/bus_managers/acpi/acpica/components/dispatcher/dspkginit.c

562

if (Element->Reference.Resolved)

src/add-ons/kernel/bus_managers/acpi/acpica/components/dispatcher/dspkginit.c

573

ScopeInfo.Scope.Node = Element->Reference.Node; /* Prefix node */

src/add-ons/kernel/bus_managers/acpi/acpica/components/dispatcher/dspkginit.c

575

Status = AcpiNsLookup (&ScopeInfo, (char *) Element->Reference.Aml,

src/add-ons/kernel/bus_managers/acpi/acpica/components/dispatcher/dspkginit.c

603

(char *) Element->Reference.Aml, NULL, &ExternalPath);

src/add-ons/kernel/bus_managers/acpi/acpica/components/dispatcher/dspkginit.c

642

Element->Reference.Resolved = TRUE;

src/add-ons/kernel/bus_managers/acpi/acpica/components/dispatcher/dspkginit.c

643

Element->Reference.Node = ResolvedNode;

src/add-ons/kernel/bus_managers/acpi/acpica/components/dispatcher/dspkginit.c

644

Type = Element->Reference.Node->Type;

src/add-ons/kernel/bus_managers/acpi/acpica/components/dispatcher/dspkginit.c

696

AcpiUtRemoveReference (Element);

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

457

ACPI_DEBUG_MEM_BLOCK *Element;

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

460

Element = AcpiGbl_GlobalList->ListHead;

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

461

if (!Element)

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

473

while (Element > Allocation)

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

477

if (!Element->Next)

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

479

return (Element);

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

482

Element = Element->Next;

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

485

if (Element == Allocation)

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

487

return (Element);

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

490

return (Element->Previous);

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

521

ACPI_DEBUG_MEM_BLOCK *Element;

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

544

Element = AcpiUtFindAllocation (Allocation);

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

545

if (Element == Allocation)

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

562

if (!Element)

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

581

Allocation->Next = Element->Next;

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

582

Allocation->Previous = Element;

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

584

if (Element->Next)

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

586

(Element->Next)->Previous = Allocation;

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

589

Element->Next = Allocation;

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

756

ACPI_DEBUG_MEM_BLOCK *Element;

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

783

Element = AcpiGbl_GlobalList->ListHead;

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

784

while (Element)

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

786

if ((Element->Component & Component) &&

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

787

((Module == NULL) || (0 == strcmp (Module, Element->Module))))

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

790

ACPI_DESCRIPTOR, &Element->UserSpace);

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

792

if (Element->Size < sizeof (ACPI_COMMON_DESCRIPTOR))

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

796

Descriptor, Element->Size, Element->Module,

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

797

Element->Line);

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

807

Descriptor, Element->Size, Element->Module,

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

808

Element->Line, AcpiUtGetDescriptorName (Descriptor));

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

815

AcpiUtDumpBuffer ((UINT8 *) Descriptor, Element->Size,

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

827

if (Element->Size == sizeof (ACPI_OPERAND_OBJECT))

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

835

if (Element->Size == sizeof (ACPI_PARSE_OBJECT))

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

843

if (Element->Size == sizeof (ACPI_NAMESPACE_NODE))

src/add-ons/kernel/bus_managers/acpi/acpica/components/utilities/uttrack.c

888

Element = Element->Next;

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

103

template<typename Element>

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

105

BlockingQueue<Element>::Pop(Element** element, bigtime_t timeout)

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

123

template<typename Element>

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

125

BlockingQueue<Element>::Peek(Element** element)

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

138

template<typename Element>

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

140

BlockingQueue<Element>::Remove(Element* element)

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

15

template<typename Element>

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

162

template<typename Element>

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

164

BlockingQueue<Element>::Size() const

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

24

const Vector<Element*>** elements = NULL);

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

26

status_t Push(Element* element);

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

27

status_t Pop(Element** element,

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

29

status_t Peek(Element** element);

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

30

status_t Remove(Element* element);

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

35

Vector<Element*> fElements;

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

40

template<typename Element>

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

41

BlockingQueue<Element>::BlockingQueue(const char* name)

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

49

template<typename Element>

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

50

BlockingQueue<Element>::~BlockingQueue()

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

57

template<typename Element>

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

59

BlockingQueue<Element>::InitCheck() const

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

65

template<typename Element>

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

67

BlockingQueue<Element>::Close(bool deleteElements,

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

68

const Vector<Element*>** elements)

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

86

template<typename Element>

src/add-ons/kernel/file_systems/netfs/headers/shared/BlockingQueue.h

88

BlockingQueue<Element>::Push(Element* element)

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

100

Element *Remove()

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

102

Element *element = fCurrent;

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

11

template<typename Element>

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

121

Element *fPrevious;

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

122

Element *fCurrent;

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

123

Element *fNext;

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

144

Element *Next()

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

146

Element *element = fNext;

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

161

Element *fNext;

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

17

Element *next;

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

172

inline void Insert(Element *element, bool back = true);

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

173

inline void InsertAfter(Element *previous, Element *element);

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

174

inline void Remove(Element *element);

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

181

inline Element *GetFirst() const { return fFirst; }

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

182

inline Element *GetLast() const { return fLast; }

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

184

inline Element *GetHead() const { return fFirst; }

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

185

inline Element *GetTail() const { return fLast; }

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

187

inline Element *GetNext(Element *element) const;

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

198

inline void _Remove(Element *previous, Element *element);

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

201

Element *fFirst;

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

202

Element *fLast;

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

21

template<typename Element>

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

218

SL_LIST_CLASS_NAME::Insert(Element *element, bool back)

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

226

SL_LIST_CLASS_NAME::InsertAfter(Element *previous, Element *element)

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

24

typedef SLListLink<Element> Link;

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

250

SL_LIST_CLASS_NAME::Remove(Element *element)

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

286

Element *element = fFirst;

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

298

Element *

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

299

SL_LIST_CLASS_NAME::GetNext(Element *element) const

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

307

SL_LIST_CLASS_NAME::_Remove(Element *previous, Element *element)

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

327

for (Element* element = GetFirst(); element; element = GetNext(element))

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

38

template<typename Element>

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

41

typedef SLListLink<Element> Link;

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

44

inline Link *operator()(Element *element) const

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

49

inline const Link *operator()(const Element *element) const

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

56

#define SL_LIST_TEMPLATE_LIST template<typename Element, typename GetLink>

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

57

#define SL_LIST_CLASS_NAME SLList<Element, GetLink>

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

60

template<typename Element, typename GetLink = SLListStandardGetLink<Element> >

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

64

typedef SLListLink<Element> Link;

src/add-ons/kernel/file_systems/netfs/headers/shared/SLList.h

87

Element *Next()

src/add-ons/kernel/file_systems/reiserfs/Iterators.cpp

138

TreePath::Element::SetTo(uint64 blockNumber, int32 index)

src/add-ons/kernel/file_systems/reiserfs/Iterators.cpp

147

TreePath::Element::GetBlockNumber() const

src/add-ons/kernel/file_systems/reiserfs/Iterators.cpp

154

TreePath::Element::GetIndex() const

src/add-ons/kernel/file_systems/reiserfs/Iterators.cpp

478

const TreePath::Element *element = fPath->GetTopElement();

src/add-ons/kernel/file_systems/reiserfs/Iterators.cpp

55

fElements = new(nothrow) Element[fMaxLength];

src/add-ons/kernel/file_systems/reiserfs/Iterators.cpp

87

const TreePath::Element *

src/add-ons/kernel/file_systems/reiserfs/Iterators.cpp

90

Element *element = NULL;

src/add-ons/kernel/file_systems/reiserfs/Iterators.cpp

97

const TreePath::Element *

src/add-ons/kernel/file_systems/reiserfs/Iterators.h

39

class Element;

src/add-ons/kernel/file_systems/reiserfs/Iterators.h

49

const Element *ElementAt(int32 index) const;

src/add-ons/kernel/file_systems/reiserfs/Iterators.h

50

const Element *GetTopElement() const;

src/add-ons/kernel/file_systems/reiserfs/Iterators.h

58

Element *fElements;

src/add-ons/kernel/file_systems/reiserfs/Iterators.h

62

class TreePath::Element {

src/add-ons/kernel/file_systems/reiserfs/Iterators.h

64

Element() {}

src/add-ons/kernel/file_systems/reiserfs/Iterators.h

65

~Element() {}

src/add-ons/translators/rtf/RTF.cpp

104

dump(Element &element, int32 level = 0)

src/add-ons/translators/rtf/RTF.cpp

174

Element *element = NULL;

src/add-ons/translators/rtf/RTF.cpp

234

Element::Element()

src/add-ons/translators/rtf/RTF.cpp

241

Element::~Element()

src/add-ons/translators/rtf/RTF.cpp

247

Element::SetParent(Group *parent)

src/add-ons/translators/rtf/RTF.cpp

254

Element::Parent() const

src/add-ons/translators/rtf/RTF.cpp

261

Element::IsDefinitionDelimiter()

src/add-ons/translators/rtf/RTF.cpp

268

Element::PrintToStream(int32 level)

src/add-ons/translators/rtf/RTF.cpp

286

Element *element;

src/add-ons/translators/rtf/RTF.cpp

287

while ((element = (Element *)fElements.RemoveItem((int32)0)) != NULL) {

src/add-ons/translators/rtf/RTF.cpp

307

Group::AddElement(Element *element)

src/add-ons/translators/rtf/RTF.cpp

328

Element *

src/add-ons/translators/rtf/RTF.cpp

331

return static_cast<Element *>(fElements.ItemAt(index));

src/add-ons/translators/rtf/RTF.cpp

335

Element *

src/add-ons/translators/rtf/RTF.cpp

341

Element *element;

src/add-ons/translators/rtf/RTF.cpp

362

Element *element = FindDefinitionStart(index, &startIndex);

src/add-ons/translators/rtf/RTF.cpp

383

Element *element;

src/add-ons/translators/rtf/RTF.cpp

725

Iterator::Iterator(Element &start, group_destination destination)

src/add-ons/translators/rtf/RTF.cpp

732

Iterator::SetTo(Element &start, group_destination destination)

src/add-ons/translators/rtf/RTF.cpp

756

Element *

src/add-ons/translators/rtf/RTF.cpp

759

Element *element;

src/add-ons/translators/rtf/RTF.cpp

797

Worker::Dispatch(Element *element)

src/add-ons/translators/rtf/RTF.h

105

class Text : public Element {

src/add-ons/translators/rtf/RTF.h

121

class Command : public Element {

src/add-ons/translators/rtf/RTF.h

146

Iterator(Element &start, group_destination destination = ALL_DESTINATIONS);

src/add-ons/translators/rtf/RTF.h

148

void SetTo(Element &start, group_destination destination = ALL_DESTINATIONS);

src/add-ons/translators/rtf/RTF.h

152

Element *Next();

src/add-ons/translators/rtf/RTF.h

155

Element *fStart;

src/add-ons/translators/rtf/RTF.h

156

Stack<Element *> fStack;

src/add-ons/translators/rtf/RTF.h

178

void Dispatch(RTF::Element *element);

src/add-ons/translators/rtf/RTF.h

46

class Element {

src/add-ons/translators/rtf/RTF.h

48

Element();

src/add-ons/translators/rtf/RTF.h

49

virtual ~Element();

src/add-ons/translators/rtf/RTF.h

63

class Group : public Element {

src/add-ons/translators/rtf/RTF.h

68

status_t AddElement(RTF::Element *element);

src/add-ons/translators/rtf/RTF.h

70

Element *ElementAt(uint32 index) const;

src/add-ons/translators/rtf/RTF.h

72

Element *FindDefinitionStart(int32 index, int32 *_startIndex = NULL) const;

src/apps/installer/BlockingQueue.h

108

template<typename Element>

src/apps/installer/BlockingQueue.h

110

BlockingQueue<Element>::Pop(Element** element, bigtime_t timeout)

src/apps/installer/BlockingQueue.h

128

template<typename Element>

src/apps/installer/BlockingQueue.h

130

BlockingQueue<Element>::Peek(Element** element)

src/apps/installer/BlockingQueue.h

143

template<typename Element>

src/apps/installer/BlockingQueue.h

145

BlockingQueue<Element>::Remove(Element* element)

src/apps/installer/BlockingQueue.h

176

template<typename Element>

src/apps/installer/BlockingQueue.h

178

BlockingQueue<Element>::Size()

src/apps/installer/BlockingQueue.h

18

template<typename Element>

src/apps/installer/BlockingQueue.h

27

const vector<Element*>** elements = NULL);

src/apps/installer/BlockingQueue.h

29

status_t Push(Element* element);

src/apps/installer/BlockingQueue.h

30

status_t Pop(Element** element,

src/apps/installer/BlockingQueue.h

32

status_t Peek(Element** element);

src/apps/installer/BlockingQueue.h

33

status_t Remove(Element* element);

src/apps/installer/BlockingQueue.h

38

vector<Element*> fElements;

src/apps/installer/BlockingQueue.h

43

template<typename Element>

src/apps/installer/BlockingQueue.h

44

BlockingQueue<Element>::BlockingQueue(const char* name)

src/apps/installer/BlockingQueue.h

52

template<typename Element>

src/apps/installer/BlockingQueue.h

53

BlockingQueue<Element>::~BlockingQueue()

src/apps/installer/BlockingQueue.h

60

template<typename Element>

src/apps/installer/BlockingQueue.h

62

BlockingQueue<Element>::InitCheck() const

src/apps/installer/BlockingQueue.h

68

template<typename Element>

src/apps/installer/BlockingQueue.h

70

BlockingQueue<Element>::Close(bool deleteElements,

src/apps/installer/BlockingQueue.h

71

const vector<Element*>** elements)

src/apps/installer/BlockingQueue.h

89

template<typename Element>

src/apps/installer/BlockingQueue.h

91

BlockingQueue<Element>::Push(Element* element)

src/kits/package/solver/SolverProblemSolution.cpp

144

const BSolverProblemSolution::Element*

src/kits/package/solver/SolverProblemSolution.cpp

152

BSolverProblemSolution::AppendElement(const Element& element)

src/kits/package/solver/SolverProblemSolution.cpp

154

Element* newElement = new(std::nothrow) Element(element);

src/kits/package/solver/libsolv/LibsolvSolver.cpp

1076

return _AddSolutionElement(solution, Element::B_DONT_KEEP,

src/kits/package/solver/libsolv/LibsolvSolver.cpp

1081

Element::B_DONT_INSTALL, 0, 0,

src/kits/package/solver/libsolv/LibsolvSolver.cpp

1091

Element::B_DONT_FORBID_INSTALLATION, what, 0, NULL);

src/kits/package/solver/libsolv/LibsolvSolver.cpp

1094

Element::BType type = select == SOLVER_SOLVABLE_PROVIDES

src/kits/package/solver/libsolv/LibsolvSolver.cpp

1095

? Element::B_DONT_DEINSTALL_ALL : Element::B_DONT_DEINSTALL;

src/kits/package/solver/libsolv/LibsolvSolver.cpp

1102

Element::B_DONT_INSTALL_MOST_RECENT, 0, 0,

src/kits/package/solver/libsolv/LibsolvSolver.cpp

1106

return _AddSolutionElement(solution, Element::B_DONT_LOCK, 0, 0,

src/kits/package/solver/libsolv/LibsolvSolver.cpp

1110

return _AddSolutionElement(solution, Element::B_UNSPECIFIED, 0,

src/kits/package/solver/libsolv/LibsolvSolver.cpp

1122

? Element::B_KEEP_INFERIOR_ARCHITECTURE

src/kits/package/solver/libsolv/LibsolvSolver.cpp

1123

: Element::B_INSTALL_INFERIOR_ARCHITECTURE,

src/kits/package/solver/libsolv/LibsolvSolver.cpp

1130

? Element::B_KEEP_EXCLUDED : Element::B_INSTALL_EXCLUDED,

src/kits/package/solver/libsolv/LibsolvSolver.cpp

1136

targetInstalled ? Element::B_KEEP_OLD : Element::B_INSTALL_OLD,

src/kits/package/solver/libsolv/LibsolvSolver.cpp

1143

return _AddSolutionElement(solution, Element::B_ALLOW_DEINSTALLATION,

src/kits/package/solver/libsolv/LibsolvSolver.cpp

1150

Element::B_ALLOW_DOWNGRADE, sourceId, targetId, NULL);

src/kits/package/solver/libsolv/LibsolvSolver.cpp

1157

Element::B_ALLOW_NAME_CHANGE, sourceId, targetId, NULL);

src/kits/package/solver/libsolv/LibsolvSolver.cpp

1164

Element::B_ALLOW_ARCHITECTURE_CHANGE, sourceId, targetId, NULL);

src/kits/package/solver/libsolv/LibsolvSolver.cpp

1171

Element::B_ALLOW_VENDOR_CHANGE, sourceId, targetId, NULL);

src/kits/package/solver/libsolv/LibsolvSolver.cpp

1177

return _AddSolutionElement(solution, Element::B_ALLOW_REPLACEMENT,

src/system/kernel/TeamThreadTables.h

119

Element* NextElement(IteratorEntry* entry, bool visibleOnly = true)

src/system/kernel/TeamThreadTables.h

137

Element* element = static_cast<Element*>(nextEntry);

src/system/kernel/TeamThreadTables.h

148

typedef Element ValueType;

src/system/kernel/TeamThreadTables.h

15

template<typename Element>

src/system/kernel/TeamThreadTables.h

155

size_t Hash(Element* value) const

src/system/kernel/TeamThreadTables.h

160

bool Compare(id_type key, Element* value) const

src/system/kernel/TeamThreadTables.h

165

Element*& GetLink(Element* value) const

src/system/kernel/TeamThreadTables.h

18

typedef typename Element::id_type id_type;

src/system/kernel/TeamThreadTables.h

19

typedef typename Element::iterator_type IteratorEntry;

src/system/kernel/TeamThreadTables.h

38

Element* Next()

src/system/kernel/TeamThreadTables.h

40

Element* result = fNext;

src/system/kernel/TeamThreadTables.h

52

fNext = static_cast<Element*>(entry);

src/system/kernel/TeamThreadTables.h

63

Element* fNext;

src/system/kernel/TeamThreadTables.h

78

void Insert(Element* element)

src/system/kernel/TeamThreadTables.h

85

void Remove(Element* element)

src/system/kernel/TeamThreadTables.h

91

Element* Lookup(id_type id, bool visibleOnly = true) const

src/system/kernel/TeamThreadTables.h

93

Element* element = fTable.Lookup(id);

src/system/kernel/scheduler/RunQueue.h

112

Element* fHeads[MaxPriority + 1];

src/system/kernel/scheduler/RunQueue.h

113

Element* fTails[MaxPriority + 1];

src/system/kernel/scheduler/RunQueue.h

119

template<typename Element>

src/system/kernel/scheduler/RunQueue.h

120

RunQueueLink<Element>::RunQueueLink()

src/system/kernel/scheduler/RunQueue.h

128

template<typename Element>

src/system/kernel/scheduler/RunQueue.h

129

RunQueueLink<Element>*

src/system/kernel/scheduler/RunQueue.h

130

RunQueueLinkImpl<Element>::GetRunQueueLink()

src/system/kernel/scheduler/RunQueue.h

136

template<typename Element>

src/system/kernel/scheduler/RunQueue.h

137

RunQueueLink<Element>*

src/system/kernel/scheduler/RunQueue.h

138

RunQueueStandardGetLink<Element>::operator()(Element* element) const

src/system/kernel/scheduler/RunQueue.h

144

template<typename Element, RunQueueLink<Element> Element::*LinkMember>

src/system/kernel/scheduler/RunQueue.h

145

RunQueueLink<Element>*

src/system/kernel/scheduler/RunQueue.h

146

RunQueueMemberGetLink<Element, LinkMember>::operator()(Element* element) const

src/system/kernel/scheduler/RunQueue.h

161

RUN_QUEUE_CLASS_NAME::ConstIterator::ConstIterator(const RunQueue<Element,

src/system/kernel/scheduler/RunQueue.h

17

template<typename Element>

src/system/kernel/scheduler/RunQueue.h

191

Element*

src/system/kernel/scheduler/RunQueue.h

196

Element* current = fNext;

src/system/kernel/scheduler/RunQueue.h

197

RunQueueLink<Element>* link = sGetLink(fNext);

src/system/kernel/scheduler/RunQueue.h

22

Element* fPrevious;

src/system/kernel/scheduler/RunQueue.h

23

Element* fNext;

src/system/kernel/scheduler/RunQueue.h

254

Element*

src/system/kernel/scheduler/RunQueue.h

26

template<typename Element>

src/system/kernel/scheduler/RunQueue.h

267

Element* element = fHeads[priority];

src/system/kernel/scheduler/RunQueue.h

279

RUN_QUEUE_CLASS_NAME::PushFront(Element* element,

src/system/kernel/scheduler/RunQueue.h

286

RunQueueLink<Element>* elementLink = sGetLink(element);

src/system/kernel/scheduler/RunQueue.h

29

inline RunQueueLink<Element>* GetRunQueueLink();

src/system/kernel/scheduler/RunQueue.h

308

RUN_QUEUE_CLASS_NAME::PushBack(Element* element,

src/system/kernel/scheduler/RunQueue.h

315

RunQueueLink<Element>* elementLink = sGetLink(element);

src/system/kernel/scheduler/RunQueue.h

32

RunQueueLink<Element> fRunQueueLink;

src/system/kernel/scheduler/RunQueue.h

337

RUN_QUEUE_CLASS_NAME::Remove(Element* element)

src/system/kernel/scheduler/RunQueue.h

341

RunQueueLink<Element>* elementLink = sGetLink(element);

src/system/kernel/scheduler/RunQueue.h

35

template<typename Element>

src/system/kernel/scheduler/RunQueue.h

371

Element*

src/system/kernel/scheduler/RunQueue.h

38

typedef RunQueueLink<Element> Link;

src/system/kernel/scheduler/RunQueue.h

41

inline Link* operator()(Element* element) const;

src/system/kernel/scheduler/RunQueue.h

44

template<typename Element, RunQueueLink<Element> Element::*LinkMember>

src/system/kernel/scheduler/RunQueue.h

47

typedef RunQueueLink<Element> Link;

src/system/kernel/scheduler/RunQueue.h

50

inline Link* operator()(Element* element) const;

src/system/kernel/scheduler/RunQueue.h

54

template<typename Element, unsigned int MaxPriority, typename GetLink>

src/system/kernel/scheduler/RunQueue.h

55

#define RUN_QUEUE_CLASS_NAME RunQueue<Element, MaxPriority, GetLink>

src/system/kernel/scheduler/RunQueue.h

57

template<typename Element, unsigned int MaxPriority,

src/system/kernel/scheduler/RunQueue.h

58

typename GetLink = RunQueueStandardGetLink<Element> >

src/system/kernel/scheduler/RunQueue.h

64

ConstIterator(const RunQueue<Element,

src/system/kernel/scheduler/RunQueue.h

70

Element* Next();

src/system/kernel/scheduler/RunQueue.h

79

Element* fNext;

src/system/kernel/scheduler/RunQueue.h

88

inline Element* PeekMaximum() const;

src/system/kernel/scheduler/RunQueue.h

90

inline void PushFront(Element* element, unsigned int priority);

src/system/kernel/scheduler/RunQueue.h

91

inline void PushBack(Element* elementt, unsigned int priority);

src/system/kernel/scheduler/RunQueue.h

93

inline void Remove(Element* element);

src/system/kernel/scheduler/RunQueue.h

95

inline Element* GetHead(unsigned int priority) const;