Lines Matching refs:entry
347 * aac_get_entry - get a queue entry
350 * @entry: Entry return
354 * With a priority the routine returns a queue entry if the queue has free entries. If the queue
355 * is full(no free entries) than no entry is returned and the function returns 0 otherwise 1 is
359 static int aac_get_entry (struct aac_dev * dev, u32 qid, struct aac_entry **entry, u32 * index, unsigned long *nonotify)
400 *entry = q->base + *index;
410 * @hw_fib: Fib to associate with the queue entry
423 struct aac_entry * entry = NULL;
428 while (!aac_get_entry(dev, qid, &entry, index, nonotify)) {
432 * Setup queue entry with a command, status and fib mapped
434 entry->size = cpu_to_le32(le16_to_cpu(hw_fib->header.Size));
437 while (!aac_get_entry(dev, qid, &entry, index, nonotify)) {
441 * Setup queue entry with command, status and fib mapped
443 entry->size = cpu_to_le32(le16_to_cpu(hw_fib->header.Size));
444 entry->addr = hw_fib->header.SenderFibAddress;
451 * in the queue entry.
454 entry->addr = cpu_to_le32(fibptr->hw_fib_pa);
553 * Get a queue entry connect the FIB to it and send an notify
793 * @entry: Return entry
795 * Will return a pointer to the entry on the top of the queue requested that
796 * we are a consumer of, and return the address of the queue entry. It does
800 int aac_consumer_get(struct aac_dev * dev, struct aac_queue * q, struct aac_entry **entry)
809 * the end of the queue, else we just use the entry
816 *entry = q->base + index;
823 * aac_consumer_free - free consumer entry
1704 struct list_head * entry;
1727 entry = aac->fib_list.next;
1735 while (entry != &aac->fib_list) {
1739 struct aac_fib_context *fibctx = list_entry(entry, struct aac_fib_context, next);
1759 entry = entry->next;
1803 entry = entry->next;
2006 struct list_head *entry;
2018 entry = dev->fib_list.next;
2019 while (entry != &dev->fib_list) {
2020 entry = entry->next;
2066 struct list_head *entry;
2076 entry = dev->fib_list.next;
2086 while (entry != &dev->fib_list) {
2090 fibctx = list_entry(entry, struct aac_fib_context,
2109 entry = entry->next;
2120 entry = entry->next;
2146 entry = entry->next;
2168 struct list_head *entry;
2176 entry = dev->queues->queue[HostNormCmdQueue].cmdq.next;
2177 list_del(entry);
2182 fib = list_entry(entry, struct fib, fiblink);