/freebsd-13-stable/crypto/heimdal/lib/kafs/ |
H A D | afsl.exp | 3 * This mumbo jumbo creates entry points to syscalls in _AIX
|
/freebsd-13-stable/usr.bin/ministat/ |
H A D | ministat.c | 144 double *points; member in struct:dataset 158 ds->points = calloc(sizeof *ds->points, ds->lpoints); 159 assert(ds->points != NULL); 170 dp = ds->points; 172 ds->points = calloc(sizeof *ds->points, ds->lpoints); 173 assert(ds->points != NULL); 174 memcpy(ds->points, dp, sizeof *dp * ds->n); 177 ds->points[d [all...] |
/freebsd-13-stable/crypto/openssl/crypto/ec/ |
H A D | 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 403 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 828 EC_POINT **points = NULL; local [all...] |
H A D | ec_lib.c | 980 EC_POINT *points[], BN_CTX *ctx) 989 if (!ec_point_is_compat(points[i], group)) { 994 return group->meth->points_make_affine(group, num, points, ctx); 1004 size_t num, const EC_POINT *points[], 1020 if (!ec_point_is_compat(points[i], group)) { 1032 ret = group->meth->mul(group, r, scalar, num, points, scalars, ctx); 1035 ret = ec_wNAF_mul(group, r, scalar, num, points, scalars, ctx); 1046 const EC_POINT *points[1]; local 1049 points[0] = point; 1054 && p_scalar != NULL), points, scalar 979 EC_POINTs_make_affine(const EC_GROUP *group, size_t num, EC_POINT *points[], BN_CTX *ctx) argument 1003 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 [all...] |
H A D | ec_local.h | 126 * + points[0] * scalars[0] 128 * + points[num-1] * scalars[num-1]. 140 size_t num, const EC_POINT *points[], const BIGNUM *scalars[], 342 size_t num, const EC_POINT *points[], const BIGNUM *scalars[], 505 const EC_POINT *points[], const BIGNUM *scalars[], 509 const EC_POINT *points[], 525 const EC_POINT *points[], const BIGNUM *scalars[], 529 const EC_POINT *points[], 545 const EC_POINT *points[], const BIGNUM *scalars[], 549 const EC_POINT *points[], [all...] |
H A D | ecp_smpl.c | 1125 ret = 1; /* points differ */ 1148 ret = 1; /* points differ */ 1152 /* points are equal */ 1201 EC_POINT *points[], BN_CTX *ctx) 1234 * Set each prod_Z[i] to the product of points[0]->Z .. points[i]->Z, 1238 if (!BN_is_zero(points[0]->Z)) { 1239 if (!BN_copy(prod_Z[0], points[0]->Z)) 1252 if (!BN_is_zero(points[i]->Z)) { 1254 meth->field_mul(group, prod_Z[i], prod_Z[i - 1], points[ 1200 ec_GFp_simple_points_make_affine(const EC_GROUP *group, size_t num, EC_POINT *points[], BN_CTX *ctx) argument [all...] |
H A D | ec2_smpl.c | 554 * Indicates whether two points are equal. 649 EC_POINT *points[], BN_CTX *ctx) 654 if (!group->meth->make_affine(group, points[i], ctx)) 837 const EC_POINT *points[], 848 * - r := scalars[0] * points[0] 850 * - r := scalar * G + scalars[0] * points[0] 859 return ec_wNAF_mul(group, r, scalar, num, points, scalars, ctx); 867 return ec_scalar_mul_ladder(group, r, scalars[0], points[0], ctx); 871 * r := scalar * G + scalars[0] * points[0] 880 || !ec_scalar_mul_ladder(group, r, scalars[0], points[ 648 ec_GF2m_simple_points_make_affine(const EC_GROUP *group, size_t num, EC_POINT *points[], BN_CTX *ctx) argument 835 ec_GF2m_simple_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...] |
H A D | ecp_nistz256.c | 361 * The formulae are incorrect if the points are equal so we check for 385 * When both points are inverse of each other, we know that the affine 623 P256_POINT *temp; /* place for 5 temporary points */ 892 * make multiple points affine at the same time. 946 /* r = scalar*G + sum(scalars[i]*points[i]) */ 951 const EC_POINT *points[], 1133 memcpy(new_points, points, num * sizeof(EC_POINT *)); 1137 points = new_points; 1146 if (!ecp_nistz256_windowed_mul(group, out, scalars, points, num, ctx)) 947 ecp_nistz256_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 D | ecp_nistp224.c | 886 * Add two elliptic curve points: 899 * checking whether the two input points are equal, (while not equal to the 968 * The formulae are incorrect if the points are equal, in affine coordinates 1154 * other points multiples (every 5th round). 1372 static void make_points_affine(size_t num, felem points[ /* num */ ][3], 1380 points, 1402 * Computes scalar*generator + \sum scalars[i]*points[i], ignoring NULL 1407 const EC_POINT *points[], 1473 * unless we precompute multiples for just one or two points, 1490 * we treat NULL scalars as 0, and NULL points a [all...] |
H A D | ecp_nistp256.c | 1230 * This function includes a branch for checking whether the two input points 1345 * The formulae are incorrect if the points are equal, in affine coordinates 1441 * Each contain various points on the curve, where each point is three field 1470 * Tables for other points have table[i] = iG for i in 0 .. 16. */ 1472 /* gmul is the table of precomputed base points */ 1691 * other points multiples (every 5th round). 1987 /* points below is of size |num|, and tmp_smallfelems is of size |num+1| */ 1988 static void make_points_affine(size_t num, smallfelem points[][3], 1996 points, 2017 * Computes scalar*generator + \sum scalars[i]*points[ [all...] |
H A D | ecp_nistp521.c | 1150 * This function includes a branch for checking whether the two input points 1248 * The formulae are incorrect if the points are equal, in affine coordinates 1348 * Each contain various points on the curve, where each point is three field 1375 * Tables for other points have table[i] = iG for i in 0 .. 16. */ 1377 /* gmul is the table of precomputed base points */ 1548 * points multiples (every 5th round). 1827 /* points below is of size |num|, and tmp_felems is of size |num+1/ */ 1828 static void make_points_affine(size_t num, felem points[][3], 1836 points, 1858 * Computes scalar*generator + \sum scalars[i]*points[ [all...] |
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Testing/Support/ |
H A D | 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 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;
|
/freebsd-13-stable/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/privs/ |
H A D | tst.procpriv.ksh | 81 * If our p_pgidp points to the same pid structure as our p_pidp, we will
|
/freebsd-13-stable/sys/arm/broadcom/bcm2835/ |
H A D | bcm2835_ft5406.c | 141 int points; local 149 points = GET_NUM_POINTS(sc->sc_window); 153 if (points == NO_POINTS) 156 for (i = 0; i < points; i++) {
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Testing/Support/ |
H A D | Annotations.cpp | 74 std::vector<size_t> Annotations::points(llvm::StringRef Name) const { function in class:Annotations
|
/freebsd-13-stable/contrib/cortex-strings/src/arm/ |
H A D | memchr.S | 133 @ r0 points to the start of the double word after the one that was tested 141 @ r0 currently points to the 3rd byte of the word containing the hit
|
/freebsd-13-stable/sbin/ipfw/ |
H A D | dummynet.c | 735 * the format of the following lines with data points. 738 * 2 or more lines representing points in the curve, 743 * Data points does not need to be ordered or equal to the number 880 struct point points[ED_MAX_SAMPLES_NO]; local 956 points[points_no].delay = atof(name); 957 points[points_no].prob = atof(arg); 959 points[points_no].delay = atof(arg); 960 points[points_no].prob = atof(name); 962 if (points[points_no].prob > 1.0) 982 /* make sure that there are enough points [all...] |
/freebsd-13-stable/stand/i386/mbr/ |
H A D | mbr.S | 128 # Various error message entry points.
|
/freebsd-13-stable/contrib/llvm-project/compiler-rt/lib/BlocksRuntime/ |
H A D | runtime.c | 267 * 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!
|
/freebsd-13-stable/sys/crypto/openssl/arm/ |
H A D | armv4-mont.S | 26 stmdb sp!,{r0,r2} @ sp points at argument block
|
/freebsd-13-stable/crypto/openssl/crypto/sha/asm/ |
H A D | keccak1600p8-ppc.pl | 310 addi r12,r12,`16*16` ; points at iotas 468 addi r12,r12,`16*16` ; points at iotas
|
/freebsd-13-stable/crypto/openssl/include/openssl/ |
H A D | ec.h | 150 * in the group of all points on the elliptic curve. 722 * \return 1 if the points are not equal, 0 if they are, or -1 on error 729 EC_POINT *points[], BN_CTX *ctx);
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Support/Windows/ |
H A D | Path.inc | 744 // Handle reparse points.
|
/freebsd-13-stable/crypto/openssl/crypto/bn/asm/ |
H A D | armv4-mont.pl | 121 stmdb sp!,{r0,r2} @ sp points at argument block
|
/freebsd-13-stable/tools/tools/netmap/ |
H A D | nmreplay.c | 61 * q->cur_pkt points to the buffer containing the packet 1405 char * cur_pkt points to the current packet (linear buffer)
|