- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 75 for leash (0.12 sec)
-
cmd/server-rlimit.go
return err } if maxLimit < 4096 && runtime.GOOS != globalWindowsOSName { logger.Info("WARNING: maximum file descriptor limit %d is too low for production servers. At least 4096 is recommended. Fix with \"ulimit -n 4096\"", maxLimit) } if err = sys.SetMaxOpenFileLimit(maxLimit, maxLimit); err != nil { return err } // Set max memory limit as current memory limit.
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Apr 04 12:06:57 GMT 2024 - 2.8K bytes - Viewed (0) -
internal/bucket/bandwidth/reader.go
tokens = need + hdr } else { // part of header can be accommodated r.opts.HeaderSize -= b - 1 need = 1 // to ensure we read at least one byte for every Read tokens = b } } else { // all tokens go towards payload need = int(math.Min(float64(b), float64(need))) tokens = need } err = r.throttle.WaitN(r.ctx, tokens) if err != nil {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Wed Sep 06 03:21:59 GMT 2023 - 3.1K bytes - Viewed (0) -
cmd/encryption-v1.go
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Apr 04 12:04:40 GMT 2024 - 36.5K bytes - Viewed (0) -
docs/debugging/pprofgoparser/main.go
t = time.Duration(a) * time.Minute save(line) record = true } else { skip = true } } } } return ret, nil } const helpUsage = ` At least one argument is required to run this tool. EXAMPLE: ./pprofgoparser --time 50m --margin 1m /path/to/*-goroutines-before,debug=2.txt ` func main() { flag.Parse() if len(flag.Args()) == 0 {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Wed Mar 06 11:43:16 GMT 2024 - 3.4K bytes - Viewed (0) -
docs/metrics/prometheus/list.md
| `minio_cluster_replication_last_hour_failed_count` | (_Site Replication Only_) Total number of objects which failed replication in the last full hour. | | `minio_cluster_replication_last_minute_failed_bytes` | Total number of bytes failed at least once to replicate in the last full minute. |
Plain Text - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Apr 25 22:01:31 GMT 2024 - 43.4K bytes - Viewed (2) -
cmd/erasure-server-pool-decom.go
continue } versionsFound++ } }); err != nil { return err } if versionsFound > 0 { return fmt.Errorf("at least %d object(s)/version(s) were found in bucket `%s` after decommissioning", versionsFound, bi.Name) } } } return nil }
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Wed May 01 15:18:21 GMT 2024 - 41.5K bytes - Viewed (1) -
docs/batch-jobs/README.md
token: "Bearer xxxxx" # optional authentication token for the notification endpoint retry: attempts: 10 # number of retries for the job before giving up delay: "500ms" # least amount of delay between each retry ``` You can create and run multiple 'replication' jobs at a time there are no predefined limits set. ## Batch Jobs Terminology ### Job
Plain Text - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Oct 06 06:00:43 GMT 2022 - 4.8K bytes - Viewed (0) -
cmd/metrics-v3-handler.go
var notFoundHandler http.Handler = http.HandlerFunc(func(w http.ResponseWriter, r *http.Request) { http.Error(w, "Metrics Resource Not found", http.StatusNotFound) }) // Require that metrics path has at least component. if path == "/" { return notFoundHandler } if isListingRequest { handler := h.listMetrics(path) if handler == nil { return notFoundHandler } return handler }
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu May 02 17:37:57 GMT 2024 - 7.5K bytes - Viewed (0) -
cmd/xl-storage.go
} legacyPreserved = true } } } else { // It is possible that some drives may not have `xl.meta` file // in such scenarios verify if at least `part.1` files exist // to verify for legacy version. if formatLegacy { // We only need this code if we are moving // from `xl.json` to `xl.meta`, we can avoid // one extra readdir operation here for all
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Sun Apr 28 17:53:50 GMT 2024 - 84.7K bytes - Viewed (0) -
cmd/endpoint-ellipses.go
// prefers setCounts to be sorted for optimal behavior. if divisibleSize < setCounts[len(setCounts)-1] { return divisibleSize } // Figure out largest value of total_drives_in_erasure_set which results // in least number of total_drives/total_drives_erasure_set ratio. prevD := divisibleSize / setCounts[0] for _, cnt := range setCounts { if divisibleSize%cnt == 0 { d := divisibleSize / cnt if d <= prevD { prevD = d
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri May 03 15:54:03 GMT 2024 - 14.7K bytes - Viewed (0)