- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 545 for iframe (0.09 sec)
-
tensorflow/compiler/jit/deadness_analysis.cc
// the same root frame are placed adjacent to each other. This grouping enables // processing the graph per root frame at a time and guarantees that when a root // frame is being processed, nodes in the downstream frames have not yet been // processed. This property is important because we need to process an entire // frame to know whether the optimistic mode converges or not. In other words,
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 60.4K bytes - Viewed (0) -
src/runtime/traceback_test.go
if !found { fatal("missing (") } frame := parseFrame(funcName, args) cur.frames = append(cur.frames, frame) case elidedRe.MatchString(line): // "...N frames elided..." nStr := elidedRe.FindStringSubmatch(line) n, _ := strconv.Atoi(nStr[1]) frame := &tbFrame{elided: n} cur.frames = append(cur.frames, frame) } } return tbs }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Dec 14 17:22:18 UTC 2023 - 22.9K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/ws/RealWebSocket.kt
): Boolean { // Don't send new frames after we've failed or enqueued a close frame. if (failed || enqueuedClose) return false // If this frame overflows the buffer, reject it and close the web socket. if (queueSize + data.size > MAX_QUEUE_SIZE) { close(CLOSE_CLIENT_GOING_AWAY, null) return false } // Enqueue the message frame. queueSize += data.size.toLong()
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Mon Apr 01 14:21:25 UTC 2024 - 22.1K bytes - Viewed (0) -
test/fixedbugs/issue20780.go
// Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. // We have a limit of 1GB for stack frames. // Make sure we include the callee args section. package main type Big = [400e6]byte func f() { // GC_ERROR "stack frame too large" // Note: This test relies on the fact that we currently always // spill function-results to the stack, even if they're so
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sun Jan 10 08:01:49 UTC 2021 - 755 bytes - Viewed (0) -
src/runtime/stack_test.go
// and that we see TestTracebackSystemstack. countIn, countOut := 0, 0 frames := CallersFrames(pcs) var tb strings.Builder for { frame, more := frames.Next() fmt.Fprintf(&tb, "\n%s+0x%x %s:%d", frame.Function, frame.PC-frame.Entry, frame.File, frame.Line) switch frame.Function { case "runtime.TracebackSystemstack": countIn++ case "runtime_test.TestTracebackSystemstack":
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jun 14 00:03:57 UTC 2023 - 23.1K bytes - Viewed (0) -
src/internal/pkgbits/encoder.go
n := runtime.Callers(2, pcs) frames = fmtFrames(pcs[:n]...) } // TODO(mdempsky): Save space by writing out stack frames as a // linked list so we can share common stack frames. w.rawUvarint(uint64(m)) w.rawUvarint(uint64(len(frames))) for _, frame := range frames { w.rawUvarint(uint64(w.rawReloc(RelocString, w.p.StringIdx(frame)))) } } // Bool encodes and writes a bool value into the element bitstream,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Aug 10 23:26:58 UTC 2022 - 9.6K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/util/flowcontrol/fairqueuing/testing/eventclock/fake.go
nCallers := runtime.Callers(2, pcs[:]) frames := runtime.CallersFrames(pcs[:nCallers]) callers := make(stackExcerpt, 0, 10) more := frames != nil boundary := 1 for i := 0; more && len(callers) < cap(callers); i++ { var frame runtime.Frame frame, more = frames.Next() fileParts := strings.Split(frame.File, "/") isMine := strings.HasSuffix(frame.File, "/fairqueuing/testing/eventclock/fake.go") if isMine {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sun Dec 18 04:27:38 UTC 2022 - 7.9K bytes - Viewed (0) -
src/cmd/trace/pprof.go
for stack, record := range m.stacks { rec := *record i := 0 stack.Frames(func(frame trace.StackFrame) bool { rec.Stack = append(rec.Stack, &trace.Frame{ PC: frame.PC, Fn: frame.Func, File: frame.File, Line: int(frame.Line), }) i++ // Cut this off at pprofMaxStack because that's as far // as our deduplication goes.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 10.1K bytes - Viewed (0) -
platforms/core-runtime/logging/src/main/java/org/gradle/internal/problems/failure/FailurePrinterListener.java
/** * Invoked after a failure header has been printed, and before any stack frames have been printed. */ void beforeFrames(); /** * Invoked before a given stack frame is printed. */ void beforeFrame(StackTraceElement element, StackTraceRelevance relevance); /** * Invoked after all stack frames of a failure have been printed. */ void afterFrames();
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Mar 25 23:45:41 UTC 2024 - 1.5K bytes - Viewed (0) -
src/runtime/stack.go
func adjustframe(frame *stkframe, adjinfo *adjustinfo) { if frame.continpc == 0 { // Frame is dead. return } f := frame.fn if stackDebug >= 2 { print(" adjusting ", funcname(f), " frame=[", hex(frame.sp), ",", hex(frame.fp), "] pc=", hex(frame.pc), " continpc=", hex(frame.continpc), "\n") } // Adjust saved frame pointer if there is one.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:31:00 UTC 2024 - 41.1K bytes - Viewed (0)