Search Options

Results per page
Sort
Preferred Languages
Advance

Results 21 - 30 of 252 for maskOf (0.12 sec)

  1. src/runtime/mbitmap.go

    	// the address of the first word referenced by mask.
    	addr uintptr
    
    	// mask is a bitmask where each bit corresponds to pointer-words after addr.
    	// Bit 0 is the pointer-word at addr, Bit 1 is the next word, and so on.
    	// If a bit is 1, then there is a pointer at that word.
    	// nextFast and next mask out bits in this mask as their pointers are processed.
    	mask uintptr
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 00:18:55 UTC 2024
    - 60K bytes
    - Viewed (0)
  2. src/runtime/signal_unix.go

    	maskUpdatedChan = make(chan struct{})
    	disableSigChan = make(chan uint32)
    	enableSigChan = make(chan uint32)
    	go func() {
    		// Signal masks are per-thread, so make sure this goroutine stays on one
    		// thread.
    		LockOSThread()
    		defer UnlockOSThread()
    		// The sigBlocked mask contains the signals not active for os/signal,
    		// initially all signals except the essential. When signal.Notify()/Stop is called,
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 10 16:04:54 UTC 2024
    - 45K bytes
    - Viewed (0)
  3. src/runtime/os_linux_mips64x.go

    //go:nosplit
    //go:nowritebarrierrec
    func sigaddset(mask *sigset, i int) {
    	(*mask)[(i-1)/64] |= 1 << ((uint32(i) - 1) & 63)
    }
    
    func sigdelset(mask *sigset, i int) {
    	(*mask)[(i-1)/64] &^= 1 << ((uint32(i) - 1) & 63)
    }
    
    //go:nosplit
    func sigfillset(mask *[2]uint64) {
    	(*mask)[0], (*mask)[1] = ^uint64(0), ^uint64(0)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Dec 05 20:34:30 UTC 2023
    - 996 bytes
    - Viewed (0)
  4. src/runtime/os_linux_mipsx.go

    //go:nosplit
    //go:nowritebarrierrec
    func sigaddset(mask *sigset, i int) {
    	(*mask)[(i-1)/32] |= 1 << ((uint32(i) - 1) & 31)
    }
    
    func sigdelset(mask *sigset, i int) {
    	(*mask)[(i-1)/32] &^= 1 << ((uint32(i) - 1) & 31)
    }
    
    //go:nosplit
    func sigfillset(mask *[4]uint32) {
    	(*mask)[0], (*mask)[1], (*mask)[2], (*mask)[3] = ^uint32(0), ^uint32(0), ^uint32(0), ^uint32(0)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Dec 05 20:34:30 UTC 2023
    - 987 bytes
    - Viewed (0)
  5. src/cmd/internal/obj/ppc64/obj9.go

    }
    
    // Encode a doubleword rotate mask into mb (mask begin) and
    // me (mask end, inclusive). Note, POWER ISA labels bits in
    // big endian order.
    func encodePPC64RLDCMask(mask int64) (mb, me int) {
    	// Determine boundaries and then decode them
    	mb = bits.LeadingZeros64(uint64(mask))
    	me = 64 - bits.TrailingZeros64(uint64(mask))
    	mbn := bits.LeadingZeros64(^uint64(mask))
    	men := 64 - bits.TrailingZeros64(^uint64(mask))
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 22 18:17:17 UTC 2024
    - 40.8K bytes
    - Viewed (0)
  6. cmd/cloud-controller-manager/nodeipamcontroller.go

    	if maskConfigured {
    		// original mask flag is still the main reference.
    		if maskV4Configured || maskV6Configured {
    			return nil, errors.New("usage of --node-cidr-mask-size-ipv4 and --node-cidr-mask-size-ipv6 is not allowed if --node-cidr-mask-size is set. For dual-stack clusters please unset it and use IPFamily specific flags")
    		}
    
    		mask := int(cfg.NodeCIDRMaskSize)
    		return sortedSizes(mask, mask), nil
    	}
    
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Sat Oct 14 19:06:22 UTC 2023
    - 8.9K bytes
    - Viewed (0)
  7. internal/pubsub/pubsub_test.go

    	ch3 := make(chan Maskable, 1)
    	doneCh := make(chan struct{})
    	defer close(doneCh)
    	// Mask matches maskString, should get result
    	if err := ps.Subscribe(Mask(1), ch1, doneCh, func(entry Maskable) bool { return true }); err != nil {
    		t.Fatalf("unexpected error: %v", err)
    	}
    	// Mask matches maskString, should get result
    	if err := ps.Subscribe(Mask(1|2), ch2, doneCh, func(entry Maskable) bool { return true }); err != nil {
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Thu Jan 18 07:03:17 UTC 2024
    - 5.8K bytes
    - Viewed (0)
  8. src/sync/atomic/doc.go

    func AndUint32(addr *uint32, mask uint32) (old uint32)
    
    // AndInt64 atomically performs a bitwise AND operation on *addr using the bitmask provided as mask
    // and returns the old value.
    // Consider using the more ergonomic and less error-prone [Int64.And] instead.
    func AndInt64(addr *int64, mask int64) (old int64)
    
    // AndUint64 atomically performs a bitwise AND operation on *addr using the bitmask provided as mask
    // and returns the old.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Jun 07 21:14:51 UTC 2024
    - 11.7K bytes
    - Viewed (0)
  9. src/net/interface_plan9.go

    			}
    			if ip.To16() != nil && ip.To4() == nil { // IPv6 address
    				mask = CIDRMask(pfxlen, 8*IPv6len)
    			}
    
    			addrs = append(addrs, &IPNet{IP: ip, Mask: mask})
    		}
    	}
    
    	return addrs, nil
    }
    
    // interfaceMulticastAddrTable returns addresses for a specific
    // interface.
    func interfaceMulticastAddrTable(ifi *Interface) ([]Addr, error) {
    	return nil, nil
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon May 06 14:00:54 UTC 2024
    - 4.7K bytes
    - Viewed (0)
  10. staging/src/k8s.io/apiserver/pkg/cel/library/cost.go

    			// So we double the cost of parsing the string.
    			cost := uint64(math.Ceil(float64(actualSize(args[0])) * 2 * common.StringTraversalCostFactor))
    			return &cost
    		}
    	case "masked", "prefixLength", "family", "isUnspecified", "isLoopback", "isLinkLocalMulticast", "isLinkLocalUnicast":
    		// IP and CIDR accessors are nominal cost.
    		cost := uint64(1)
    		return &cost
    	case "containsIP":
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Tue Apr 23 17:22:44 UTC 2024
    - 20.6K bytes
    - Viewed (0)
Back to top