Home
last modified time | relevance | path

Searched refs:pts (Results 1 – 11 of 11) sorted by relevance

/dragonfly/games/sail/
H A Ddr_1.c208 ? from->specs->pts in fightitout()
209 : 2 * from->specs->pts); in fightitout()
212 topoints = 2 * from->specs->pts + to->file->points; in fightitout()
214 topoints -= from->specs->pts; in fightitout()
418 net = (float)s->file->points / s->specs->pts; in next()
H A Dlo_main.c113 (float) log.l_netpoints / ship->specs->pts); in lo_curses()
154 (float) log.l_netpoints / ship->specs->pts); in lo_main()
H A Dmisc.c215 net = (float)s->file->points / s->specs->pts; in logger()
228 / scene[lp->l_gamenum].ship[lp->l_shipnum].specs->pts) { in logger()
H A Dassorted.c281 points = ship->specs->pts + from->file->points; in strike()
H A Ddr_2.c146 - 2 * sp->specs->pts); in prizecheck()
H A Dextern.h212 short pts; member
H A Dpl_7.c917 sp->specs->pts, in displayshiplist()
1200 ship->specs->pts); in drawpicker()
/dragonfly/test/stress/stress2/tools/
H A Dptsleak.sh35 n=`find /dev/pts -mtime +15m 2>/dev/null | wc -l`
/dragonfly/contrib/gcc-8.0/gcc/
H A Dtree-ssa-structalias.c2657 bitmap pts; in solve_graph() local
2672 pts = BITMAP_ALLOC (&pta_obstack); in solve_graph()
2719 bitmap_copy (pts, get_varinfo (find (anything_id))->solution); in solve_graph()
2722 bitmap_and_compl (pts, vi->solution, vi->oldsolution); in solve_graph()
2724 bitmap_copy (pts, vi->solution); in solve_graph()
2726 if (bitmap_empty_p (pts)) in solve_graph()
2730 bitmap_ior_into (vi->oldsolution, pts); in solve_graph()
2734 bitmap_copy (vi->oldsolution, pts); in solve_graph()
2756 do_complex_constraint (graph, c, pts, &expanded_pts); in solve_graph()
2802 flag = bitmap_ior_into (tmp, pts); in solve_graph()
[all …]
/dragonfly/contrib/gcc-4.7/gcc/
H A Dtree-ssa-structalias.c2510 bitmap pts; in solve_graph() local
2525 pts = BITMAP_ALLOC (&pta_obstack); in solve_graph()
2564 bitmap_and_compl (pts, vi->solution, vi->oldsolution); in solve_graph()
2566 bitmap_copy (pts, vi->solution); in solve_graph()
2568 if (bitmap_empty_p (pts)) in solve_graph()
2572 bitmap_ior_into (vi->oldsolution, pts); in solve_graph()
2576 bitmap_copy (vi->oldsolution, pts); in solve_graph()
2597 do_complex_constraint (graph, c, pts); in solve_graph()
2627 flag = set_union_with_increment (tmp, pts, 0); in solve_graph()
2642 BITMAP_FREE (pts); in solve_graph()
/dragonfly/sys/dev/misc/psm/
H A Dpsm.c324 int pts; member
6814 { 0x01, 0x2c, PSM_TPINFO(pts) },
6957 sc->tpinfo.pts = 0x00;
6990 if (sc->tpinfo.pts == 0x01)