HomeSort by relevance Sort by last modified time
    Searched defs:qn (Results 1 - 14 of 14) sorted by null

  /external/libxaac/decoder/
ixheaacd_lpc_dec.c 70 WORD32 i, k, n, qn, nk, kv[8] = {0}; local
77 qn = read_arr[k];
80 n = qn;
81 if (qn > 4) {
82 nk = (qn - 3) >> 1;
83 n = qn - nk * 2;
86 if (qn > 0) {
97 ixheaacd_rotated_gosset_mtx_dec(qn, code_book_idx, ptr_kv, &nvecq[k * 8]);
ixheaacd_acelp_bitparse.c 96 VOID ixheaacd_qn_data(WORD32 nk_mode, WORD32 *qn,
103 qn[k] += 1;
105 if (qn[k] > 0) qn[k] += 1;
112 qn[k] = 2 + ixheaacd_read_bits_buf(it_bit_buff, 2);
116 if (qn[k] > 4) {
117 qn[k] = 0;
119 while (ixheaacd_read_bits_buf(it_bit_buff, 1) == 1) qn[k] += 1;
121 if (qn[k] > 0) qn[k] += 4
155 WORD32 k, qn[2] = {0, 0}, nk, n, i; local
239 WORD32 i, j, n, qn, nk, kv[8]; local
    [all...]
  /external/apache-xml/src/main/java/org/apache/xpath/operations/
Variable.java 124 QName qn = (QName)vars.elementAt(i); local
125 // System.out.println("qn: "+qn);
126 if(qn.equals(m_qname))
  /external/aac/libAACdec/src/
usacdec_lpc.cpp 367 DECODING OF AN INDEX IN Qn (n=0,2,3 or 4)
489 /* Check bound of codebook qn */
579 * \param qn pointer to output buffer to hold decoded code book numbers qn.
582 int qn[]) {
589 qn[n] = get_vlclbf(hBs);
590 if (qn[n] > 0) {
591 qn[n]++;
597 qn[n] = 2 + FDKreadBits(hBs, 2);
603 if (qn[n] > 4)
726 int qn[2], nk, n, I; local
    [all...]
  /external/u-boot/board/freescale/mx6ul_14x14_evk/
mx6ul_14x14_evk.c 88 enum qn { enum
  /device/linaro/bootloader/edk2/MdeModulePkg/Universal/RegularExpressionDxe/Oniguruma/
regexec.c 1540 UChar *qn, *endp, lowbuf[ONIGENC_MBC_CASE_FOLD_MAXLEN]; local
    [all...]
regcomp.c 686 compile_range_repeat_node(QtfrNode* qn, int target_len, int empty_info,
692 r = add_opcode(reg, qn->greedy ? OP_REPEAT : OP_REPEAT_NG);
700 r = entry_repeat_range(reg, num_repeat, qn->lower, qn->upper);
703 r = compile_tree_empty_check(qn->target, reg, empty_info);
710 IS_QUANTIFIER_IN_REPEAT(qn)) {
711 r = add_opcode(reg, qn->greedy ? OP_REPEAT_INC_SG : OP_REPEAT_INC_NG_SG);
714 r = add_opcode(reg, qn->greedy ? OP_REPEAT_INC : OP_REPEAT_INC_NG);
722 is_anychar_star_quantifier(QtfrNode* qn)
724 if (qn->greedy && IS_REPEAT_INFINITE(qn->upper) &&
1214 QtfrNode* qn; local
1349 QtfrNode* qn = NQTFR(node->target); local
1998 QtfrNode* qn = NQTFR(node); local
2117 QtfrNode* qn = NQTFR(node); local
2230 QtfrNode* qn = NQTFR(node); local
2337 QtfrNode* qn = NQTFR(node); local
2629 QtfrNode* qn = NQTFR(node); local
3163 QtfrNode* qn = NQTFR(node); local
3563 QtfrNode* qn = NQTFR(node); local
3744 QtfrNode* qn = NQTFR(node); local
4796 QtfrNode* qn = NQTFR(node); local
    [all...]
regparse.c 4767 QtfrNode* qn; local
5052 Node* qn; local
    [all...]
  /external/doclava/src/com/google/doclava/
MethodInfo.java 406 String qn = item.qualifiedName(); local
409 if (ex != null && ex.qualifiedName().equals(qn)) {
    [all...]
  /external/libopus/celt/
bands.c 651 int qn, qb; local
664 qn = 1;
666 qn = exp2_table8[qb&0x7]>>(14-(qb>>BITRES));
667 qn = (qn+1)>>1<<1;
669 celt_assert(qn <= 256);
670 return qn;
705 int qn; local
731 qn = compute_qn(N, *b, offset, pulse_cap, stereo);
733 qn = 1
    [all...]
  /external/vixl/test/aarch64/
test-assembler-aarch64.cc 17049 double qn = RawbitsToDouble(0x7ffaaaaa11111111); local
17125 float qn = RawbitsToFloat(0x7fea1111); local
17237 double qn = RawbitsToDouble(0x7ffaaaaa11111111); local
17309 float qn = RawbitsToFloat(0x7fea1111); local
17509 float qn = RawbitsToFloat(0x7fea1111); local
17637 double qn = RawbitsToDouble(0x7ffaaaaa11111111); local
    [all...]
  /external/guice/extensions/struts2/lib/
jsp-api-2.1.jar 
  /external/guice/extensions/persist/lib/
hibernate3.jar 
  /external/testng/ant/3rdparty/
doclava-1.0.3.jar 

Completed in 1130 milliseconds