- Sort Score
- Result 10 results
- Languages All
Results 101 - 110 of 1,361 for aloop (0.1 sec)
-
src/net/write_unix_test.go
//go:build darwin || dragonfly || freebsd || linux || netbsd || openbsd || solaris package net import ( "bytes" "syscall" "testing" "time" ) // Test that a client can't trigger an endless loop of write system // calls on the server by shutting down the write side on the client. // Possibility raised in the discussion of https://golang.org/cl/71973. func TestEndlessWrite(t *testing.T) { t.Parallel()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 28 18:17:57 UTC 2021 - 1.6K bytes - Viewed (0) -
pkg/controller/daemon/update.go
// When not surging, we delete just enough pods to stay under the maxUnavailable limit, if any // are necessary, and let the core loop create new instances on those nodes. // // Assumptions: // * Expect manage loop to allow no more than one pod per node // * Expect manage loop will create new pods // * Expect manage loop will handle failed pods // * Deleted pods do not count as unavailable so that updates make progress when nodes are down
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon May 13 16:53:53 UTC 2024 - 24.4K bytes - Viewed (0) -
tensorflow/compiler/mlir/tf2xla/transforms/legalization_op_config_test.cc
} TEST_F(LegalizationOpConfigTest, ExpectsTrueForTF2XLATypeID) { EXPECT_TRUE(HasTf2XlaFallback(TypeID::get<TF::AllOp>())); EXPECT_TRUE(IsOpAllowedTf2xlaPreferred(TypeID::get<TF::AllOp>())); EXPECT_FALSE(IsTypeLegalizedWithMlir(TypeID::get<TF::AllOp>())); } TEST_F(LegalizationOpConfigTest, ChecksDynamicPadderOps) { EXPECT_TRUE(
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu May 30 03:31:01 UTC 2024 - 8.4K bytes - Viewed (0) -
src/crypto/subtle/xor_generic.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 31 23:25:07 UTC 2023 - 1.7K bytes - Viewed (0) -
pkg/kubelet/pluginmanager/plugin_manager.go
type pluginManager struct { // desiredStateOfWorldPopulator (the plugin watcher) runs an asynchronous // periodic loop to populate the desiredStateOfWorld. desiredStateOfWorldPopulator *pluginwatcher.Watcher // reconciler runs an asynchronous periodic loop to reconcile the // desiredStateOfWorld with the actualStateOfWorld by triggering register // and unregister operations using the operationExecutor.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Jul 01 05:56:33 UTC 2022 - 4.3K bytes - Viewed (0) -
src/math/big/arith_s390x.s
MOVD $0, R4 // c = 0 MOVD $0, R0 // make sure it's zero MOVD $0, R10 // i = 0 // s/JL/JMP/ below to disable the unrolled loop SUB $4, R3 BLT v1 SUB $12, R3 // n -= 16 BLT A1 // if n < 0 goto A1 MOVD R8, R5 MOVD R9, R6 MOVD R2, R7 // n >= 0 // regular loop body unrolled 16x VZERO V0 // c = 0 UU1: VLM 0(R5), V1, V4 // 64-bytes into V1..V8 ADD $64, R5
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:27 UTC 2023 - 20.3K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/g3doc/tf_dialects.md
matches TensorFlow semantics. ## Example Below is an example of a loop decrementing an initial `%_count.init` integer until it reaches 0 and returns the last value in the loop. ```mlir {.mlir} // Loop `%count.init` times and return the last counter (always zero) %fetches = tf_executor.graph { %loop.init, %ctl0 = tf_executor.Enter %count.init : i32
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Oct 13 16:33:28 UTC 2021 - 16K bytes - Viewed (0) -
tensorflow/compiler/jit/deadness_analysis_test.cc
"{#true,&,*iv0/cond:0}<loop>"); EXPECT_EQ(predicate_map[ControlOutputFor(dependent_iv0)], "{#true,&,(iv0/iv:0 & *iv0/cond:0)}<loop>"); EXPECT_EQ(predicate_map[ControlOutputFor(dependent_iv1)], "{#true,&,(iv0/iv:0 & *iv0/cond:0)}<loop>"); EXPECT_EQ(predicate_map[ControlOutputFor(add0)], "{#true,&,(iv0/iv:0 & *iv0/cond:0)}<loop>"); } }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 22 06:59:07 UTC 2024 - 51.6K bytes - Viewed (0) -
tensorflow/compiler/jit/xla_cluster_util.cc
// detection graph, disconnecting each loop from the enclosing graph. // Specifically, we: // * add a new "frame" node for each loop. // * replace edges to "Enter" nodes, and edges from "Exit" nodes with edges // to/from the corresponding frame node. In essence, we collapse the loop // into a single node for the purpose of cycle detection in the enclosing // graph.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 29 08:39:39 UTC 2024 - 21.3K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/decompose_reduce_dataset.cc
/*parallel_iterations=*/10, false, /*shape_invariant=*/false); // `_lower_using_switch_merge` is the default for While ops created // in TensorFlow and allows lowering to V1 control flow for loop // parallelization. dataset_while->setAttr("_lower_using_switch_merge", builder.getBoolAttr(true)); return dataset_while; }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 14K bytes - Viewed (0)