- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 45 for Vt (0.02 sec)
-
src/crypto/sha256/sha256block_ppc64x.s
VADDUWM FUNC, S0, S0; \ VADDUWM s0, xj, xj; \ LVX (TBL)(idx), KI; \ VADDUWM S0, h, h; \ VADDUWM s1, xj, xj #ifdef GOARCH_ppc64le #define VPERMLE(va,vb,vc,vt) VPERM va, vb, vc, vt #else #define VPERMLE(va,vb,vc,vt) #endif // func block(dig *digest, p []byte) TEXT ·block(SB),0,$0-32 MOVD dig+0(FP), CTX MOVD p_base+8(FP), INP MOVD p_len+16(FP), LEN SRD $6, LEN
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:29:44 UTC 2024 - 14.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/writebarrier.go
// Itabs, string data, and closure fields are // read-only once initialized. return true case OpAddr: vt := v.Aux.(*obj.LSym).Type return vt == objabi.SRODATA || vt == objabi.SLIBFUZZER_8BIT_COUNTER || vt == objabi.SCOVERAGE_COUNTER || vt == objabi.SCOVERAGE_AUXVAR } return false } // isVolatile reports whether v is a pointer to argument region on stack which
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 08 19:09:14 UTC 2023 - 23.5K bytes - Viewed (0) -
src/crypto/sha512/sha512block_ppc64x.s
#define s0 V28 #define s1 V29 #define LEMASK V31 // Permutation control register for little endian // VPERM is needed on LE to switch the bytes #ifdef GOARCH_ppc64le #define VPERMLE(va,vb,vc,vt) VPERM va, vb, vc, vt #else #define VPERMLE(va,vb,vc,vt) #endif // 2 copies of each Kt, to fill both doublewords of a vector register DATA ·kcon+0x000(SB)/8, $0x428a2f98d728ae22 DATA ·kcon+0x008(SB)/8, $0x428a2f98d728ae22
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:29:44 UTC 2024 - 15.8K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/analysis/passes/asmdecl/asmdecl.go
kind = dst } else { kind = src } vk := v.kind vs := v.size vt := v.typ switch vk { case asmInterface, asmEmptyInterface, asmString, asmSlice: // allow reference to first word (pointer) vk = v.inner[0].kind vs = v.inner[0].size vt = v.inner[0].typ case asmComplex: // Allow a single instruction to load both parts of a complex. if int(kind) == vs {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 02:38:00 UTC 2024 - 22.8K bytes - Viewed (0) -
src/cmd/internal/notsha256/sha256block_ppc64x.s
VADDUWM FUNC, S0, S0; \ VADDUWM s0, xj, xj; \ LVX (TBL)(idx), KI; \ VADDUWM S0, h, h; \ VADDUWM s1, xj, xj #ifdef GOARCH_ppc64le #define VPERMLE(va,vb,vc,vt) VPERM va, vb, vc, vt #else #define VPERMLE(va,vb,vc,vt) #endif // func block(dig *digest, p []byte) TEXT ·block(SB),0,$0-32 MOVD dig+0(FP), CTX MOVD p_base+8(FP), INP MOVD p_len+16(FP), LEN SRD $6, LEN
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:27 UTC 2023 - 14.5K bytes - Viewed (0) -
src/crypto/tls/testdata/Server-TLSv12-ECDHE-ECDSA-AES
00000090 15 03 03 00 30 00 00 00 00 00 00 00 00 00 00 00 |....0...........| 000000a0 00 00 00 00 00 13 3e 42 a5 61 84 ae 49 8b b9 91 |......>B.a..I...| 000000b0 c2 a3 76 74 1e 4f 53 0a fc 71 de 0d d2 44 c8 ac |..vt.OS..q...D..|
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 25 00:13:30 UTC 2023 - 6.3K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/profile/merge.go
values[i] = s.Value[idx] } s.Value = s.Value[:len(values)] copy(s.Value, values) } return nil } func searchValueType(vts []*ValueType, s string) int { for i, vt := range vts { if vt.Type == s { return i } } return -1
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 16 15:19:53 UTC 2024 - 17K bytes - Viewed (0) -
src/cmd/compile/internal/types2/stmt.go
// look for duplicate types for a given value // (quadratic algorithm, but these lists tend to be very short) for _, vt := range seen[val] { if Identical(v.typ, vt.typ) { err := check.newError(DuplicateCase) err.addf(&v, "duplicate case %s in expression switch", &v) err.addf(vt.pos, "previous case") err.report() continue L } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 30.7K bytes - Viewed (0) -
operator/pkg/translate/translate.go
scope.Debugf("ProtoToHelmValues with path %s, %v (%T)", path, node, node) if util.IsValueNil(node) { return nil } vv := reflect.ValueOf(node) vt := reflect.TypeOf(node) switch vt.Kind() { case reflect.Ptr: if !util.IsNilOrInvalidValue(vv.Elem()) { errs = util.AppendErrs(errs, t.ProtoToHelmValues(vv.Elem().Interface(), root, path)) } case reflect.Struct:
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Mon Feb 12 19:43:09 UTC 2024 - 36.3K bytes - Viewed (0) -
src/main/webapp/js/admin/jquery-3.6.3.min.js
(t){var e,n,r,i,o,a;return m(t)?this.each(function(e){E(this).addClass(t.call(this,e,vt(this)))}):(e=mt(t)).length?this.each(function(){if(r=vt(this),n=1===this.nodeType&&" "+yt(r)+" "){for(o=0;o<e.length;o++)i=e[o],n.indexOf(" "+i+" ")<0&&(n+=i+" ");a=yt(n),r!==a&&this.setAttribute("class",a)}}):this},removeClass:function(t){var e,n,r,i,o,a;return m(t)?this.each(function(e){E(this).removeClass(t.call(this,e,vt(this)))}):arguments.length?(e=mt(t)).length?this.each(function(){if(r=vt(this),n=1===this.nodeType&&"...
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Fri Feb 17 12:13:41 UTC 2023 - 87.8K bytes - Viewed (0)