| /external/iptables/libiptc/ |
| D | linux_list.h | 54 struct list_head *next, *prev; member
74 struct list_head *next) in __list_add()
115 struct list_head * prev, struct list_head * next) in __list_add_rcu()
174 static inline void __list_del(struct list_head * prev, struct list_head * next) in __list_del()
279 struct list_head *next = head->next; in list_empty_careful() local
370 #define list_for_each_safe(pos, n, head) \ argument
431 #define list_for_each_entry_safe(pos, n, head, member) \ argument
465 #define list_for_each_safe_rcu(pos, n, head) \ argument
514 struct hlist_node *next, **pprev; member
532 static inline void __hlist_del(struct hlist_node *n) in __hlist_del()
[all …]
|
| /external/v8/test/mjsunit/es6/ |
| D | iteration-semantics.js | 50 function next() { function
55 return wrap_iterator({ next: next, n: 0 }); property
60 function next() { function
63 return wrap_iterator({ next: next }); property
66 function* integers_from(n) { argument
87 function* take(iterable, n) { argument
95 function nth(iterable, n) { argument
102 function* skip_every(iterable, n) { argument
149 function remove_next_after(iterable, n) { argument
151 function next() { function
[all …]
|
| /external/iproute2/include/ |
| D | hlist.h | 16 struct hlist_node *next, **pprev; member
19 static inline void hlist_del(struct hlist_node *n) in hlist_del()
21 struct hlist_node *next = n->next; in hlist_del() local
28 static inline void hlist_add_head(struct hlist_node *n, struct hlist_head *h) in hlist_add_head()
42 #define hlist_for_each_safe(pos, n, head) \ argument
|
| /external/google-tv-pairing-protocol/java/src/com/google/polo/json/ |
| D | JSONTokener.java | 125 public char next() throws JSONException { in next() method in JSONTokener
157 public char next(char c) throws JSONException { in next() method in JSONTokener
158 char n = next(); in next() local
176 public String next(int n) throws JSONException { in next() method in JSONTokener
|
| /external/owasp/sanitizer/src/main/org/owasp/html/ |
| D | Encoding.java | 50 int n = s.length(); in decodeHtml() local
109 char next = sb.charAt(i+1); in stripBannedCodeunits() local
133 int n = s.length(), i; in longestPrefixOfGoodCodeunits() local
166 int n = plainText.length(); in encodeHtmlOnto() local
178 char next; in encodeHtmlOnto() local
|
| /external/webp/src/enc/ |
| D | token.c | 58 VP8Tokens* const next = p->next_; in VP8TBufferClear() local
115 int n = first; in VP8RecordCoeffTokens() local
229 const VP8Tokens* const next = p->next_; in VP8EmitTokens() local
231 int n = b->page_size_; in VP8EmitTokens() local
255 const VP8Tokens* const next = p->next_; in VP8EstimateTokenSize() local
257 int n = b->page_size_; in VP8EstimateTokenSize() local
|
| /external/skia/src/core/ |
| D | SkTLS.cpp | 27 int n = sk_atomic_inc(&gTLSRecCount); in SkTLSRec() local
39 int n = sk_atomic_dec(&gTLSRecCount); in ~SkTLSRec() local
52 SkTLSRec* next = rec->fNext; in Destructor() local
116 SkTLSRec* next = curr->fNext; in Delete() local
|
| D | SkLinearBitmapPipeline.cpp | 131 PointProcessor(Next* next, Args&&... args) in PointProcessor()
135 void VECTORCALL pointListFew(int n, Sk4f xs, Sk4f ys) override { in pointListFew()
161 BilerpProcessor(Next* next, Args&&... args) in BilerpProcessor()
165 void VECTORCALL pointListFew(int n, Sk4f xs, Sk4f ys) override { in pointListFew()
192 void VECTORCALL pointListFew(int n, Sk4f xs, Sk4f ys) override { in pointListFew()
218 bool maybeProcessSpan(SkPoint start, SkScalar length, int count, Next* next) { in maybeProcessSpan()
240 bool maybeProcessSpan(SkPoint start, SkScalar length, int count, Next* next) { in maybeProcessSpan()
270 bool maybeProcessSpan(SkPoint start, SkScalar length, int count, Next* next) { in maybeProcessSpan()
283 SkLinearBitmapPipeline::PointProcessorInterface* next, in choose_matrix()
313 ExpandBilerp(Next* next) : fNext{next} { } in ExpandBilerp()
[all …]
|
| /external/zlib/src/ |
| D | infback.c | 93 static code *next; local
183 #define NEEDBITS(n) \ argument
190 #define BITS(n) \ argument
194 #define DROPBITS(n) \ argument
258 z_const unsigned char FAR *next; /* next input */ local
|
| /external/opencv3/3rdparty/zlib/ |
| D | infback.c | 93 static code *next; local
183 #define NEEDBITS(n) \ argument
190 #define BITS(n) \ argument
194 #define DROPBITS(n) \ argument
258 z_const unsigned char FAR *next; /* next input */ local
|
| /external/pdfium/third_party/zlib_v128/ |
| D | infback.c | 93 static code *next; in fixedtables() local
183 #define NEEDBITS(n) \ argument
190 #define BITS(n) \ argument
194 #define DROPBITS(n) \ argument
258 z_const unsigned char FAR *next; /* next input */ in inflateBack() local
|
| /external/e2fsprogs/lib/ext2fs/ |
| D | blkmap64_rb.c | 86 struct rb_node *new_node, *node, *next; in check_tree() local
210 struct rb_node *node, *next; in rb_free_tree() local
236 struct rb_node *dest_node, *src_node, *dest_last, **n; in rb_copy_bmap() local
325 struct rb_node *parent = NULL, *next; in rb_test_bit() local
326 struct rb_node **n = &bp->root.rb_node; in rb_test_bit() local
388 struct rb_node *parent = NULL, **n = &root->rb_node; in rb_insert_extent() local
389 struct rb_node *new_node, *node, *next; in rb_insert_extent() local
489 struct rb_node *parent = NULL, **n = &root->rb_node; in rb_remove_extent() local
630 struct rb_node *parent = NULL, **n; in rb_test_clear_bmap_extent() local
631 struct rb_node *node, *next; in rb_test_clear_bmap_extent() local
[all …]
|
| /external/f2fs-tools/include/ |
| D | list.h | 14 struct list_head *next, *prev; member
30 struct list_head *next) in __list_add()
48 static inline void __list_del(struct list_head * prev, struct list_head * next) in __list_del()
77 #define list_for_each_safe(pos, n, head) \ argument
84 #define list_for_each_entry_safe(pos, n, head, member) \ argument
|
| /external/opencv3/modules/flann/include/opencv2/flann/ |
| D | random.h | 93 UniqueRandom(int n) in UniqueRandom()
102 void init(int n) in init()
120 int next() in next() function
|
| /external/zlib/src/contrib/infback9/ |
| D | infback9.c | 57 code *next, *lenfix, *distfix; in makefixed9() local
150 #define NEEDBITS(n) \ argument
157 #define BITS(n) \ argument
161 #define DROPBITS(n) \ argument
225 z_const unsigned char FAR *next; /* next input */ local
|
| /external/libdrm/amdgpu/ |
| D | util_hash.c | 78 struct util_node *next; member
197 int n = hash->numBuckets; in util_data_first_node() local
268 int n = hash->data.d->numBuckets; in util_hash_delete() local
272 struct util_node *next = cur->next; in util_hash_delete() local
307 struct util_node *next; in util_hash_data_next() member
313 int n; in util_hash_data_next() local
337 struct util_hash_iter next = {iter.hash, util_hash_data_next(iter.node)}; in util_hash_iter_next() local
353 struct util_node *next = (*node)->next; in util_hash_take() local
|
| /external/icu/icu4j/eclipse-build/plugins.template/com.ibm.icu.base/src/com/ibm/icu/text/ |
| D | BreakIterator.java | 278 public abstract int next(int n); in next() method in BreakIterator
291 public abstract int next(); in next() method in BreakIterator
764 public int next(int n) { in next() method in BreakIterator.BreakIteratorHandle
767 public int next() { in next() method in BreakIterator.BreakIteratorHandle
|
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| D | RedundentExprEliminator.java | 123 int n = paths.size(); in eleminateRedundent() local
167 MultistepExprHolder next = list; in eleminateSharedPartialPaths() local
304 MultistepExprHolder next = head; in findCommonAncestor() local
384 MultistepExprHolder next = head; in isNotSameAsOwner() local
497 AxesWalker next = (AxesWalker)walker.getNextWalker().clone(); in createIteratorFromSteps() local
557 int n = paths.size(); in createMultistepExprList() local
605 int n = paths.size(); in findAndEliminateRedundant() local
684 int n = paths.size(); in oldFindAndEliminateRedundant() local
1273 int n = paths.size(); in validateNewAddition() local
1321 MultistepExprHolder(ExpressionOwner exprOwner, int stepCount, MultistepExprHolder next) in MultistepExprHolder() method in RedundentExprEliminator.MultistepExprHolder
[all …]
|
| /external/blktrace/btt/ |
| D | list.h | 35 struct list_head *next, *prev; member
57 struct list_head *next) in __list_add()
98 static inline void __list_del(struct list_head * prev, struct list_head * next) in __list_del()
136 #define list_for_each_safe(pos, n, head) \ argument
152 int n = 0; in list_len() local
|
| /external/boringssl/src/crypto/lhash/ |
| D | lhash.c | 104 LHASH_ITEM *n, *next; in lh_free() local
166 LHASH_ITEM **new_buckets, *cur, *next; in lh_rebucket() local
281 LHASH_ITEM *cur, *next; in lh_doall_internal() local
326 long n; in lh_strhash() local
|
| /external/e2fsprogs/e2fsck/ |
| D | mtrace.h | 85 #define memset(s, zero, n) bzero ((s), (n)) argument
88 #define memcpy(d, s, n) bcopy ((s), (d), (n)) argument
142 size_t next; /* Index of next free cluster. */ member
166 struct list *next; member
176 struct alignlist *next; member
|
| /external/autotest/client/tests/monotonic_time/src/ |
| D | cpuset.c | 37 char *next; in parse_cpu_set() local
89 int n; in show_range() local
124 int n; in show_cpu_set() local
135 int n; in show_cpu_set() local
|
| /external/skia/src/views/ |
| D | SkEvent.cpp | 133 int32_t n; in inflate() local
155 int32_t n; in inflate() local
262 …#define EVENT_LOGN(s, n) do { SkString str(s); str.append(" "); str.appendS32(n); event_log(str… argument
265 #define EVENT_LOGN(s, n) argument
456 SkEvent* next = evt->fNextEvent; in ServiceQueueTimer() local
497 SkEvent* next = evt->fNextEvent; in Term() local
504 SkEvent* next = evt->fNextEvent; in Term() local
|
| /external/icu/icu4j/main/classes/localespi/src/com/ibm/icu/impl/jdkadapter/ |
| D | BreakIteratorICU.java | 71 public int next() { in next() method in BreakIteratorICU
76 public int next(int n) { in next() method in BreakIteratorICU
|
| /external/skia/tests/ |
| D | LListTest.cpp | 196 int n = random.nextULessThan(list1.count()); in test_tllist() local
203 Iter next(iter); in test_tllist() local
240 int n = random.nextULessThan(list1.count()); in test_tllist() local
262 Iter next = iter; in test_tllist() local
|