* the list represents an input buffer which has not been completely
* used by this btr node.
*/
- struct list_head buffer_queue;
+ struct list_head input_queue;
};
#define FOR_EACH_TARGET_NODE(_tn, _btrn) list_for_each_entry((_tn), \
&((_btrn)->children), node)
#define FOR_EACH_BUFFER_REF(_br, _btrn) \
- list_for_each_entry((_br), &(_btrn)->buffer_queue, node)
+ list_for_each_entry((_br), &(_btrn)->input_queue, node)
#define FOR_EACH_BUFFER_REF_SAFE(_br, _tmp, _btrn) \
- list_for_each_entry_safe((_br), (_tmp), &(_btrn)->buffer_queue, node)
+ list_for_each_entry_safe((_br), (_tmp), &(_btrn)->input_queue, node)
INIT_STDERR_LOGGING(0);
if (parent)
list_add_tail(&btrn->node, &parent->children);
INIT_LIST_HEAD(&btrn->children);
- INIT_LIST_HEAD(&btrn->buffer_queue);
+ INIT_LIST_HEAD(&btrn->input_queue);
return btrn;
}
struct btr_buffer_reference *br = para_malloc(sizeof(*br));
br->btrb = btrb;
br->consumed = 0;
- list_add_tail(&br->node, &tn->buffer_queue);
+ list_add_tail(&br->node, &tn->input_queue);
btrb->refcount++;
}
}
struct btr_buffer_reference *btr_next_br(struct btr_node *btrn)
{
- if (list_empty(&btrn->buffer_queue))
+ if (list_empty(&btrn->input_queue))
return NULL;
- return list_first_entry(&btrn->buffer_queue, struct btr_buffer_reference, node);
+ return list_first_entry(&btrn->input_queue, struct btr_buffer_reference, node);
}
static inline size_t br_available_bytes(struct btr_buffer_reference *br)