search for: eqp

Displaying 4 results from an estimated 4 matches for "eqp".

Did you mean: ebp
2012 Oct 30
0
[LLVMdev] Any plan to add MIN/MAX isd node?
...in/max idioms, here is part of a transform using this, from InstructionSimplify.cpp: // Signed variants on "max(a,b)>=a -> true". if (match(LHS, m_SMax(m_Value(A), m_Value(B))) && (A == RHS || B == RHS)) { if (A != RHS) std::swap(A, B); // smax(A, B) pred A. EqP = CmpInst::ICMP_SGE; // "A == smax(A, B)" iff "A sge B". // We analyze this as smax(A, B) pred A. P = Pred; } At the codegen level, the same could be done. Also, if a target has a max/min instruction it can transform compare+select to max/min, in fact I'm pret...
2012 Oct 30
1
[LLVMdev] Any plan to add MIN/MAX isd node?
...in/max idioms, here is part of a transform using this, from InstructionSimplify.cpp: // Signed variants on "max(a,b)>=a -> true". if (match(LHS, m_SMax(m_Value(A), m_Value(B))) && (A == RHS || B == RHS)) { if (A != RHS) std::swap(A, B); // smax(A, B) pred A. EqP = CmpInst::ICMP_SGE; // "A == smax(A, B)" iff "A sge B". // We analyze this as smax(A, B) pred A. P = Pred; } At the codegen level, the same could be done. Also, if a target has a max/min instruction it can transform compare+select to max/min, in fact I'm pret...
2012 Oct 30
2
[LLVMdev] Any plan to add MIN/MAX isd node?
Hi Duncan, To use select, usually, there is a compare before select. Presence of comparison will disable some opportunities to optimize some code. Select and Compare is not associative neither. Thanks, Yin -----Original Message----- From: llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at cs.uiuc.edu] On Behalf Of Duncan Sands Sent: Tuesday, October 30, 2012
2005 Jun 11
0
testing techniques for checking the effectiveness of changes made to sch_gred.c
...could also let me know if the logic that I have applied to effect these changes is correct. My logic is as follows: 1) Since the process deals with dequeueing, i have to make changes to gred_dequeue only. If t->tab[0] != 0 then we dequeue the packet otherwise do not dequeue it. 2) if (t->eqp && t->grio) { for (i=0;i<t->DPs;i++) { if ((!t->tab[i]) || (i==q->DP) || (i==0)) continue; if ((t->tab[i] != q) && (PSCHED_IS_PASTPERFECT(t->tab[i]->qidlestart)))...