Home
last modified time | relevance | path

Searched refs:ListNode (Results 1 – 18 of 18) 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* %n.01, i64 0, i32 1
57 %next = getelementptr inbounds %struct.ListNode* %n.01, i64 0, i32 0
58 %1 = load %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/chromium_org/tools/gn/
Dfunctions_unittest.cc19 ListNode args_list_identifier_undefined; in TEST()
35 ListNode args_list_identifier_defined; in TEST()
49 ListNode args_list_accessor_defined; in TEST()
Dparse_tree.h23 class ListNode; variable
81 virtual const ListNode* AsList() const;
315 const ListNode* args() const { return args_.get(); } in args()
316 void set_args(scoped_ptr<ListNode> a) { args_ = a.Pass(); } in set_args()
323 scoped_ptr<ListNode> args_;
356 class ListNode : public ParseNode {
358 ListNode();
359 virtual ~ListNode();
361 virtual const ListNode* AsList() const OVERRIDE;
385 DISALLOW_COPY_AND_ASSIGN(ListNode);
Doperators_unittest.cc28 scoped_ptr<ListNode> ListWithLiteral(const Token& token) { in ListWithLiteral()
29 scoped_ptr<ListNode> list(new ListNode); in ListWithLiteral()
81 ListNode list; in TEST()
118 scoped_ptr<ListNode> outer_list(new ListNode); in TEST()
Dparse_tree.cc47 const ListNode* ParseNode::AsList() const { return NULL; } in AsList()
447 ListNode::ListNode() { in ListNode() function in ListNode
450 ListNode::~ListNode() { in ~ListNode()
454 const ListNode* ListNode::AsList() const { in AsList()
458 Value ListNode::Execute(Scope* scope, Err* err) const { in Execute()
480 LocationRange ListNode::GetRange() const { in GetRange()
484 Err ListNode::MakeErrorDescribing(const std::string& msg, in MakeErrorDescribing()
489 void ListNode::Print(std::ostream& out, int indent) const { in Print()
Dparser.cc286 scoped_ptr<ListNode> list(new ListNode); in IdentifierOrCall()
381 scoped_ptr<ListNode> Parser::ParseList(Token start_token, in ParseList()
384 scoped_ptr<ListNode> list(new ListNode); in ParseList()
393 return scoped_ptr<ListNode>(); in ParseList()
403 return scoped_ptr<ListNode>(); in ParseList()
407 return scoped_ptr<ListNode>(); in ParseList()
419 return scoped_ptr<ListNode>(); in ParseList()
538 } else if (const ListNode* list = root->AsList()) { in TraverseOrder()
Dfunctions.h18 class ListNode; variable
33 const ListNode* args_list,
113 const ListNode* args_list,
138 const ListNode* args_list,
360 const ListNode* args_list,
Dfunction_foreach.cc51 const ListNode* args_list, in RunForEach()
Dparser.h69 scoped_ptr<ListNode> ParseList(Token start_token,
Dfunctions.cc344 const ListNode* args_list, in RunDefined()
722 const ListNode* args_list, in RunFunction()
Dcommand_format.cc256 } else if (const ListNode* list = root->AsList()) { in Expr()
/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
/external/chromium_org/third_party/cython/src/Cython/Compiler/
DOptimize.py1051 ExprNodes.ListNode,
1608 elif isinstance(pos_args[0], ExprNodes.ListNode):
1614 return ExprNodes.ListNode(node.pos, args=[], constant_result=[])
3596 return ExprNodes.ListNode(
3617 if isinstance(sequence, ExprNodes.ListNode):
DParsing.py909 return ExprNodes.ListNode(pos, args = [])
926 return ExprNodes.ListNode(pos, args = exprs)
1297 name_list = ExprNodes.ListNode(pos, args = [
1391 import_list = ExprNodes.ListNode(
DParseTreeTransforms.py554 target, ExprNodes.ListNode(pos=pos, args=starred_rhs)])
2586 return ExprNodes.ListNode(pos, args=items)
DExprNodes.py1934 if (self.entry.type.is_ptr and isinstance(rhs, ListNode)
6266 class ListNode(SequenceNode): class
9781 if isinstance(self.operand2, (ListNode, TupleNode, SetNode)):
9785 elif isinstance(self.operand2, ListNode) and not self.cascade: