| /external/usrsctp/usrsctplib/ |
| D | user_queue.h | 219 #define SLIST_SWAP(head1, head2, type) do { \ argument
221 SLIST_FIRST(head1) = SLIST_FIRST(head2); \
222 SLIST_FIRST(head2) = swap_first; \
245 #define STAILQ_CONCAT(head1, head2) do { \ argument
246 if (!STAILQ_EMPTY((head2))) { \
247 *(head1)->stqh_last = (head2)->stqh_first; \
248 (head1)->stqh_last = (head2)->stqh_last; \
249 STAILQ_INIT((head2)); \
325 #define STAILQ_SWAP(head1, head2, type) do { \ argument
328 STAILQ_FIRST(head1) = STAILQ_FIRST(head2); \
[all …]
|
| /external/adhd/cras/src/common/ |
| D | utlist.h | 70 #define LL_CONCAT(head1, head2) \ argument
77 _tmp->next = (head2); \
79 (head1) = (head2); \
181 #define DL_CONCAT(head1, head2) \ argument
184 if (head2) { \
186 _tmp = (head2)->prev; \
187 (head2)->prev = (head1)->prev; \
188 (head1)->prev->next = (head2); \
191 (head1) = (head2); \
|
| /external/zopfli/src/zopfli/ |
| D | hash.c | 53 h->head2 = (int*)malloc(sizeof(*h->head2) * 65536); in ZopfliInitHash()
57 h->head2[i] = -1; in ZopfliInitHash()
72 free(h->head2); in ZopfliCleanHash()
122 if (h->head2[h->val2] != -1 && h->hashval2[h->head2[h->val2]] == h->val2) { in ZopfliUpdateHash()
123 h->prev2[hpos] = h->head2[h->val2]; in ZopfliUpdateHash()
126 h->head2[h->val2] = hpos; in ZopfliUpdateHash()
|
| D | hash.h | 38 int* head2; /* Hash value to index of its most recent occurance. */ member
|
| D | lz77.c | 333 if (hhead != h->head2 && bestlength >= h->same[hpos] && in ZopfliFindLongestMatch()
336 hhead = h->head2; in ZopfliFindLongestMatch()
|
| /external/llvm-project/polly/lib/External/ppcg/m4/ |
| D | ax_detect_git_head.m4 | 14 head2=`echo $head | sed -e 's/[^0-9a-f]//'`
15 head3=`echo $head2 | sed -e 's/........................................//'`
16 if test "x$head3" = "x" -a "x$head" = "x$head2"; then
|
| /external/libiio/src/iiod/ |
| D | queue.h | 274 #define STAILQ_CONCAT(head1, head2) do { \ argument
275 if (!STAILQ_EMPTY((head2))) { \
276 *(head1)->stqh_last = (head2)->stqh_first; \
277 (head1)->stqh_last = (head2)->stqh_last; \
278 STAILQ_INIT((head2)); \
445 #define TAILQ_CONCAT(head1, head2, field) do { \ argument
446 if (!TAILQ_EMPTY(head2)) { \
447 *(head1)->tqh_last = (head2)->tqh_first; \
448 (head2)->tqh_first->field.tqe_prev = (head1)->tqh_last; \
449 (head1)->tqh_last = (head2)->tqh_last; \
[all …]
|
| /external/llvm-project/polly/lib/External/isl/m4/ |
| D | ax_detect_git_head.m4 | 19 head2=`echo $head | sed -e 's/[^0-9a-f]//'`
20 head3=`echo $head2 | sed -e 's/........................................//'`
21 if test "x$head3" = "x" -a "x$head" = "x$head2"; then
|
| /external/python/cpython2/Lib/ |
| D | ntpath.py | 187 head2 = head
188 while head2 and head2[-1] in '/\\':
189 head2 = head2[:-1]
190 head = head2 or head
|
| /external/antlr/runtime/Perl5/docs/ |
| D | design.pod | 21 =head2 OO
34 =head2 Exceptions
39 =head2 Types
|
| /external/freetype/src/base/ |
| D | ftrfork.c | 57 unsigned char head[16], head2[16]; in FT_Raccess_Get_HeaderInfo() local
131 head2[15] = (FT_Byte)( head[15] + 1 ); /* make it be different */ in FT_Raccess_Get_HeaderInfo()
133 error = FT_Stream_Read( stream, (FT_Byte*)head2, 16 ); in FT_Raccess_Get_HeaderInfo()
141 if ( head2[i] != 0 ) in FT_Raccess_Get_HeaderInfo()
143 if ( head2[i] != head[i] ) in FT_Raccess_Get_HeaderInfo()
|
| /external/ImageMagick/scripts/ |
| D | format_c_api_docs | 565 print( OUT head2($func) );
591 sub head2 { subroutine
|
| /external/mesa3d/src/util/ |
| D | list.h | 256 #define list_pair_for_each_entry(type, pos1, pos2, head1, head2, member) \ argument
258 *pos2 = LIST_ENTRY(type, (head2)->next, member); \
259 &pos1->member != (head1) && &pos2->member != (head2); \
|
| /external/lmfit/man/ |
| D | lmmin.pod | 172 =head2 Initializing parameter records.
191 =head2 Fitting a surface
270 =head2 More examples
|
| /external/skqp/src/pathops/ |
| D | SkPathOpsTSect.cpp | 1999 const SkTSpan* head2 = sect2->fHead; in BinarySearch() local
2000 if (!(zeroOneSet & kZeroS2Set) && approximately_less_than_zero(head2->fStartT)) { in BinarySearch()
2002 if (head2->isBounded()) { in BinarySearch()
2003 double t = head2->closestBoundedT(start2); in BinarySearch()
|
| /external/skia/src/pathops/ |
| D | SkPathOpsTSect.cpp | 1999 const SkTSpan* head2 = sect2->fHead; in BinarySearch() local
2000 if (!(zeroOneSet & kZeroS2Set) && approximately_less_than_zero(head2->fStartT)) { in BinarySearch()
2002 if (head2->isBounded()) { in BinarySearch()
2003 double t = head2->closestBoundedT(start2); in BinarySearch()
|
| /external/llvm-project/polly/lib/External/isl/doc/ |
| D | user.pod | 23 =head2 Backward Incompatible Changes
350 =head2 Installation from the git repository
384 =head2 Common installation instructions
447 =head2 Memory Management
510 =head2 Initialization
644 =head2 Return Types
683 =head2 Values
878 =head2 Sets and Relations
896 =head2 Error Handling
953 =head2 Identifiers
[all …]
|
| /external/llvm-project/polly/lib/External/ppcg/ |
| D | configure | 12210 head2=`echo $head | sed -e 's/^0-9a-f//'`
12211 head3=`echo $head2 | sed -e 's/........................................//'`
12212 if test "x$head3" = "x" -a "x$head" = "x$head2"; then
|
| /external/llvm-project/polly/lib/External/isl/ |
| D | configure | 21147 head2=`echo $head | sed -e 's/^0-9a-f//'`
21148 head3=`echo $head2 | sed -e 's/........................................//'`
21149 if test "x$head3" = "x" -a "x$head" = "x$head2"; then
|