| /external/v8/src/compiler/ |
| tail-call-optimization.cc | 17 Reduction TailCallOptimization::Reduce(Node* node) {
|
| checkpoint-elimination.cc | 41 Reduction CheckpointElimination::Reduce(Node* node) {
|
| js-context-specialization.cc | 19 Reduction JSContextSpecialization::Reduce(Node* node) {
81 // We do not have a concrete context object, so we can only partially reduce
93 // mutable we can only partially reduce the load.
123 // First walk up the context chain in the graph until we reduce the depth to 0
130 // We do not have a concrete context object, so we can only partially reduce
|
| js-frame-specialization.cc | 15 Reduction JSFrameSpecialization::Reduce(Node* node) {
|
| select-lowering.cc | 23 Reduction SelectLowering::Reduce(Node* node) {
|
| dead-code-elimination.cc | 25 Reduction DeadCodeElimination::Reduce(Node* node) {
|
| graph-reducer.cc | 81 Reduction GraphReducer::Reduce(Node* const node) {
85 Reduction reduction = (*i)->Reduce(node);
141 Reduction reduction = Reduce(node);
213 // If there was a replacement, reduce it after popping {node}.
|
| simplified-operator-reducer.cc | 42 Reduction SimplifiedOperatorReducer::Reduce(Node* node) {
|
| value-numbering-reducer.cc | 62 Reduction ValueNumberingReducer::Reduce(Node* node) {
110 // Now we are called again to reduce node1, and we would return NoChange
|
| common-operator-reducer.cc | 50 Reduction CommonOperatorReducer::Reduce(Node* node) {
215 // We might now be able to further reduce the {merge} node.
252 // We might now be able to further reduce the {merge} node.
263 // We might now be able to further reduce the {merge} node.
282 // We might now be able to further reduce the {merge} node.
|
| escape-analysis-reducer.cc | 99 Reduction EscapeAnalysisReducer::Reduce(Node* node) {
|
| redundancy-elimination.cc | 18 Reduction RedundancyElimination::Reduce(Node* node) {
|
| branch-elimination.cc | 28 Reduction BranchElimination::Reduce(Node* node) {
|
| js-inlining-heuristic.cc | 70 Reduction JSInliningHeuristic::Reduce(Node* node) {
|
| typed-optimization.cc | 32 Reduction TypedOptimization::Reduce(Node* node) {
|
| js-call-reducer.cc | 21 Reduction JSCallReducer::Reduce(Node* node) {
153 // Reduce {node} to a JSCallForwardVarargs operation, which just
194 // Try to further reduce the JSCall {node}.
231 // Try to further reduce the JSCall {node}.
573 // Try to further reduce the JSCall {node}.
644 // Try to further reduce the JSCall {node}.
[all...] |
| js-inlining.cc | 447 Reduction JSInliner::Reduce(Node* node) {
|
| js-intrinsic-lowering.cc | 27 Reduction JSIntrinsicLowering::Reduce(Node* node) {
|
| load-elimination.cc | 69 Reduction LoadElimination::Reduce(Node* node) {
[all...] |
| machine-operator-reducer.cc | 146 Reduction MachineOperatorReducer::Reduce(Node* node) {
[all...] |
| /frameworks/compile/libbcc/bcinfo/include/bcinfo/ |
| MetadataExtractor.h | 52 struct Reduce {
53 // These strings are owned by the Reduce instance, and deleted upon its destruction.
66 Reduce() :
72 ~Reduce() {
81 Reduce(const Reduce &) = delete;
82 void operator=(const Reduce &) = delete;
99 const Reduce *mExportReduceList;
222 * \return number of exported general reduce kernels (slots) in this script/module.
229 * \return array of exported general reduce kernel descriptions
[all...] |
| /external/tensorflow/tensorflow/core/graph/ |
| testlib.cc | 149 Node* Reduce(Graph* g, const string& reduce, Node* data, Node* axes,
152 TF_CHECK_OK(NodeBuilder(g->NewName("n"), reduce, g->op_registry())
|
| /external/tensorflow/tensorflow/core/kernels/ |
| reduction_ops_common.h | 88 // tmp_out.reshape(out_reshape) = data.reshape(data_reshape).reduce(axes)
100 // True if need to reduce the 0-th dimension.
129 bool reduce_first_axis_; // True if need to reduce the 0-th dimension.
196 // Reduce to a scalar.
197 Functor::Reduce(ctx, helper.out<T, 0>(&tmp_out), helper.in<T, 1>(data),
201 Functor::Reduce(ctx, helper.out<T, 1>(&tmp_out), helper.in<T, 2>(data),
205 Functor::Reduce(ctx, helper.out<T, 1>(&tmp_out), helper.in<T, 2>(data),
210 Functor::Reduce(ctx, helper.out<T, 1>(&tmp_out), helper.in<T, 3>(data),
214 Functor::Reduce(ctx, helper.out<T, 2>(&tmp_out), helper.in<T, 3>(data),
230 Functor::Reduce(ctx, tmp_out.flat<T>()
[all...] |
| /external/libchrome/crypto/ |
| p224.cc | 33 // exactly, making the reflections during a reduce much nicer.
208 // Reduce reduces the coefficients of in_out to smaller bounds.
212 void Reduce(FieldElement* in_out) {
300 // Reduce the coefficients to < 2**28.
354 // The value is < 2**224, but maybe greater than p. In order to reduce to a
463 Reduce(&h);
470 Reduce(&i);
477 Reduce(&r);
490 Reduce(&r);
498 Reduce(&z2z2)
[all...] |
| /external/tensorflow/tensorflow/compiler/xla/python/ |
| local_computation_builder.cc | 468 ComputationDataHandle LocalComputationBuilder::Reduce(
473 return builder_.Reduce(operand, init_value, local_computation.computation(),
|
