| /src/crypto/dist/ipsec-tools/src/racoon/ |
| rsalist.c | 191 struct genlist *winners; member in struct:lookup_result
211 // genlist_free(req->winners, NULL);
215 genlist_append(req->winners, key);
234 r.winners = genlist_init();
244 rsa_key_dump(r.winners);
246 return r.winners;
|
| rsalist.c | 191 struct genlist *winners; member in struct:lookup_result
211 // genlist_free(req->winners, NULL);
215 genlist_append(req->winners, key);
234 r.winners = genlist_init();
244 rsa_key_dump(r.winners);
246 return r.winners;
|
| rsalist.c | 191 struct genlist *winners; member in struct:lookup_result
211 // genlist_free(req->winners, NULL);
215 genlist_append(req->winners, key);
234 r.winners = genlist_init();
244 rsa_key_dump(r.winners);
246 return r.winners;
|
| rsalist.c | 191 struct genlist *winners; member in struct:lookup_result
211 // genlist_free(req->winners, NULL);
215 genlist_append(req->winners, key);
234 r.winners = genlist_init();
244 rsa_key_dump(r.winners);
246 return r.winners;
|
| /src/external/bsd/zstd/dist/tests/ |
| paramgrill.c | 993 * winners must be a table of NB_LEVELS_TRACKED+1 elements winnerInfo_t, all entries presumed initialized
997 BMK_print_cLevelTable(FILE* f, const winnerInfo_t* winners, const size_t srcSize)
1006 cLevel, winners[cLevel].params,
1007 winners[cLevel].result, srcSize);
1015 * winners must be a table of NB_LEVELS_TRACKED+1 elements winnerInfo_t, all entries presumed initialized
1020 const winnerInfo_t* winners,
1024 BMK_print_cLevelTable(f, winners, srcSize);
1026 BMK_print_cLevelTable(stdout, winners, srcSize);
1821 static int BMK_seed(winnerInfo_t* winners,
1842 if (winners[cLevel].result.cSize==0)
2003 winnerInfo_t winners[NB_LEVELS_TRACKED+1]; local
[all...] |
| paramgrill.c | 993 * winners must be a table of NB_LEVELS_TRACKED+1 elements winnerInfo_t, all entries presumed initialized
997 BMK_print_cLevelTable(FILE* f, const winnerInfo_t* winners, const size_t srcSize)
1006 cLevel, winners[cLevel].params,
1007 winners[cLevel].result, srcSize);
1015 * winners must be a table of NB_LEVELS_TRACKED+1 elements winnerInfo_t, all entries presumed initialized
1020 const winnerInfo_t* winners,
1024 BMK_print_cLevelTable(f, winners, srcSize);
1026 BMK_print_cLevelTable(stdout, winners, srcSize);
1821 static int BMK_seed(winnerInfo_t* winners,
1842 if (winners[cLevel].result.cSize==0)
2003 winnerInfo_t winners[NB_LEVELS_TRACKED+1]; local
[all...] |
| paramgrill.c | 993 * winners must be a table of NB_LEVELS_TRACKED+1 elements winnerInfo_t, all entries presumed initialized
997 BMK_print_cLevelTable(FILE* f, const winnerInfo_t* winners, const size_t srcSize)
1006 cLevel, winners[cLevel].params,
1007 winners[cLevel].result, srcSize);
1015 * winners must be a table of NB_LEVELS_TRACKED+1 elements winnerInfo_t, all entries presumed initialized
1020 const winnerInfo_t* winners,
1024 BMK_print_cLevelTable(f, winners, srcSize);
1026 BMK_print_cLevelTable(stdout, winners, srcSize);
1821 static int BMK_seed(winnerInfo_t* winners,
1842 if (winners[cLevel].result.cSize==0)
2003 winnerInfo_t winners[NB_LEVELS_TRACKED+1]; local
[all...] |
| paramgrill.c | 993 * winners must be a table of NB_LEVELS_TRACKED+1 elements winnerInfo_t, all entries presumed initialized
997 BMK_print_cLevelTable(FILE* f, const winnerInfo_t* winners, const size_t srcSize)
1006 cLevel, winners[cLevel].params,
1007 winners[cLevel].result, srcSize);
1015 * winners must be a table of NB_LEVELS_TRACKED+1 elements winnerInfo_t, all entries presumed initialized
1020 const winnerInfo_t* winners,
1024 BMK_print_cLevelTable(f, winners, srcSize);
1026 BMK_print_cLevelTable(stdout, winners, srcSize);
1821 static int BMK_seed(winnerInfo_t* winners,
1842 if (winners[cLevel].result.cSize==0)
2003 winnerInfo_t winners[NB_LEVELS_TRACKED+1]; local
[all...] |
