ersmith mentioned that using lockset() and lockclr() can hog the locks and cause a race condition on the P2. I wanted to know more about that mechanism. In fact, if I remove lockset and lockclr from the infamous prime number program code, it runs faster. That is very different from what happened on the P1. The post that brought my attention can be seen here:
However, I want do dedicate a new thread just for understanding the nature of the problem. Is it an issue? Or the lockset()/lockclr() mechanisms are now implicit (in hardware)?
Kind regards, Samuel Lourenço