Search Options

Results per page
Sort
Preferred Languages
Advance

Results 31 - 40 of 47 for __bits (0.17 sec)

  1. src/cmd/compile/internal/ssa/rewrite.go

    		me = 32 - bits.TrailingZeros32(uint32(mask))
    		mbn = bits.LeadingZeros32(^uint32(mask))
    		men = 32 - bits.TrailingZeros32(^uint32(mask))
    	} else {
    		mb = bits.LeadingZeros64(uint64(mask))
    		me = 64 - bits.TrailingZeros64(uint64(mask))
    		mbn = bits.LeadingZeros64(^uint64(mask))
    		men = 64 - bits.TrailingZeros64(^uint64(mask))
    	}
    	// Check for a wrapping mask (e.g bits at 0 and 63)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Jun 07 19:02:52 UTC 2024
    - 64.2K bytes
    - Viewed (0)
  2. src/cmd/compile/internal/types2/gcsizes.go

    // Use of this source code is governed by a BSD-style
    // license that can be found in the LICENSE file.
    
    package types2
    
    type gcSizes struct {
    	WordSize int64 // word size in bytes - must be >= 4 (32bits)
    	MaxAlign int64 // maximum alignment in bytes - must be >= 1
    }
    
    func (s *gcSizes) Alignof(T Type) (result int64) {
    	defer func() {
    		assert(result >= 1)
    	}()
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Feb 22 19:32:17 UTC 2024
    - 4.2K bytes
    - Viewed (0)
  3. src/cmd/internal/obj/riscv/obj.go

    // immIFits checks whether the immediate value x fits in nbits bits
    // as a signed integer. If it does not, an error is returned.
    func immIFits(x int64, nbits uint) error {
    	nbits--
    	min := int64(-1) << nbits
    	max := int64(1)<<nbits - 1
    	if x < min || x > max {
    		if nbits <= 16 {
    			return fmt.Errorf("signed immediate %d must be in range [%d, %d] (%d bits)", x, min, max, nbits)
    		}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Sun Apr 07 03:32:27 UTC 2024
    - 77K bytes
    - Viewed (0)
  4. guava/src/com/google/common/math/LongMath.java

                result *= n;
                result /= i;
              }
              return result;
            } else {
              int nBits = LongMath.log2(n, RoundingMode.CEILING);
    
              long result = 1;
              long numerator = n--;
              long denominator = 1;
    
              int numeratorBits = nBits;
              // This is an upper bound on log2(numerator, ceiling).
    
              /*
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Wed Feb 07 17:50:39 UTC 2024
    - 44.6K bytes
    - Viewed (0)
  5. tensorflow/compiler/mlir/quantization/tensorflow/python/integration_test/quantize_model_test_base.py

          is_qat_model: bool = False,
      ) -> module.Module:
        class EinsumModel(module.Module):
          """Einsum class."""
    
          def __init__(self):
            self._bias = None
            if bias_shape is not None:
              self._bias = array_ops.constant(
                  np.random.uniform(size=bias_shape), dtype=dtypes.float32
              )
    
            self._kernel = np.random.uniform(size=y_shape).astype('f4')
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Thu Mar 21 08:51:46 UTC 2024
    - 51.2K bytes
    - Viewed (0)
  6. src/cmd/compile/internal/types2/sizes.go

    //     types are naturally aligned with a maximum alignment MaxAlign.
    //
    // *StdSizes implements Sizes.
    type StdSizes struct {
    	WordSize int64 // word size in bytes - must be >= 4 (32bits)
    	MaxAlign int64 // maximum alignment in bytes - must be >= 1
    }
    
    func (s *StdSizes) Alignof(T Type) (result int64) {
    	defer func() {
    		assert(result >= 1)
    	}()
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Mar 25 19:53:03 UTC 2024
    - 8.8K bytes
    - Viewed (0)
  7. src/runtime/mgcmark.go

    	// base and extent.
    	b := b0
    	n := n0
    
    	for i := uintptr(0); i < n; {
    		// Find bits for the next word.
    		bits := uint32(*addb(ptrmask, i/(goarch.PtrSize*8)))
    		if bits == 0 {
    			i += goarch.PtrSize * 8
    			continue
    		}
    		for j := 0; j < 8 && i < n; j++ {
    			if bits&1 != 0 {
    				// Same work as in scanobject; see comments there.
    				p := *(*uintptr)(unsafe.Pointer(b + i))
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Apr 18 21:25:11 UTC 2024
    - 52.5K bytes
    - Viewed (0)
  8. src/cmd/link/internal/ld/dwarf.go

    }
    
    // addDwarfAddrField adds a DWARF field in DWARF 64bits or 32bits.
    func (d *dwctxt) addDwarfAddrField(sb *loader.SymbolBuilder, v uint64) {
    	if isDwarf64(d.linkctxt) {
    		sb.AddUint(d.arch, v)
    	} else {
    		sb.AddUint32(d.arch, uint32(v))
    	}
    }
    
    // addDwarfAddrRef adds a DWARF pointer in DWARF 64bits or 32bits.
    func (d *dwctxt) addDwarfAddrRef(sb *loader.SymbolBuilder, t loader.Sym) {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Apr 02 16:25:18 UTC 2024
    - 72.4K bytes
    - Viewed (0)
  9. src/go/types/sizes.go

    //     types are naturally aligned with a maximum alignment MaxAlign.
    //
    // *StdSizes implements Sizes.
    type StdSizes struct {
    	WordSize int64 // word size in bytes - must be >= 4 (32bits)
    	MaxAlign int64 // maximum alignment in bytes - must be >= 1
    }
    
    func (s *StdSizes) Alignof(T Type) (result int64) {
    	defer func() {
    		assert(result >= 1)
    	}()
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Apr 03 18:48:38 UTC 2024
    - 8.9K bytes
    - Viewed (0)
  10. src/runtime/gc_test.go

    	// n must always be a multiple of 8, since gcBits is
    	// always rounded up 8 bytes.
    	for _, n := range []int{8, 16, 32, 64, 128} {
    		b.Run(fmt.Sprintf("bits=%d", n*8), func(b *testing.B) {
    			// Initialize a new byte slice with pseduo-random data.
    			bits := make([]byte, n)
    			rand.Read(bits)
    
    			b.ResetTimer()
    			for i := 0; i < b.N; i++ {
    				runtime.MSpanCountAlloc(s, bits)
    			}
    		})
    	}
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Jun 05 22:33:52 UTC 2024
    - 17.6K bytes
    - Viewed (0)
Back to top