| /src/games/backgammon/teachgammon/ |
| tutor.c | 44 static const char better[] = variable
45 "That is a legal move, but there is a better one.\n";
73 writel(better);
|
| /src/external/mit/isl/dist/ |
| isl_lp.c | 144 int better; local
157 better = 1;
160 better = isl_int_gt(opt_i, *opt);
162 better = isl_int_lt(opt_i, *opt);
167 better = isl_int_is_pos(t);
169 better = isl_int_is_neg(t);
171 if (better) {
|
| isl_pw_union_opt.c | 18 * "el1" is "better" than "el2", return this set.
20 static __isl_give isl_set *FN(PW,better)(__isl_keep EL *el1, __isl_keep EL *el2,
44 /* Given sets B ("set"), C ("better") and A' ("out"), return
49 __isl_take isl_set *better, __isl_take isl_set *out)
53 set_better = isl_set_intersect(isl_set_copy(set), isl_set_copy(better));
54 set_out = isl_set_subtract(isl_set_subtract(set, better), out);
59 /* Given sets A ("set"), C ("better") and B' ("out"), return
64 __isl_take isl_set *better, __isl_take isl_set *out)
68 set_worse = isl_set_subtract(isl_set_copy(set), isl_set_copy(better));
69 set_out = isl_set_subtract(isl_set_intersect(set, better), out)
149 isl_set *better; local
186 isl_set *better, *set_i, *set_j; local
[all...] |
| isl_box.c | 282 isl_bool is_bound, better; local
302 better = isl_val_lt(v, info->size);
303 if (better >= 0 && better) {
315 return better < 0 ? isl_stat_error : isl_stat_ok;
325 * Initialize the size with infinity and if no better size is found
|
| isl_fold.c | 663 * "better" is the sign that the difference qp1 - qp2 needs to have for qp1
668 __isl_take isl_qpolynomial_list *list2, int better)
698 if (sgn != better)
731 int better; local
738 better = fold1->type == isl_fold_max ? -1 : 1;
755 list1 = merge_lists(set, list1, list2, better);
|
| isl_ast_codegen.c | 556 isl_set *better; local
562 better = isl_pw_aff_gt_set(isl_pw_aff_copy(pa_i), pa_j);
563 domain_i = isl_set_intersect(domain_i, better);
2427 * better than the one stored in "data"?
2433 * the new lower bound to be better.
2475 /* Check if we can use "c" as a lower bound and if it is better than
2498 * if the new lower bound is better (smaller n or fewer integer divisions)
2506 int better; local
2520 better = is_better_lower_bound(data, lower, max);
2521 if (better < 0 || !better)
[all...] |
| /src/sys/netinet/ |
| in_pcb.c | 1015 vestigial_inpcb_t better; local
1040 better = *vp;
1050 *vp = better;
|
| /src/sys/netinet6/ |
| in6_pcb.c | 914 struct vestigial_inpcb better; local
947 better = *vp;
957 *vp = better;
|
| /src/games/gomoku/ |
| pickmove.c | 71 static bool better(spot_index, spot_index, player_color);
141 if (better(s, os, us)) /* pick our best move */
143 if (better(s, ts, them)) /* pick their best move */
191 * Return true if spot 'as' is better than spot 'bs' for color 'us'.
194 better(spot_index as, spot_index bs, player_color us) function
|
| /src/sys/dev/ic/ |
| cs89x0.c | 133 ** is Digital confidential!), but is better than nothing and more
146 ** 20-25% better than the driver had previously been getting).
293 * To get better performance, we tell the chip to start packet
299 * better is the next 'better' state in the table.
301 * better state.
309 int better; member in struct:cs_xmit_early
1051 * is a better way to do it because the card has a counter which can be
1055 * the receive miss interrupt. This is a better estimate of errors
1927 cs_xmit_early_table[sc->sc_xe_ent].better;
[all...] |
| /src/external/bsd/zstd/dist/tests/ |
| paramgrill.c | 592 /* return true if r2 strictly better than r1 */
720 /* strictly better, strictly worse, equal, speed-side adv, size-side adv */
771 return 1; /* never insert if better */
807 return 1; /* never insert if better */
867 /* when used with --optimize, will only print results better than previously discovered */
1549 /* note : it would be a lot better if this function was present in benchzstd.c,
1827 int better = 0; local
1847 better = 1;
1910 DISPLAYLEVEL(3, "Solution %4.3f selected over %4.3f at level %i, due to better secondary statistics \n",
1917 better = 1
2184 int better = 1; local
[all...] |
| /src/external/gpl3/gdb/dist/gdb/ |
| symtab.c | 129 which is rare). The value here is just a first attempt. A better default
1080 us better bcache hit rates for partial symbols. */
2389 struct symbol *better
2391 if (better != other.symbol)
2393 other.symbol = better;
2965 /* In order to better support objfiles that contain both
3483 /* Didn't find an exact match. So we better keep looking for
6557 an Ada function. It is not clear that this is a better approach
2384 struct symbol *better local
|
| /src/external/gpl3/gdb.old/dist/gdb/ |
| symtab.c | 126 which is rare). The value here is just a first attempt. A better default
1061 us better bcache hit rates for partial symbols. */
2346 struct symbol *better
2348 if (better != other.symbol)
2350 other.symbol = better;
2922 /* In order to better support objfiles that contain both
3449 /* Didn't find an exact match. So we better keep looking for
6488 an Ada function. It is not clear that this is a better approach
2341 struct symbol *better local
|
| /src/external/mpl/bind/dist/lib/dns/ |
| resolver.c | 4024 * See if we have a better alternate server by address.
6228 * cache is better than
6378 * better than the answer we
6829 * See if the forwarder declaration is better.
6832 bool better = !dns_name_equal(&forwarders->name, local
6835 return better;
|
