| /external/e2fsprogs/lib/support/ |
| D | dict.c | 144 static void free_nodes(dict_t *dict, dnode_t *node, dnode_t *nil) in free_nodes() argument
146 if (node == nil) in free_nodes()
148 free_nodes(dict, node->left, nil); in free_nodes()
149 free_nodes(dict, node->right, nil); in free_nodes()
197 static unsigned int verify_redblack(dnode_t *nil, dnode_t *root) in verify_redblack() argument
201 if (root != nil) { in verify_redblack()
202 height_left = verify_redblack(nil, root->left); in verify_redblack()
203 height_right = verify_redblack(nil, root->right); in verify_redblack()
228 static dictcount_t verify_node_count(dnode_t *nil, dnode_t *root) in verify_node_count() argument
230 if (root == nil) in verify_node_count()
[all …]
|
| /external/f2fs-tools/fsck/ |
| D | dict.c | 136 static void free_nodes(dict_t *dict, dnode_t *node, dnode_t *nil) in free_nodes() argument
138 if (node == nil) in free_nodes()
140 free_nodes(dict, node->left, nil); in free_nodes()
141 free_nodes(dict, node->right, nil); in free_nodes()
188 static unsigned int verify_redblack(dnode_t *nil, dnode_t *root) in verify_redblack() argument
192 if (root != nil) { in verify_redblack()
193 height_left = verify_redblack(nil, root->left); in verify_redblack()
194 height_right = verify_redblack(nil, root->right); in verify_redblack()
218 static dictcount_t verify_node_count(dnode_t *nil, dnode_t *root) in verify_node_count() argument
220 if (root == nil) in verify_node_count()
[all …]
|
| /external/antlr/runtime/ObjC/Framework/ |
| D | RewriteRuleElementStream.m | 66 if ((self = [super init]) != nil) {
73 singleElement = nil;
74 elements = nil;
81 if ((self = [super init]) != nil) {
88 singleElement = nil;
89 elements = nil;
104 singleElement = nil;
118 [self setDescription:nil];
119 [self setTreeAdaptor:nil];
145 if (anElement == nil)
[all …]
|
| D | BaseTree.m | 37 TreeNavigationNodeDown *navigationNodeDown = nil;
38 TreeNavigationNodeUp *navigationNodeUp = nil;
39 TreeNavigationNodeEOF *navigationNodeEOF = nil;
44 static id<BaseTree> invalidNode = nil;
50 if ( invalidNode == nil ) {
58 if ( invalidNode == nil ) {
81 if ( self != nil ) {
82 children = nil;
85 return nil;
91 if ( self != nil ) {
[all …]
|
| D | TreePatternParser.m | 46 if ((self = [super init]) != nil) {
59 if ((self = [super init]) != nil) {
92 return nil; // extra junk on end
94 return nil;
104 if ( root==nil ) {
105 return nil;
118 if ( child == nil ) {
119 return nil;
134 NSString *label = nil;
139 return nil;
[all …]
|
| D | CommonTreeAdaptor.m | 57 if ( t==nil )
58 return nil;
107 * seems like this will yield start=i and stop=i-1 in a nil node.
112 if ( aTree == nil )
116 if ( startToken != nil )
118 if ( stopToken != nil )
126 if ( t == nil )
133 if ( t == nil )
140 if ( t == nil )
141 return nil;
[all …]
|
| D | CommonTree.m | 71 if ( self != nil ) {
72 token = nil;
75 parent = nil;
84 if ( self != nil ) {
89 parent = nil;
98 if ( self != nil ) {
103 parent = nil;
112 if ( self != nil ) {
118 parent = nil;
127 if ( self != nil ) {
[all …]
|
| D | ArrayIterator.m | 60 if ( self != nil ) {
64 userInfo:nil];
73 peekObj = nil;
83 if ( self != nil ) {
87 userInfo:nil];
90 peekObj = nil;
100 if ( self != nil ) {
104 userInfo:nil];
107 peekObj = nil;
125 if ( peekObj == nil ) {
[all …]
|
| D | UnbufferedCommonTreeNodeStream.m | 53 return [self initWithTree:theTree treeAdaptor:nil];
58 if ((self = [super init]) != nil) {
60 if ( theAdaptor == nil )
77 [self setRoot:nil];
78 [self setTreeAdaptor:nil];
80 [nodeStack release]; nodeStack = nil;
81 [indexStack release]; indexStack = nil;
82 [markers release]; markers = nil;
83 [lookahead release]; lookahead = nil;
91 previousNode = nil;
[all …]
|
| D | BaseTreeAdaptor.m | 46 if ( self != nil ) {
65 return [CommonTree newTreeWithToken:nil];
70 return [CommonTree newTreeWithToken:nil];
103 return [self dupTree:(id)tree Parent:nil];
112 if ( t==nil ) {
113 return nil;
141 if ( t != nil && child != nil ) {
146 /** If oldRoot is a nil root, just copy or move the children to newRoot.
147 * If not a nil root, make oldRoot a child of newRoot.
149 * old=^(nil a b c), new=r yields ^(r a b c)
[all …]
|
| D | LinkedList.m | 56 lastReturned = nil;
58 next = (index == count) ? nil : [ll node:anIndex];
90 lastReturned = next = (next == nil) ? ll.last : next.prev;
108 if (lastReturned == nil)
116 lastReturned = nil;
122 if (lastReturned == nil)
131 lastReturned = nil;
132 if (next == nil)
257 LLNode *newNode = [[LLNode newNode:nil element:e next:f] autorelease];
259 if (f == nil)
[all …]
|
| D | HashMap.m | 83 if (k1 == k2 || (k1 != nil && [k1 isEqualTo:k2])) {
86 if (v1 == v2 || (v1 != nil && [v1 isEqualTo:v2]))
94 return (key == nil ? 0 : [key hash]) ^ (value == nil ? 0 : [value hash]);
147 if ( next == nil )
157 return next != nil;
165 if (e == nil)
167 if ((next = e.next) == nil) {
170 if ( next == nil )
180 if (current == nil)
185 current = nil;
[all …]
|
| /external/python/cpython2/Mac/Modules/cg/ |
| D | CFMLateImport.c | 172 MoreAssertQ(fragToFix != nil); in ReadContainerBasics()
173 MoreAssertQ(fragToFix->locator.fileSpec != nil); in ReadContainerBasics()
174 MoreAssertQ(fragToFix->connID != nil); in ReadContainerBasics()
175 MoreAssertQ(fragToFix->loaderSection == nil); in ReadContainerBasics()
176 MoreAssertQ(fragToFix->sectionHeaders == nil); in ReadContainerBasics()
271 MoreAssertQ(inOpStart != nil); in DecodeInstrCountValue()
272 MoreAssertQ(outCount != nil); in DecodeInstrCountValue()
295 MoreAssertQ(packedData != nil); in UnpackPEFDataSection()
296 MoreAssertQ(unpackedData != nil); in UnpackPEFDataSection()
522 packedDataSection = nil; in SetupSectionBaseAddresses()
[all …]
|
| /external/antlr/runtime/ObjC/Framework/examples/polydiff/ |
| D | Simplifier.m | 140 if (tree != nil) [tree release];
141 if (aTree != nil) [aTree retain];
148 self.tree = nil;
178 if (tree != nil) [tree release];
179 if (aTree != nil) [aTree retain];
186 self.tree = nil;
216 if (tree != nil) [tree release];
217 if (aTree != nil) [aTree retain];
224 self.tree = nil;
254 if (tree != nil) [tree release];
[all …]
|
| D | PolyDifferentiator.m | 92 if (tree != nil) [tree release];
93 if (aTree != nil) [aTree retain];
100 self.tree = nil;
144 @"ID", @"INT", @"MULT", @"WS", @"'+'", @"'^'", nil] retain]];
156 if ( self != nil ) {
168 [self setTreeAdaptor:nil];
206 CommonTree *root_0 = nil;
208 CommonTree *_first_0 = nil;
209 CommonTree *_last = nil;
214 CommonTree *c = nil;
[all …]
|
| /external/grpc-grpc/src/objective-c/tests/ |
| D | RxLibraryUnitTests.m | 75 [writeable writesFinishedWithError:nil];
80 XCTAssertEqualObjects(handler.errorOrNil, nil);
86 NSError *anyError = [NSError errorWithDomain:@"domain" code:7 userInfo:nil];
94 XCTAssertEqualObjects(handler.value, nil);
102 NSError *anyError = [NSError errorWithDomain:@"domain" code:7 userInfo:nil];
112 XCTAssertEqualObjects(handler.errorOrNil, nil);
124 [writeable writesFinishedWithError:nil];
129 XCTAssertEqualObjects(handler.errorOrNil, nil);
138 [writeable writesFinishedWithError:nil];
142 XCTAssertEqualObjects(handler.value, nil);
[all …]
|
| /external/antlr/runtime/ObjC/Framework/test/runtime/tree/ |
| D | CommonTreeTest.m | 22 STAssertNotNil(tree, @"Tree was nil");
30 STAssertNotNil(tree, @"Tree was nil");
31 if (tree != nil)
44 STAssertNotNil(tree, @"Tree was nil");
45 if (tree != nil)
46 STAssertNotNil(tree.token, @"Tree with token was nil");
47 if (tree != nil && tree.token != nil) {
50 STAssertNotNil(((CommonToken *)tree.token).text, @"Tree with token with text was nil");
52 if (tree != nil && tree.token != nil && tree.token.text != nil)
61 STAssertNotNil(tree, @"Tree was nil");
[all …]
|
| /external/clang/test/Analysis/inlining/ |
| D | inline-defensive-checks.m | 47 // Test nil receiver suppression.
48 // We only suppress on nil receiver if the nil value is directly causing the bug.
74 // On a path where fPtr is nil, mem should be nil.
82 // On a path where fPtr is nzil, mem should be nil.
90 // On a path where fPtr is nzil, mem should be nil.
98 // On a path where fPtr is nil, mem should be nil.
99 // The warning is not suppressed because the receiver being nil is not
110 // On a path where fPtr is nil, mem should be nil.
111 // The warning is not suppressed because the receiver being nil is not
122 // On a path where fPtr is nil, mem should be nil.
[all …]
|
| /external/python/cpython3/Lib/test/test_email/data/ |
| D | msg_43.txt | 2 X-VM-v5-Data: ([nil nil nil nil nil nil nil nil nil]
3 …nil nil nil nil nil nil nil "MAILER DAEMON <>" "MAILER DAEMON <>" nil nil "Banned file: auto__mail…
4 nil)
|
| /external/python/cpython2/Lib/email/test/data/ |
| D | msg_43.txt | 2 X-VM-v5-Data: ([nil nil nil nil nil nil nil nil nil]
3 …nil nil nil nil nil nil nil "MAILER DAEMON <>" "MAILER DAEMON <>" nil nil "Banned file: auto__mail…
4 nil)
|
| /external/antlr/runtime/ObjC/Framework/examples/simplecTreeParser/ |
| D | SimpleCParser.m | 45 #define dfa2_T_empty nil
87 dfa2_T5, dfa2_T8, dfa2_T4, dfa2_T2, nil, dfa2_T6, dfa2_T0, dfa2_T1,
88 nil, nil, dfa2_T3, dfa2_T7, dfa2_T1
101 if ( self != nil ) {
113 return nil;
293 if (tree != nil) [tree release];
294 if (aTree != nil) [aTree retain];
301 self.tree = nil;
331 if (tree != nil) [tree release];
332 if (aTree != nil) [aTree retain];
[all …]
|
| /external/skia/src/gpu/mtl/ |
| D | GrMtlBuffer.mm | 38 fMtlBuffer = size == 0 ? nil :
51 SkASSERT(fMtlBuffer == nil);
52 SkASSERT(fMappedBuffer == nil);
57 if (fMtlBuffer == nil) {
66 if (fMapPtr == nil) {
84 fMtlBuffer = nil;
85 fMappedBuffer = nil;
94 fMtlBuffer = nil;
95 fMappedBuffer = nil;
118 // SkASSERT(fMappedBuffer == nil);
[all …]
|
| D | GrMtlRenderTarget.mm | 21 , fResolveTexture(nil) {
33 , fResolveTexture(nil) {
40 SkASSERT(nil != renderTexture);
47 SkASSERT(nil == fRenderTexture);
48 SkASSERT(nil == fResolveTexture);
67 fRenderTexture = nil;
68 fResolveTexture = nil;
73 fRenderTexture = nil;
74 fResolveTexture = nil;
|
| /external/clang/test/Analysis/ |
| D | NSContainers.m | 115 …ddObject:0]; // expected-warning {{Argument to 'NSMutableArray' method 'addObject:' cannot be nil}}
120 …; // expected-warning {{Argument to 'NSMutableArray' method 'insertObject:atIndex:' cannot be nil}}
125 …ed-warning {{Argument to 'NSMutableArray' method 'replaceObjectAtIndex:withObject:' cannot be nil}}
130 …ected-warning {{Argument to 'NSMutableArray' method 'setObject:atIndexedSubscript:' cannot be nil}}
135 marray[1] = 0; // expected-warning {{Array element cannot be nil}}
141 …bject:0]; // expected-warning {{Argument to 'NSArray' method 'arrayByAddingObject:' cannot be nil}}
146 …etObject:0 forKey:key]; // expected-warning {{Value argument to 'setObject:forKey:' cannot be nil}}
150 … setObject:obj forKey:0]; // expected-warning {{Key argument to 'setObject:forKey:' cannot be nil}}
154 …emoveObjectForKey:0]; // expected-warning {{Value argument to 'removeObjectForKey:' cannot be nil}}
163 d[key] = 0; // expected-warning {{'NSMutableDictionary' key cannot be nil}}
[all …]
|
| /external/clang/test/SemaTemplate/ |
| 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];
|