| /src/games/caesar/ |
| caesar.c | 133 unsigned int try, winner; local
156 winner = 0;
165 /* got a new winner! */
166 winner = try;
171 init_rottbl(winner);
|
| /src/sys/arch/alpha/stand/standtest/ |
| test.c | 176 const struct cmdtab *try, *winner; local
203 winner = try;
209 (*winner->fn)(buf + nonwhitespace);
|
| /src/external/bsd/ppp/dist/pppd/ |
| options.h | 55 short int winner; member in struct:option
|
| /src/games/gomoku/ |
| main.c | 278 player_color winner; member in struct:outcome
384 declare_winner(outcome.result, input, outcome.winner);
|
| /src/external/cddl/osnet/dist/uts/common/fs/zfs/ |
| zap.c | 414 void *winner; local
428 winner = dmu_buf_set_user(l->l_dbuf, &l->l_dbu);
429 ASSERT(winner == NULL);
463 zap_leaf_t *l, *winner; local
475 winner = dmu_buf_set_user(db, &l->l_dbu);
478 if (winner != NULL) {
481 l = winner;
|
| zap_micro.c | 374 zap_t *winner; local
394 winner = NULL; /* No actual winner here... */
407 winner = dmu_buf_set_user(db, &zap->zap_dbu);
409 if (winner != NULL)
469 return (winner);
|
| dnode.c | 1138 dnode_children_t *winner; local
1148 winner = dmu_buf_set_user(&db->db, &children_dnodes->dnc_dbu);
1149 if (winner != NULL) {
1157 children_dnodes = winner;
|
| dsl_dir.c | 183 dsl_dir_t *winner; local
245 winner = dmu_buf_set_user_ie(dbuf, &dd->dd_dbu);
246 if (winner != NULL) {
252 dd = winner;
|
| sa.c | 1390 sa_handle_t *winner = NULL; local
1407 winner = dmu_buf_set_user_ie(db, &handle->sa_dbu);
1410 if (winner != NULL) {
1412 handle = winner;
|
| dsl_dataset.c | 452 dsl_dataset_t *winner = NULL; local
548 winner = dmu_buf_set_user_ie(dbuf, &ds->ds_dbu);
550 if (err != 0 || winner != NULL) {
565 ds = winner;
|
| /src/external/gpl3/gcc/dist/gcc/cp/ |
| cvt.cc | 1808 tree winner = NULL_TREE;
1885 if (winner && winner == cand)
1941 if (winner)
1944 = non_reference (TREE_TYPE (TREE_TYPE (winner)));
1955 winner, cand);
1961 winner = cand;
1965 if (winner)
1967 tree type = non_reference (TREE_TYPE (TREE_TYPE (winner)));
1806 tree winner = NULL_TREE; local
|
| constraint.cc | 3651 int winner = 0; local
3653 ++winner;
3655 --winner;
3656 return winner;
|
| call.cc | 12677 /* Note a warning about preferring WINNER to LOSER. We do this by storing
12678 a pointer to LOSER and re-running joust to produce the warning if WINNER
12682 add_warning (struct z_candidate *winner, struct z_candidate *loser)
12687 cw->next = winner->warnings;
12688 winner->warnings = cw;
12881 int winner = 0; local
12954 winner = 1;
12960 winner = -1;
13008 if (winner && comp != winner)
[all...] |
| pt.cc | 2089 int winner = more_constrained (get_template_for_ordering (champ), local
2091 if (winner == -1)
2093 else if (winner == 0)
25921 int winner = more_constrained (decl1, decl2);
25922 if (winner > 0)
25924 else if (winner < 0)
25966 int winner = 0;
25982 --winner;
25989 ++winner;
25996 if (!winner && any_deductions
25919 int winner = more_constrained (decl1, decl2); local
25964 int winner = 0; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/cp/ |
| cvt.cc | 1762 tree winner = NULL_TREE;
1839 if (winner && winner == cand)
1895 if (winner)
1898 = non_reference (TREE_TYPE (TREE_TYPE (winner)));
1909 winner, cand);
1915 winner = cand;
1919 if (winner)
1921 tree type = non_reference (TREE_TYPE (TREE_TYPE (winner)));
1760 tree winner = NULL_TREE; local
|
| constraint.cc | 3527 int winner = 0; local
3529 ++winner;
3531 --winner;
3532 return winner;
|
| pt.cc | 2107 int winner = more_constrained (get_template_for_ordering (champ), local
2109 if (winner == -1)
2111 else if (winner == 0)
25342 int winner = more_constrained (decl1, decl2);
25343 if (winner > 0)
25345 else if (winner < 0)
25387 int winner = 0;
25403 --winner;
25410 ++winner;
25417 if (!winner && any_deductions
[all...] |
| call.cc | 11939 /* Note a warning about preferring WINNER to LOSER. We do this by storing
11940 a pointer to LOSER and re-running joust to produce the warning if WINNER
11944 add_warning (struct z_candidate *winner, struct z_candidate *loser)
11949 cw->next = winner->warnings;
11950 winner->warnings = cw;
12033 int winner = 0; local
12166 if (winner && comp != winner)
12174 winner = 0;
12177 winner = comp
[all...] |
| /src/external/apache2/mDNSResponder/dist/Clients/srputil/ |
| srputil.c | 430 thread_service_t *winner = NULL; local
436 if (winner == NULL || in6addr_compare(&service->u.unicast.address, &winner->u.unicast.address) < 0) {
437 winner = service;
441 if (winner == NULL) {
445 winner->u.unicast.address.s6_addr[15] = 0;
448 memcpy(server_data, &winner->u.unicast.address, 15);
450 server_data[16] = winner->u.unicast.port[0];
451 server_data[17] = winner->u.unicast.port[1];
|
| /src/external/historical/nawk/dist/ |
| run.c | 83 Node *winner = NULL; /* root of parse tree */ variable
|
| /src/external/bsd/ntp/dist/ntpd/ |
| ntp_io.c | 4170 endpt * winner; local
4175 winner = NULL;
4184 if (NULL == winner ||
4187 winner = ep;
4190 if (NULL == winner)
4195 stoa(addr), stoa(&winner->sin)));
4197 return winner;
4361 * ...it is the winner unless we're looking for
|
| /src/external/bsd/zstd/dist/tests/ |
| paramgrill.c | 899 /* global winner used for constraints */
909 DISPLAY("New Winner: \n");
943 fprintf(f, "Overall Winner: \n");
1698 /* Benchmarking which stops when we are sufficiently sure the solution is infeasible / worse than the winner */
1744 /* disregard if resultMax < winner in infeas mode */
2180 * winner - best option found so far.
2372 winnerInfo_t winner = initWinnerInfo(emptyParams()); local
2425 winner.params = cParamsToPVals(ZSTD_getCParams(cLevelOpt, buf.maxBlockSize, ctx.dictSize));
2426 if(BMK_benchParam(&winner.result, buf, ctx, winner.params))
[all...] |
| /src/external/gpl3/binutils/dist/ld/ |
| ldlang.c | 3357 static const bfd_target *winner;
3387 /* If we have not found a potential winner yet, then record this one. */
3388 if (winner == NULL)
3390 winner = target;
3397 > name_compare (winner->name, original->name))
3398 winner = target;
3517 if (winner == NULL)
3521 output_target = winner->name;
3354 static const bfd_target *winner; variable
|
| /src/external/gpl3/binutils.old/dist/ld/ |
| ldlang.c | 3374 static const bfd_target *winner;
3404 /* If we have not found a potential winner yet, then record this one. */
3405 if (winner == NULL)
3407 winner = target;
3414 > name_compare (winner->name, original->name))
3415 winner = target;
3534 if (winner == NULL)
3538 output_target = winner->name;
3371 static const bfd_target *winner; variable
|
