Lines Matching defs:queue
43 * Each queue has a double linked list of auxtrace_buffers. This list contains
47 * To sort the queues in chronological order, all queue access is controlled
49 * entries, the queue number and a time stamp. However the stack is sorted by
64 * position in the auxtrace_buffer of that queue is remembered and the time
575 /* Process the data samples of a single queue. The first parameter is a
576 * pointer to the queue, the second parameter is the time stamp. This
579 * - or the time stamp when the last processing of this queue stopped.
588 * queue.
597 * >0: Done on this queue. The second parameter returns the
674 * Select the queue buffer to operate on, the caller already selected
675 * the proper queue, depending on second parameter 'ts'.
681 * get a new buffer from the queue and setup start position for
683 * When a buffer is completely processed remove it from the queue
687 * 1: When the queue is empty. Second parameter will be set to
690 * <0: Error during queue buffer setup. This causes the caller
698 struct auxtrace_queue *queue;
701 queue = &sfq->sf->queues.queue_array[sfq->queue_nr];
710 sfq->buffer = buffer = auxtrace_buffer__next(queue,
714 return 1; /* Processing done on this queue */
716 /* Start with a new buffer on this queue */
800 struct auxtrace_queue *queue,
803 struct s390_cpumsf_queue *sfq = queue->priv;
805 if (list_empty(&queue->head))
812 queue->priv = sfq;
814 if (queue->cpu != -1)
815 sfq->cpu = queue->cpu;
850 struct auxtrace_queue *queue;
860 queue = &sf->queues.queue_array[queue_nr];
861 sfq = queue->priv;