printk(KERN_WARNING "Queue %d full, %d outstanding.\n", 
printk(KERN_WARNING "Queue %d full, %u outstanding.\n", 
static int aac_get_entry (struct aac_dev * dev, u32 qid, struct aac_entry **entry, u32 * index, unsigned long *nonotify){	struct aac_queue * q;	/*	 *	All of the queues wrap when they reach the end, so we check	 *	to see if they have reached the end and if they have we just	 *	set the index back to zero. This is a wrap. You could or off	 *	the high bits in all updates but this is a bit faster I think.	 */	q = &dev->queues->queue[qid];		*index = le32_to_cpu(*(q->headers.producer));	if ((*index - 2) == le32_to_cpu(*(q->headers.consumer)))			*nonotify = 1; 	if (qid == AdapHighCmdQueue) {	        if (*index >= ADAP_HIGH_CMD_ENTRIES)        		*index = 0;	} else if (qid == AdapNormCmdQueue) {	        if (*index >= ADAP_NORM_CMD_ENTRIES) 			*index = 0; /* Wrap to front of the Producer Queue. */	}	else if (qid == AdapHighRespQueue) 	{	        if (*index >= ADAP_HIGH_RESP_ENTRIES)			*index = 0;	}	else if (qid == AdapNormRespQueue) 	{		if (*index >= ADAP_NORM_RESP_ENTRIES) 			*index = 0; /* Wrap to front of the Producer Queue. */	}	else {		printk("aacraid: invalid qid\n");		BUG();	}        if ((*index + 1) == le32_to_cpu(*(q->headers.consumer))) { /* Queue is full */		printk(KERN_WARNING "Queue %d full, %d outstanding.\n",				qid, q->numpending);		return 0;	} else {	        *entry = q->base + *index;		return 1;	}}   
10457	/local/tlutelli/issta_data/temp/c/2005_temp/2005/10457/7c00ffa314bf0fb0e23858bbebad33b48b6abbb9/commsup.c/clean/drivers/scsi/aacraid/commsup.c