Searched refs:points (Results 1 - 25 of 34) sorted by relevance

12

/freebsd-10.1-release/crypto/heimdal/lib/kafs/
H A Dafsl.exp3 * This mumbo jumbo creates entry points to syscalls in _AIX
/freebsd-10.1-release/crypto/openssl/crypto/ec/
H A Dec_mult.c84 EC_POINT **points; /* array with pre-calculated multiples of member in struct:ec_pre_comp_st
112 ret->points = NULL;
141 if (pre->points) {
144 for (p = pre->points; *p != NULL; p++)
146 OPENSSL_free(pre->points);
163 if (pre->points) {
166 for (p = pre->points; *p != NULL; p++) {
170 OPENSSL_free(pre->points);
325 * \sum scalars[i]*points[i],
331 size_t num, const EC_POINT *points[], cons
330 ec_wNAF_mul(const EC_GROUP *group, EC_POINT *r, const BIGNUM *scalar, size_t num, const EC_POINT *points[], const BIGNUM *scalars[], BN_CTX *ctx) argument
748 EC_POINT **points = NULL; local
[all...]
H A Dectest.c240 const EC_POINT *points[6]; local
294 points[0] = Q; /* => infinity */
296 points[1] = P; /* => -P */
298 points[2] = Q; /* => infinity */
300 points[3] = Q; /* => infinity */
302 points[4] = P; /* => P */
304 points[5] = Q; /* => infinity */
305 if (!EC_POINTs_mul(group, P, NULL, 6, points, scalars, ctx))
452 EC_POINT *points[3];
454 points[
880 const EC_POINT *points[4]; local
1394 const EC_POINT *points[3]; local
[all...]
H A Dec_lcl.h176 size_t num, const EC_POINT *points[], const BIGNUM *scalars[],
310 size_t num, const EC_POINT *points[], const BIGNUM *scalars[],
449 const EC_POINT *points[], const BIGNUM *scalars[],
466 const EC_POINT *points[], const BIGNUM *scalars[],
470 const EC_POINT *points[],
486 const EC_POINT *points[], const BIGNUM *scalars[],
490 const EC_POINT *points[],
506 const EC_POINT *points[], const BIGNUM *scalars[],
510 const EC_POINT *points[],
H A Dec_lib.c986 EC_POINT *points[], BN_CTX *ctx)
995 if (group->meth != points[i]->meth) {
1000 return group->meth->points_make_affine(group, num, points, ctx);
1010 size_t num, const EC_POINT *points[],
1015 return ec_wNAF_mul(group, r, scalar, num, points, scalars, ctx);
1017 return group->meth->mul(group, r, scalar, num, points, scalars, ctx);
1025 const EC_POINT *points[1]; local
1028 points[0] = point;
1033 && p_scalar != NULL), points, scalars, ctx);
985 EC_POINTs_make_affine(const EC_GROUP *group, size_t num, EC_POINT *points[], BN_CTX *ctx) argument
1009 EC_POINTs_mul(const EC_GROUP *group, EC_POINT *r, const BIGNUM *scalar, size_t num, const EC_POINT *points[], const BIGNUM *scalars[], BN_CTX *ctx) argument
H A Decp_smpl.c1172 ret = 1; /* points differ */
1195 ret = 1; /* points differ */
1199 /* points are equal */
1250 EC_POINT *points[], BN_CTX *ctx)
1283 * Set each prod_Z[i] to the product of points[0]->Z .. points[i]->Z,
1287 if (!BN_is_zero(&points[0]->Z)) {
1288 if (!BN_copy(prod_Z[0], &points[0]->Z))
1301 if (!BN_is_zero(&points[i]->Z)) {
1303 &points[
1249 ec_GFp_simple_points_make_affine(const EC_GROUP *group, size_t num, EC_POINT *points[], BN_CTX *ctx) argument
[all...]
H A Dec2_mult.c371 * scalar*group->generator + scalars[0]*points[0] + ... + scalars[num-1]*points[num-1]
376 const EC_POINT *points[], const BIGNUM *scalars[],
393 * 2 or fewer points. Use the ec_wNAF_mul implementation for 3 or more
394 * points, or if we can perform a fast multiplication based on
399 ret = ec_wNAF_mul(group, r, scalar, num, points, scalars, ctx);
424 (group, p, scalars[i], points[i], ctx))
374 ec_GF2m_simple_mul(const EC_GROUP *group, EC_POINT *r, const BIGNUM *scalar, size_t num, const EC_POINT *points[], const BIGNUM *scalars[], BN_CTX *ctx) argument
H A Dec2_smpl.c665 * Indicates whether two points are equal.
764 EC_POINT *points[], BN_CTX *ctx)
769 if (!group->meth->make_affine(group, points[i], ctx))
763 ec_GF2m_simple_points_make_affine(const EC_GROUP *group, size_t num, EC_POINT *points[], BN_CTX *ctx) argument
H A Decp_nistp224.c914 * Add two elliptic curve points:
927 * checking whether the two input points are equal, (while not equal to the
995 * the formulae are incorrect if the points are equal so we check for
1155 * other points multiples (every 5th round).
1382 static void make_points_affine(size_t num, felem points[ /* num */ ][3],
1390 points,
1413 * Computes scalar*generator + \sum scalars[i]*points[i], ignoring NULL
1418 const EC_POINT *points[],
1491 * unless we precompute multiples for just one or two points,
1508 * we treat NULL scalars as 0, and NULL points a
1416 ec_GFp_nistp224_points_mul(const EC_GROUP *group, EC_POINT *r, const BIGNUM *scalar, size_t num, const EC_POINT *points[], const BIGNUM *scalars[], BN_CTX *ctx) argument
[all...]
/freebsd-10.1-release/usr.bin/ministat/
H A Dministat.c136 double *points; member in struct:dataset
149 ds->points = calloc(sizeof *ds->points, ds->lpoints);
159 dp = ds->points;
161 ds->points = calloc(sizeof *ds->points, ds->lpoints);
162 memcpy(ds->points, dp, sizeof *dp * ds->n);
165 ds->points[ds->n++] = a;
174 return (ds->points[0]);
181 return (ds->points[d
[all...]
/freebsd-10.1-release/contrib/groff/src/devices/grolbp/
H A Dlbp.h316 vdmpolyline(int numpoints, int *points) argument
318 int i,*p = points;
333 vdmpolygon(int numpoints, int *points) argument
335 int i,*p = points;
363 int points[4]; local
365 points[0] = startx;
366 points[1] = starty;
367 points[2] = sizex;
368 points[3] = sizey;
370 vdmpolyline(2,points);
[all...]
H A Dlbp.cpp402 int *points, i; local
403 points = new int[np + 2];
404 points[0] = hpos;
405 points[1] = vpos;
406 // fprintf(stderr, "Poligon (%d,%d) ", points[0], points[1]);
408 points[i + 2] = p[i];
411 vdmpolygon((np /2) + 1, points);
504 // ending points
/freebsd-10.1-release/contrib/groff/src/devices/xditview/
H A Ddraw.c592 appendPoint(XPoint *points, int *pointi, int x, int y) argument
595 points[*pointi].x = x;
596 points[*pointi].y = y;
604 flattenCurve(XPoint *points, int *pointi, argument
609 x_1 = points[*pointi - 1].x;
610 y_1 = points[*pointi - 1].y;
624 appendPoint (points, pointi, x_4, y_4);
626 flattenCurve (points, pointi,
633 flattenCurve (points, pointi,
650 XPoint points[POINTS_MA local
686 points, pointi, CoordModeOrigin); local
[all...]
/freebsd-10.1-release/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/privs/
H A Dtst.procpriv.ksh81 * If our p_pgidp points to the same pid structure as our p_pidp, we will
/freebsd-10.1-release/contrib/texinfo/info/
H A Dinfo.h100 long *points; /* For each node in NODES, the point. */
99 long *points; /* For each node in NODES, the point. */ member in struct:__anon4583
H A Dsession.c353 info_win->points[info_win->current] = window->point;
370 info_win->points = (long *)NULL;
387 && info_win->points[info_win->current] == window->point)
392 and points as well as nodes, it is more efficient to avoid the
401 info_win->points = (long *) xrealloc (info_win->points,
407 info_win->points[info_win->nodes_index] = window->point;
411 info_win->points[info_win->nodes_index] = 0;
469 maybe_free (info_win->points);
986 window->point = info_win->points[old_curren
[all...]
/freebsd-10.1-release/sbin/ipfw/
H A Ddummynet.c462 * the format of the following lines with data points.
465 * 2 or more lines representing points in the curve,
470 * Data points does not need to be ordered or equal to the number
605 struct point points[ED_MAX_SAMPLES_NO]; local
682 points[points_no].delay = atof(name);
683 points[points_no].prob = atof(arg);
685 points[points_no].delay = atof(arg);
686 points[points_no].prob = atof(name);
688 if (points[points_no].prob > 1.0)
708 /* make sure that there are enough points
[all...]
/freebsd-10.1-release/contrib/gcc/config/i386/
H A Dsol2-ci.asm36 ! This file just supplies labeled starting points for the .init and .fini
/freebsd-10.1-release/contrib/gcc/config/rs6000/
H A Dsol-ci.asm36 # This file just supplies labeled starting points for the .got* and other
H A Dsol-cn.asm36 # This file just supplies labeled ending points for the .got* and other
/freebsd-10.1-release/sys/i386/xen/
H A Dexception.s440 add %eax,%esi # %esi points at end of src region
442 add $0x40,%edi # %edi points at end of dst region
/freebsd-10.1-release/sys/boot/i386/mbr/
H A Dmbr.s128 # Various error message entry points.
/freebsd-10.1-release/contrib/groff/src/roff/troff/
H A Denv.h35 font_size(int points);
/freebsd-10.1-release/crypto/openssl/crypto/bn/asm/
H A Darmv4-mont.pl62 stmdb sp!,{r0,r2} @ sp points at argument block
/freebsd-10.1-release/contrib/compiler-rt/BlocksRuntime/
H A Druntime.c267 * Blocks and Block_byrefs have their own special entry points.
359 * Runtime entry points for maintaining the sharing knowledge of byref data blocks.
379 // src points to stack
519 #pragma mark Compiler SPI entry points
525 Entry points used by the compiler - the real API!

Completed in 365 milliseconds

12