HomeSort by relevance Sort by last modified time
    Searched full:listnode (Results 1 - 25 of 27) sorted by null

1 2

  /system/core/init/
list.h 20 struct listnode struct
22 struct listnode *next;
23 struct listnode *prev;
30 struct listnode name = { \
41 void list_init(struct listnode *list);
42 void list_add_tail(struct listnode *list, struct listnode *item);
43 void list_remove(struct listnode *item);
init.h 29 struct listnode clist;
38 struct listnode alist;
40 struct listnode qlist;
42 struct listnode tlist;
47 struct listnode commands;
79 struct listnode slist;
init_parser.c 247 struct listnode *node;
260 struct listnode *node;
273 struct listnode *node;
286 struct listnode *node;
297 struct listnode *node;
310 struct listnode *node;
323 struct listnode *node;
335 struct listnode *node;
354 struct listnode *node;
412 struct listnode *node = list_head(&action_queue)
    [all...]
parser.c 17 struct listnode *node;
18 struct listnode *node2;
util.c 195 void list_init(struct listnode *node)
201 void list_add_tail(struct listnode *head, struct listnode *item)
209 void list_remove(struct listnode *item)
signal_handler.c 51 struct listnode *node;
devices.c 96 struct listnode plist;
135 struct listnode *node;
164 struct listnode *node;
init.c 73 static struct listnode *command_queue = NULL;
465 struct listnode *node;
475 struct listnode *node;
  /packages/apps/Nfc/jni/
com_android_nfc_list.h 26 struct listNode
29 struct listNode* pNext;
34 listNode* pFirst;
com_android_nfc_list.cpp 56 struct listNode* pNode;
57 struct listNode* pLastNode;
61 pNode = (struct listNode*)malloc(sizeof(listNode));
102 struct listNode* pNode;
103 struct listNode* pRemovedNode;
165 struct listNode* pNode;
202 struct listNode* pNode = pList->pFirst;
  /external/webkit/WebCore/editing/
InsertListCommand.cpp 140 HTMLElement* listNode = enclosingList(listChildNode);
141 if (!listNode)
142 listNode = fixOrphanedListChild(listChildNode);
143 if (!listNode->hasTagName(listTag))
161 if (enclosingList(nextListChild) != listNode)
165 if (enclosingList(previousListChild) != listNode)
174 if (enclosingList(listNode)) {
180 // We want to pull listChildNode out of listNode, and place it before nextListChild
181 // and after previousListChild, so we split listNode and insert it between the two lists.
182 // But to split listNode, we must first split ancestors of listChildNode between it and listNode
    [all...]
ModifySelectionListLevel.cpp 263 Element* listNode = startListChild->parentElement();
267 insertSiblingNodeRangeBefore(startListChild, endListChild, listNode);
270 removeNode(listNode);
273 insertSiblingNodeRangeAfter(startListChild, endListChild, listNode);
274 } else if (listNode) {
276 splitElement(listNode, startListChild);
277 insertSiblingNodeRangeBefore(startListChild, endListChild, listNode);
CompositeEditCommand.cpp     [all...]
IndentOutdentCommand.cpp 74 RefPtr<Element> listNode = enclosingList(lastNodeInSelectedParagraph);
75 if (!listNode)
93 RefPtr<Element> newList = document()->createElement(listNode->tagQName(), false);
  /external/astl/include/
list 58 struct ListNode: public ListNodeBase {
67 typedef android::ListNode<_T> node_type;
108 typedef android::ListNode<_T> node_type;
243 android::ListNode<_T> *node =
244 static_cast<android::ListNode<_T> *>(mHead.mNext);
254 android::ListNode<_T> *node = new android::ListNode<_T>();
283 android::ListNode<_T>* node =
284 static_cast<android::ListNode<_T>*>(pos.mNode);
  /external/webkit/WebCore/html/
HTMLLIElement.cpp 90 Node* listNode = 0;
92 while (!listNode && (n = n->parentNode())) {
94 listNode = n;
99 if (!listNode)
  /external/chromium/sdch/open-vcdiff/src/gtest/src/
gtest-internal-inl.h 153 // ListNode is a node in a singly-linked list. It consists of an
157 class ListNode {
163 ListNode * next_;
165 // The c'tor is private s.t. only in the ListNode class and in its
166 // friend class List we can create a ListNode object.
171 // ListNode does NOT have a default constructor. Always use this
172 // constructor (with parameter) to create a ListNode object.
173 explicit ListNode(const E & element) : element_(element), next_(NULL) {}
175 // We disallow copying ListNode
176 GTEST_DISALLOW_COPY_AND_ASSIGN(ListNode);
    [all...]
  /external/gtest/src/
gtest-internal-inl.h 215 // ListNode is a node in a singly-linked list. It consists of an
219 class ListNode {
225 ListNode * next_;
227 // The c'tor is private s.t. only in the ListNode class and in its
228 // friend class List we can create a ListNode object.
233 // ListNode does NOT have a default constructor. Always use this
234 // constructor (with parameter) to create a ListNode object.
235 explicit ListNode(const E & element) : element_(element), next_(NULL) {}
237 // We disallow copying ListNode
238 GTEST_DISALLOW_COPY_AND_ASSIGN_(ListNode);
    [all...]
gtest-test-part.cc 87 const internal::ListNode<TestPartResult>* p = list_->Head();
gtest.cc 268 for (const internal::ListNode<TestCase*>* node = case_list.Head();
    [all...]
  /external/gtest/test/
gtest_stress_test.cc 49 using internal::ListNode;
73 const ListNode<TestProperty>* node = properties.FindIf(matches_key);
  /external/webkit/WebCore/rendering/
RenderListItem.cpp 329 Node* listNode = enclosingList(node());
331 if (listNode)
332 listRenderer = listNode->renderer();
  /external/webkit/WebCore/inspector/front-end/
treeoutline.js 29 function TreeOutline(listNode)
33 this._childrenListNode = listNode;
335 var listNode = node.enclosingNodeOrSelfWithNodeNameInArray(["ol", "li"]);
336 if (listNode)
337 return listNode.parentTreeElement || listNode.treeElement;
  /external/webkit/JavaScriptCore/parser/
NodeConstructors.h 206 inline ArgumentListNode::ArgumentListNode(JSGlobalData* globalData, ArgumentListNode* listNode, ExpressionNode* expr)
211 listNode->m_next = this;
219 inline ArgumentsNode::ArgumentsNode(JSGlobalData*, ArgumentListNode* listNode)
220 : m_listNode(listNode)
    [all...]
  /external/chromium/sdch/open-vcdiff/src/gtest/
gtest.cc 208 for (const internal::ListNode<TestCase*>* node = case_list.Head();
465 const internal::ListNode<TestPartResult>* p = list_->Head();
    [all...]

Completed in 1006 milliseconds

1 2