- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 2,856 for block1 (0.13 sec)
-
src/cmd/compile/internal/test/testdata/flowgraph_generator1.go
"fmt" "strings" ) // make fake flow graph. // The blocks of the flow graph are designated with letters A // through Z, always including A (start block) and Z (exit // block) The specification of a flow graph is a comma- // separated list of block successor words, for blocks ordered // A, B, C etc, where each block except Z has one or two // successors, and any block except A can be a target. Within
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Dec 23 06:40:04 UTC 2020 - 6.7K bytes - Viewed (0) -
src/go/doc/comment/testdata/code.txt
a block. More text. Blocks can have blank lines. -- markdown -- Text. A tab-indented (no, not eight-space indented) code block and haiku. More text. One space is enough to start a block. More text. Blocks can have blank lines. -- html -- <p>Text.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:31:47 UTC 2022 - 944 bytes - Viewed (0) -
src/cmd/compile/internal/ssa/looprotate.go
for i, b := range f.Blocks { idToIdx[b.ID] = i } // Set of blocks we're moving, by ID. move := map[ID]struct{}{} // Map from block ID to the moving blocks that should // come right after it. after := map[ID][]*Block{} // Check each loop header and decide if we want to move it. for _, loop := range loopnest.loops { b := loop.header var p *Block // b's in-loop predecessor
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 15:44:14 UTC 2024 - 3K bytes - Viewed (0) -
src/cmd/compile/internal/syntax/branches.go
} type label struct { parent *block // block containing this label declaration lstmt *LabeledStmt // statement declaring the label used bool // whether the label is used or not } type block struct { parent *block // immediately enclosing block, or nil start Pos // start of block lstmt *LabeledStmt // labeled statement associated with this block, or nil }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sun Jun 26 00:21:29 UTC 2022 - 9.8K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/deadcode.go
// y = (op1 x ...) // z = (op2 y ...) // Where opX are not Phi ops. But such a situation // implies a cycle in the dominator graph. In the // example, x.Block dominates y.Block, y.Block dominates // z.Block, and z.Block dominates x.Block (treating // "dominates" as reflexive). Cycles in the dominator // graph can only happen in an unreachable cycle. }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Dec 08 00:29:01 UTC 2023 - 9.2K 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) -
platforms/extensibility/plugin-use/src/integTest/groovy/org/gradle/plugin/use/PluginUseDslIntegrationSpec.groovy
failure.assertThatCause(containsString("only buildscript {}, pluginManagement {} and other plugins {} script blocks are allowed before plugins {} blocks, no other statements are allowed")) includesLinkToUserguide() } def "settings scripts can have plugin blocks"() { when: settingsFile.text = """ plugins { id "noop" version "1.0" }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Nov 16 22:36:52 UTC 2023 - 11.7K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/cfg/cfg.go
// // The entry point is Blocks[0]; there may be multiple return blocks. type CFG struct { fset *token.FileSet Blocks []*Block // block[0] is entry; order otherwise undefined } // A Block represents a basic block: a list of statements and // expressions that are always evaluated sequentially. // // A block may have 0-2 successors: zero for a return block or a block
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 02:20:05 UTC 2024 - 7.7K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/dom.go
// which maps block ID to the immediate dominator of that block. // Unreachable blocks map to nil. The entry block maps to nil. func dominatorsSimple(f *Func) []*Block { // A simple algorithm for now // Cooper, Harvey, Kennedy idom := make([]*Block, f.NumBlocks()) // Compute postorder walk post := f.postorder() // Make map from block id to order index (for intersect call)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Dec 03 17:08:51 UTC 2022 - 7.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/fuse_branchredirect.go
// // We can redirect p to s directly. // // The implementation here borrows the framework of the prove pass. // // 1, Traverse all blocks of function f to find If blocks. // 2, For any If block b, traverse all its predecessors to find If blocks. // 3, For any If block predecessor p, update relationship p->b. // 4, Traverse all successors of b. // 5, For any successor s of b, try to update relationship b->s, if a
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 16 21:40:11 UTC 2023 - 3.2K bytes - Viewed (0)