- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 99 for lineFor (0.39 sec)
-
src/cmd/link/internal/ld/dwarf_test.go
t.Fatalf("FileRef: %v", err) } base := filepath.Base(file) if base != tc.file { t.Errorf("DW_AT_decl_file for main is %v, want %v", base, tc.file) } line, lineOK := maindie.Val(dwarf.AttrDeclLine).(int64) if !lineOK { t.Errorf("missing or invalid DW_AT_decl_line for main") } if line != tc.line { t.Errorf("DW_AT_decl_line for main is %v, want %d", line, tc.line) } }) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Feb 08 01:38:11 UTC 2024 - 48.6K bytes - Viewed (0) -
src/runtime/runtime.go
unlock(&ticks.lock) } // minTimeForTicksPerSecond is the minimum elapsed time we require to consider our ticksPerSecond // measurement to be of decent enough quality for profiling. // // There's a linear relationship here between minimum time and error from the true value. // The error from the true ticks-per-second in a linux/amd64 VM seems to be: // - 1 ms -> ~0.02% error // - 5 ms -> ~0.004% error
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:16:47 UTC 2024 - 9.9K bytes - Viewed (0) -
src/unicode/letter.go
// this CaseRange represents a sequence of the form (say) // [Upper] [Lower] [Upper] [Lower]. const ( UpperLower = MaxRune + 1 // (Cannot be a valid delta.) ) // linearMax is the maximum size table for linear search for non-Latin1 rune. // Derived by running 'go test -calibrate'. const linearMax = 18 // is16 reports whether r is in the sorted slice of 16-bit ranges. func is16(ranges []Range16, r uint16) bool {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Nov 06 20:02:46 UTC 2023 - 10K bytes - Viewed (0) -
src/runtime/asm_wasm.s
TEXT wasm_pc_f_loop(SB),NOSPLIT,$0 // Call the function for the current PC_F. Repeat until PAUSE != 0 indicates pause or exit. // The WebAssembly stack may unwind, e.g. when switching goroutines. // The Go stack on the linear memory is then used to jump to the correct functions // with this loop, without having to restore the full WebAssembly stack. // It is expected to have a pending call before entering the loop, so check PAUSE first. Get PAUSE
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Nov 20 21:26:51 UTC 2023 - 11.8K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/rulegen.go
blockrules := map[string][]Rule{} oprules := map[string][]Rule{} // read rule file scanner := bufio.NewScanner(text) rule := "" var lineno int var ruleLineno int // line number of "=>" for scanner.Scan() { lineno++ line := scanner.Text() if i := strings.Index(line, "//"); i >= 0 { // Remove comments. Note that this isn't string safe, so
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Sep 02 22:09:21 UTC 2023 - 48.7K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/nilcheck_test.go
func BenchmarkNilCheckDeep10000(b *testing.B) { benchmarkNilCheckDeep(b, 10000) } // benchmarkNilCheckDeep is a stress test of nilcheckelim. // It uses the worst possible input: A linear string of // nil checks, none of which can be eliminated. // Run with multiple depths to observe big-O behavior. func benchmarkNilCheckDeep(b *testing.B, depth int) { c := testConfig(b) ptrType := c.config.Types.BytePtr
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 17 23:34:11 UTC 2023 - 12.3K bytes - Viewed (0) -
src/internal/trace/gc.go
// We think of the mutator utilization over time as the // box-filtered utilization function, which we call the // "windowed mutator utilization function". The resulting // function is continuous and piecewise linear (unless // window==0, which we handle elsewhere), where the boundaries // between segments occur when either edge of the window // encounters a change in the instantaneous mutator
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 26K bytes - Viewed (0) -
docs/bucket/replication/setup_ilm_expiry_replication.sh
#!/usr/bin/env bash set -x trap 'catch $LINENO' ERR # shellcheck disable=SC2120 catch() { if [ $# -ne 0 ]; then echo "error on line $1" for site in sitea siteb sitec sited; do echo "$site server logs =========" cat "/tmp/${site}_1.log" echo "===========================" cat "/tmp/${site}_2.log" done fi echo "Cleaning up instances of MinIO" pkill minio pkill -9 minio rm -rf /tmp/multisitea
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Sat May 18 18:19:01 UTC 2024 - 12.8K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 12 17:02:53 UTC 2023 - 29.9K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/stackalloc.go
// TODO: this could be quadratic if lots of variables are live across lots of // basic blocks. Figure out a way to make this function (or, more precisely, the user // of this function) require only linear size & time. func (s *stackAllocState) computeLive(spillLive [][]ID) { s.live = make([][]ID, s.f.NumBlocks()) var phis []*Value live := s.f.newSparseSet(s.f.NumValues()) defer s.f.retSparseSet(live)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Feb 29 21:29:41 UTC 2024 - 12.6K bytes - Viewed (0)