intq.c File Reference

#include "devices/intq.h"
#include <debug.h>
#include "threads/thread.h"

Include dependency graph for intq.c:

Functions
static int	next (int pos)
static void	wait (struct intq *q, struct thread **waiter)
static void	signal (struct intq *q, struct thread **waiter)
void	intq_init (struct intq *q)
bool	intq_empty (const struct intq *q)
bool	intq_full (const struct intq *q)
uint8_t	intq_getc (struct intq *q)
void	intq_putc (struct intq *q, uint8_t byte)
static void	wait (struct intq *q UNUSED, struct thread **waiter)
static void	signal (struct intq *q UNUSED, struct thread **waiter)

Function Documentation

intq_empty()

bool intq_empty

(

const struct intq *

q

)

                                  {
    ASSERT (intr_get_level () == INTR_OFF);
    return q->head == q->tail;
}

Here is the call graph for this function:

Here is the caller graph for this function:

intq_full()

bool intq_full

(

const struct intq *

q

)

                                 {
    ASSERT (intr_get_level () == INTR_OFF);
    return next (q->head) == q->tail;
}

Here is the call graph for this function:

Here is the caller graph for this function:

intq_getc()

uint8_t intq_getc

(

struct intq *

q

)

                           {
    uint8_t byte;
 
    ASSERT (intr_get_level () == INTR_OFF);
    while (intq_empty (q)) {
        ASSERT (!intr_context ());
        lock_acquire (&q->lock);
        wait (q, &q->not_empty);
        lock_release (&q->lock);
    }
 
    byte = q->buf[q->tail];
    q->tail = next (q->tail);
    signal (q, &q->not_full);
    return byte;
}

Here is the call graph for this function:

Here is the caller graph for this function:

intq_init()

void intq_init

(

struct intq *

q

)

                           {
    lock_init (&q->lock);
    q->not_full = q->not_empty = NULL;
    q->head = q->tail = 0;
}

Here is the call graph for this function:

Here is the caller graph for this function:

intq_putc()

void intq_putc	(	struct intq *	q,
		uint8_t	byte
	)

                                         {
    ASSERT (intr_get_level () == INTR_OFF);
    while (intq_full (q)) {
        ASSERT (!intr_context ());
        lock_acquire (&q->lock);
        wait (q, &q->not_full);
        lock_release (&q->lock);
    }
 
    q->buf[q->head] = byte;
    q->head = next (q->head);
    signal (q, &q->not_empty);
}

Here is the call graph for this function:

Here is the caller graph for this function:

next()

static int next ( int  pos )

static

               {
    return (pos + 1) % INTQ_BUFSIZE;
}

Here is the caller graph for this function:

signal() [1/2]

static void signal ( struct intq *q  UNUSED, struct thread **  waiter  )

static

                                                       {
    ASSERT (intr_get_level () == INTR_OFF);
    ASSERT ((waiter == &q->not_empty && !intq_empty (q))
            || (waiter == &q->not_full && !intq_full (q)));
 
    if (*waiter != NULL) {
        thread_unblock (*waiter);
        *waiter = NULL;
    }
}

Here is the call graph for this function:

signal() [2/2]

static void signal ( struct intq *  q, struct thread **  waiter  )

static

Here is the caller graph for this function:

wait() [1/2]

static void wait ( struct intq *q  UNUSED, struct thread **  waiter  )

static

                                                     {
    ASSERT (!intr_context ());
    ASSERT (intr_get_level () == INTR_OFF);
    ASSERT ((waiter == &q->not_empty && intq_empty (q))
            || (waiter == &q->not_full && intq_full (q)));
 
    *waiter = thread_current ();
    thread_block ();
}

Here is the call graph for this function:

wait() [2/2]

static void wait ( struct intq *  q, struct thread **  waiter  )

static

Here is the caller graph for this function: