search for: merge_sort

...ack to a slightly different output setcc. And how can I prevent this, or fix it, since my conditional branches only support having single bit inputs. Thanks, -Dilan PS Here is optimized DAG in case you were wondering. Combining: t0: ch = EntryToken Optimized legalized selection DAG: BB#212 'merge_sort:for.cond.cleanup39.1' SelectionDAG has 36 nodes: t0: ch = EntryToken t6: i32,ch = CopyFromReg t0, Register:i32 %vreg507 t2: i32,ch = CopyFromReg t0, Register:i32 %vreg17 t4: i32 = or t2, Constant:i32<256> t9: i32 = shl t4, Constant:i32<2> t10: i32 = add t6, t9 t12: i32,ch = CopyFrom...

...it, since my conditional branches only support having single bit inputs. >> >> Thanks, >> >> -Dilan >> >> PS Here is optimized DAG in case you were wondering. >> >> Combining: t0: ch = EntryToken Optimized legalized selection DAG: BB#212 >> 'merge_sort:for.cond.cleanup39.1' SelectionDAG has 36 nodes: t0: ch = >> EntryToken t6: i32,ch = CopyFromReg t0, Register:i32 %vreg507 t2: i32,ch = >> CopyFromReg t0, Register:i32 %vreg17 t4: i32 = or t2, Constant:i32<256> t9: >> i32 = shl t4, Constant:i32<2> t10: i32 = add t6...

Hi, I need to compare two matrices with each other. If you can get one of them out of the other one by resorting the rows and/or the columns, then both of them are equal, otherwise they're not. A matrix could look like this: [,1] [,2] [,3] [,4] [,5] [,6] [,7] [,8] [1,] 0 1 1 1 0 1 1 0 [2,] 1 1 0 0 0 1 0 1 [3,] 1 0 1 0 0

Dear all, The below has been tested quite thoroughly by now, including performance-testing by the way of using a modified compiler that triggers the below while compiling at least an old part of LLVM ["Function.cpp"] and sorting a symbol table with >7000 global variables. Unfortunately, the optimization I have been working on for which I _thought_ I needed the ability to sort a