- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 27 for l0 (0.02 sec)
-
src/crypto/internal/edwards25519/field/fe_generic.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Sep 27 01:16:19 UTC 2023 - 8.5K bytes - Viewed (0) -
src/crypto/internal/edwards25519/field/_asm/fe_amd64_asm.go
Pragma("noescape") a := Dereference(Param("a")) l0 := namedComponent{a.Field("l0"), "l0"} l1 := namedComponent{a.Field("l1"), "l1"} l2 := namedComponent{a.Field("l2"), "l2"} l3 := namedComponent{a.Field("l3"), "l3"} l4 := namedComponent{a.Field("l4"), "l4"} // r0 = l0×l0 + 19×2×(l1×l4 + l2×l3) r0 := uint128{"r0", GP64(), GP64()} mul64(r0, 1, l0, l0) addMul64(r0, 38, l1, l4) addMul64(r0, 38, l2, l3)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:29:44 UTC 2024 - 7.2K bytes - Viewed (0) -
src/crypto/internal/edwards25519/field/fe.go
c := (v.l0 + 19) >> 51 c = (v.l1 + c) >> 51 c = (v.l2 + c) >> 51 c = (v.l3 + c) >> 51 c = (v.l4 + c) >> 51 // If v < 2^255 - 19 and c = 0, this will be a no-op. Otherwise, it's // effectively applying the reduction identity to the carry. v.l0 += 19 * c v.l1 += v.l0 >> 51 v.l0 = v.l0 & maskLow51Bits v.l2 += v.l1 >> 51 v.l1 = v.l1 & maskLow51Bits
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 11.8K bytes - Viewed (0) -
platforms/jvm/jvm-services/src/main/java/org/gradle/internal/jvm/inspection/MetadataProbe.java
mv.visitCode(); Label l0 = new Label(); mv.visitLabel(l0); mv.visitVarInsn(ALOAD, 0); mv.visitMethodInsn(INVOKESPECIAL, "java/lang/Object", "<init>", "()V", false); mv.visitInsn(RETURN); Label l1 = new Label(); mv.visitLabel(l1); mv.visitLocalVariable("this", "LJavaProbe;", null, l0, l1, 0); mv.visitMaxs(1, 1); mv.visitEnd();
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Sep 28 15:09:49 UTC 2023 - 4.7K bytes - Viewed (0) -
src/crypto/internal/edwards25519/field/fe_amd64.s
MOVQ a+8(FP), CX // r0 = l0×l0 MOVQ (CX), AX MULQ (CX) MOVQ AX, SI MOVQ DX, BX // r0 += 38×l1×l4 MOVQ 8(CX), AX IMUL3Q $0x26, AX, AX MULQ 32(CX) ADDQ AX, SI ADCQ DX, BX // r0 += 38×l2×l3 MOVQ 16(CX), AX IMUL3Q $0x26, AX, AX MULQ 24(CX) ADDQ AX, SI ADCQ DX, BX // r1 = 2×l0×l1 MOVQ (CX), AX SHLQ $0x01, AX
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:29:44 UTC 2024 - 5.7K bytes - Viewed (0) -
src/internal/types/testdata/check/cycles0.go
T8 T6 // arrays A0 /* ERROR "invalid recursive type" */ [10]A0 A1 [10]*A1 A2 /* ERROR "invalid recursive type" */ [10]A3 A3 [10]A4 A4 A2 A5 [10]A6 A6 *A5 // slices L0 []L0 // structs S0 /* ERROR "invalid recursive type: S0 refers to itself" */ struct{ _ S0 } S1 /* ERROR "invalid recursive type: S1 refers to itself" */ struct{ S1 } S2 struct{ _ *S2 } S3 struct{ *S3 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jan 17 19:54:25 UTC 2023 - 3.6K bytes - Viewed (0) -
platforms/documentation/docs/src/docs/css/prettify.css
nt-style:italic}.typ{color:#404;font-weight:700}.lit{color:#044}.pun,.opn,.clo{color:#440}.tag{color:#006;font-weight:700}.atn{color:#404}.atv{color:#060}}pre.prettyprint{padding:2px;border:1px solid #888}ol.linenums{margin-top:0;margin-bottom:0}li.L0,li.L1,li.L2,li.L3,li.L5,li.L6,li.L7,li.L8{list-style-type:none}li.L1,li.L3,li.L5,li.L7,li.L9{background:#eee}...
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Nov 27 17:53:42 UTC 2023 - 673 bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/einsum.cc
} // Calculates dimension for the label L from L0,...,Ln in lhs. if (dnums.lhs_out.empty()) { lhs_shape.push_back(1); out_shape->push_back(1); dnums.lhs_out.emplace_back(lhs_shape.size() - 1, out_shape->size() - 1); ++num_lhs_reshape_segids; } else if (dnums.lhs_rhs_out.empty()) { // If there is not batch labels B0,...,Bn, it is safe to use L0,...,Ln as
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 33.3K bytes - Viewed (0) -
subprojects/core/src/main/java/org/gradle/initialization/MixInLegacyTypesClassLoader.java
mv.visitCode(); Label l0 = new Label(); mv.visitLabel(l0); mv.visitVarInsn(Opcodes.ALOAD, 0); mv.visitFieldInsn(Opcodes.GETFIELD, className, booleanField, "Z"); mv.visitInsn(Opcodes.IRETURN); Label l1 = new Label(); mv.visitLabel(l1); mv.visitLocalVariable("this", "L" + className + ";", null, l0, l1, 0); mv.visitMaxs(1, 1);
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Apr 22 14:04:39 UTC 2024 - 17K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/likelyadjust.go
certain[b.ID] = min8(certain[b0], certain[b1]) l := b2l[b.ID] l0 := b2l[b0] l1 := b2l[b1] prediction := b.Likely // Weak loop heuristic -- both source and at least one dest are in loops, // and there is a difference in the destinations. // TODO what is best arrangement for nested loops? if l != nil && l0 != l1 { noprediction := false switch { // prefer not to exit loops
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 31 21:41:20 UTC 2022 - 15.4K bytes - Viewed (0)