Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 17 for subr32s (0.32 sec)

  1. test/armimm.go

    	if want, got = a^c32a, xor32(a); got != want {
    		panic(fmt.Sprintf("xor32(%x) = %x, want %x", a, got, want))
    	}
    	if want, got = c32a-a, subr32a(a); got != want {
    		panic(fmt.Sprintf("subr32a(%x) = %x, want %x", a, got, want))
    	}
    	if want, got = c32s-a, subr32s(a); got != want {
    		panic(fmt.Sprintf("subr32s(%x) = %x, want %x", a, got, want))
    	}
    	if want, got = a&^c32a, bic32(a); got != want {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 11 13:53:54 UTC 2017
    - 3.9K bytes
    - Viewed (0)
  2. src/math/bits/example_math_test.go

    func ExampleSub32() {
    	// First number is 33<<32 + 23
    	n1 := []uint32{33, 23}
    	// Second number is 21<<32 + 12
    	n2 := []uint32{21, 12}
    	// Sub them together without producing carry.
    	d1, carry := bits.Sub32(n1[1], n2[1], 0)
    	d0, _ := bits.Sub32(n1[0], n2[0], carry)
    	nsum := []uint32{d0, d1}
    	fmt.Printf("%v - %v = %v (carry bit was %v)\n", n1, n2, nsum, carry)
    
    	// First number is 3<<32 + 2147483647
    	n1 = []uint32{3, 0x7fffffff}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Nov 11 21:27:05 UTC 2021
    - 6.3K bytes
    - Viewed (0)
  3. src/cmd/compile/internal/ssa/_gen/dec64.rules

    	(Int64Make
    		(Or32 <typ.UInt32>
    			(Or32 <typ.UInt32>
    				(Lsh32x32 <typ.UInt32> (Int64Hi x) s)
    				(Rsh32Ux32 <typ.UInt32>
    					(Int64Lo x)
    					(Sub32 <typ.UInt32> (Const32 <typ.UInt32> [32]) s)))
    			(Lsh32x32 <typ.UInt32>
    				(Int64Lo x)
    				(Sub32 <typ.UInt32> s (Const32 <typ.UInt32> [32]))))
    		(Lsh32x32 <typ.UInt32> (Int64Lo x) s))
    (Lsh64x16 x s) =>
    	(Int64Make
    		(Or32 <typ.UInt32>
    			(Or32 <typ.UInt32>
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Oct 04 19:35:46 UTC 2022
    - 14.2K bytes
    - Viewed (0)
  4. src/cmd/compile/internal/ssa/_gen/generic.rules

    // x - (C - z) -> x + (z - C) -> (x + z) - C
    (Sub64 x (Sub64 i:(Const64 <t>) z)) && (z.Op != OpConst64 && x.Op != OpConst64) => (Sub64 (Add64 <t> x z) i)
    (Sub32 x (Sub32 i:(Const32 <t>) z)) && (z.Op != OpConst32 && x.Op != OpConst32) => (Sub32 (Add32 <t> x z) i)
    (Sub16 x (Sub16 i:(Const16 <t>) z)) && (z.Op != OpConst16 && x.Op != OpConst16) => (Sub16 (Add16 <t> x z) i)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 16 22:21:05 UTC 2024
    - 135.3K bytes
    - Viewed (0)
  5. test/fixedbugs/issue27718.go

    	inf := 1.0 / zero
    	negZero := -1 / inf
    	if 1/add32(negZero) != inf {
    		panic("negZero+0 != posZero (32 bit)")
    	}
    }
    
    //go:noinline
    func sub32(x float32) float32 {
    	return x - 0
    }
    
    func testSub32() {
    	var zero float32
    	inf := 1.0 / zero
    	negZero := -1 / inf
    	if 1/sub32(negZero) != -inf {
    		panic("negZero-0 != negZero (32 bit)")
    	}
    }
    
    //go:noinline
    func neg32(x float32) float32 {
    	return -x
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Aug 28 02:29:42 UTC 2019
    - 1.6K bytes
    - Viewed (0)
  6. src/math/bits/bits.go

    func Sub(x, y, borrow uint) (diff, borrowOut uint) {
    	if UintSize == 32 {
    		d32, b32 := Sub32(uint32(x), uint32(y), uint32(borrow))
    		return uint(d32), uint(b32)
    	}
    	d64, b64 := Sub64(uint64(x), uint64(y), uint64(borrow))
    	return uint(d64), uint(b64)
    }
    
    // Sub32 returns the difference of x, y and borrow, diff = x - y - borrow.
    // The borrow input must be 0 or 1; otherwise the behavior is undefined.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Oct 19 11:59:09 UTC 2023
    - 17.9K bytes
    - Viewed (0)
  7. src/math/bits/bits_test.go

    		{_M32, _M32, 0, _M32 - 1, 1},
    		{_M32, _M32, 1, _M32, 1},
    	} {
    		test("Add32", Add32, a.x, a.y, a.c, a.z, a.cout)
    		test("Add32 symmetric", Add32, a.y, a.x, a.c, a.z, a.cout)
    		test("Sub32", Sub32, a.z, a.x, a.c, a.y, a.cout)
    		test("Sub32 symmetric", Sub32, a.z, a.y, a.c, a.x, a.cout)
    	}
    }
    
    func TestAddSubUint64(t *testing.T) {
    	test := func(msg string, f func(x, y, c uint64) (z, cout uint64), x, y, c, z, cout uint64) {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Apr 22 20:11:06 UTC 2020
    - 32.5K bytes
    - Viewed (0)
  8. src/cmd/compile/internal/ssa/rewritegeneric.go

    			return true
    		}
    		break
    	}
    	// match: (Sub32 (Sub32 x y) x)
    	// result: (Neg32 y)
    	for {
    		if v_0.Op != OpSub32 {
    			break
    		}
    		y := v_0.Args[1]
    		x := v_0.Args[0]
    		if x != v_1 {
    			break
    		}
    		v.reset(OpNeg32)
    		v.AddArg(y)
    		return true
    	}
    	// match: (Sub32 x (Add32 x y))
    	// result: (Neg32 y)
    	for {
    		x := v_0
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Apr 22 18:24:47 UTC 2024
    - 812.2K bytes
    - Viewed (0)
  9. src/cmd/compile/internal/ssa/rewritedec64.go

    	typ := &b.Func.Config.Types
    	// match: (Lsh64x32 x s)
    	// result: (Int64Make (Or32 <typ.UInt32> (Or32 <typ.UInt32> (Lsh32x32 <typ.UInt32> (Int64Hi x) s) (Rsh32Ux32 <typ.UInt32> (Int64Lo x) (Sub32 <typ.UInt32> (Const32 <typ.UInt32> [32]) s))) (Lsh32x32 <typ.UInt32> (Int64Lo x) (Sub32 <typ.UInt32> s (Const32 <typ.UInt32> [32])))) (Lsh32x32 <typ.UInt32> (Int64Lo x) s))
    	for {
    		x := v_0
    		s := v_1
    		v.reset(OpInt64Make)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Jan 19 22:42:34 UTC 2023
    - 65.3K bytes
    - Viewed (0)
  10. src/internal/trace/traceviewer/static/trace_viewer_full.html

    const nextLevelRows=new Array(nextLevelRowCount);let nextLevelRowIndex=0;currentLevelRows.forEach(function(currentLevelRow){const subRows=currentLevelRow.subRows;if(subRows===undefined||subRows.length===0)return;table.setExpand...
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Nov 21 20:45:06 UTC 2023
    - 2.5M bytes
    - Viewed (0)
Back to top