- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 100 for aloop (0.05 sec)
-
src/cmd/compile/internal/ppc64/ssa.go
// generates STXV instructions on // power9. The Short variation is used // if no loop is generated. // sizes >= 64 generate a loop as follows: // Set up loop counter in CTR, used by BC // XXLXOR clears VS32 // XXLXOR VS32,VS32,VS32 // MOVD len/64,REG_TMP // MOVD REG_TMP,CTR // loop: // STXV VS32,0(R20) // STXV VS32,16(R20)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 19:59:38 UTC 2024 - 55.4K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/sparsecore/embedding_pipelining.cc
// Fourth, add all the inputs to sc_forward(). These all come from the // while loop operands or the non_tpu() call that's in the loop body. The // loop operands need to be pulled from the "i" (or "2") version of the // inputs. The inputs coming from non_tpu() are from the same loop iteration // (non_tpu_res_i). std::vector<Value> f_operands;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 92.9K bytes - Viewed (0) -
src/index/suffixarray/sais2.go
bucketMax_8_64(text, freq, bucket) numLMS := 0 lastB := int64(-1) bucket = bucket[:256] // eliminate bounds check for bucket[c1] below // The next stanza of code (until the blank line) loop backward // over text, stopping to execute a code body at each position i // such that text[i] is an L-character and text[i+1] is an S-character. // That is, i+1 is the position of the start of an LMS-substring.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 18 23:57:18 UTC 2024 - 52.3K 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) -
src/cmd/compile/internal/ssa/prove.go
// nxt = inc + ind // goto loop // // exit_loop: // // is rewritten to: // // loop: // ind = (Phi end nxt) // if (Const [x]) < ind // then goto enter_loop // else goto exit_loop // // enter_loop: // do something without using ind nor nxt // nxt = ind - inc // goto loop // // exit_loop: //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:30:21 UTC 2024 - 48.9K bytes - Viewed (0) -
tensorflow/compiler/jit/deadness_analysis.cc
// // `X` may contain symbolic predicates and the operations corresponding to these // symbolic predicates are either in frame `loop` or outside it. The symbols // that are inside frame `loop` are loop variant (i.e. can have different // liveness in each loop iteration) and the symbols that are outside frame // `loop` are loop invariant (i.e. have the same liveness across all // iterations). class AndRecurrencePredicate : public Predicate { public:
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 60.4K bytes - Viewed (0) -
src/cmd/internal/obj/loong64/asm.go
continue default: c.ctxt.Diag("zero-width instruction\n%v", p) } } pc += int64(m) } c.cursym.Size = pc // mark loop entry instructions for padding // loop entrances are defined as targets of backward branches for p = c.cursym.Func().Text.Link; p != nil; p = p.Link { if q := p.To.Target(); q != nil && q.Pc < p.Pc { q.Mark |= branchLoopHead } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 02:04:54 UTC 2024 - 61.8K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/AbstractFuture.java
removeWaiter(node); break long_wait_loop; // jump down to the busy wait loop } } } oldHead = waiters; // re-read and loop. } while (oldHead != Waiter.TOMBSTONE); } // re-read value, if we get here then we must have observed a TOMBSTONE while trying to add a
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 62.8K bytes - Viewed (1) -
android/guava/src/com/google/common/util/concurrent/AbstractFuture.java
removeWaiter(node); break long_wait_loop; // jump down to the busy wait loop } } } oldHead = waiters; // re-read and loop. } while (oldHead != Waiter.TOMBSTONE); } // re-read value, if we get here then we must have observed a TOMBSTONE while trying to add a
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 63.1K bytes - Viewed (1) -
tensorflow/compiler/mlir/tensorflow/tests/convert_control_to_data_outputs.mlir
!tf_res = tensor<!tf_type.resource<tensor<f32>>> // Do not convert control outputs to chains in the presence of an op with // unknown side effects in the while body. // This test checks that loop signatures are unchanged and no control output is // erased from while loop body. // CHECK-LABEL: func @unknown_resource_op_while_body
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 22 18:35:00 UTC 2024 - 68.9K bytes - Viewed (0)