Searched refs:head2 (Results 1 - 10 of 10) sorted by relevance

/external/zopfli/src/zopfli/
H A Dhash.c53 h->head2 = (int*)malloc(sizeof(*h->head2) * 65536);
57 h->head2[i] = -1;
72 free(h->head2);
122 if (h->head2[h->val2] != -1 && h->hashval2[h->head2[h->val2]] == h->val2) {
123 h->prev2[hpos] = h->head2[h->val2];
126 h->head2[h->val2] = hpos;
H A Dhash.h38 int* head2; /* Hash value to index of its most recent occurance. */ member in struct:ZopfliHash
H A Dlz77.c333 if (hhead != h->head2 && bestlength >= h->same[hpos] &&
336 hhead = h->head2;
/external/dhcpcd-6.8.2/compat/
H A Dqueue.h165 #define TAILQ_CONCAT(head1, head2, field) do { \
166 if (!TAILQ_EMPTY(head2)) { \
167 *(head1)->tqh_last = (head2)->tqh_first; \
168 (head2)->tqh_first->field.tqe_prev = (head1)->tqh_last; \
169 (head1)->tqh_last = (head2)->tqh_last; \
170 TAILQ_INIT((head2)); \
/external/autotest/client/tools/
H A Dboottool29 =head2 new()
33 =head2 read()
39 =head2 write()
45 =head2 print_info()
51 =head2 _info()
57 =head2 get_default()
63 =head2 set_default()
69 =head2 add()
75 =head2 update()
81 =head2 remov
[all...]
/external/freetype/src/base/
H A Dftrfork.c58 unsigned char head[16], head2[16]; local
107 head2[15] = (FT_Byte)( head[15] + 1 ); /* make it be different */
109 error = FT_Stream_Read( stream, (FT_Byte*)head2, 16 );
117 if ( head2[i] != 0 )
119 if ( head2[i] != head[i] )
/external/pdfium/third_party/freetype/src/base/
H A Dftrfork.c58 unsigned char head[16], head2[16]; local
107 head2[15] = (FT_Byte)( head[15] + 1 ); /* make it be different */
109 error = FT_Stream_Read( stream, (FT_Byte*)head2, 16 );
117 if ( head2[i] != 0 )
119 if ( head2[i] != head[i] )
/external/ImageMagick/scripts/
H A Dformat_c_api_docs565 print( OUT head2($func) );
591 sub head2 { subroutine
593 return( "=head2 $heading\n\n" );
/external/antlr/antlr-3.4/runtime/Perl5/lib/ANTLR/
H A DRuntime.pm34 May include numerous subsections (i.e. =head2, =head3, etc.)
/external/skia/src/pathops/
H A DSkPathOpsTSect.h2169 const SkTSpan<OppCurve, TCurve>* head2 = sect2->fHead; local
2170 if (!(zeroOneSet & kZeroS2Set) && approximately_less_than_zero(head2->fStartT)) {
2172 if (head2->isBounded()) {
2173 double t = head2->closestBoundedT(start2);

Completed in 528 milliseconds