Searched refs:num_entries (Results 1 - 11 of 11) sorted by relevance
| /barrelfish-master/lib/dma/ |
| H A D | dma_mem_mgr.c | 30 size_t num_entries; member in struct:dma_mem_tree
65 tree->num_entries = 0;
119 assert(tree->num_entries == 0);
123 tree->num_entries = 1;
134 tree->num_entries++;
151 tree->num_entries++;
160 assert(tree->num_entries == 0);
178 assert(tree->root || (tree->num_entries == 1));
180 tree->num_entries--;
|
| /barrelfish-master/lib/libc/iconv/ |
| H A D | citrus_db.c | 105 uint32_t hashval, num_entries; local
111 num_entries = be32toh(dhx->dhx_num_entries);
112 if (num_entries == 0)
121 hashval = db->db_hashfunc(key)%num_entries;
299 uint32_t num_entries; local
305 num_entries = be32toh(dhx->dhx_num_entries);
306 if (idx < 0 || (uint32_t)idx >= num_entries)
|
| H A D | citrus_db_factory.c | 250 size_t num_entries)
255 put32(r, rofs, num_entries);
249 dump_header(struct _region *r, const char *magic, size_t *rofs, size_t num_entries) argument
|
| /barrelfish-master/lib/devif/backends/net/mlx4/drivers/infiniband/hw/mlx4/ |
| H A D | cq.c | 789 int mlx4_ib_poll_cq(struct ib_cq *ibcq, int num_entries, struct ib_wc *wc) { argument
798 for (npolled = 0; npolled < num_entries; ++npolled) {
|
| H A D | mlx4_ib.h | 654 int mlx4_ib_poll_cq(struct ib_cq *ibcq, int num_entries, struct ib_wc *wc);
|
| /barrelfish-master/lib/devif/backends/net/mlx4/drivers/net/mlx4/ |
| H A D | mr.c | 311 struct mlx4_cmd_mailbox *mailbox, int num_entries) {
312 return mlx4_cmd(&priv->dev, mailbox->dma, num_entries, 0,
310 mlx4_WRITE_MTT(struct mlx4_priv *priv, struct mlx4_cmd_mailbox *mailbox, int num_entries) argument
|
| H A D | mlx4_devif_queue.c | 1088 int num_entries = priv->dev.caps.num_ports; local
1091 priv->steer = calloc(num_entries, sizeof(struct mlx4_steer));
1095 for (i = 0; i < num_entries; i++)
|
| /barrelfish-master/lib/devif/backends/net/mlx4/include/rdma/ |
| H A D | ib_verbs.h | 1247 int (*poll_cq)(struct ib_cq *cq, int num_entries, struct ib_wc *wc);
1711 * @num_entries:maximum number of completions to return
1712 * @wc:array of at least @num_entries &struct ib_wc where completions
1718 * non-negative and < num_entries, then the CQ was emptied.
1720 static inline int ib_poll_cq(struct ib_cq *cq, int num_entries, argument
1722 return cq->device->poll_cq(cq, num_entries, wc);
|
| /barrelfish-master/lib/devif/backends/net/mlx4/drivers/infiniband/hw/mthca/ |
| H A D | mthca_cq.c | 659 int mthca_poll_cq(struct ib_cq *ibcq, int num_entries, argument
674 while (npolled < num_entries) {
|
| H A D | mthca_dev.h | 494 int mthca_poll_cq(struct ib_cq *ibcq, int num_entries,
|
| /barrelfish-master/lib/devif/backends/net/mlx4/include/infiniband/ |
| H A D | verbs.h | 686 int (*poll_cq)(struct ibv_cq *cq, int num_entries, struct ibv_wc *wc);
914 * @num_entries:maximum number of completions to return
915 * @wc:array of at least @num_entries of &struct ibv_wc where completions
921 * non-negative and strictly less than num_entries, then the CQ was
924 /*static inline int ibv_poll_cq(struct ibv_cq *cq, int num_entries, struct ibv_wc *wc)
926 return cq->context->ops.poll_cq(cq, num_entries, wc);
|
Completed in 208 milliseconds