/external/libutf/ |
H A D | utfdef.h | 14 #define nil ((void*)0) macro
|
/external/clang/test/Index/ |
H A D | complete-macros.c | 4 #define nil 0 macro 13 int *ip = nil; 14 ip = nil; 15 g(nil); 35 // CHECK-CC2: macro definition:{TypedText nil} (32) 38 // CHECK-CC3: macro definition:{TypedText nil} (65)
|
/external/valgrind/memcheck/tests/ |
H A D | thread_alloca.c | 18 nop(void *nil) argument
|
/external/clang/test/SemaTemplate/ |
H A D | example-typelist.cpp | 5 struct nil { }; struct 7 template<typename Head, typename Tail = nil> 33 struct length<nil> { 66 class reverse<nil> { 68 typedef nil type; 91 struct find<nil, T> { 92 typedef nil type; 98 int find1[is_same<find<unsigned_inttypes, int>::type, nil>::value? 1 : -1];
|
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
H A D | BaseTreeAdaptor.as | 18 public function nil():Object { function 82 /** If oldRoot is a nil root, just copy or move the children to newRoot. 83 * If not a nil root, make oldRoot a child of newRoot. 85 * old=^(nil a b c), new=r yields ^(r a b c) 88 * If newRoot is a nil-rooted single child tree, use the single 91 * old=^(nil a b c), new=^(nil r) yields ^(r a b c) 92 * old=^(a b c), new=^(nil r) yields ^(r ^(a b c)) 97 * old=null, new=^(nil r) yields ^(nil [all...] |
/external/clang/test/ARCMT/ |
H A D | Common.h | 12 #define nil ((void*) 0) macro
|
/external/clang/test/Sema/ |
H A D | conditional-expr.c | 87 #define nil ((void*) 0) macro 93 return a ? f1() : nil; // expected-warning {{pointer/integer type mismatch in conditional expression ('int' and 'void *')}} expected-warning {{incompatible pointer to integer conversion returning 'void *' from a function with result type 'int'}}
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/debug/ |
H A D | DebugTreeAdaptor.java | 102 public Object nil() { method in class:DebugTreeAdaptor 103 Object node = adaptor.nil();
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
H A D | BaseTreeAdaptor.java | 46 public Object nil() { method in class:BaseTreeAdaptor 111 /** If oldRoot is a nil root, just copy or move the children to newRoot. 112 * If not a nil root, make oldRoot a child of newRoot. 114 * old=^(nil a b c), new=r yields ^(r a b c) 117 * If newRoot is a nil-rooted single child tree, use the single 120 * old=^(nil a b c), new=^(nil r) yields ^(r a b c) 121 * old=^(a b c), new=^(nil r) yields ^(r ^(a b c)) 126 * old=null, new=^(nil r) yields ^(nil [all...] |
H A D | TreeAdaptor.java | 62 /** Return a nil node (an empty but non-null node) that can hold 64 * use "t=adaptor.nil(); t.addChild(x); t.addChild(y);" 66 public Object nil(); method in interface:TreeAdaptor 84 /** Is tree considered a nil node used to make lists of child nodes? */ 96 /** If oldRoot is a nil root, just copy or move the children to newRoot. 97 * If not a nil root, make oldRoot a child of newRoot. 99 * old=^(nil a b c), new=r yields ^(r a b c) 102 * If newRoot is a nil-rooted single child tree, use the single 105 * old=^(nil a b c), new=^(nil [all...] |
/external/jemalloc/test/unit/ |
H A D | rb.c | 72 node_t *nil) 89 if (node == nil) 95 if (left_node != nil) 96 ret += tree_recurse(left_node, black_height, black_depth, nil); 101 if (right_node != nil) 102 ret += tree_recurse(right_node, black_height, black_depth, nil); 71 tree_recurse(node_t *node, unsigned black_height, unsigned black_depth, node_t *nil) argument
|
/external/antlr/antlr-3.4/runtime/Python/antlr3/ |
H A D | debug.py | 272 def nil(self): member in class:DebugTreeAdaptor 273 node = self.adaptor.nil() 658 """A nil was created (even nil nodes have a unique ID...
|
H A D | tree.py | 173 is nil, add all children of t to this' children. 180 """Set ith child (0..n-1) to t; t must be non-null and non-nil node""" 192 a list (nil-root tree). num of children can increase or decrease. 202 Indicates the node is a nil node but may still have children, meaning 312 def nil(self): member in class:TreeAdaptor 314 Return a nil node (an empty but non-null node) that can hold 316 use "t=adaptor.nil(); t.addChild(x); t.addChild(y);" 343 """Is tree considered a nil node used to make lists of child nodes?""" 363 If oldRoot is a nil root, just copy or move the children to newRoot. 364 If not a nil roo 968 def nil(self): member in class:BaseTreeAdaptor [all...] |
/external/e2fsprogs/e2fsck/ |
H A D | dict.c | 94 the sentinel nil node, and root->parent->left points back to root */ 138 static void free_nodes(dict_t *dict, dnode_t *node, dnode_t *nil) argument 140 if (node == nil) 142 free_nodes(dict, node->left, nil); 143 free_nodes(dict, node->right, nil); 185 * mismatches. It does not check for every nil node being black, because there 186 * is only one sentinel nil node. The return value of this function is the 191 static unsigned int verify_redblack(dnode_t *nil, dnode_t *root) argument 195 if (root != nil) { 196 height_left = verify_redblack(nil, roo 222 verify_node_count(dnode_t *nil, dnode_t *root) argument 239 verify_dict_has_node(dnode_t *nil, dnode_t *root, dnode_t *node) argument 311 dnode_t *nil = dict_nil(dict), *root = dict_root(dict); local 397 dnode_t *nil = dict_nil(dict), *root = dict_root(dict); local 457 dnode_t *nil = dict_nil(dict); local 496 dnode_t *nil = dict_nil(dict); local 528 dnode_t *nil = dict_nil(dict); local 563 dnode_t *where = dict_root(dict), *nil = dict_nil(dict); local 661 dnode_t *nil = dict_nil(dict), *child, *delparent = delete->parent; local 861 dnode_t *nil = dict_nil(dict), *root = dict_root(dict), *left; local 877 dnode_t *nil = dict_nil(dict), *root = dict_root(dict), *right; local 895 dnode_t *nil = dict_nil(dict), *parent, *left; local 921 dnode_t *nil = dict_nil(dict), *parent, *right; local 1060 dnode_t *nil = &load->nilnode; local [all...] |
/external/v8/test/cctest/compiler/ |
H A D | test-scheduler.cc | 696 Node* nil = graph.NewNode(common_builder.Dead()); local 698 Node* n23 = graph.NewNode(op, nil); 701 Node* n22 = graph.NewNode(op, nil, nil); 704 Node* n16 = graph.NewNode(op, nil, nil, nil); 707 Node* n15 = graph.NewNode(op, nil, nil, nil, ni 840 Node* nil = graph.NewNode(common_builder.Dead()); local 958 Node* nil = graph.NewNode(common_builder.Dead()); local 1207 Node* nil = graph.NewNode(common_builder.Dead()); local 1529 Node* nil = graph.NewNode(common_builder.Dead()); local [all...] |
/external/opencv/cv/src/ |
H A D | cvstereogc.cpp | 137 GCVtx stub, *nil = &stub, *first = nil, *last = nil; local 143 stub.next = nil; 162 last->next = nil; 163 nil->next = 0; 173 while( first != nil ) 192 u->next = nil; 347 u->next = nil;
|
/external/v8/src/ic/ |
H A D | ic.cc | 2401 Handle<Object> CompareNilIC::DoCompareNilSlow(Isolate* isolate, NilValue nil, argument 2421 NilValue nil = stub.nil_value(); local 2434 return DoCompareNilSlow(isolate(), nil, object);
|
/external/v8/src/ |
H A D | code-stubs.h | 1317 CompareNilICStub(Isolate* isolate, NilValue nil) : HydrogenCodeStub(isolate) { argument 1318 set_sub_minor_key(NilValueBits::encode(nil)); 1328 NilValue nil) { 1329 return CompareNilICStub(isolate, nil, UNINITIALIZED).GetCode(); 1361 CompareNilICStub(Isolate* isolate, NilValue nil, argument 1364 set_sub_minor_key(NilValueBits::encode(nil)); 1327 GetUninitialized(Isolate* isolate, NilValue nil) argument
|
/external/v8/src/arm/ |
H A D | full-codegen-arm.cc | 4703 NilValue nil) { 4714 Heap::RootListIndex nil_value = nil == kNullValue ? 4721 Handle<Code> ic = CompareNilICStub::GetUninitialized(isolate(), nil); 4701 EmitLiteralCompareNil(CompareOperation* expr, Expression* sub_expr, NilValue nil) argument
|
/external/v8/src/arm64/ |
H A D | full-codegen-arm64.cc | 4375 NilValue nil) { 4388 Heap::RootListIndex nil_value = nil == kNullValue ? 4394 Handle<Code> ic = CompareNilICStub::GetUninitialized(isolate(), nil); 4373 EmitLiteralCompareNil(CompareOperation* expr, Expression* sub_expr, NilValue nil) argument
|
/external/v8/src/ia32/ |
H A D | full-codegen-ia32.cc | 4666 NilValue nil) { 4677 Handle<Object> nil_value = nil == kNullValue 4684 Handle<Code> ic = CompareNilICStub::GetUninitialized(isolate(), nil); 4664 EmitLiteralCompareNil(CompareOperation* expr, Expression* sub_expr, NilValue nil) argument
|
/external/v8/src/mips/ |
H A D | full-codegen-mips.cc | 4716 NilValue nil) { 4728 Heap::RootListIndex nil_value = nil == kNullValue ? 4734 Handle<Code> ic = CompareNilICStub::GetUninitialized(isolate(), nil); 4714 EmitLiteralCompareNil(CompareOperation* expr, Expression* sub_expr, NilValue nil) argument
|
/external/v8/src/mips64/ |
H A D | full-codegen-mips64.cc | 4717 NilValue nil) { 4729 Heap::RootListIndex nil_value = nil == kNullValue ? 4735 Handle<Code> ic = CompareNilICStub::GetUninitialized(isolate(), nil); 4715 EmitLiteralCompareNil(CompareOperation* expr, Expression* sub_expr, NilValue nil) argument
|
/external/v8/src/x64/ |
H A D | full-codegen-x64.cc | 4676 NilValue nil) { 4687 Heap::RootListIndex nil_value = nil == kNullValue ? 4693 Handle<Code> ic = CompareNilICStub::GetUninitialized(isolate(), nil); 4674 EmitLiteralCompareNil(CompareOperation* expr, Expression* sub_expr, NilValue nil) argument
|
/external/v8/src/x87/ |
H A D | full-codegen-x87.cc | 4655 NilValue nil) { 4666 Handle<Object> nil_value = nil == kNullValue 4673 Handle<Code> ic = CompareNilICStub::GetUninitialized(isolate(), nil); 4653 EmitLiteralCompareNil(CompareOperation* expr, Expression* sub_expr, NilValue nil) argument
|