HomeSort by relevance Sort by last modified time
    Searched refs:Peeling (Results 1 - 2 of 2) sorted by null

  /external/eigen/Eigen/src/Jacobi/
Jacobi.h 332 enum { Peeling = 2 };
367 Index peelingEnd = alignedStart + ((size-alignedStart)/(Peeling*PacketSize))*(Peeling*PacketSize);
368 for(Index i=alignedStart; i<peelingEnd; i+=Peeling*PacketSize)
378 px += Peeling*PacketSize;
379 py += Peeling*PacketSize;
  /external/v8/src/compiler/
loop-peeling.cc 5 #include "src/compiler/loop-peeling.h"
13 // Loop peeling is an optimization that copies the body of a loop, creating
104 struct Peeling {
110 Peeling(Graph* graph, Zone* tmp_zone, size_t max, NodeVector* p)
217 Peeling peeling(graph, tmp_zone, estimated_peeled_size, &iter->node_pairs_);
223 peeling.Insert(node, node->InputAt(kAssumedLoopEntryIndex));
227 peeling.CopyNodes(graph, tmp_zone, dead, loop_tree->BodyNodes(loop));
240 inputs.push_back(peeling.map(loop_node->InputAt(i)));
250 inputs.push_back(peeling.map(node->InputAt(1 + i)))
    [all...]

Completed in 84 milliseconds