On 14/09/15 02:24, Cyrille Artho wrote:
Hi Sebastian,
The example you linked to uses file locking meshed with mutexes. If
you consider them to be just locks, then you are right that their
accesses (acquire/release) are interleaved in an unordered way.
The locks are mutexes in Newlib.
For uno
On 11/09/15 02:25, Cyrille Artho wrote:
Dear all,
Please let me try to clarify:
1. Our understanding so far was that upon lock release, the priority
instantly gets reverted back to the previous priority. This also
applies for nested locks, i.e., a higher priority gets reverted
(stepwise) when re
Hello Saurabh,
On 11/09/15 02:14, Saurabh Gadia wrote:
Hi Sebastian,
Sorry for late reply. I was out of town and could not reply. I am bit
confused with above description which I need to get clarified:
1. replaced LIFO with sorted list: I don't change the mutex order to
make the list sorte
Hi Sebastian,
Sorry for late reply. I was out of town and could not reply. I am bit
confused with above description which I need to get clarified:
1. replaced LIFO with sorted list: I don't change the mutex order to make
the list sorted. Instead I promote the priorities so that we don't need to
On 07/09/15 08:32, Cyrille Artho wrote:
Hi Sebastian,
I was not aware that deadlock detection was an objective.
It would be good to first clarify the requirements for a new mutex
implementation. This is why I created the ticket. It doesn't make sense
to add something which will be replaced in
Hello Saurabh,
On 05/09/15 01:52, Saurabh Gadia wrote:
This is the patch for solving priority inversion problem for
uniprocessor architecture. It works correctly for all test cases on
master. For 4.11 the patch get applied cleanly but the branch does not
compile because of some rbtree error(un
