- Sort Score
- Result 10 results
- Languages All
Results 1 - 4 of 4 for contradiction (0.1 sec)
-
src/cmd/compile/internal/ssa/fuse_branchredirect.go
// 3, For any If block predecessor p, update relationship p->b. // 4, Traverse all successors of b. // 5, For any successor s of b, try to update relationship b->s, if a // contradiction is found then redirect p to another successor of b. func fuseBranchRedirect(f *Func) bool { ft := newFactsTable(f) ft.checkpoint() changed := false for i := len(f.Blocks) - 1; i >= 0; i-- { b := f.Blocks[i]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 16 21:40:11 UTC 2023 - 3.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/sparsetree.go
// entry(x) < entry(y) allows cases x-dom-y and x-then-y. // But by supposition, x does not dominate y. So we have x-then-y. // // For contradiction, assume x dominates z. // Then entry(x) < entry(z) < exit(z) < exit(x). // But we know x-then-y, so entry(x) < exit(x) < entry(y) < exit(y). // Combining those, entry(x) < entry(z) < exit(z) < exit(x) < entry(y) < exit(y).
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 8.1K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/ir/tf_op_interfaces.h
#include "tensorflow/core/framework/resource_mgr.h" namespace mlir { namespace TF { //===----------------------------------------------------------------------===// // TensorFlow Contraction Fusion. //===----------------------------------------------------------------------===// struct ContractionFusion { explicit ContractionFusion( StringRef output_kernel, ArrayRef<int> additional_arguments = {},
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed May 03 19:26:14 UTC 2023 - 6.5K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/fold_broadcast.cc
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 7.9K bytes - Viewed (0)