Presentation is loading. Please wait.

Presentation is loading. Please wait.

CS 140 Lecture Notes: Lock Implementation

Similar presentations


Presentation on theme: "CS 140 Lecture Notes: Lock Implementation"— Presentation transcript:

1 CS 140 Lecture Notes: Lock Implementation
Uniprocessor Locks void lock_acquire(struct lock *l) { intr_disable(); if (!l->locked) { l->locked = 1; } else { queue_add(&l->q, thread_current()); thread_block(); } intr_enable(); void lock_release(struct lock *l) { if (queue_empty(&l->q) { l->locked = 0; thread_unblock(queue_remove(&l->q)); struct lock { int locked; struct queue q; }; CS 140 Lecture Notes: Lock Implementation

2 Multiprocessor Locks, v1
struct lock { int locked; }; void lock_acquire( struct lock *l) { while (swap(&l->locked, 1)) { /* Do nothing */ } void lock_release( struct lock *l) { l->locked = 0; } CS 140 Lecture Notes: Lock Implementation

3 Multiprocessor Locks, v2
struct lock { int locked; struct queue q; }; void lock_acquire( struct lock *l) { if (swap(&l->locked, 1)) { queue_add(&l->q, thread_current()); thread_block(); } void lock_release( struct lock *l) { if (queue_empty(&l->q) { l->locked = 0; } else { thread_unblock( queue_remove(&l->q)); } CS 140 Lecture Notes: Lock Implementation

4 Multiprocessor Locks, v3
struct lock { int locked; struct queue q; int sync; }; void lock_acquire( struct lock *l) { while (swap(&l->sync, 1)) { /* Do nothing */ } if (!l->locked) { l->locked = 1; l->sync = 0; } else { queue_add(&l->q, thread_current()); thread_block(); void lock_release( struct lock *l) { while (swap(&l->sync, 1)) { /* Do nothing */ } if (queue_empty(&l->q) { l->locked = 0; } else { thread_unblock( queue_remove(&l->q)); l->sync = 0; CS 140 Lecture Notes: Lock Implementation

5 Multiprocessor Locks, v4
struct lock { int locked; struct queue q; int sync; }; void lock_acquire( struct lock *l) { while (swap(&l->sync, 1)) { /* Do nothing */ } if (!l->locked) { l->locked = 1; l->sync = 0; } else { queue_add(&l->q, thread_current()); thread_block(&l->sync); void lock_release( struct lock *l) { while (swap(&l->sync, 1)) { /* Do nothing */ } if (queue_empty(&l->q) { l->locked = 0; } else { thread_unblock( queue_remove(&l->q)); l->sync = 0; CS 140 Lecture Notes: Lock Implementation

6 Multiprocessor Locks, v5
struct lock { int locked; struct queue q; int sync; }; void lock_acquire( struct lock *l) { intr_disable(); while (swap(&l->sync, 1)) { /* Do nothing */ } if (!l->locked) { l->locked = 1; l->sync = 0; } else { queue_add(&l->q, thread_current()); thread_block(&l->sync); intr_enable(); void lock_release( struct lock *l) { intr_disable(); while (swap(&l->sync, 1)) { /* Do nothing */ } if (queue_empty(&l->q) { l->locked = 0; } else { thread_unblock( queue_remove(&l->q)); l->sync = 0; intr_enable(); CS 140 Lecture Notes: Lock Implementation

7 CS 140 Lecture Notes: Lock Implementation


Download ppt "CS 140 Lecture Notes: Lock Implementation"

Similar presentations


Ads by Google