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

1 2

  /system/core/include/cutils/
list.h 26 struct listnode struct
28 struct listnode *next;
29 struct listnode *prev;
36 struct listnode name = { \
47 void list_init(struct listnode *list);
48 void list_add_tail(struct listnode *list, struct listnode *item);
49 void list_remove(struct listnode *item);
  /external/llvm/test/Analysis/ScalarEvolution/
load.ll 36 %struct.ListNode = type { %struct.ListNode*, i32 }
38 @node5 = internal constant { %struct.ListNode*, i32, [4 x i8] } { %struct.ListNode* bitcast ({ %struct.ListNode*, i32, [4 x i8] }* @node4 to %struct.ListNode*), i32 4, [4 x i8] undef }, align 8
39 @node4 = internal constant { %struct.ListNode*, i32, [4 x i8] } { %struct.ListNode* bitcast ({ %struct.ListNode*, i32, [4 x i8] }* @node3 to %struct.ListNode*), i32 3, [4 x i8] undef }, align
    [all...]
  /external/webkit/Source/WebCore/editing/
InsertListCommand.cpp 40 static Node* enclosingListChild(Node* node, Node* listNode)
43 while (listChild && enclosingList(listChild) != listNode)
92 Element* listNode = enclosingList(start.deepEquivalent().deprecatedNode());
93 if (!listNode || !listNode->hasTagName(listTag))
199 RefPtr<HTMLElement> listNode = enclosingList(listChildNode);
200 if (!listNode) {
201 listNode = fixOrphanedListChild(listChildNode);
202 listNode = mergeWithNeighboringLists(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);
InsertListCommand.h 58 void unlistifyParagraph(const VisiblePosition& originalStart, HTMLElement* listNode, Node* listChildNode);
CompositeEditCommand.cpp     [all...]
IndentOutdentCommand.cpp 63 RefPtr<Element> listNode = enclosingList(lastNodeInSelectedParagraph);
64 if (!listNode)
78 RefPtr<Element> newList = document()->createElement(listNode->tagQName(), false);
  /packages/apps/Nfc/nxp/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;
  /system/core/libcutils/
list.c 19 void list_init(struct listnode *node)
25 void list_add_tail(struct listnode *head, struct listnode *item)
33 void list_remove(struct listnode *item)
  /external/clang/test/ASTMerge/Inputs/
struct1.c 48 struct ListNode {
50 struct ListNode *Next;
struct2.c 45 struct ListNode {
47 struct ListNode *Next;
  /system/core/init/
init.h 29 struct listnode clist;
38 struct listnode alist;
40 struct listnode qlist;
42 struct listnode tlist;
47 struct listnode commands;
82 struct listnode slist;
init_parser.c 44 struct listnode list;
293 struct listnode *import_list = state->priv;
346 struct listnode import_list;
347 struct listnode *node;
427 struct listnode *node;
440 struct listnode *node;
453 struct listnode *node;
466 struct listnode *node;
477 struct listnode *node;
490 struct listnode *node
    [all...]
parser.c 16 struct listnode *node;
17 struct listnode *node2;
devices.c 81 struct listnode plist;
88 struct listnode list;
128 struct listnode *node;
157 struct listnode *node;
222 struct listnode *node;
258 struct listnode *node;
274 struct listnode *node;
signal_handler.c 51 struct listnode *node;
  /system/core/adb/
adb_auth_client.c 33 struct listnode node;
51 static void read_keys(const char *file, struct listnode *list)
96 static void free_keys(struct listnode *list)
98 struct listnode *item;
107 static void load_keys(struct listnode *list)
140 struct listnode *item;
142 struct listnode key_list;
adb_auth_host.c 55 struct listnode node;
59 static struct listnode key_list;
226 static int read_key(const char *file, struct listnode *list)
296 static int get_user_key(struct listnode *list)
320 static void get_vendor_keys(struct listnode *list)
361 struct listnode *item;
  /external/webkit/Source/WebCore/html/
HTMLLIElement.cpp 100 Node* listNode = 0;
102 while (!listNode && (n = n->parentNode())) {
104 listNode = n;
109 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/webkit/Source/WebCore/rendering/
RenderListItem.cpp 391 Node* listNode = enclosingList(this);
393 if (listNode)
394 listRenderer = listNode->renderer();
431 Node* listNode = enclosingList(this);
432 ASSERT(listNode && listNode->renderer());
433 if (!listNode || !listNode->renderer())
436 RenderObject* list = listNode->renderer();
  /hardware/qcom/audio/hal/
audio_hw.h 214 struct listnode list;
254 struct listnode usecase_list;
  /external/icu4c/common/
stringtriebuilder.cpp 281 ListBranchNode *listNode=new ListBranchNode();
282 if(listNode==NULL) {
293 listNode->add(unit, getElementValue(start));
295 listNode->add(unit, makeNode(start, i, unitIndex+1, errorCode));
302 listNode->add(unit, getElementValue(start));
304 listNode->add(unit, makeNode(start, limit, unitIndex+1, errorCode));
306 Node *node=registerNode(listNode, errorCode);
  /external/webkit/Source/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;

Completed in 1091 milliseconds

1 2