Search Options

Results per page
Sort
Preferred Languages
Advance

Results 31 - 40 of 43 for sig1 (0.06 sec)

  1. cmd/kubelet/app/server.go

    			q, err := resource.ParseQuantity(v)
    			if err != nil {
    				return nil, fmt.Errorf("failed to parse quantity %q for %q resource: %w", v, k, err)
    			}
    			if q.Sign() == -1 {
    				return nil, fmt.Errorf("resource quantity for %q cannot be negative: %v", k, v)
    			}
    			rl[v1.ResourceName(k)] = q
    		default:
    			return nil, fmt.Errorf("cannot reserve %q resource", k)
    		}
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Fri Jun 07 00:05:34 UTC 2024
    - 53.9K bytes
    - Viewed (0)
  2. pkg/proxy/nftables/proxier.go

    	"k8s.io/kubernetes/pkg/proxy/metrics"
    	proxyutil "k8s.io/kubernetes/pkg/proxy/util"
    	"k8s.io/kubernetes/pkg/util/async"
    	utilexec "k8s.io/utils/exec"
    	netutils "k8s.io/utils/net"
    	"k8s.io/utils/ptr"
    	"sigs.k8s.io/knftables"
    )
    
    const (
    	// Our nftables table. All of our chains/sets/maps are created inside this table,
    	// so they don't need any "kube-" or "kube-proxy-" prefix of their own.
    	kubeProxyTable = "kube-proxy"
    
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Sat Jun 08 13:48:54 UTC 2024
    - 55.5K bytes
    - Viewed (0)
  3. src/cmd/vendor/golang.org/x/sys/unix/syscall_zos_s390x.go

    	return
    }
    
    //sys	Getegid() (egid int) = SYS_GETEGID
    //sys	Geteuid() (euid int) = SYS_GETEUID
    //sysnb Getsid(pid int) (sid int, err error) = SYS_GETSID
    //sysnb	Getuid() (uid int)
    //sysnb	Kill(pid int, sig Signal) (err error)
    //sys	Lchown(path string, uid int, gid int) (err error) = SYS___LCHOWN_A
    //sys	Link(path string, link string) (err error) = SYS___LINK_A
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 08 16:12:58 UTC 2024
    - 84.4K bytes
    - Viewed (0)
  4. src/crypto/tls/conn.go

    			break
    		}
    	}
    	if x != 0 {
    		// io.Writer and io.Closer should not be used concurrently.
    		// If Close is called while a Write is currently in-flight,
    		// interpret that as a sign that this Close is really just
    		// being used to break the Write and/or clean up resources and
    		// avoid sending the alertCloseNotify, which may block
    		// waiting on handshakeMutex or the c.out mutex.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 03:10:12 UTC 2024
    - 51.8K bytes
    - Viewed (0)
  5. src/cmd/vendor/github.com/ianlancetaylor/demangle/demangle.go

    	}
    	// We don't currently print out the discriminator, so we don't
    	// save it.
    	return a
    }
    
    // closureTypeName parses:
    //
    //	<closure-type-name> ::= Ul <lambda-sig> E [ <nonnegative number> ] _
    //	<lambda-sig> ::= <parameter type>+
    func (st *state) closureTypeName() AST {
    	st.checkChar('U')
    	st.checkChar('l')
    
    	oldLambdaTemplateLevel := st.lambdaTemplateLevel
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 31 19:48:28 UTC 2024
    - 94.1K bytes
    - Viewed (0)
  6. src/time/time_test.go

    		}
    	}
    }
    
    var parseDurationTests = []struct {
    	in   string
    	want Duration
    }{
    	// simple
    	{"0", 0},
    	{"5s", 5 * Second},
    	{"30s", 30 * Second},
    	{"1478s", 1478 * Second},
    	// sign
    	{"-5s", -5 * Second},
    	{"+5s", 5 * Second},
    	{"-0", 0},
    	{"+0", 0},
    	// decimal
    	{"5.0s", 5 * Second},
    	{"5.6s", 5*Second + 600*Millisecond},
    	{"5.s", 5 * Second},
    	{".5s", 500 * Millisecond},
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 03:13:47 UTC 2024
    - 56.5K bytes
    - Viewed (0)
  7. src/time/time.go

    			return w
    		case u < uint64(Microsecond):
    			// print nanoseconds
    			prec = 0
    			buf[w] = 'n'
    		case u < uint64(Millisecond):
    			// print microseconds
    			prec = 3
    			// U+00B5 'µ' micro sign == 0xC2 0xB5
    			w-- // Need room for two bytes.
    			copy(buf[w:], "µ")
    		default:
    			// print milliseconds
    			prec = 6
    			buf[w] = 'm'
    		}
    		w, u = fmtFrac(buf[:w], u, prec)
    		w = fmtInt(buf[:w], u)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 29 17:58:53 UTC 2024
    - 50.7K bytes
    - Viewed (0)
  8. cmd/erasure-object.go

    				return errFileCorrupt
    			}
    			resp, err := disks[index].RenameData(ctx, srcBucket, srcEntry, fi, dstBucket, dstEntry, RenameOptions{})
    			if err != nil {
    				return err
    			}
    			diskVersions[index] = resp.Sign
    			dataDirs[index] = resp.OldDataDir
    			return nil
    		}, index)
    	}
    
    	// Wait for all renames to finish.
    	errs := g.Wait()
    
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Mon Jun 10 15:51:27 UTC 2024
    - 78.6K bytes
    - Viewed (0)
  9. cmd/xl-storage.go

    		// it heal during the regular scanner cycle.
    		dst := []byte{}
    		for _, ver := range xlMeta.versions {
    			dst = slices.Grow(dst, 16)
    			copy(dst[len(dst):], ver.header.VersionID[:])
    		}
    		res.Sign = dst
    	}
    
    	newDstBuf, err := xlMeta.AppendTo(metaDataPoolGet())
    	defer metaDataPoolPut(newDstBuf)
    	if err != nil {
    		if legacyPreserved {
    			s.deleteFile(dstVolumeDir, legacyDataPath, true, false)
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Mon Jun 10 15:51:27 UTC 2024
    - 85.3K bytes
    - Viewed (0)
  10. src/cmd/internal/obj/loong64/asm.go

    				// BFPT and BFPT is 21 bits, and the others are 16 bits. The jump target address
    				// is to logically shift the immediate value in the instruction code to the left
    				// by 2 bits and then sign extend.
    				bound := int64(1 << (18 - 1))
    
    				switch p.As {
    				case ABFPT, ABFPF:
    					bound = int64(1 << (23 - 1))
    				}
    
    				if otxt < -bound || otxt >= bound {
    					q := c.newprog()
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 22 02:04:54 UTC 2024
    - 61.8K bytes
    - Viewed (0)
Back to top