Search Options

Results per page
Sort
Preferred Languages
Advance

Results 81 - 90 of 212 for cond_a (0.21 sec)

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

    	v_1 := v.Args[1]
    	v_0 := v.Args[0]
    	// match: (Load <t> ptr mem)
    	// cond: is32BitFloat(t)
    	// result: (F32Load ptr mem)
    	for {
    		t := v.Type
    		ptr := v_0
    		mem := v_1
    		if !(is32BitFloat(t)) {
    			break
    		}
    		v.reset(OpWasmF32Load)
    		v.AddArg2(ptr, mem)
    		return true
    	}
    	// match: (Load <t> ptr mem)
    	// cond: is64BitFloat(t)
    	// result: (F64Load ptr mem)
    	for {
    		t := v.Type
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Feb 17 03:56:57 UTC 2023
    - 108.6K bytes
    - Viewed (0)
  2. src/cmd/asm/internal/asm/asm.go

    func (p *Parser) append(prog *obj.Prog, cond string, doLabel bool) {
    	if cond != "" {
    		switch p.arch.Family {
    		case sys.ARM:
    			if !arch.ARMConditionCodes(prog, cond) {
    				p.errorf("unrecognized condition code .%q", cond)
    				return
    			}
    
    		case sys.ARM64:
    			if !arch.ARM64Suffix(prog, cond) {
    				p.errorf("unrecognized suffix .%q", cond)
    				return
    			}
    
    		case sys.AMD64, sys.I386:
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 22 02:04:54 UTC 2024
    - 25.5K bytes
    - Viewed (0)
  3. operator/pkg/helmreconciler/wait.go

    			if errGet != nil {
    				return false, errGet
    			}
    			for _, cond := range crd.Status.Conditions {
    				switch cond.Type {
    				case apiextensions.Established:
    					if cond.Status == apiextensions.ConditionTrue {
    						scope.Infof("established CRD %s", crdName)
    						continue descriptor
    					}
    				case apiextensions.NamesAccepted:
    					if cond.Status == apiextensions.ConditionFalse {
    Registered: Fri Jun 14 15:00:06 UTC 2024
    - Last Modified: Fri Dec 08 03:13:12 UTC 2023
    - 13.1K bytes
    - Viewed (0)
  4. tensorflow/compiler/mlir/lite/tests/flatbuffer2mlir/while_op.mlir

      // While %arg0 is greater than zero, element wise add %arg1 with itself.
      %0:2 = "tfl.while"(%arg0, %arg1) ({
      ^bb0(%arg2: tensor<*xi32>, %arg3: tensor<*xf32>):
        %1 = func.call @cond(%arg2, %arg3) : (tensor<*xi32>, tensor<*xf32>) -> tensor<i1>
        "tfl.yield"(%1) : (tensor<i1>) -> ()
      },  {
      ^bb0(%arg2: tensor<*xi32>, %arg3: tensor<*xf32>):
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Thu Jul 14 16:41:28 UTC 2022
    - 2K bytes
    - Viewed (0)
  5. src/cmd/asm/internal/arch/arm64.go

    	return false
    }
    
    // ARM64Suffix handles the special suffix for the ARM64.
    // It returns a boolean to indicate success; failure means
    // cond was unrecognized.
    func ARM64Suffix(prog *obj.Prog, cond string) bool {
    	if cond == "" {
    		return true
    	}
    	bits, ok := parseARM64Suffix(cond)
    	if !ok {
    		return false
    	}
    	prog.Scond = bits
    	return true
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Sep 29 09:04:58 UTC 2022
    - 10.4K bytes
    - Viewed (0)
  6. src/cmd/compile/internal/ssa/rewritedec64.go

    		v.AddArg2(v0, v3)
    		return true
    	}
    }
    func rewriteValuedec64_OpArg(v *Value) bool {
    	b := v.Block
    	config := b.Func.Config
    	typ := &b.Func.Config.Types
    	// match: (Arg {n} [off])
    	// cond: is64BitInt(v.Type) && !config.BigEndian && v.Type.IsSigned() && !(b.Func.pass.name == "decompose builtin")
    	// result: (Int64Make (Arg <typ.Int32> {n} [off+4]) (Arg <typ.UInt32> {n} [off]))
    	for {
    		off := auxIntToInt32(v.AuxInt)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Jan 19 22:42:34 UTC 2023
    - 65.3K bytes
    - Viewed (0)
  7. src/crypto/internal/nistec/p256.go

    	q.x.Set(x3)
    	q.y.Set(y3)
    	q.z.Set(z3)
    	return q
    }
    
    // Select sets q to p1 if cond == 1, and to p2 if cond == 0.
    func (q *P256Point) Select(p1, p2 *P256Point, cond int) *P256Point {
    	q.x.Select(p1.x, p2.x, cond)
    	q.y.Select(p1.y, p2.y, cond)
    	q.z.Select(p1.z, p2.z, cond)
    	return q
    }
    
    // A p256Table holds the first 15 multiples of a point at offset -1, so [1]P
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Mar 04 17:29:44 UTC 2024
    - 17.2K bytes
    - Viewed (0)
  8. test/literal2.go

    // Test Go2 literal syntax for basic types.
    // Avoid running gofmt on this file to preserve the
    // test cases with upper-case prefixes (0B, 0O, 0X).
    
    package main
    
    import "fmt"
    
    func assert(cond bool) {
    	if !cond {
    		panic("assertion failed")
    	}
    }
    
    func equal(x, y interface{}) bool {
    	if x != y {
    		fmt.Printf("%g != %g\n", x, y)
    		return false
    	}
    	return true
    }
    
    func main() {
    	// 0-octals
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Feb 19 22:45:09 UTC 2019
    - 2.2K bytes
    - Viewed (0)
  9. test/iota.go

    // Copyright 2009 The Go Authors. All rights reserved.
    // Use of this source code is governed by a BSD-style
    // license that can be found in the LICENSE file.
    
    // Test iota.
    
    package main
    
    func assert(cond bool, msg string) {
    	if !cond {
    		print("assertion fail: ", msg, "\n")
    		panic(1)
    	}
    }
    
    const (
    	x int = iota
    	y = iota
    	z = 1 << iota
    	f float32 = 2 * iota
    	g float32 = 4.5 * float32(iota)
    )
    
    const (
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Feb 23 07:47:26 UTC 2012
    - 1.6K bytes
    - Viewed (0)
  10. src/crypto/internal/nistec/p224_sqrt.go

    	for i := 96 - 1; i >= 1; i-- {
    		w := new(fiat.P224Element).Set(v)
    		for j := 0; j < i-1; j++ {
    			w.Square(w)
    		}
    		cond := w.Equal(p224MinusOne)
    		v.Select(t0.Mul(v, &p224GG[96-i]), v, cond)
    		r.Select(t0.Mul(r, &p224GG[96-i-1]), r, cond)
    	}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Aug 12 00:04:29 UTC 2022
    - 3.1K bytes
    - Viewed (1)
Back to top