HomeSort by relevance Sort by last modified time
    Searched refs:bc (Results 1 - 25 of 87) sorted by null

1 2 3 4

  /external/libvpx/vp8/encoder/
boolhuff.h 37 extern void vp8_start_encode(BOOL_CODER *bc, unsigned char *buffer);
38 extern void vp8_encode_bool(BOOL_CODER *bc, int x, int context);
40 extern void vp8_stop_encode(BOOL_CODER *bc);
bitstream.c 121 vp8_writer *const w = & cpi->bc;
143 static void write_ymode(vp8_writer *bc, int m, const vp8_prob *p)
145 vp8_write_token(bc, vp8_ymode_tree, p, vp8_ymode_encodings + m);
148 static void kfwrite_ymode(vp8_writer *bc, int m, const vp8_prob *p)
150 vp8_write_token(bc, vp8_kf_ymode_tree, p, vp8_kf_ymode_encodings + m);
153 static void write_uv_mode(vp8_writer *bc, int m, const vp8_prob *p)
155 vp8_write_token(bc, vp8_uv_mode_tree, p, vp8_uv_mode_encodings + m);
159 static void write_bmode(vp8_writer *bc, int m, const vp8_prob *p)
161 vp8_write_token(bc, vp8_bmode_tree, p, vp8_bmode_encodings + m);
164 static void write_split(vp8_writer *bc, int x
1067 vp8_writer *const bc = & cpi->bc; local
1369 vp8_writer *const bc = & cpi->bc; local
    [all...]
  /external/qemu/slirp/
bootp.c 55 BOOTPClient *bc; local
59 bc = &bootp_clients[i];
60 if (!bc->allocated || !memcmp(macaddr, bc->macaddr, 6))
65 bc = &bootp_clients[i];
66 bc->allocated = 1;
68 return bc;
76 BOOTPClient *bc; local
80 bc = &bootp_clients[(req_addr & 0xff) - START_ADDR];
81 if (!bc->allocated || !memcmp(macaddr, bc->macaddr, 6))
91 BOOTPClient *bc; local
155 BOOTPClient *bc = NULL; local
    [all...]
  /external/qemu/slirp-android/
bootp.c 56 BOOTPClient *bc; local
60 bc = &bootp_clients[i];
61 if (!bc->allocated || !memcmp(macaddr, bc->macaddr, 6))
66 bc = &bootp_clients[i];
67 bc->allocated = 1;
71 return bc;
79 BOOTPClient *bc; local
83 bc = &bootp_clients[(req_addr & 0xff) - START_ADDR];
84 if (!bc->allocated || !memcmp(macaddr, bc->macaddr, 6))
94 BOOTPClient *bc; local
160 BOOTPClient *bc = NULL; local
    [all...]
  /frameworks/base/media/libstagefright/codecs/m4v_h263/dec/src/
chvr_filter.cpp 36 int br, bc, incr, mbr, mbc; local
91 for (bc = mbc; bc < mbc + 2; bc++) /* bc is the column counter in blocks */
95 if (br < pp_h && bc < pp_w)
99 * bc * 8 is the pixel column offset */
100 ptr = rec + (brwidth << 6) + (bc << 3);
103 index = brwidth + bc;
239 }/*bc*/
    [all...]
