HomeSort by: relevance | last modified time | path
    Searched defs:points (Results 1 - 10 of 10) sorted by relevancy

  /src/games/sail/
assorted.c 276 int points; local in function:strike
281 points = ship->specs->pts + from->file->points;
282 send_points(from, points);
extern.h 143 short points; /* 20 */ member in struct:File
  /src/games/backgammon/backgammon/
move.c 66 static int pt; /* comp's protected points */
74 static int points; /* comp's protected points */ variable in typeref:typename:int
476 points = pt;
561 if (abs(n = pt - points) > rnum(4))
  /src/tests/usr.bin/xlint/lint1/
init.c 51 } points[] = { variable in typeref:struct:__anone42d7e190308[]
init_c99.c 199 struct point points[] = { variable in typeref:struct:point[]
202 * At this point, the size of the object 'points' is not known
207 * of 'points' was set too early, resulting in a negative
210 sizeof(int[-(int)sizeof(points)]),
217 struct point points[3]; member in struct:triangle
221 struct point points[5]; member in struct:pentagon
227 struct point points[3][5][2]; member in struct:geometry
235 .pentagons[0].points[4].x = 1,
236 .points[0][0][0] = { 0, 0 },
237 .points[2][4][1] = {301, 302 }
    [all...]
  /src/games/hack/
hack.end.c 245 printf("\nescaped from the dungeon with %ld points,\n",
248 printf("You escaped from the dungeon with %ld points,\n",
282 printf("You %s on dungeon level %d with %ld points,\n",
288 printf("You were level %u with a maximum of %d hit points when you %s.\n",
312 long int points; member in struct:toptenentry
361 t0->points = u.urexp;
371 /* assure minimum number of points */
372 if (t0->points < POINTSMIN)
373 t0->points = 0;
382 &t1->hp, &t1->maxhp, &t1->points,
    [all...]
  /src/sys/external/bsd/drm2/dist/drm/i915/display/
intel_bw.c 23 struct intel_qgv_point points[I915_NUM_QGV_POINTS]; member in struct:intel_qgv_info
130 if (WARN_ON(qi->num_points > ARRAY_SIZE(qi->points)))
131 qi->num_points = ARRAY_SIZE(qi->points);
134 struct intel_qgv_point *sp = &qi->points[i];
160 dclk = max(dclk, qi->points[i].dclk);
220 const struct intel_qgv_point *sp = &qi.points[j];
257 * Pcode will not expose all QGV points when
286 * Any bw group has same amount of QGV points
  /src/sys/external/bsd/drm2/dist/drm/
drm_syncobj.c 1057 uint64_t *points; local in function:drm_syncobj_array_wait_timeout
1068 points = kmalloc_array(count, sizeof(*points), GFP_KERNEL);
1069 if (points == NULL)
1073 memset(points, 0, count * sizeof(uint64_t));
1075 } else if (copy_from_user(points, user_points,
1100 entries[i].point = points[i];
1102 if (!fence || dma_fence_chain_find_seqno(&fence, points[i])) {
1230 kfree(points);
1294 u64_to_user_ptr(timeline_wait->points),
1502 uint64_t *points; local in function:drm_syncobj_timeline_signal_ioctl
1573 uint64_t __user *points = u64_to_user_ptr(args->points); local in function:drm_syncobj_query_ioctl
    [all...]
  /src/sys/external/bsd/drm2/dist/drm/qxl/
qxl_dev.h 775 struct qxl_point_fix points[0]; member in struct:qxl_path_seg
  /src/sys/external/bsd/drm2/dist/include/uapi/drm/
drm.h 787 __u64 points; member in struct:drm_syncobj_timeline_wait
806 __u64 points; member in struct:drm_syncobj_timeline_array

Completed in 20 milliseconds