getter=getter+1

LOAD mem reg1
STORE reg1 getter
INC reg1
STORE reg1 mem

if(no_bread){
    if(no_note){
        leave_note
        buy_bread
        remove_note
    }
}

leave_note
if(no_bread){
    if(no_note){
        buy_bread
    }
}
remove_note

//A
leave_note_A
while(no_note_B){}
if(no_bread){
    buy_bread
}
remove_note_A

//B
leave_note_B
if(no_note_A){
    if(no_bread){
        buy_bread
    }
}
remove_note_B

// 以下是A的code,B記得換成對方的變數
do{
    note_A=true
    turn=P_B //表示自己可以去,不過對方想去可以先給對方=>增加公平性
    while(note_B===true&&turn=P_B){} //忙等待,對方想去,且對方真的有權要去
    //c.s. start
    buy_bread
    //c.s. end
    note_A=false
}while(true)

boolean TestAndSet(boolean * target){
    boolean rv= *target
    *target=true
    return rv
}

class Lock{
boolean value=0;
    acquire(){
        while(TestAndSet(value)){};//忙等待
    }
    release(){
        value=0
    }
}

class BoundBuf{
    const mutex=Semphore(1)
    const fullBuf=Semphore(0)
    const eptBuf=Semphore(n)
    const q=queue()
    public productor(c){
        eptBuf.P()
        mutex.P()
        q.enqueue(c)
        mutex.V()
        fullBuf.V()
    }
    
    public consumer(){
        fullBuf.P()
        mutex.P()
        q.dequeue(c)
        mutex.V()
        eptBuf.V()
    }
}

class BoundBuf{
    const entryLock=lock()
    const count=0
    const notFull=Condition()
    const notEmpt=Condition()
    const q=queue()
    public productor(c){
        entryLock.acquire()
        //滿時不能進
        while(count==n){
            notFull.wait(&entryLock)
        }
        
        q.enqueue(c)
        count++
        
        //告知非空
        notEmpt.signal()
        entryLock.release()
    }
    
    public consumer(){
        entryLock.acquire()
        //空時不能進
        while(count==0){
            notEmpt.wait(&entryLock)
        }
        
        q.dequeue(c)
        count--
        
        //告知非滿
        notFull.signal()
        entryLock.release()
    }
}