search for: pseduocod

Dear R´ers, How can I create one single factor variable from two variables incorporating all possible combinations of the values?? test<-sample(c("A",NA,"B"),100,replace=T) test2<-sample(c("E",F,"A"),100,replace=T) tes<-cbind(test,test2) pseduocode: r<-function(test,test2) r AE AF AA NAE NAF NAA BE BF BA //M [[alternative HTML version deleted]]

...#39;s doing is shifting v0 right by one within each row and adding >>>>>> it to v1. v1 stays the same in the first lane of each row, however. >>>>>> With llvm.amdgcn.mov_dpp, we could try to express it as something like >>>>>> this, in LLVM-like pseduocode: >>>>>> >>>>>> %tmp = call llvm.amdgcn.mov_dpp %input row_shr:1 >>>>>> %result = foo %tmp, %input >>>>>> >>>>>> but this is incorrect. If I'm reading the source correctly, this will >>>>>&g...

...gt;>>> What it's doing is shifting v0 right by one within each row and adding >>>> it to v1. v1 stays the same in the first lane of each row, however. >>>> With llvm.amdgcn.mov_dpp, we could try to express it as something like >>>> this, in LLVM-like pseduocode: >>>> >>>> %tmp = call llvm.amdgcn.mov_dpp %input row_shr:1 >>>> %result = foo %tmp, %input >>>> >>>> but this is incorrect. If I'm reading the source correctly, this will >>>> make %tmp garbage in lane 0 (since it just tu...

...9;s doing is shifting v0 right by one within each row and >>>>>> adding it to v1. v1 stays the same in the first lane of each row, however. >>>>>> With llvm.amdgcn.mov_dpp, we could try to express it as something >>>>>> like this, in LLVM-like pseduocode: >>>>>> >>>>>> %tmp = call llvm.amdgcn.mov_dpp %input row_shr:1 %result = foo >>>>>> %tmp, %input >>>>>> >>>>>> but this is incorrect. If I'm reading the source correctly, this >>>>>>...

...mple, take the first instruction: v_foo_f32 v1, v0, v1 row_shr:1 What it's doing is shifting v0 right by one within each row and adding it to v1. v1 stays the same in the first lane of each row, however. With llvm.amdgcn.mov_dpp, we could try to express it as something like this, in LLVM-like pseduocode: %tmp = call llvm.amdgcn.mov_dpp %input row_shr:1 %result = foo %tmp, %input but this is incorrect. If I'm reading the source correctly, this will make %tmp garbage in lane 0 (since it just turns into a normal move with the dpp modifier, and no restrictions on the destination). We could set...

...v1, v0, v1 row_shr:1 >> >> What it's doing is shifting v0 right by one within each row and adding >> it to v1. v1 stays the same in the first lane of each row, however. >> With llvm.amdgcn.mov_dpp, we could try to express it as something like >> this, in LLVM-like pseduocode: >> >> %tmp = call llvm.amdgcn.mov_dpp %input row_shr:1 >> %result = foo %tmp, %input >> >> but this is incorrect. If I'm reading the source correctly, this will >> make %tmp garbage in lane 0 (since it just turns into a normal move >> with the dpp mod...

...v0 right by one within each row and adding >>>>>>>> it to v1. v1 stays the same in the first lane of each row, however. >>>>>>>> With llvm.amdgcn.mov_dpp, we could try to express it as something like >>>>>>>> this, in LLVM-like pseduocode: >>>>>>>> >>>>>>>> %tmp = call llvm.amdgcn.mov_dpp %input row_shr:1 >>>>>>>> %result = foo %tmp, %input >>>>>>>> >>>>>>>> but this is incorrect. If I'm reading the source cor...

...e within each row >>>>>>>>> and adding it to v1. v1 stays the same in the first lane of each row, however. >>>>>>>>> With llvm.amdgcn.mov_dpp, we could try to express it as >>>>>>>>> something like this, in LLVM-like pseduocode: >>>>>>>>> >>>>>>>>> %tmp = call llvm.amdgcn.mov_dpp %input row_shr:1 %result = foo >>>>>>>>> %tmp, %input >>>>>>>>> >>>>>>>>> but this is incorrect. If I'm r...