Displaying 2 results from an estimated 2 matches for "210218".
Did you mean:
10218
2014 Jan 28
3
[LLVMdev] MergeFunctions: reduce complexity to O(log(N))
Hi Stepan,
Sorry for the delay. It's great that you are working on MergeFunctions
as well and I agree, we should definitely try to combine our efforts to
improve MergeFunctions.
Just to give you some context, the pass (with the similar function
merging patch) is already being used in a production setting. From my
point of view, it would be better if we focus on improving its
capability
2014 Jan 30
3
[LLVMdev] MergeFunctions: reduce complexity to O(log(N))
...0 0.02 145093
btCollisionObject.ll 18 29521 1 0.01 28033 1 0.01 28033
btCollisionShape.ll 30 50815 4 0.01 48523 4 0.02 49415
btCollisionWorld.ll 179 487893 20 0.04 475898 * * *
btCompoundCollisionAlgorithm.ll 135 315394 22 0.03 309831 7 0.03 311259
btCompoundShape.ll 90 210823 6 0.02 207856 5 0.02 210218
btConcaveShape.ll 7 9800 0 0.01 9782 0 0.01 9782
btConeShape.ll 45 93005 5 0.02 87742 3 0.02 88742
btConeTwistConstraint.ll 151 582413 16 0.05 582440 12 0.05 576236
btContactConstraint.ll 46 92768 4 0.02 90771 2 0.02 90511
btContactProcessing.ll 58 111001 6 0.02 109787 1 0.02 112377
btContinuousCon...