| /external/fec/ |
| init_rs.h | 21 if(nroots < 0 || nroots >= (1<<symsize))
23 if(pad < 0 || pad >= ((1<<symsize) -1 - nroots))
70 rs->genpoly = (data_t *)malloc(sizeof(data_t)*(nroots+1));
80 rs->nroots = nroots;
88 for (i = 0,root=fcr*prim; i < nroots; i++,root += prim) {
102 for (i = 0; i <= nroots; i++)
|
| init_rs.c | 29 * nroots = RS code generator polynomial degree (number of roots)
33 int nroots,int pad){
|
| init_rs_char.c | 25 * nroots = RS code generator polynomial degree (number of roots)
29 int nroots,int pad){
|
| init_rs_int.c | 25 * nroots = RS code generator polynomial degree (number of roots)
29 int nroots,int pad){
|
| rs-common.h | 13 int nroots; /* Number of generator roots = number of parity symbols */ member in struct:rs
|
| char.h | 15 #define NROOTS (rs->nroots)
|
| int.h | 15 #define NROOTS (rs->nroots)
|
| rstest.c | 20 int nroots; member in struct:etab
57 kk = nn - Tab[i].nroots;
155 kk = nn - e->nroots;
157 rs = init_rs_char(e->symsize,e->genpoly,e->fcs,e->prim,e->nroots,0);
163 for(errors=0;errors <= e->nroots/2;errors++){
233 kk = nn - e->nroots;
235 rs = init_rs_int(e->symsize,e->genpoly,e->fcs,e->prim,e->nroots,0);
241 for(errors=0;errors <= e->nroots/2;errors++){
|
| exercise.c | 33 #define PRINTPARM printf("(%d,%d):",rs->nn,rs->nn-rs->nroots);
49 int derrlocs[NROOTS];
57 for(errors=0;errors <= NROOTS/2;errors++){
60 for(i=0;i<NN-NROOTS;i++)
64 ENCODE_RS(&block[0],&block[NN-NROOTS],0);
66 ENCODE_RS(rs,&block[0],&block[NN-NROOTS]);
|
| fec.h | 233 int fcr,int prim,int nroots,
241 int prim,int nroots,int pad);
|
| /external/tensorflow/tensorflow/core/profiler/internal/ |
| tfprof_scope.cc | 139 std::vector<ScopeNode*> nroots = SearchRoot(root->show_children, regexes); local
140 res.insert(res.end(), nroots.begin(), nroots.end());
|
| tfprof_code.cc | 554 std::vector<CodeNode*> nroots = SearchRoot(root->show_children, regexes); local
555 res.insert(res.end(), nroots.begin(), nroots.end());
|
