/external/fec/ |
ccsds.h | 3 #define NN 255
|
decode_rs_ccsds.c | 12 data_t cdata[NN]; 15 for(i=0;i<NN-pad;i++) 22 for(i=0;i<NN-pad;i++)
|
char.h | 11 #define NN (rs->nn) 20 #define A0 (NN)
|
encode_rs_ccsds.c | 13 data_t cdata[NN-NROOTS]; 16 for(i=0;i<NN-NROOTS-pad;i++)
|
int.h | 11 #define NN (rs->nn) 20 #define A0 (NN)
|
exercise.c | 33 #define PRINTPARM printf("(%d,%d):",rs->nn,rs->nn-rs->nroots); 45 data_t block[NN],tblock[NN]; 48 int errlocs[NN]; 60 for(i=0;i<NN-NROOTS;i++) 61 block[i] = random() & NN; 64 ENCODE_RS(&block[0],&block[NN-NROOTS],0); 66 ENCODE_RS(rs,&block[0],&block[NN-NROOTS]); 76 errval = random() & NN; [all...] |
encode_rs.c | 27 if(pad < 0 || pad >= NN) 33 for(i=0;i<NN-NROOTS-PAD;i++){ 40 feedback = MODNN(NN - GENPOLY[NROOTS] + feedback);
|
encode_rs.h | 6 * data_t data[] - array of NN-NROOTS-PAD and type data_t to be encoded 12 * NN - the total number of symbols in a RS block. Integer variable or literal. 14 * ALPHA_TO - The address of an array of NN elements to convert Galois field 16 * INDEX_OF - The address of an array of NN elements to convert Galois field 18 * MODNN - a function to reduce its argument modulo NN. May be inline or a macro. 31 #define A0 (NN) /* Special reserved value encoding zero in index form */ 39 for(i=0;i<NN-NROOTS-PAD;i++){ 46 feedback = MODNN(NN - GENPOLY[NROOTS] + feedback);
|
fixed.h | 24 #define NN 255
|
decode_rs.h | 6 * data_t data[] - array of NN data and parity symbols to be corrected in place 11 * NN - the total number of symbols in a RS block. Integer variable or literal. 13 * ALPHA_TO - The address of an array of NN elements to convert Galois field 15 * INDEX_OF - The address of an array of NN elements to convert Galois field 17 * MODNN - a function to reduce its argument modulo NN. May be inline or a macro. 34 #if !defined(NN) 35 #error "NN not defined" 69 #define A0 (NN) 85 for(j=1;j<NN-PAD;j++){ 114 lambda[1] = ALPHA_TO[MODNN(PRIM*(NN-1-eras_pos[0]))] [all...] |
decode_rs.c | 41 if(pad < 0 || pad >= NN) 49 for(j=1;j<NN-PAD;j++){ 78 lambda[1] = ALPHA_TO[MODNN(PRIM*(NN-1-eras_pos[0]))]; 80 u = MODNN(PRIM*(NN-1-eras_pos[i])); 97 for (i = 1,k=IPRIM-1; i <= NN; i++,k = MODNN(k+IPRIM)) { 162 b[i] = (lambda[i] == 0) ? A0 : MODNN(INDEX_OF[lambda[i]] - discr_r + NN); 182 for (i = 1,k=IPRIM-1; i <= NN; i++,k = MODNN(k+IPRIM)) { 236 num2 = ALPHA_TO[MODNN(root[j] * (FCR - 1) + NN)]; 253 data[loc[j]-PAD] ^= ALPHA_TO[MODNN(INDEX_OF[num1] + INDEX_OF[num2] + NN - INDEX_OF[den])];
|
encode_rs_av.c | 46 for(i=0;i<NN-NROOTS-pad;i++){
|
encode_rs_8.c | 86 for(i=0;i<NN-NROOTS-pad;i++){
|
/external/speex/libspeexdsp/ |
testecho.c | 14 #define NN 128 20 short echo_buf[NN], ref_buf[NN], e_buf[NN]; 34 st = speex_echo_state_init(NN, TAIL); 35 den = speex_preprocess_state_init(NN, sampleRate); 41 fread(ref_buf, sizeof(short), NN, ref_fd); 42 fread(echo_buf, sizeof(short), NN, echo_fd); 45 fwrite(e_buf, sizeof(short), NN, e_fd);
|
testresample.c | 42 #define NN 256 55 in = malloc(NN*sizeof(short)); 56 out = malloc(2*NN*sizeof(short)); 57 fin = malloc(NN*sizeof(float)); 58 fout = malloc(2*NN*sizeof(float)); 63 fread(in, sizeof(short), NN, stdin); 66 for (i=0;i<NN;i++) 68 in_len = NN; 69 out_len = 2*NN;
|
testdenoise.c | 8 #define NN 160 12 short in[NN]; 18 st = speex_preprocess_state_init(NN, 8000); 34 fread(in, sizeof(short), NN, stdin); 39 fwrite(in, sizeof(short), NN, stdout);
|
/external/clang/test/CodeGenCXX/ |
debug-info-template.cpp | 121 struct NN { 124 // CHECK: !DIGlobalVariable(name: "nn" 126 // CHECK-SAME: variable: %struct.NN* @nn 130 // CHECK: ![[NNT]] ={{.*}}!DICompositeType(tag: DW_TAG_structure_type, name: "NN<tmpl_impl, &glb, &glb>", 139 NN<tmpl_impl, glb, glb> nn; variable
|
/external/tensorflow/tensorflow/contrib/tensor_forest/hybrid/python/models/ |
nn.py | 25 class NN(hybrid_model.HybridModel): 33 super(NN, self).__init__(
|
/external/adhd/scripts/volume_tuning/ |
volume.js | 6 var NN = 100; // Total number of points 7 var FIXES = 25; // Number of fixed points, evenly spaced in the range [0, NN] 51 var fix_pos = Math.round(i * NN * 10 / FIXES) / 10; 109 drawText(ctx, Math.round(i * NN * 10 / FIXES) / 10, x, -20, 'center'); 173 for (var i = 0; i <= NN; i++) { 176 var x = i * w / NN; 210 // Generate points indexed by 0 to NN, using interpolation and quantization 221 var x = NN * i / FIXES; 232 var x = NN * i / FIXES; 248 var xl = NN * left / FIXES [all...] |
/external/elfutils/libdwfl/ |
link_map.c | 715 #define AUXV_SCAN(NN, BL) do \ 717 const Elf##NN##_auxv_t *av = auxv; \ 720 const char *typep = auxv + i * sizeof (Elf##NN##_auxv_t); \ 721 typep += offsetof (Elf##NN##_auxv_t, a_type); \ 722 uint##NN##_t type = READ_AUXV##NN (typep); \ 723 const char *valp = auxv + i * sizeof (Elf##NN##_auxv_t); \ 724 valp += offsetof (Elf##NN##_auxv_t, a_un.a_val); \ 725 uint##NN##_t val = BL##NN (READ_AUXV##NN (valp)); [all...] |
/external/clang/test/SemaCXX/ |
attr-noreturn.cpp | 89 struct NN : MM {}; 90 struct OO { NN n; }; 106 NN n; 122 const NN& nn = NN(); local
|
/external/clang/test/Sema/ |
block-return.c | 130 int (^NN) (void) = ^{ return cint; };
|
/external/one-true-awk/ |
tran.c | 235 (void*)p, NN(p->nval), NN(p->sval), p->fval, p->tval) ); 332 dprintf( ("setfval %p: %s = %g, t=%o\n", (void*)vp, NN(vp->nval), f, vp->tval) ); 353 (void*)vp, NN(vp->nval), s, vp->tval, donerec, donefld) ); 377 (void*)vp, NN(vp->nval), t, (void *) t, vp->tval, donerec, donefld) ); 403 (void*)vp, NN(vp->nval), vp->fval, vp->tval) ); 491 (void*)vp, NN(vp->nval), vp->sval, (void *) vp->sval, vp->tval) );
|
awk.h | 35 #define NN(p) ((p) ? (p) : "(null)") /* guaranteed non-null for dprintf
|
/external/llvm/lib/Support/ |
YAMLTraits.cpp | 168 for (const auto &NN : MN->Mapping) { 169 if (!MN->isValidKey(NN.first())) { 170 setError(NN.second.get(), Twine("unknown key '") + NN.first() + "'");
|