| /external/openssl/crypto/modes/asm/ |
| ghash-s390x.pl | 59 $Htbl="%r3";
171 lg $Zlo,8($nlo,$Htbl)
172 lg $Zhi,0($nlo,$Htbl)
183 xg $Zlo,8($nhi,$Htbl)
184 xg $Zhi,0($nhi,$Htbl)
194 xg $Zlo,8($nlo,$Htbl)
197 xg $Zhi,0($nlo,$Htbl)
209 xg $Zlo,8($nhi,$Htbl)
210 xg $Zhi,0($nhi,$Htbl)
221 xg $Zlo,8($nlo,$Htbl)
[all...] |
| ghash-sparcv9.pl | 65 $Htbl="%i1";
89 add $Htbl,8,$Htblo
100 ldx [$Htbl+$nlo],$Zhi
106 ldx [$Htbl+$nhi],$Thi
127 ldx [$Htbl+$nlo],$Thi
143 ldx [$Htbl+$nhi],$Thi
161 ldx [$Htbl+$nlo],$Thi
179 ldx [$Htbl+$nhi],$Thi
200 ldx [$Htbl+$nhi],$Thi
227 add $Htbl,8,$Htbl
[all...] |
| ghash-x86_64.pl | 64 $Htbl="%rsi";
95 mov 8($Htbl,$nlo),$Zlo
96 mov ($Htbl,$nlo),$Zhi
108 xor 8($Htbl,$nhi),$Zlo
110 xor ($Htbl,$nhi),$Zhi
123 xor 8($Htbl,$nlo),$Zlo
125 xor ($Htbl,$nlo),$Zhi
138 xor 8($Htbl,$nlo),$Zlo
140 xor ($Htbl,$nlo),$Zhi
150 xor 8($Htbl,$nhi),$Zl
[all...] |
| ghash-x86.pl | 127 $Htbl = "esi";
138 &mov ($Zhh,&DWP(4,$Htbl,$Zll));
139 &mov ($Zhl,&DWP(0,$Htbl,$Zll));
140 &mov ($Zlh,&DWP(12,$Htbl,$Zll));
141 &mov ($Zll,&DWP(8,$Htbl,$Zll));
170 &xor ($Zll,&DWP(8,$Htbl,$rem));
171 &xor ($Zlh,&DWP(12,$Htbl,$rem));
172 &xor ($Zhl,&DWP(0,$Htbl,$rem));
173 &xor ($Zhh,&DWP(4,$Htbl,$rem));
202 &xor ($Zll,&DWP(8,$Htbl,$rem))
[all...] |
| ghash-armv4.pl | 64 $Htbl="r1";
151 add $Zhh,$Htbl,$nlo,lsl#4
152 ldmia $Zhh,{$Zll-$Zhh} @ load Htbl[nlo]
153 add $Thh,$Htbl,$nhi
157 ldmia $Thh,{$Tll-$Thh} @ load Htbl[nhi]
174 add $Thh,$Htbl,$nlo,lsl#4
178 ldmia $Thh,{$Tll-$Thh} @ load Htbl[nlo]
189 add $Thh,$Htbl,$nhi
193 ldmia $Thh,{$Tll-$Thh} @ load Htbl[nhi]
239 add $Zhh,$Htbl,$nlo,lsl#
[all...] |
| ghash-alpha.pl | 16 # Htbl and Z.hi updates for 8 cycles per byte, measured performance is
35 $Htbl="a1";
58 addq $nlo,$Htbl,$nlo
60 addq $nhi,$Htbl,$nhi
83 addq $nlo,$Htbl,$nlo
85 addq $nhi,$Htbl,$nhi
117 addq $nlo,$Htbl,$nlo
118 addq $nhi,$Htbl,$nhi
158 addq $nlo,$Htbl,$nlo
159 addq $nhi,$Htbl,$nh
[all...] |
| ghash-ia64.pl | 70 (p18) add Hi[1]=Htbl,Hi[1] };;
84 (p17) add Hi[0]=Htbl,Hi[0]
96 Xi=r24; Htbl=r25;
111 { .mii; $ADDP Htbl=8,in1 // &Htbl[0].lo
131 { .mii; add Hi[1]=Htbl,Hi[1] // &Htbl[nlo].lo
155 $Htbl="in1";
190 { .mfi; $ADDP r8=0+0,$Htbl
191 $ADDP r9=0+8,$Htbl }
[all...] |
| ghash-armv4.s | 43 ldmia r7,{r4-r7} @ load Htbl[nlo]
48 ldmia r11,{r8-r11} @ load Htbl[nhi]
69 ldmia r11,{r8-r11} @ load Htbl[nlo]
84 ldmia r11,{r8-r11} @ load Htbl[nhi]
188 ldmia r7,{r4-r7} @ load Htbl[nlo]
193 ldmia r11,{r8-r11} @ load Htbl[nhi]
212 ldmia r11,{r8-r11} @ load Htbl[nlo]
227 ldmia r11,{r8-r11} @ load Htbl[nhi]
|
| ghash-parisc.pl | 54 $Htbl="%r25";
57 $Hhh=$Htbl; # variables
126 ldo 8($Htbl),$Hll
217 ldo 12($Htbl),$Hll
218 ldo 8($Htbl),$Hlh
219 ldo 4($Htbl),$Hhl
382 ldo 8($Htbl),$Hll
484 ldo 12($Htbl),$Hll
485 ldo 8($Htbl),$Hlh
486 ldo 4($Htbl),$Hh
[all...] |
| /external/jpeg/ |
| jchuff.h | 47 JPP((j_compress_ptr cinfo, JHUFF_TBL * htbl, long freq[]));
|
| jcapimin.c | 123 JHUFF_TBL * htbl; local
131 if ((htbl = cinfo->dc_huff_tbl_ptrs[i]) != NULL)
132 htbl->sent_table = suppress;
133 if ((htbl = cinfo->ac_huff_tbl_ptrs[i]) != NULL)
134 htbl->sent_table = suppress;
|
| jdhuff.h | 177 #define HUFF_DECODE(result,state,htbl,failaction,slowlabel) \
187 if ((nb = htbl->look_nbits[look]) != 0) { \
189 result = htbl->look_sym[look]; \
193 if ((result=jpeg_huff_decode(&state,get_buffer,bits_left,htbl,nb)) < 0) \
202 register int bits_left, d_derived_tbl * htbl, int min_bits));
|
| jcmarker.c | 187 JHUFF_TBL * htbl; local
191 htbl = cinfo->ac_huff_tbl_ptrs[index];
194 htbl = cinfo->dc_huff_tbl_ptrs[index];
197 if (htbl == NULL)
200 if (! htbl->sent_table) {
205 length += htbl->bits[i];
211 emit_byte(cinfo, htbl->bits[i]);
214 emit_byte(cinfo, htbl->huffval[i]);
216 htbl->sent_table = TRUE;
|
| jdhuff.c | 153 JHUFF_TBL *htbl; local
162 * paralleling the order of the symbols themselves in htbl->huffval[].
168 htbl =
170 if (htbl == NULL)
179 dtbl->pub = htbl; /* fill in back link */
185 i = (int) htbl->bits[l];
218 if (htbl->bits[l]) {
223 p += htbl->bits[l];
242 for (i = 1; i <= (int) htbl->bits[l]; i++, p++) {
248 dtbl->look_sym[lookbits] = htbl->huffval[p]
[all...] |
| jchuff.c | 182 JHUFF_TBL *htbl; local
190 * paralleling the order of the symbols themselves in htbl->huffval[].
196 htbl =
198 if (htbl == NULL)
212 i = (int) htbl->bits[l];
258 i = htbl->huffval[p];
677 * Generate the best Huffman code table for the given counts, fill htbl.
705 jpeg_gen_optimal_table (j_compress_ptr cinfo, JHUFF_TBL * htbl, long freq[])
820 MEMCOPY(htbl->bits, bits, SIZEOF(htbl->bits))
[all...] |
| install.doc | 631 for (i = 1; i <= (int) htbl->bits[l]; i++)
[all...] |
| /external/qemu/distrib/jpeg-6b/ |
| jchuff.h | 47 JPP((j_compress_ptr cinfo, JHUFF_TBL * htbl, long freq[]));
|
| jcapimin.c | 123 JHUFF_TBL * htbl; local
131 if ((htbl = cinfo->dc_huff_tbl_ptrs[i]) != NULL)
132 htbl->sent_table = suppress;
133 if ((htbl = cinfo->ac_huff_tbl_ptrs[i]) != NULL)
134 htbl->sent_table = suppress;
|
| jdhuff.h | 177 #define HUFF_DECODE(result,state,htbl,failaction,slowlabel) \
187 if ((nb = htbl->look_nbits[look]) != 0) { \
189 result = htbl->look_sym[look]; \
193 if ((result=jpeg_huff_decode(&state,get_buffer,bits_left,htbl,nb)) < 0) \
202 register int bits_left, d_derived_tbl * htbl, int min_bits));
|
| jcmarker.c | 187 JHUFF_TBL * htbl; local
191 htbl = cinfo->ac_huff_tbl_ptrs[index];
194 htbl = cinfo->dc_huff_tbl_ptrs[index];
197 if (htbl == NULL)
200 if (! htbl->sent_table) {
205 length += htbl->bits[i];
211 emit_byte(cinfo, htbl->bits[i]);
214 emit_byte(cinfo, htbl->huffval[i]);
216 htbl->sent_table = TRUE;
|
| jdhuff.c | 153 JHUFF_TBL *htbl; local
162 * paralleling the order of the symbols themselves in htbl->huffval[].
168 htbl =
170 if (htbl == NULL)
179 dtbl->pub = htbl; /* fill in back link */
185 i = (int) htbl->bits[l];
218 if (htbl->bits[l]) {
223 p += htbl->bits[l];
242 for (i = 1; i <= (int) htbl->bits[l]; i++, p++) {
248 dtbl->look_sym[lookbits] = htbl->huffval[p]
[all...] |
| jchuff.c | 182 JHUFF_TBL *htbl; local
190 * paralleling the order of the symbols themselves in htbl->huffval[].
196 htbl =
198 if (htbl == NULL)
212 i = (int) htbl->bits[l];
258 i = htbl->huffval[p];
677 * Generate the best Huffman code table for the given counts, fill htbl.
705 jpeg_gen_optimal_table (j_compress_ptr cinfo, JHUFF_TBL * htbl, long freq[])
820 MEMCOPY(htbl->bits, bits, SIZEOF(htbl->bits))
[all...] |
| install.doc | 631 for (i = 1; i <= (int) htbl->bits[l]; i++)
[all...] |
