- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 122 for stackID (0.23 sec)
-
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) -
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 (0) -
tensorflow/compiler/mlir/tensorflow/tests/stack_ops_decomposition.mlir
%stack = "tf.StackV2"(%max_size) {elem_type = f32, stack_name = "s"} : (tensor<i32>) -> tensor<!tf_type.resource> %stack2 = "tf.StackV2"(%max_size) {elem_type = f32, stack_name = "s2"} : (tensor<i32>) -> tensor<!tf_type.resource> %if_op = "tf.If"(%arg0, %stack, %stack2) {then_branch = @if_then, else_branch = @if_else, is_stateless = false}
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Oct 30 06:52:55 UTC 2023 - 25.8K bytes - Viewed (0) -
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) -
src/runtime/debug/stack.go
) // PrintStack prints to standard error the stack trace returned by runtime.Stack. func PrintStack() { os.Stderr.Write(Stack()) } // Stack returns a formatted stack trace of the goroutine that calls it. // It calls [runtime.Stack] with a large enough buffer to capture the entire trace. func Stack() []byte { buf := make([]byte, 1024) for { n := runtime.Stack(buf, false) if n < len(buf) { return buf[:n] }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 16 15:19:04 UTC 2024 - 3.2K bytes - Viewed (0) -
src/runtime/mprof.go
// A StackRecord describes a single execution stack. type StackRecord struct { Stack0 [32]uintptr // stack trace for this record; ends at first 0 entry } // Stack returns the stack trace associated with the record, // a prefix of r.Stack0. func (r *StackRecord) Stack() []uintptr { for i, v := range r.Stack0 { if v == 0 { return r.Stack0[0:i] } } return r.Stack0[0:] }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 17:57:37 UTC 2024 - 53.3K bytes - Viewed (0) -
samples/helloworld/helloworld-dual-stack.yaml
John Howard <******@****.***> 1710626582 -0700
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Sat Mar 16 22:03:02 UTC 2024 - 1.3K bytes - Viewed (0) -
src/runtime/cgo/libcgo_unix.h
// Copyright 2016 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. /* * Initialize g->stacklo. */ extern void _cgo_set_stacklo(G *, uintptr *); /* * Call pthread_create, retrying on EAGAIN. */ extern int _cgo_try_pthread_create(pthread_t*, const pthread_attr_t*, void* (*)(void*), void*); /*
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 22 22:06:46 UTC 2023 - 684 bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/telemetry/internal/counter/stackcounter.go
// by a more efficient mechanism stacks []stack } type stack struct { pcs []uintptr counter *Counter } func NewStack(name string, depth int) *StackCounter { return &StackCounter{name: name, depth: depth, file: &defaultFile} } // Inc increments a stack counter. It computes the caller's stack and // looks up the corresponding counter. It then increments that counter,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:10:54 UTC 2024 - 4.8K bytes - Viewed (0) -
cmd/leak-detect_test.go
"signal.signal_recv", "sigterm.handler", "runtime_mcall", "goroutine in C code", } // Identify whether the stack trace entry is part of ignoredStackFn . func isIgnoredStackFn(stack string) (ok bool) { ok = true for _, stackFn := range ignoredStackFns { if !strings.Contains(stack, stackFn) { ok = false continue } break } return ok }
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Thu Jan 18 07:03:17 UTC 2024 - 5.2K bytes - Viewed (0)