- Sort Score
- Result 10 results
- Languages All
Results 81 - 90 of 736 for block64 (0.2 sec)
-
subprojects/core/src/main/java/org/gradle/util/internal/DisconnectableInputStream.java
} finally { lock.unlock(); } } /** * Closes this {@code InputStream} for reading. Any threads blocked in read() will receive an end-of-stream. Also requests that the * reader thread stop reading, if possible, but does not block waiting for this to happen. * * <p>NOTE: this method does not close the source input stream.</p> */ @Override
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed Apr 07 08:18:46 UTC 2021 - 6.5K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/critical.go
// critical splits critical edges (those that go from a block with // more than one outedge to a block with more than one inedge). // Regalloc wants a critical-edge-free CFG so it can implement phi values. func critical(f *Func) { // maps from phi arg ID to the new block created for that argument blocks := f.Cache.allocBlockSlice(f.NumValues()) defer f.Cache.freeBlockSlice(blocks) // need to iterate over f.Blocks without range, as we might
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 16 21:40:11 UTC 2023 - 3.1K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/fuse_comparisons.go
func fuseIntegerComparisons(b *Block) bool { if len(b.Preds) != 1 { return false } p := b.Preds[0].Block() if b.Kind != BlockIf || p.Kind != BlockIf { return false } // Don't merge control values if b is likely to be bypassed anyway. if p.Likely == BranchLikely && p.Succs[0].Block() != b { return false } if p.Likely == BranchUnlikely && p.Succs[1].Block() != b { return false }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 4K bytes - Viewed (0) -
testing/internal-integ-testing/src/main/groovy/org/gradle/test/fixtures/server/http/ExpectMethod.java
} SendPartialResponseThenBlock block = new SendPartialResponseThenBlock(lock, timeout, new WaitPrecondition() { @Override public void assertCanWait() throws IllegalStateException { ExpectMethod.this.precondition.assertCanWait(); } }, content); replaceBody(block, block); return this; } @Override
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Apr 04 07:21:38 UTC 2024 - 6.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/GeneratedMonitorTest.java
private static final long SMALL_TIMEOUT_MILLIS = 10; /** How long to wait when determining that a thread is blocked if we expect it to be blocked. */ private static final long EXPECTED_HANG_DELAY_MILLIS = 75; /** * How long to wait when determining that a thread is blocked if we DON'T expect it to be blocked. */ private static final long UNEXPECTED_HANG_DELAY_MILLIS = 10000; /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed May 29 16:29:37 UTC 2024 - 27.1K bytes - Viewed (0) -
src/runtime/sigqueue.go
// variable. It can be in three states: // * sigReceiving means that signal_recv is blocked on sig.Note and there are // no new pending signals. // * sigSending means that sig.mask *may* contain new pending signals, // signal_recv can't be blocked in this state. // * sigIdle means that there are no new pending signals and signal_recv is not // blocked. // // Transitions between states are done atomically with CAS. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 7.6K bytes - Viewed (0) -
cmd/erasure-utils.go
"github.com/klauspost/reedsolomon" ) // getDataBlockLen - get length of data blocks from encoded blocks. func getDataBlockLen(enBlocks [][]byte, dataBlocks int) int { size := 0 // Figure out the data block length. for _, block := range enBlocks[:dataBlocks] { size += len(block) } return size } // Writes all the data blocks from encoded blocks until requested // outSize length. Provides a way to skip bytes until the offset.
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Wed Jan 31 02:11:45 UTC 2024 - 3.1K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/build/relnote/relnote.go
slices.Sort(filenames) return filenames, nil } // lastBlock returns the last block in the document. // It panics if the document has no blocks. func lastBlock(doc *md.Document) md.Block { return doc.Blocks[len(doc.Blocks)-1] } // addLines adds n lines to the position of b. // n can be negative. func addLines(b md.Block, n int) { pos := position(b) pos.StartLine += n pos.EndLine += n }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 16:19:04 UTC 2024 - 12.7K bytes - Viewed (0) -
src/cmd/trace/goroutinegen.go
} if from == trace.GoNotExist && to == trace.GoRunnable { // Goroutine was created. gs.created(ev.Time(), ev.Goroutine(), ev.Stack()) } if from == trace.GoSyscall && to != trace.GoRunning { // Exiting blocked syscall. gs.syscallEnd(ev.Time(), true, ctx) gs.blockedSyscallEnd(ev.Time(), ev.Stack(), ctx) } else if from == trace.GoSyscall { // Check if we're exiting a syscall in a non-blocking way.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 4.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/tighten.go
package ssa import "cmd/compile/internal/base" // tighten moves Values closer to the Blocks in which they are used. // This can reduce the amount of register spilling required, // if it doesn't also create more live values. // A Value can be moved to any block that // dominates all blocks in which it is used. func tighten(f *Func) { if base.Flag.N != 0 && len(f.Blocks) < 10000 { // Skip the optimization in -N mode, except for huge functions.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 16 01:01:38 UTC 2023 - 7.7K bytes - Viewed (0)