search for: queued_lock_unlock

...sues: > 1) emulation in text_poke() can only easily handle a small set > of instructions and this is problematic for inlined pv-ops (and see > a possible alternatives use-case below.) > 2) paravirt patching might have inter-dependendent ops (ex. > lock.queued_lock_slowpath, lock.queued_lock_unlock are paired and > need to be updated atomically.) And then you hope that the spinlock state transfers.. That is that both implementations agree what an unlocked spinlock looks like. Suppose the native one was a ticket spinlock, where unlocked means 'head == tail' while the paravirt one...

...sues: > 1) emulation in text_poke() can only easily handle a small set > of instructions and this is problematic for inlined pv-ops (and see > a possible alternatives use-case below.) > 2) paravirt patching might have inter-dependendent ops (ex. > lock.queued_lock_slowpath, lock.queued_lock_unlock are paired and > need to be updated atomically.) And then you hope that the spinlock state transfers.. That is that both implementations agree what an unlocked spinlock looks like. Suppose the native one was a ticket spinlock, where unlocked means 'head == tail' while the paravirt one...

...tion in text_poke() can only easily handle a small set >> of instructions and this is problematic for inlined pv-ops (and see >> a possible alternatives use-case below.) >> 2) paravirt patching might have inter-dependendent ops (ex. >> lock.queued_lock_slowpath, lock.queued_lock_unlock are paired and >> need to be updated atomically.) > > And then you hope that the spinlock state transfers.. That is that both > implementations agree what an unlocked spinlock looks like. > > Suppose the native one was a ticket spinlock, where unlocked means 'head >...