Searched refs:avail (Results 1 - 25 of 408) sorted by relevance

1234567891011>>

/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/drivers/xen/xenbus/
H A Dxenbus_comms.c100 unsigned int avail; local
117 dst = get_output_chunk(cons, prod, intf->req, &avail);
118 if (avail == 0)
120 if (avail > len)
121 avail = len;
126 memcpy(dst, data, avail);
127 data += avail;
128 len -= avail;
132 intf->req_prod += avail;
159 unsigned int avail; local
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/drivers/xen/xenbus/
H A Dxenbus_comms.c100 unsigned int avail; local
117 dst = get_output_chunk(cons, prod, intf->req, &avail);
118 if (avail == 0)
120 if (avail > len)
121 avail = len;
126 memcpy(dst, data, avail);
127 data += avail;
128 len -= avail;
132 intf->req_prod += avail;
159 unsigned int avail; local
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/libgdbm/
H A Dfalloc.c48 Each hash bucket has a fixed size avail table. We first check this
49 avail table to satisfy the request for space. In most cases we can
53 satisfied from the file header avail block. If nothing is there that
55 and the unused portion is returned to the avail block. This routine
57 the size is larger than a single block. The avail structure is
76 /* If the header avail table is less than half full, and there's
78 if ((dbf->header->avail.count <= (dbf->header->avail.size >> 1))
79 && (dbf->header->avail.next_block != 0))
82 /* check the header avail tabl
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/libgdbm/
H A Dfalloc.c48 Each hash bucket has a fixed size avail table. We first check this
49 avail table to satisfy the request for space. In most cases we can
53 satisfied from the file header avail block. If nothing is there that
55 and the unused portion is returned to the avail block. This routine
57 the size is larger than a single block. The avail structure is
76 /* If the header avail table is less than half full, and there's
78 if ((dbf->header->avail.count <= (dbf->header->avail.size >> 1))
79 && (dbf->header->avail.next_block != 0))
82 /* check the header avail tabl
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/libgdbm/
H A Dfalloc.c48 Each hash bucket has a fixed size avail table. We first check this
49 avail table to satisfy the request for space. In most cases we can
53 satisfied from the file header avail block. If nothing is there that
55 and the unused portion is returned to the avail block. This routine
57 the size is larger than a single block. The avail structure is
76 /* If the header avail table is less than half full, and there's
78 if ((dbf->header->avail.count <= (dbf->header->avail.size >> 1))
79 && (dbf->header->avail.next_block != 0))
82 /* check the header avail tabl
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/net/rds/
H A Dstats.c115 unsigned int avail; local
117 avail = len / sizeof(struct rds_info_counter);
119 if (avail < ARRAY_SIZE(rds_stat_names)) {
120 avail = 0;
133 avail -= ARRAY_SIZE(rds_stat_names);
137 lens->nr = rds_trans_stats_info_copy(iter, avail) +
H A Dtransport.c102 unsigned int avail)
119 part = trans->stats_info_copy(iter, avail);
120 avail -= min(avail, part);
101 rds_trans_stats_info_copy(struct rds_info_iterator *iter, unsigned int avail) argument
H A Dib_stats.c73 unsigned int avail)
81 if (avail < ARRAY_SIZE(rds_ib_stat_names))
72 rds_ib_stats_info_copy(struct rds_info_iterator *iter, unsigned int avail) argument
H A Diw_stats.c73 unsigned int avail)
81 if (avail < ARRAY_SIZE(rds_iw_stat_names))
72 rds_iw_stats_info_copy(struct rds_info_iterator *iter, unsigned int avail) argument
H A Dtcp_stats.c52 unsigned int avail)
60 if (avail < ARRAY_SIZE(rds_tcp_stat_names))
51 rds_tcp_stats_info_copy(struct rds_info_iterator *iter, unsigned int avail) argument
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/net/rds/
H A Dstats.c115 unsigned int avail; local
117 avail = len / sizeof(struct rds_info_counter);
119 if (avail < ARRAY_SIZE(rds_stat_names)) {
120 avail = 0;
133 avail -= ARRAY_SIZE(rds_stat_names);
137 lens->nr = rds_trans_stats_info_copy(iter, avail) +
H A Dtransport.c102 unsigned int avail)
119 part = trans->stats_info_copy(iter, avail);
120 avail -= min(avail, part);
101 rds_trans_stats_info_copy(struct rds_info_iterator *iter, unsigned int avail) argument
H A Dib_stats.c73 unsigned int avail)
81 if (avail < ARRAY_SIZE(rds_ib_stat_names))
72 rds_ib_stats_info_copy(struct rds_info_iterator *iter, unsigned int avail) argument
H A Diw_stats.c73 unsigned int avail)
81 if (avail < ARRAY_SIZE(rds_iw_stat_names))
72 rds_iw_stats_info_copy(struct rds_info_iterator *iter, unsigned int avail) argument
H A Dtcp_stats.c52 unsigned int avail)
60 if (avail < ARRAY_SIZE(rds_tcp_stat_names))
51 rds_tcp_stats_info_copy(struct rds_info_iterator *iter, unsigned int avail) argument
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/fs/squashfs/
H A Dlzo_wrapper.c84 int avail, i, bytes = length, res; local
94 avail = min(bytes, msblk->devblksize - offset);
95 memcpy(buff, bh[i]->b_data + offset, avail);
96 buff += avail;
97 bytes -= avail;
109 avail = min_t(int, bytes, PAGE_CACHE_SIZE);
110 memcpy(buffer[i], buff, avail);
111 buff += avail;
112 bytes -= avail;
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/fs/squashfs/
H A Dlzo_wrapper.c84 int avail, i, bytes = length, res; local
94 avail = min(bytes, msblk->devblksize - offset);
95 memcpy(buff, bh[i]->b_data + offset, avail);
96 buff += avail;
97 bytes -= avail;
109 avail = min_t(int, bytes, PAGE_CACHE_SIZE);
110 memcpy(buffer[i], buff, avail);
111 buff += avail;
112 bytes -= avail;
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/db-4.8.30/java/src/com/sleepycat/util/
H A DFastInputStream.java152 int avail = len - off;
153 if (avail <= 0) {
156 if (length > avail) {
157 length = avail;
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/db-4.8.30/java/src/com/sleepycat/util/
H A DFastInputStream.java152 int avail = len - off;
153 if (avail <= 0) {
156 if (length > avail) {
157 length = avail;
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/db-4.8.30/java/src/com/sleepycat/util/
H A DFastInputStream.java152 int avail = len - off;
153 if (avail <= 0) {
156 if (length > avail) {
157 length = avail;
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/drivers/uwb/
H A Ddrp-avail.c59 * avail = global & local & pending
61 void uwb_drp_available(struct uwb_rc *rc, struct uwb_mas_bm *avail) argument
63 bitmap_and(avail->bm, rc->drp_avail.global, rc->drp_avail.local, UWB_NUM_MAS);
64 bitmap_and(avail->bm, avail->bm, rc->drp_avail.pending, UWB_NUM_MAS);
76 struct uwb_mas_bm avail; local
78 uwb_drp_available(rc, &avail);
79 if (!bitmap_subset(mas->bm, avail.bm, UWB_NUM_MAS))
115 * avail = global & local
119 struct uwb_mas_bm avail; local
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/drivers/uwb/
H A Ddrp-avail.c59 * avail = global & local & pending
61 void uwb_drp_available(struct uwb_rc *rc, struct uwb_mas_bm *avail) argument
63 bitmap_and(avail->bm, rc->drp_avail.global, rc->drp_avail.local, UWB_NUM_MAS);
64 bitmap_and(avail->bm, avail->bm, rc->drp_avail.pending, UWB_NUM_MAS);
76 struct uwb_mas_bm avail; local
78 uwb_drp_available(rc, &avail);
79 if (!bitmap_subset(mas->bm, avail.bm, UWB_NUM_MAS))
115 * avail = global & local
119 struct uwb_mas_bm avail; local
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/include/linux/
H A Dvirtio_ring.h24 /* The Guest uses this in avail->flags to advise the Host: don't interrupt me
69 struct vring_avail *avail; member in struct:vring
101 vr->avail = p + num*sizeof(struct vring_desc);
102 vr->used = (void *)(((unsigned long)&vr->avail->ring[num] + align-1)
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/include/linux/
H A Dvirtio_ring.h24 /* The Guest uses this in avail->flags to advise the Host: don't interrupt me
69 struct vring_avail *avail; member in struct:vring
101 vr->avail = p + num*sizeof(struct vring_desc);
102 vr->used = (void *)(((unsigned long)&vr->avail->ring[num] + align-1)
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/toolchains/hndtools-arm-linux-2.6.36-uclibc-4.5.3/usr/include/linux/
H A Dvirtio_ring.h24 /* The Guest uses this in avail->flags to advise the Host: don't interrupt me
69 struct vring_avail *avail; member in struct:vring
101 vr->avail = p + num*sizeof(struct vring_desc);
102 vr->used = (void *)(((unsigned long)&vr->avail->ring[num] + align-1)

Completed in 217 milliseconds

1234567891011>>