- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 805 for block1 (0.19 sec)
-
tensorflow/compiler/mlir/tensorflow/transforms/sparsecore/embedding_program_key.cc
return tpu_compile_successor; } // Get all the Blocks underneath `top` that are "in the scope" of `bottom`, // i.e., are ancestors. llvm::DenseSet<Block*> GetAllBlocksBetween(Operation* bottom, Operation* top) { llvm::DenseSet<Block*> blocks; Operation* op = bottom; while (op && op != top) { blocks.insert(op->getBlock()); op = op->getParentOp(); } return blocks; }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 17.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/func.go
f.freeValues = v } // NewBlock allocates a new Block of the given kind and places it at the end of f.Blocks. func (f *Func) NewBlock(kind BlockKind) *Block { var b *Block if f.freeBlocks != nil { b = f.freeBlocks f.freeBlocks = b.succstorage[0].b b.succstorage[0].b = nil } else { ID := f.bid.get() if int(ID) < len(f.Cache.blocks) { b = &f.Cache.blocks[ID] b.ID = ID } else {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 25.8K bytes - Viewed (0) -
src/cmd/compile/internal/liveness/plive.go
} c := b.Preds[0].Block() d := b.Preds[1].Block() // Find their common predecessor block (the one that branches based on wb on/off). // It might be a diamond pattern, or one of the blocks in the diamond pattern might // be missing. var decisionBlock *ssa.Block if len(c.Preds) == 1 && c.Preds[0].Block() == d { decisionBlock = d
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 15:22:22 UTC 2024 - 45.2K bytes - Viewed (0) -
JavadocStyleGuide.md
*/ ``` ## 1.3 Code blocks and snippets `<pre>` is the default HTML tag for preformatted text. All code blocks and multi-line snippets should be wrapped in `<pre>{@code ...... }</pre>` at minimum. Code blocks can be optionally formatted and highlighted using [`highlight.js`](https://highlightjs.org/) with the `<code>` tag.
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Jun 06 15:43:07 UTC 2024 - 11.5K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/mod/modfile/rule.go
// If there are no direct-only or indirect-only blocks, a new block may // be inserted after the last require line or block. lastRequireIndex = -1 // If there's only one require line or block, and it's uncommented, // we'll move its requirements to the direct-only or indirect-only blocks. requireLineOrBlockCount = 0 // Track the block each requirement belongs to (if any) so we can // move them later.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 14 18:34:56 UTC 2024 - 46.5K bytes - Viewed (0) -
src/crypto/cipher/gcm.go
*y = z } // updateBlocks extends y with more polynomial terms from blocks, based on // Horner's rule. There must be a multiple of gcmBlockSize bytes in blocks. func (g *gcm) updateBlocks(y *gcmFieldElement, blocks []byte) { for len(blocks) > 0 { y.low ^= byteorder.BeUint64(blocks) y.high ^= byteorder.BeUint64(blocks[8:]) g.mul(y) blocks = blocks[gcmBlockSize:] } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 13.7K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/build/relnote/dump.go
// document to standard output. // It is intended for debugging. func DumpMarkdown(d *md.Document) { dumpBlocks(d.Blocks, 0) } func dumpBlocks(bs []md.Block, depth int) { for _, b := range bs { dumpBlock(b, depth) } } func dumpBlock(b md.Block, depth int) { typeName := strings.TrimPrefix(fmt.Sprintf("%T", b), "*markdown.") dprintf(depth, "%s\n", typeName) switch b := b.(type) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 16:19:04 UTC 2024 - 1.7K bytes - Viewed (0) -
samples/bookinfo/src/details/Gemfile.lock
Brian Sonnenberg <******@****.***> 1716576125 -0700
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Fri May 24 18:42:05 UTC 2024 - 171 bytes - Viewed (0) -
docs/debugging/xl-meta/main.go
} offset := ei.V2Obj.EcBSize * blockNum if offset >= m.size { return nil, fmt.Errorf("block %d out of range. offset %d > size %d", blockNum, offset, m.size) } m.blockOffset = offset m.blocks = (m.size + ei.V2Obj.EcBSize - 1) / ei.V2Obj.EcBSize if m.blocks > 0 { m.blocks-- } if blockNum < m.blocks { m.size = ei.V2Obj.EcBSize } else { m.size -= offset }
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri May 31 14:49:23 UTC 2024 - 38.5K bytes - Viewed (0) -
analysis/analysis-api-fir/src/org/jetbrains/kotlin/analysis/api/fir/components/KtFirExpressionInfoProvider.kt
is KtStringTemplateEntry -> parent.expression == child // Catch blocks are used if the parent-try uses the catch block is KtCatchClause -> doesParentUseChild(parent.parent, parent) // Finally blocks are never used is KtFinallySection -> false is KtPropertyDelegate ->
Registered: Wed Jun 12 09:53:16 UTC 2024 - Last Modified: Wed Jun 05 16:16:39 UTC 2024 - 17.6K bytes - Viewed (0)