| /src/crypto/external/bsd/heimdal/dist/lib/kafs/ |
| afsl.exp | 3 * This mumbo jumbo creates entry points to syscalls in _AIX
|
| /src/external/gpl3/gdb.old/dist/sim/common/ |
| sim-watch.h | 68 sim_watch_point *points; member in struct:_sim_watchpoints
|
| /src/external/gpl3/gdb/dist/sim/common/ |
| sim-watch.h | 68 sim_watch_point *points; member in struct:_sim_watchpoints
|
| /src/tests/usr.bin/xlint/lint1/ |
| 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...] |
| init.c | 51 } points[] = { variable in typeref:struct:__anon8025
|
| /src/external/apache2/llvm/dist/llvm/tools/sancov/ |
| coverage-report-server.py | 76 self.covered_points = frozenset(symcov_json['covered-points'])
88 points = self.point_symbol_info.get(filename, dict())
91 for fn, points in points.items():
92 for point, loc in points.items():
97 for line, points in line_to_points.items():
99 covered_points = self.covered_points & set(points)
102 elif len(covered_points) != len(points):
112 for fn, points in fns.items():
113 file_points.extend(points.keys()
[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/gpl2/dts/dist/arch/arm/boot/dts/nxp/imx/ |
| imx6q-cm-fx6.dts | 184 operating-points = <
191 fsl,soc-operating-points = <
206 operating-points = <
213 fsl,soc-operating-points = <
228 operating-points = <
235 fsl,soc-operating-points = <
250 operating-points = <
257 fsl,soc-operating-points = <
|
| /src/share/locale/ctype/ |
| gen_ctype_utf8.pl | 272 my ( $list, $points ) = @_;
274 my @squished = reverse @{ squish_points($points) };
293 my ( $map, $points ) = @_;
303 foreach my $point ( sort { $a <=> $b } keys %{$points} ) {
304 my $diff = $point - $points->{$point};
316 $adjustment //= $points->{$point};
348 my ($points) = @_;
354 foreach my $i ( 0 .. $#{$points} + 1 ) {
356 my $point = $points->[$i];
366 format_point( $points->[$start] )
[all...] |
| /src/sys/external/gpl2/dts/dist/arch/arm/boot/dts/allwinner/ |
| sun5i-a13.dtsi | 105 operating-points =
|
| sun8i-h3.dtsi | 48 compatible = "operating-points-v2";
80 operating-points-v2 = <&cpu0_opp_table>;
90 operating-points-v2 = <&cpu0_opp_table>;
100 operating-points-v2 = <&cpu0_opp_table>;
110 operating-points-v2 = <&cpu0_opp_table>;
116 compatible = "operating-points-v2";
228 operating-points-v2 = <&gpu_opp_table>;
|
| sun8i-a33.dtsi | 50 compatible = "operating-points-v2";
130 operating-points-v2 = <&cpu0_opp_table>;
137 operating-points-v2 = <&cpu0_opp_table>;
147 operating-points-v2 = <&cpu0_opp_table>;
157 operating-points-v2 = <&cpu0_opp_table>;
168 compatible = "operating-points-v2";
395 operating-points-v2 = <&mali_opp_table>;
|
| /src/external/gpl2/groff/dist/src/devices/grolbp/ |
| lbp.h | 318 vdmpolyline(int numpoints, int *points)
320 int i,*p = points;
335 vdmpolygon(int numpoints, int *points)
337 int i,*p = points;
365 int points[4]; local
367 points[0] = startx;
368 points[1] = starty;
369 points[2] = sizex;
370 points[3] = sizey;
372 vdmpolyline(2,points);
[all...] |
| /src/crypto/external/apache2/openssl/dist/crypto/ec/ |
| ec_mult.c | 43 EC_POINT **points; /* array with pre-calculated multiples of member in struct:ec_pre_comp_st
93 if (pre->points != NULL) {
96 for (pts = pre->points; *pts != NULL; pts++)
98 OPENSSL_free(pre->points);
398 * \sum scalars[i]*points[i],
404 size_t num, const EC_POINT *points[],
424 * 'pre_comp->points' */
456 return ossl_ec_scalar_mul_ladder(group, r, scalars[0], points[0],
472 && (EC_POINT_cmp(group, generator, pre_comp->points[0], ctx) == 0)) {
519 * num_val will be the total number of temporarily precomputed points
820 EC_POINT **points = NULL; local
[all...] |
| /src/crypto/external/bsd/openssl/dist/crypto/ec/ |
| ec_mult.c | 43 EC_POINT **points; /* array with pre-calculated multiples of member in struct:ec_pre_comp_st
99 if (pre->points != NULL) {
102 for (pts = pre->points; *pts != NULL; pts++)
104 OPENSSL_free(pre->points);
405 * \sum scalars[i]*points[i],
411 size_t num, const EC_POINT *points[],
431 * 'pre_comp->points' */
463 return ossl_ec_scalar_mul_ladder(group, r, scalars[0], points[0],
479 && (EC_POINT_cmp(group, generator, pre_comp->points[0], ctx) ==
529 * num_val will be the total number of temporarily precomputed points
836 EC_POINT **points = NULL; local
[all...] |
| /src/crypto/external/bsd/openssl.old/dist/crypto/ec/ |
| ec_mult.c | 37 EC_POINT **points; /* array with pre-calculated multiples of member in struct:ec_pre_comp_st
93 if (pre->points != NULL) {
96 for (pts = pre->points; *pts != NULL; pts++)
98 OPENSSL_free(pre->points);
398 * \sum scalars[i]*points[i],
404 size_t num, const EC_POINT *points[], const BIGNUM *scalars[],
424 * 'pre_comp->points' */
456 return ec_scalar_mul_ladder(group, r, scalars[0], points[0], ctx);
471 && (EC_POINT_cmp(group, generator, pre_comp->points[0], ctx) ==
521 * num_val will be the total number of temporarily precomputed points
828 EC_POINT **points = NULL; local
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/ |
| drm_syncobj.c | 1057 uint64_t *points; local
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
1573 uint64_t __user *points = u64_to_user_ptr(args->points); local
[all...] |
| /src/games/sail/ |
| assorted.c | 276 int points; local
281 points = ship->specs->pts + from->file->points;
282 send_points(from, points);
|
| /src/sys/external/bsd/drm2/dist/drm/amd/display/modules/color/ |
| color_gamma.h | 109 struct dc_transfer_func_distributed_points *points);
|
| amdgpu_color_gamma.c | 55 * The idea is that our regions for X points are exponential and currently they all use
56 * the same number of points (NUM_PTS_IN_REGION) and in each region every point
77 /* one-time setup of X points */
278 /* X points is 2^-25 to 2^7
978 rgb += 32; // first 32 points have problems with fixed point, too small
1035 /* X points is 2^-25 to 2^7
1315 * for evenly spaced points in 0-1 range. lut1D[index] gives correction
1390 struct gamma_pixel *points,
1394 struct gamma_pixel *p = points;
1497 * and we concatenate them. It also searches for points of interpolation an
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Testing/Support/ |
| Annotations.h | 19 /// Annotations lets you mark points and ranges inside source code, for tests:
24 /// $definition^class Foo{}; // points can be named: "definition"
29 /// std::vector<size_t> PP = Example.points(); // all unnamed points
33 /// Points/ranges are coordinated into `code()` which is stripped of
36 /// Ranges may be nested (and points can be inside ranges), but there's no way
43 /// 2. making characters for marking points and ranges configurable,
64 /// All points and ranges are relative to this stripped text.
70 /// Returns the position of all points marked by ^ (or $name^) in the text.
72 std::vector<size_t> points(llvm::StringRef Name = "") const
[all...] |
| /src/external/gpl3/gcc/dist/gcc/analyzer/ |
| program-point.cc | 529 /* Comparator for program points within the same supernode,
598 /* Comparator for program points within the same supernode,
659 /* For those function points for which there is a uniquely-defined
707 /* For those program points for which there is a uniquely-defined
801 /* Populate an array with various points within the same
803 auto_vec<function_point> points; local
804 points.safe_push (function_point::before_supernode (snode, NULL));
805 points.safe_push (function_point::before_stmt (snode, 0));
806 points.safe_push (function_point::before_stmt (snode, 1));
807 points.safe_push (function_point::after_supernode (snode))
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/analyzer/ |
| program-point.cc | 513 /* Comparator for program points within the same supernode,
582 /* Comparator for program points within the same supernode,
643 /* For those function points for which there is a uniquely-defined
672 /* For those program points for which there is a uniquely-defined
726 /* Populate an array with various points within the same
728 auto_vec<function_point> points; local
729 points.safe_push (function_point::before_supernode (snode, NULL));
730 points.safe_push (function_point::before_stmt (snode, 0));
731 points.safe_push (function_point::before_stmt (snode, 1));
732 points.safe_push (function_point::after_supernode (snode))
[all...] |
| /src/external/gpl2/groff/dist/src/devices/xditview/ |
| draw.c | 594 appendPoint(XPoint *points, int *pointi, int x, int y)
597 points[*pointi].x = x;
598 points[*pointi].y = y;
606 flattenCurve(XPoint *points, int *pointi,
611 x_1 = points[*pointi - 1].x;
612 y_1 = points[*pointi - 1].y;
626 appendPoint (points, pointi, x_4, y_4);
628 flattenCurve (points, pointi,
635 flattenCurve (points, pointi,
652 XPoint points[POINTS_MAX] local
688 points, pointi, CoordModeOrigin); local
[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
|
