/freebsd-current/crypto/heimdal/lib/kafs/ |
H A D | afsl.exp | 3 * This mumbo jumbo creates entry points to syscalls in _AIX
|
/freebsd-current/usr.bin/ministat/ |
H A D | ministat.c | 141 double *points; member in struct:dataset 155 ds->points = calloc(sizeof *ds->points, ds->lpoints); 156 assert(ds->points != NULL); 167 dp = ds->points; 169 ds->points = calloc(sizeof *ds->points, ds->lpoints); 170 assert(ds->points != NULL); 171 memcpy(ds->points, dp, sizeof *dp * ds->n); 174 ds->points[d [all...] |
/freebsd-current/crypto/openssl/crypto/ec/ |
H A D | 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 410 ossl_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 836 EC_POINT **points = NULL; local [all...] |
H A D | ecp_s390x_nistp.c | 49 size_t num, const EC_POINT *points[], 87 point_ptr = points[0]; 118 rc = ossl_ec_wNAF_mul(group, r, scalar, num, points, scalars, ctx); 290 const EC_POINT *points[], \ 294 return ec_GFp_s390x_nistp_mul(group, r, scalar, num, points, \ 47 ec_GFp_s390x_nistp_mul(const EC_GROUP *group, EC_POINT *r, const BIGNUM *scalar, size_t num, const EC_POINT *points[], const BIGNUM *scalars[], BN_CTX *ctx, unsigned int fc, int len) argument
|
H A D | ec_local.h | 122 * + points[0] * scalars[0] 124 * + points[num-1] * scalars[num-1]. 136 size_t num, const EC_POINT *points[], const BIGNUM *scalars[], 353 size_t num, const EC_POINT *points[], 526 const EC_POINT *points[], const BIGNUM *scalars[], 530 const EC_POINT *points[], 546 const EC_POINT *points[], const BIGNUM *scalars[], 550 const EC_POINT *points[], 566 const EC_POINT *points[], const BIGNUM *scalars[], 570 const EC_POINT *points[], [all...] |
H A D | ecp_smpl.c | 1131 ret = 1; /* points differ */ 1154 ret = 1; /* points differ */ 1158 /* points are equal */ 1207 EC_POINT *points[], BN_CTX *ctx) 1240 * Set each prod_Z[i] to the product of points[0]->Z .. points[i]->Z, 1244 if (!BN_is_zero(points[0]->Z)) { 1245 if (!BN_copy(prod_Z[0], points[0]->Z)) 1258 if (!BN_is_zero(points[i]->Z)) { 1260 meth->field_mul(group, prod_Z[i], prod_Z[i - 1], points[ 1206 ossl_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 | 575 * Indicates whether two points are equal. 682 EC_POINT *points[], BN_CTX *ctx) 687 if (!group->meth->make_affine(group, points[i], ctx)) 870 const EC_POINT *points[], 881 * - r := scalars[0] * points[0] 883 * - r := scalar * G + scalars[0] * points[0] 892 return ossl_ec_wNAF_mul(group, r, scalar, num, points, scalars, ctx); 900 return ossl_ec_scalar_mul_ladder(group, r, scalars[0], points[0], ctx); 904 * r := scalar * G + scalars[0] * points[0] 913 || !ossl_ec_scalar_mul_ladder(group, r, scalars[0], points[ 681 ossl_ec_GF2m_simple_points_make_affine(const EC_GROUP *group, size_t num, EC_POINT *points[], BN_CTX *ctx) argument 868 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 | ec_lib.c | 1042 EC_POINT *points[], BN_CTX *ctx) 1051 if (!ec_point_is_compat(points[i], group)) { 1056 return group->meth->points_make_affine(group, num, points, ctx); 1068 size_t num, const EC_POINT *points[], 1086 if (!ec_point_is_compat(points[i], group)) { 1102 ret = group->meth->mul(group, r, scalar, num, points, scalars, ctx); 1105 ret = ossl_ec_wNAF_mul(group, r, scalar, num, points, scalars, ctx); 1041 EC_POINTs_make_affine(const EC_GROUP *group, size_t num, EC_POINT *points[], BN_CTX *ctx) argument 1067 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 D | ecp_nistp224.c | 890 * Add two elliptic curve points: 903 * checking whether the two input points are equal, (while not equal to the 972 * The formulae are incorrect if the points are equal, in affine coordinates 1158 * other points multiples (every 5th round). 1378 static void make_points_affine(size_t num, felem points[ /* num */ ][3], 1386 points, 1408 * Computes scalar*generator + \sum scalars[i]*points[i], ignoring NULL 1413 const EC_POINT *points[], 1479 * unless we precompute multiples for just one or two points, 1496 * we treat NULL scalars as 0, and NULL points a 1411 ossl_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...] |
H A D | ecp_nistz256.c | 367 * The formulae are incorrect if the points are equal so we check for 391 * When both points are inverse of each other, we know that the affine 629 P256_POINT *temp; /* place for 5 temporary points */ 897 * make multiple points affine at the same time. 951 /* r = scalar*G + sum(scalars[i]*points[i]) */ 956 const EC_POINT *points[], 1139 memcpy(new_points, points, num * sizeof(EC_POINT *)); 1143 points = new_points; 1152 if (!ecp_nistz256_windowed_mul(group, out, scalars, points, num, ctx)) 952 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_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). 1990 /* points below is of size |num|, and tmp_smallfelems is of size |num+1| */ 1991 static void make_points_affine(size_t num, smallfelem points[][3], argument 1999 points, 2020 * Computes scalar*generator + \sum scalars[i]*points[ 2023 ossl_ec_GFp_nistp256_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_nistp521.c | 1202 * This function includes a branch for checking whether the two input points 1300 * The formulae are incorrect if the points are equal, in affine coordinates 1400 * Each contain various points on the curve, where each point is three field 1427 * Tables for other points have table[i] = iG for i in 0 .. 16. */ 1429 /* gmul is the table of precomputed base points */ 1600 * points multiples (every 5th round). 1882 /* points below is of size |num|, and tmp_felems is of size |num+1/ */ 1883 static void make_points_affine(size_t num, felem points[][3], argument 1891 points, 1913 * Computes scalar*generator + \sum scalars[i]*points[ 1916 ossl_ec_GFp_nistp521_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-current/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-current/sys/arm/broadcom/bcm2835/ |
H A D | bcm2835_ft5406.c | 138 int points; local 146 points = GET_NUM_POINTS(sc->sc_window); 150 if (points == NO_POINTS) 153 for (i = 0; i < points; i++) {
|
/freebsd-current/contrib/llvm-project/llvm/include/llvm/Testing/Annotations/ |
H A D | Annotations.h | 21 /// Annotations lets you mark points and ranges inside source code, for tests: 26 /// $definition^class Foo{}; // points can be named: "definition" 33 /// std::vector<size_t> PP = Example.points(); // all unnamed points 43 /// Ranges may be nested (and points can be inside ranges), but there's no way 50 /// 2. making characters for marking points and ranges configurable, 71 /// All points and ranges are relative to this stripped text. 80 /// Returns the position of all points marked by ^ (or $name^) in the text. 82 std::vector<size_t> points(llvm::StringRef Name = "") const; 83 /// Returns the positions and payloads (if any) of all points name [all...] |
/freebsd-current/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-current/contrib/arm-optimized-routines/string/arm/ |
H A D | memchr.S | 130 @ r0 points to the start of the double word after the one that was tested 144 @ r0 currently points to the 3rd byte of the word containing the hit
|
/freebsd-current/contrib/llvm-project/llvm/lib/Testing/Annotations/ |
H A D | Annotations.cpp | 96 std::vector<size_t> Annotations::points(llvm::StringRef Name) const { function in class:Annotations 122 auto Pts = points(Name);
|
/freebsd-current/crypto/openssl/test/ |
H A D | ectest.c | 79 const EC_POINT *points[6]; local 118 points[0] = points[1] = P; 120 if (!TEST_true(EC_POINTs_mul(group, R, NULL, 2, points, scalars, ctx)) 121 || !TEST_true(EC_POINT_dbl(group, S, points[0], ctx)) 126 points[0] = Q; /* => infinity */ 128 points[1] = P; /* => -P */ 130 points[2] = Q; /* => infinity */ 132 points[3] = Q; /* => infinity */ 134 points[ 167 const EC_POINT *points[4]; local 788 const EC_POINT *points[3]; local [all...] |
/freebsd-current/sbin/ipfw/ |
H A D | dummynet.c | 742 * the format of the following lines with data points. 745 * 2 or more lines representing points in the curve, 750 * Data points does not need to be ordered or equal to the number 887 struct point points[ED_MAX_SAMPLES_NO]; local 963 points[points_no].delay = atof(name); 964 points[points_no].prob = atof(arg); 966 points[points_no].delay = atof(arg); 967 points[points_no].prob = atof(name); 969 if (points[points_no].prob > 1.0) 989 /* make sure that there are enough points [all...] |
/freebsd-current/stand/i386/mbr/ |
H A D | mbr.S | 126 # Various error message entry points.
|
/freebsd-current/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-current/lib/libc/amd64/string/ |
H A D | strncmp.S | 118 sub $1, %rdx # RDX--, so RDX points to the last byte to compare 384 add %rax, %rdx # RDX points to buffer end in RSI
|
/freebsd-current/sys/crypto/openssl/arm/ |
H A D | armv4-mont.S | 30 stmdb sp!,{r0,r2} @ sp points at argument block
|
/freebsd-current/crypto/openssl/crypto/sha/asm/ |
H A D | keccak1600p8-ppc.pl | 314 addi r12,r12,`16*16` ; points at iotas 472 addi r12,r12,`16*16` ; points at iotas
|