- Sort Score
- Result 10 results
- Languages All
Results 211 - 220 of 379 for Words (0.04 sec)
-
src/runtime/stkframe.go
throw("bad symbol table") } locals = stackmapdata(stkmap, stackid) if stackDebug >= 3 && debug { print(" locals ", stackid, "/", stkmap.n, " ", locals.n, " words ", locals.bytedata, "\n") } } else if stackDebug >= 3 && debug { print(" no locals to adjust\n") } } // Arguments. First fetch frame size and special-case argument maps.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 15:10:48 UTC 2024 - 9.9K bytes - Viewed (0) -
src/net/interface_test.go
// Note: BSD variants allow assigning any IPv4/IPv6 address // prefix to IP interface. For example, // - 0.0.0.0/0 through 255.255.255.255/32 // - ::/0 through ffff:ffff:ffff:ffff:ffff:ffff:ffff:ffff/128 // In other words, there is no tightly-coupled combination of // interface address prefixes and connected routes. stats := new(routeStats) for _, ifa := range ifat { switch ifa := ifa.(type) { case *IPNet:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Sep 18 17:20:52 UTC 2023 - 9.8K bytes - Viewed (0) -
src/math/big/int.go
h := nlz(A.abs[n-1]) a1 = A.abs[n-1]<<h | A.abs[n-2]>>(_W-h) // B may have implicit zero words in the high bits if the lengths differ switch { case n == m: a2 = B.abs[n-1]<<h | B.abs[n-2]>>(_W-h) case n == m+1: a2 = B.abs[n-2] >> (_W - h) default: a2 = 0 } // Since we are calculating with full words to avoid overflow, // we use 'even' to track the sign of the cosequences.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 14 17:02:38 UTC 2024 - 33.1K bytes - Viewed (0) -
analysis/analysis-api-fir/src/org/jetbrains/kotlin/analysis/api/fir/references/FirReferenceResolveHelper.kt
if (receiverExpression !is KtDotQualifiedExpression) { // If the receiver is not a KtDotQualifiedExpression, it means we are hitting the end of nested receivers. In other // words, this receiver expression should be pointing at an unqualified name of a class, whose class ID is // `outerClassId`. if (receiverExpression == expression) {
Registered: Wed Jun 12 09:53:16 UTC 2024 - Last Modified: Mon Jun 10 20:18:28 UTC 2024 - 37K bytes - Viewed (0) -
src/runtime/metrics/doc.go
Sum of all metrics in /cpu/classes/gc. /cpu/classes/idle:cpu-seconds Estimated total available CPU time not spent executing any Go or Go runtime code. In other words, the part of /cpu/classes/total:cpu-seconds that was unused. This metric is an overestimate, and not directly comparable to system CPU time measurements. Compare only with other /cpu/classes metrics.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:58:43 UTC 2024 - 20K bytes - Viewed (0) -
tensorflow/compiler/jit/xla_launch_util.h
// missing and adjusts input indices accordingly. All elements in kernel's // input_mapping must be greater than or equal to `missing_ctx_input_prefix` // (in other words, no inputs actually required by the kernel can be missing). absl::StatusOr<std::vector<xla::ExecutionInput>> PopulateInputs( OpKernelContext* ctx, const XlaCompiler::CompilationResult* compilation_result,
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Feb 21 09:53:30 UTC 2024 - 11.8K bytes - Viewed (0) -
src/syscall/syscall_dragonfly.go
// as the size. I don't know why the +2 is here, but the // kernel uses +2 for its own implementation of this function. // I am scared that if we don't include the +2 here, the kernel // will silently write 2 words farther than we specify // and we'll get memory corruption. var buf [CTL_MAXNAME + 2]_C_int n := uintptr(CTL_MAXNAME) * siz p := (*byte)(unsafe.Pointer(&buf[0])) bytes, err := ByteSliceFromString(name)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Sep 20 18:12:35 UTC 2023 - 8.5K bytes - Viewed (0) -
src/cmd/internal/objfile/disasm.go
} if size%4 != 0 || d.goarch == "386" || d.goarch == "amd64" { // Print instruction as bytes. fmt.Fprintf(tw, "%x", code[i:i+size]) } else { // Print instruction as 32-bit words. for j := uint64(0); j < size; j += 4 { if j > 0 { fmt.Fprintf(tw, " ") } fmt.Fprintf(tw, "%08x", d.byteOrder.Uint32(code[i+j:])) } } fmt.Fprintf(tw, "\t%s\t\n", text)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Sep 20 02:13:02 UTC 2022 - 10.5K bytes - Viewed (0) -
cluster/images/etcd/Makefile
--build-arg BASEIMAGE=$(BASEIMAGE) \ --build-arg RUNNERIMAGE=$(RUNNERIMAGE) \ -f $(TEMP_DIR)/$(DOCKERFILE) \ $(TEMP_DIR) docker buildx rm $$BUILDER push: build # split words on hyphen, access by 1-index word-hyphen = $(word $2,$(subst -, ,$1)) sub-build-%: $(MAKE) OUTPUT_TYPE=docker OS=$(call word-hyphen,$*,1) ARCH=$(call word-hyphen,$*,2) build
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Jun 06 16:13:15 UTC 2024 - 11.1K bytes - Viewed (0) -
src/vendor/golang.org/x/crypto/internal/poly1305/sum_generic.go
// We split the final result at the 2¹³⁰ mark into h and cc, the carry. // Note that the carry bits are effectively shifted left by 2, in other // words, cc = c * 4 for the c in the reduction identity. h0, h1, h2 = t0, t1, t2&maskLow2Bits cc := uint128{t2 & maskNotLow2Bits, t3} // To add c * 5 to h, we first add cc = c * 4, and then add (cc >> 2) = c.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jan 22 19:00:13 UTC 2024 - 9.6K bytes - Viewed (0)