Search Options

Results per page
Sort
Preferred Languages
Advance

Results 21 - 30 of 475 for Koop (0.06 sec)

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

    	HotPgoInitial          = HotPgo | HotInitial                // special case; single block loop, initial block is header block has a flow-in entry, but PGO says it is hot
    	HotPgoInitialNotFLowIn = HotPgo | HotInitial | HotNotFlowIn // PGO says it is hot, and the loop is rotated so flow enters loop with a branch
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 15 15:44:14 UTC 2024
    - 12.2K bytes
    - Viewed (0)
  2. src/cmd/compile/internal/ssa/deadstore_test.go

    	// make sure we don't get into an infinite loop with phi values.
    	c := testConfig(t)
    	ptrType := c.config.Types.BytePtr
    	fun := c.Fun("entry",
    		Bloc("entry",
    			Valu("start", OpInitMem, types.TypeMem, 0, nil),
    			Valu("sb", OpSB, c.config.Types.Uintptr, 0, nil),
    			Valu("v", OpConstBool, c.config.Types.Bool, 1, nil),
    			Valu("addr", OpAddr, ptrType, 0, nil, "sb"),
    			Goto("loop")),
    		Bloc("loop",
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Apr 25 20:07:26 UTC 2024
    - 5.6K bytes
    - Viewed (0)
  3. staging/src/k8s.io/apiserver/pkg/storage/storagebackend/factory/etcd3.go

    }
    
    func newETCD3Check(c storagebackend.Config, timeout time.Duration, stopCh <-chan struct{}) (func() error, error) {
    	// constructing the etcd v3 client blocks and times out if etcd is not available.
    	// retry in a loop in the background until we successfully create the client, storing the client or error encountered
    
    	lock := sync.RWMutex{}
    	var prober *etcd3ProberMonitor
    	clientErr := fmt.Errorf("etcd client connection not yet established")
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Wed Apr 24 07:56:39 UTC 2024
    - 15.1K bytes
    - Viewed (0)
  4. doc/next/6-stdlib/99-minor/reflect/66056.md

    The new methods [Value.Seq] and [Value.Seq2] return sequences that iterate over the value
    as though it were used in a for/range loop.
    The new methods [Type.CanSeq] and [Type.CanSeq2] report whether calling
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 09 11:54:18 UTC 2024
    - 282 bytes
    - Viewed (0)
  5. tensorflow/compiler/jit/shape_inference.cc

                }
              }
            }
          }
        }
    
        // Merge node causes a loop so we remove NextIteration->Merge edge before
        // performing shape inference. But removing those edges also prevents us
        // from inferring output shape for Merge node (we need shapes for all its
        // inputs).
        // For loop invariant resource input's Merge node, we set output resource
        // shape as Enter node's resource shape.
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Fri May 31 00:41:19 UTC 2024
    - 13K bytes
    - Viewed (0)
  6. tensorflow/compiler/mlir/tensorflow/transforms/sparsecore/embedding_sequencing.cc

                                    TF::WhileOp* while_op) {
      // Given a while loop body function 'body_func', find the tf.While Op that
      // uses it.
      auto uses_optional = body_func.getSymbolUses(module);
      if (!uses_optional.has_value()) {
        body_func.emitOpError() << "no use of while loop body";
        return LogicalResult::failure();
      }
      *while_op = nullptr;
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Thu Apr 25 16:01:03 UTC 2024
    - 39.4K bytes
    - Viewed (0)
  7. .github/workflows/feedback.yml

      workflow_dispatch:
    
    permissions: {}
    
    jobs:
      feedback:
        permissions:
          issues: write
          pull-requests: write
        runs-on: ubuntu-latest
        steps:
          # Feedback loop: ask for something on PR/Issue and close if not provided or return to the queue on update.
          # https://github.com/gradle/issue-management-action/blob/main/src/feedback.ts
          - uses: gradle/issue-management-action@v1
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Thu May 02 09:13:16 UTC 2024
    - 516 bytes
    - Viewed (1)
  8. tensorflow/compiler/mlir/lite/transforms/while_loop_outline.cc

      // Collect external values used.
      llvm::SetVector<Value> extern_values;
    
      // The basic block arguments correspond to values that are loop carried, while
      // all those post are loop independent. Initialize extern_values with while_op
      // not loop carried operands.
      auto num_loop_carried = while_op.getCond().getNumArguments();
      auto not_carried_operands =
          while_op.getOperands().drop_front(num_loop_carried);
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Thu Apr 25 16:01:03 UTC 2024
    - 11.8K bytes
    - Viewed (0)
  9. tensorflow/compiler/mlir/lite/tests/tfl_while_outline.mlir

    // Test to verify loop outlining.
    
    // RUN: tf-opt --split-input-file --tfl-while-loop-outline %s | FileCheck %s
    // Check that while loop outlining is nop if re-ran.
    // RUN: tf-opt --tfl-while-loop-outline %s -o %t1
    // RUN: tf-opt --tfl-while-loop-outline %t1 -o %t2
    // RUN: diff %t1 %t2
    
    // CHECK-LABEL: func @while
    func.func @while() -> tensor<1xf32>
        attributes {tf.entry_function = {outputs = "result"}} {
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Thu May 02 09:41:17 UTC 2024
    - 13.5K bytes
    - Viewed (0)
  10. src/crypto/internal/bigmod/nat.go

    	// Eliminate bounds checks in the loop.
    	size := len(x.limbs)
    	xLimbs := x.limbs[:size]
    	yLimbs := y.limbs[:size]
    
    	equal := yes
    	for i := 0; i < size; i++ {
    		equal &= ctEq(xLimbs[i], yLimbs[i])
    	}
    	return equal
    }
    
    // IsZero returns 1 if x == 0, and 0 otherwise.
    func (x *Nat) IsZero() choice {
    	// Eliminate bounds checks in the loop.
    	size := len(x.limbs)
    	xLimbs := x.limbs[:size]
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon May 13 18:57:38 UTC 2024
    - 24K bytes
    - Viewed (0)
Back to top