Search Options

Results per page
Sort
Preferred Languages
Advance

Results 21 - 30 of 141 for stacklo (0.27 sec)

  1. src/cmd/vendor/github.com/google/pprof/internal/driver/stacks.go

    		return // error already reported
    	}
    
    	// Make stack data and generate corresponding JSON.
    	stacks := rpt.Stacks()
    	b, err := json.Marshal(stacks)
    	if err != nil {
    		http.Error(w, "error serializing stacks for flame graph",
    			http.StatusInternalServerError)
    		ui.options.UI.PrintErr(err)
    		return
    	}
    
    	nodes := make([]string, len(stacks.Sources))
    	for i, src := range stacks.Sources {
    		nodes[i] = src.FullName
    	}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 31 19:48:28 UTC 2024
    - 1.7K bytes
    - Viewed (0)
  2. src/cmd/vendor/github.com/google/pprof/internal/driver/html/stacks.html

    <!DOCTYPE html>
    <html>
    <head>
      <meta charset="utf-8">
      <title>{{.Title}}</title>
      {{template "css" .}}
      {{template "stacks_css"}}
    </head>
    <body>
      {{template "header" .}}
      <div id="stack-holder">
        <div id="stack-chart"></div>
        <div id="current-details"></div>
      </div>
      <div id="action-menu" class="submenu">
        <span id="action-title"></span>
        <hr>
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 31 19:48:28 UTC 2024
    - 1K bytes
    - Viewed (1)
  3. src/internal/trace/generation.go

    	return nil
    }
    
    // validateStackStrings makes sure all the string references in
    // the stack table are present in the string table.
    func validateStackStrings(
    	stacks *dataTable[stackID, stack],
    	strings *dataTable[stringID, string],
    	frames map[uint64]frame,
    ) error {
    	var err error
    	stacks.forEach(func(id stackID, stk stack) bool {
    		for _, pc := range stk.pcs {
    			frame, ok := frames[pc]
    			if !ok {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 30 22:14:45 UTC 2024
    - 12.1K bytes
    - Viewed (0)
  4. src/internal/trace/testdata/testprog/stacks.go

    	defer trace.Stop() // in case of early return
    
    	// Now we will do a bunch of things for which we verify stacks later.
    	// It is impossible to ensure that a goroutine has actually blocked
    	// on a channel, in a select or otherwise. So we kick off goroutines
    	// that need to block first in the hope that while we are executing
    	// the rest of the test, they will block.
    	go func() { // func1
    		select {}
    	}()
    	go func() { // func2
    		var c chan int
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 17 18:48:18 UTC 2024
    - 2.4K bytes
    - Viewed (0)
  5. test/codegen/stack.go

    // license that can be found in the LICENSE file.
    
    package codegen
    
    import "runtime"
    
    // This file contains code generation tests related to the use of the
    // stack.
    
    // Check that stack stores are optimized away.
    
    // 386:"TEXT\t.*, [$]0-"
    // amd64:"TEXT\t.*, [$]0-"
    // arm:"TEXT\t.*, [$]-4-"
    // arm64:"TEXT\t.*, [$]0-"
    // mips:"TEXT\t.*, [$]-4-"
    // ppc64x:"TEXT\t.*, [$]0-"
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Feb 29 21:29:41 UTC 2024
    - 3.4K bytes
    - Viewed (0)
  6. src/cmd/internal/objabi/stack.go

    )
    
    func StackNosplit(race bool) int {
    	// This arithmetic must match that in runtime/stack.go:stackNosplit.
    	return abi.StackNosplitBase * stackGuardMultiplier(race)
    }
    
    // stackGuardMultiplier returns a multiplier to apply to the default
    // stack guard size. Larger multipliers are used for non-optimized
    // builds that have larger stack frames or for specific targets.
    func stackGuardMultiplier(race bool) int {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Apr 21 19:28:56 UTC 2023
    - 904 bytes
    - Viewed (0)
  7. test/fixedbugs/issue8047.go

    // Use of this source code is governed by a BSD-style
    // license that can be found in the LICENSE file.
    
    // Issue 8047.  Stack copier shouldn't crash if there
    // is a nil defer.
    
    package main
    
    func stackit(n int) {
    	if n == 0 {
    		return
    	}
    	stackit(n - 1)
    }
    
    func main() {
    	defer func() {
    		// catch & ignore panic from nil defer below
    		err := recover()
    		if err == nil {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon May 02 13:43:18 UTC 2016
    - 530 bytes
    - Viewed (0)
  8. src/cmd/cgo/internal/test/callback.go

    		Used += c
    	}
    }
    
    var splitTests = []func(){
    	// Edit .+1,/^}/-1|seq 4 4 5000 | sed 's/.*/	stack&,/' | fmt
    	stack4, stack8, stack12, stack16, stack20, stack24, stack28,
    	stack32, stack36, stack40, stack44, stack48, stack52, stack56,
    	stack60, stack64, stack68, stack72, stack76, stack80, stack84,
    	stack88, stack92, stack96, stack100, stack104, stack108, stack112,
    	stack116, stack120, stack124, stack128, stack132, stack136,
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 12 12:00:02 UTC 2023
    - 111.5K bytes
    - Viewed (0)
  9. src/cmd/asm/internal/lex/stack.go

    import (
    	"text/scanner"
    
    	"cmd/internal/src"
    )
    
    // A Stack is a stack of TokenReaders. As the top TokenReader hits EOF,
    // it resumes reading the next one down.
    type Stack struct {
    	tr []TokenReader
    }
    
    // Push adds tr to the top (end) of the input stack. (Popping happens automatically.)
    func (s *Stack) Push(tr TokenReader) {
    	s.tr = append(s.tr, tr)
    }
    
    func (s *Stack) Next() ScanToken {
    	tos := s.tr[len(s.tr)-1]
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Jan 09 22:33:23 UTC 2017
    - 1.2K bytes
    - Viewed (0)
  10. test/stack.go

    // Copyright 2009 The Go Authors. All rights reserved.
    // Use of this source code is governed by a BSD-style
    // license that can be found in the LICENSE file.
    
    // Test stack splitting code.
    // Try to tickle stack splitting bugs by doing
    // go, defer, and closure calls at different stack depths.
    
    package main
    
    type T [20]int
    
    func g(c chan int, t T) {
    	s := 0
    	for i := 0; i < len(t); i++ {
    		s += t[i]
    	}
    	c <- s
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Feb 24 00:48:19 UTC 2012
    - 1.7K bytes
    - Viewed (0)
Back to top