3 primarypfq_t pqueue; //Global queue
6 /* Intitialize primary queue */
7 pqueue.front = pqueue.rear = NULL;
8 pthread_mutex_init(&pqueue.qlock, NULL);
9 pthread_cond_init(&pqueue.qcond, NULL);
12 /* Delete the node pointed to by the front ptr of the queue */
14 prefetchqelem_t *delnode;
15 if((pqueue.front == NULL) && (pqueue.rear == NULL)) {
16 printf("The queue is empty: UNDERFLOW %s, %d\n", __FILE__, __LINE__);
18 } else if ((pqueue.front == pqueue.rear) && pqueue.front != NULL && pqueue.rear != NULL) {
21 pqueue.front = pqueue.rear = NULL;
23 delnode = pqueue.front;
24 pqueue.front = pqueue.front->next;
30 void queueDelete(void) {
31 /* Remove each element */
32 while(pqueue.front != NULL)
34 pqueue.front = pqueue.rear = NULL;
37 /* Inserts to the rear of primary prefetch queue */
38 void enqueue(prefetchqelem_t *qnode) {
39 if(pqueue.front == NULL && pqueue.rear == NULL) {
40 pqueue.front = pqueue.rear = qnode;
43 pqueue.rear->next = qnode;
48 /* Return the node pointed to by the front ptr of the queue */
49 prefetchqelem_t *dequeue(void) {
50 prefetchqelem_t *retnode;
51 if (pqueue.front == NULL) {
52 printf("Queue empty: Underflow %s, %d\n", __FILE__, __LINE__);
55 retnode = pqueue.front;
56 pqueue.front = pqueue.front->next;
62 int offset = sizeof(prefetchqelem_t);
66 prefetchqelem_t *tmp = pqueue.front;
69 ptr = (int *)(ptr1 + offset);
71 printf("Number of tuples = %d\n", ntuples);
79 unsigned int oids[] = {11, 13};
80 short endoffsets[] = {2, 5};
81 short arrayfields[] = {2, 2, 1, 5, 6};
84 prefetch(2, oids, endoffsets, arrayfields);
86 unsigned int oids1[] = {21, 23, 25, 27};
87 short endoffsets1[] = {1, 2, 3, 4};
88 short arrayfields1[] = {3, 2, 1, 3};
89 prefetch(4, oids1, endoffsets1, arrayfields1);