chv_filter.cpp 188 int br, bc, mbr, mbc; local
216 for (bc = mbc; bc < mbc + 2; bc++)
219 if (bc < pp_w) /* boundary : don't do it on the most right col block */
221 ptr = rec + (brwidth << 6) + (bc << 3);
222 jVal0 = brwidth + bc;
325 }/*bc*/
332 for (bc = mbc + 1; bc < mbc + 3; bc++
465 int br, bc, mbr, mbc; local
    [all...]
  /external/libvpx/vp8/decoder/
decodemv.c 21 static int vp8_read_bmode(vp8_reader *bc, const vp8_prob *p)
23 const int i = vp8_treed_read(bc, vp8_bmode_tree, p);
29 static int vp8_read_ymode(vp8_reader *bc, const vp8_prob *p)
31 const int i = vp8_treed_read(bc, vp8_ymode_tree, p);
36 static int vp8_kfread_ymode(vp8_reader *bc, const vp8_prob *p)
38 const int i = vp8_treed_read(bc, vp8_kf_ymode_tree, p);
45 static int vp8_read_uv_mode(vp8_reader *bc, const vp8_prob *p)
47 const int i = vp8_treed_read(bc, vp8_uv_mode_tree, p);
67 vp8_reader *const bc = & pbi->bc; local
250 vp8_reader *const bc = & pbi->bc; local
293 vp8_reader *const bc = & pbi->bc; local
    [all...]
decodframe.c 297 static int get_delta_q(vp8_reader *bc, int prev, int *q_update)
301 if (vp8_read_bit(bc))
303 ret_val = vp8_read_literal(bc, 4);
305 if (vp8_read_bit(bc))
435 pc->multi_token_partition = (TOKEN_PARTITION)vp8_read_literal(&pbi->bc, 2);
563 vp8_reader *const bc = & pbi->bc; local
631 if (vp8dx_start_decode(bc, IF_RTCD(&pbi->dboolhuff),
636 pc->clr_type = (YUV_TYPE)vp8_read_bit(bc);
637 pc->clamp_type = (CLAMP_TYPE)vp8_read_bit(bc);
    [all...]
detokenize.c 239 BOOL_DECODER *bc = x->current_bc; local
285 bufend = bc->user_buffer_end;
286 bufptr = bc->user_buffer;
287 value = bc->value;
288 count = bc->count;
289 range = bc->range;
418 bc->user_buffer = bufptr;
419 bc->value = value;
420 bc->count = count;
421 bc->range = range
    [all...]
  /dalvik/dx/tests/024-code-bytecode/
small-class.txt 267 bc 04 # 016c: newarray boolean
268 bc 05 # 016e: newarray char
269 bc 06 # 0170: newarray float
270 bc 07 # 0172: newarray double
271 bc 08 # 0174: newarray byte
272 bc 09 # 0176: newarray short
273 bc 0a # 0178: newarray int
274 bc 0b # 017a: newarray long
  /external/netcat/data/
data.c 82 int bc = 0; local
95 bc = 1; /* preload, assuming "dump" */
163 bc = 0;
214 bc++;
220 if (bc >= sizeof (buf_raw)) /* buffer full */
225 x = write (1, buf_raw, bc);
245 printf ("%c %d\n", *p, bc);
247 printf (". %d\n", bc);
249 bc++;
  /external/libgsm/src/
gsm_print.c 18 word LARc[8], Nc[4], Mc[4], bc[4], xmaxc[4], xmc[13*4]; local
38 bc[0] = (*c++ & 0x1) << 1;
39 bc[0] |= (*c >> 7) & 0x1;
61 bc[1] = (*c++ & 0x1) << 1;
62 bc[1] |= (*c >> 7) & 0x1;
85 bc[2] = (*c++ & 0x1) << 1; /* 20 */
86 bc[2] |= (*c >> 7) & 0x1;
108 bc[3] = (*c++ & 0x1) << 1;
109 bc[3] |= (*c >> 7) & 0x1;
135 fprintf(f, "#1: Nc %4.4d bc %d Mc %d xmaxc %d\n"
    [all...]
code.c 27 void Gsm_Coder P8((S,s,LARc,Nc,bc,Mc,xmaxc,xMc),
52 word * bc, /* [0..3] coded LTP gain OUT */
76 bc++);
long_term.c 23 * This module computes the LTP gain (bc) and the LTP lag (Nc)
60 word Nc, bc; local
148 * quantization of the LTP gain b to get the coded version bc.
150 for (bc = 0; bc <= 2; bc++) if (R <= gsm_mult(S, gsm_DLB[bc])) break;
151 *bc_out = bc;
164 word Nc, bc; local
283 * quantization of the LTP gain b to get the coded version bc
302 word Nc, bc; local
479 word Nc, bc; local
648 word Nc, bc; local
720 word Nc, bc; local
    [all...]
gsm_encode.c 15 word LARc[8], Nc[4], Mc[4], bc[4], xmaxc[4], xmc[13*4]; local
17 Gsm_Coder(s, source, LARc, Nc, bc, Mc, xmaxc, xmc);
34 bc[0] 2
52 bc[1] 2
70 bc[2] 2
88 bc[3] 2
129 sr = sr >> 2 | bc[0] << 14;
153 sr = sr >> 2 | bc[1] << 14;
177 sr = sr >> 2 | bc[2] << 14;
201 sr = sr >> 2 | bc[3] << 14
    [all...]
gsm_implode.c 30 bc[0] 2 9
48 bc[1] 2 26
66 bc[2] 2 43
84 bc[3] 2 60
111 # define bc *((gsm_signal (*) [17])(source + 9)) macro
134 sr = sr >> 2 | bc[0] << 14;
161 sr = sr >> 2 | bc[1] << 14;
188 sr = sr >> 2 | bc[2] << 14;
215 sr = sr >> 2 | bc[3] << 14;
260 sr = sr >> 2 | bc[0] << 14
    [all...]
gsm_decode.c 16 word LARc[8], Nc[4], Mc[4], bc[4], xmaxc[4], xmc[13*4]; local
41 bc[0] = sr & 0x3; sr >>= 2;
65 bc[1] = sr & 0x3; sr >>= 2;
89 bc[2] = sr & 0x3; sr >>= 2;
113 bc[3] = sr & 0x3; sr >>= 2;
155 bc[0] = sr & 0x3; sr >>= 2;
179 bc[1] = sr & 0x3; sr >>= 2;
203 bc[2] = sr & 0x3; sr >>= 2;
227 bc[3] = sr & 0x3; sr >>= 2;
269 bc[0] = (*c++ & 0x1) << 1
    [all...]
gsm_explode.c 17 # define bc *((gsm_signal (*) [17])(target + 9)) macro
44 bc[0] = sr & 0x3; sr >>= 2;
70 bc[1] = sr & 0x3; sr >>= 2;
97 bc[2] = sr & 0x3; sr >>= 2;
125 bc[3] = sr & 0x3; sr >>= 2;
170 bc[0] = sr & 0x3; sr >>= 2;
196 bc[1] = sr & 0x3; sr >>= 2;
223 bc[2] = sr & 0x3; sr >>= 2;
249 bc[3] = sr & 0x3; sr >>= 2;
297 bc[0] = (*c++ & 0x1) << 1
    [all...]
  /external/bouncycastle/src/main/java/org/bouncycastle/asn1/bc/
BCObjectIdentifiers.java 1 package org.bouncycastle.asn1.bc;
12 public static final DERObjectIdentifier bc = new DERObjectIdentifier("1.3.6.1.4.1.22554"); field in interface:BCObjectIdentifiers
17 public static final DERObjectIdentifier bc_pbe = new DERObjectIdentifier(bc.getId() + ".1");
  /external/qemu/audio/
dsound_template.h 191 DSCBCAPS bc; local
196 DSBCAPS bc; local
247 memset (&bc, 0, sizeof (bc));
248 bc.dwSize = sizeof (bc);
250 hr = glue (IFACE, _GetCaps) (ds->FIELD, &bc);
265 if (bc.dwBufferBytes & hw->info.align) {
268 bc.dwBufferBytes, hw->info.align + 1
271 hw->samples = bc.dwBufferBytes >> hw->info.shift
    [all...]
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/gscripts/
android.widget.LinearLayout.groovy 50 def bc = it.getBounds();
51 if (bc.isValid()) {
53 int v = isVertical ? bc.y : bc.x;
57 last = isVertical ? (bc.y + bc.h) : (bc.x + bc.w);
  /external/webkit/JavaScriptCore/tests/mozilla/js1_2/regexp/
RegExp_lastParen_as_array.js 71 // 'abcdefg'.match(/(^a)bc/); RegExp['$+']
72 'abcdefg'.match(/(^a)bc/);
73 testcases[count++] = new TestCase ( SECTION, "'abcdefg'.match(/(^a)bc/); RegExp['$+']",
76 // 'abcdefg'.match(new RegExp('(^a)bc')); RegExp['$+']
77 'abcdefg'.match(new RegExp('(^a)bc'));
78 testcases[count++] = new TestCase ( SECTION, "'abcdefg'.match(new RegExp('(^a)bc')); RegExp['$+']",
81 // 'abcdefg'.match(/bc/); RegExp['$+']
82 'abcdefg'.match(/bc/);
83 testcases[count++] = new TestCase ( SECTION, "'abcdefg'.match(/bc/); RegExp['$+']",
RegExp_lastParen.js 71 // 'abcdefg'.match(/(^a)bc/); RegExp.lastParen
72 'abcdefg'.match(/(^a)bc/);
73 testcases[count++] = new TestCase ( SECTION, "'abcdefg'.match(/(^a)bc/); RegExp.lastParen",
76 // 'abcdefg'.match(new RegExp('(^a)bc')); RegExp.lastParen
77 'abcdefg'.match(new RegExp('(^a)bc'));
78 testcases[count++] = new TestCase ( SECTION, "'abcdefg'.match(new RegExp('(^a)bc')); RegExp.lastParen",
81 // 'abcdefg'.match(/bc/); RegExp.lastParen
82 'abcdefg'.match(/bc/);
83 testcases[count++] = new TestCase ( SECTION, "'abcdefg'.match(/bc/); RegExp.lastParen",
asterisk.js 75 // 'abcdef'.match(/[\d]*[\s]*bc./)
76 testcases[count++] = new TestCase ( SECTION, "'abcdef'.match(/[\\d]*[\\s]*bc./)",
77 String(["bcd"]), String('abcdef'.match(/[\d]*[\s]*bc./)));
79 // 'abcdef'.match(/bc..[\d]*[\s]*/)
80 testcases[count++] = new TestCase ( SECTION, "'abcdef'.match(/bc..[\\d]*[\\s]*/)",
81 String(["bcde"]), String('abcdef'.match(/bc..[\d]*[\s]*/)));
  /external/chromium/base/third_party/dmg_fp/
dtoa.cc 2229 U *rv; CONST char *s0; BCinfo *bc; variable
2439 BCinfo bc; variable
    [all...]

Completed in 255 milliseconds

1 2 3 4