HomeSort by: relevance | last modified time | path
    Searched refs:Simplify (Results 1 - 4 of 4) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonVectorCombine.cpp 1298 auto Simplify = [&](Value *V) {
1334 // First, try to simplify the subtraction directly.
1336 Simplify(CallBuilder(B, CreateSub(Idx0, Idx1)))))
1346 Value *AndU0 = Simplify(CallBuilder(B, CreateAnd(Idx0, MaskU)));
1347 Value *AndU1 = Simplify(CallBuilder(B, CreateAnd(Idx1, MaskU)));
1348 Value *SubU = Simplify(CallBuilder(B, CreateSub(AndU0, AndU1)));
1357 Value *AndK0 = Simplify(CallBuilder(B, CreateAnd(Idx0, MaskK)));
1358 Value *AndK1 = Simplify(CallBuilder(B, CreateAnd(Idx1, MaskK)));
1359 Value *SubK = Simplify(CallBuilder(B, CreateSub(AndK0, AndK1)));
  /src/external/bsd/pcc/dist/pcc/mip/
regs.c 757 RDEBUG(("MkWorklist: spill %d freeze %d simplify %d\n", s,f,d));
1839 Simplify(void)
1847 RDEBUG(("Simplify: node %d class %d\n", ASGNUM(w), w->r_class));
3036 Simplify();
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
CodeGenPrepare.cpp 839 // Assuming Cost(Copy) == Cost(Branch), we could simplify it to :
1511 // Convert (A u> B) to (A u< B) to simplify pattern matching.
3366 Value *Simplify(Value *Val) {
3621 // Second Step, fill new nodes by merged values and simplify if possible.
3745 /// Fill the placeholders with values from predecessors and simplify them.
3773 Map[Current] = ST.Simplify(V);
  /src/external/mit/isl/dist/doc/
implementation.tex 189 on that of {\tt Simplify} \parencite{Detlefs2005simplify}, which, in turn,
192 as a sparse matrix, but neither {\tt Simplify} nor the current

Completed in 32 milliseconds