Home
last modified time | relevance | path

Searched refs:ListNode (Results 1 – 4 of 4) sorted by relevance

/external/llvm/test/Analysis/ScalarEvolution/
Dload.ll36 %struct.ListNode = type { %struct.ListNode*, i32 }
38 …stant { %struct.ListNode*, i32, [4 x i8] } { %struct.ListNode* bitcast ({ %struct.ListNode*, i32, …
39 …stant { %struct.ListNode*, i32, [4 x i8] } { %struct.ListNode* bitcast ({ %struct.ListNode*, i32, …
40 …stant { %struct.ListNode*, i32, [4 x i8] } { %struct.ListNode* bitcast ({ %struct.ListNode*, i32, …
41 …stant { %struct.ListNode*, i32, [4 x i8] } { %struct.ListNode* bitcast ({ %struct.ListNode*, i32, …
42 @node1 = internal constant { %struct.ListNode*, i32, [4 x i8] } { %struct.ListNode* null, i32 0, [4…
52 …%n.01 = phi %struct.ListNode* [ bitcast ({ %struct.ListNode*, i32, [4 x i8] }* @node5 to %struct.L…
54 %i = getelementptr inbounds %struct.ListNode, %struct.ListNode* %n.01, i64 0, i32 1
57 %next = getelementptr inbounds %struct.ListNode, %struct.ListNode* %n.01, i64 0, i32 0
58 %1 = load %struct.ListNode*, %struct.ListNode** %next, align 8
[all …]
/external/cmockery/cmockery_0_1_2/src/
Dcmockery.c51 typedef struct ListNode { struct
54 struct ListNode *next; argument
55 struct ListNode *prev; argument
56 } ListNode; typedef
64 ListNode node; // Node within list of all allocated blocks.
69 const ListNode *check_point; // Check point of the test if there's a
89 ListNode symbol_values_list_head;
117 static ListNode* list_initialize(ListNode * const node);
118 static ListNode* list_add(ListNode * const head, ListNode *new_node);
119 static ListNode* list_add_value(ListNode * const head, const void *value,
[all …]
/external/clang/test/ASTMerge/Inputs/
Dstruct2.c45 struct ListNode { struct
47 struct ListNode *Next; argument
Dstruct1.c48 struct ListNode { struct
50 struct ListNode *Next; argument