Displaying 4 results from an estimated 4 matches for "cmpvalue".
Did you mean:
cipvalue
2008 Nov 18
1
[LLVMdev] 32 bit boolean results
You can tell LLVM that you have "sign extended" setCC results (all
ones).
Dan
On Nov 18, 2008, at 5:33 PM, Eli Friedman wrote:
> On Tue, Nov 18, 2008 at 1:56 PM, Villmow, Micah
> <Micah.Villmow at amd.com> wrote:
>> The IR produces correct results, but my backend does not and the
>> only thing
>> I can think of is that the IR is treating the
2008 Sep 18
4
[LLVMdev] Custom Opcodes versus built-in opcodes
...DAG){
MVT VT = Op.getValueType();
SDValue Chain = Op.getOperand(0);
SDValue LHS = Op.getOperand(2);
SDValue RHS = Op.getOperand(3);
SDValue Jump = Op.getOperand(4);
bool logical_nz = getLogicalNZ(cmpOpcode);
SDValue CmpValue;
unsigned int brOpcode = CUSTOM::BRANCH_NZERO;
CmpValue = DAG.getNode(CUSTOM::CMP, LHS.getValueType(),
Chain, DAG.getConstant(cmpOpcode, MVT::i32), LHS, RHS);
return DAG.getNode(brOpcode, VT, Chain, Jump, CmpValue);
}
What I want to happen is to take the b...
2014 Mar 13
2
[LLVMdev] MergeFunctions: reduce complexity to O(log(N))
...> How are function, global variable and alias reachable here?
>
> 0004:
>
> Thanks for the comment on sn_mapL/R!
>
> +int FunctionComparator::cmpEnumerate(const Value *V1, const Value *V2) {
>
> "Compare enumerate"? This name doesn't make sense to me. "cmpValue" perhaps?
>
> + const Constant *C1 = dyn_cast<Constant>(V1);
> + const Constant *C2 = dyn_cast<Constant>(V2);
> + if (C1 && C2) {
> + if (V1 == V2) return 0;
> // TODO: constant expressions with GEP or references to F1 or F2.
> - if (C1-&...
2014 Feb 27
3
[LLVMdev] MergeFunctions: reduce complexity to O(log(N))
Hi Nick,
I tried to rework changes as you requested. One of patches (0004 with
extra assertions) has been removed.
> + bool isEquivalentType(Type *Ty1, Type *Ty2) const {
> + return cmpType(Ty1, Ty2) == 0;
> + }
>
> Why do we still need isEquivalentType? Can we nuke this?
Yup. After applying all the patches isEquivalentType will be totally
replaced with cmpType. All