HomeSort by relevance Sort by last modified time
    Searched refs:LinkNode (Results 1 - 7 of 7) sorted by null

  /external/libchrome/base/containers/
linked_list.h 14 // list, as extending LinkNode (this gives it next/previous pointers).
16 // class MyNodeType : public LinkNode<MyNodeType> {
25 // LinkNode::InsertBefore, or LinkNode::InsertAfter:
27 // LinkNode<MyNodeType>* n1 = ...;
28 // LinkNode<MyNodeType>* n2 = ...;
29 // LinkNode<MyNodeType>* n3 = ...;
37 // for (LinkNode<MyNodeType>* node = list.head();
46 // for (LinkNode<MyNodeType>* node = list.tail();
77 // space for the "next" and "previous" pointers (base::LinkNode<T>*)
    [all...]
  /frameworks/rs/
rsMap.h 33 struct LinkNode {
35 LinkNode* next;
45 LinkNode* p = bucket[i];
46 LinkNode* next;
57 LinkNode* node = bucket[index];
58 LinkNode* prev = nullptr;
68 node = new LinkNode();
83 LinkNode* next;
118 iterator(size_t index, LinkNode* n, const Map* m) : bucket_index(index), node(n), map(m) {}
122 LinkNode* node
    [all...]
  /external/libchrome/base/debug/
leak_tracker.h 69 class LeakTracker : public LinkNode<LeakTracker<T> > {
89 for (LinkNode<LeakTracker<T> >* node = instances()->head();
117 for (LinkNode<LeakTracker<T> >* node = instances()->head();
  /external/libchrome/base/trace_event/
memory_usage_estimator.h 362 for (base::LinkNode<T>* node = list.head(); node != list.end();
  /prebuilts/jdk/jdk9/darwin-x86/lib/
jrt-fs.jar 
  /prebuilts/jdk/jdk9/linux-x86/lib/
jrt-fs.jar 
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ddk/
ntddk.h     [all...]

Completed in 260 milliseconds