/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/arch/sparc/include/asm/ |
H A D | bitext.h | 19 int first_free; member in struct:bit_map
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/arch/sparc/include/asm/ |
H A D | bitext.h | 19 int first_free; member in struct:bit_map
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/arch/sparc/lib/ |
H A D | bitext.c | 54 offset = t->first_free; 85 if (offset == t->first_free) 86 t->first_free = find_next_zero_bit 88 t->first_free + len); 115 if (offset < t->first_free) 116 t->first_free = offset;
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/arch/sparc/lib/ |
H A D | bitext.c | 54 offset = t->first_free; 85 if (offset == t->first_free) 86 t->first_free = find_next_zero_bit 88 t->first_free + len); 115 if (offset < t->first_free) 116 t->first_free = offset;
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/net/tipc/ |
H A D | ref.c | 58 * @first_free: array index of first unused object reference entry 68 u32 first_free; member in struct:ref_table 104 tipc_ref_table.first_free = 0; 157 if (tipc_ref_table.first_free) { 158 index = tipc_ref_table.first_free; 162 tipc_ref_table.first_free = next_plus_upper & index_mask; 237 if (tipc_ref_table.first_free == 0) 238 tipc_ref_table.first_free = index;
|
H A D | name_table.c | 84 * @first_free: array index of first unused sub-sequence entry 94 u32 first_free; member in struct:name_seq 181 nseq, type, nseq->sseqs, nseq->first_free); 200 int high = nseq->first_free - 1; 229 int high = nseq->first_free - 1; 280 if ((inspos < nseq->first_free) && 289 if (nseq->first_free == nseq->alloc) { 308 dbg("ins in pos %u, ff = %u\n", inspos, nseq->first_free); 310 freesseq = &nseq->sseqs[nseq->first_free]; 313 nseq->first_free [all...] |
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/net/tipc/ |
H A D | ref.c | 58 * @first_free: array index of first unused object reference entry 68 u32 first_free; member in struct:ref_table 104 tipc_ref_table.first_free = 0; 157 if (tipc_ref_table.first_free) { 158 index = tipc_ref_table.first_free; 162 tipc_ref_table.first_free = next_plus_upper & index_mask; 237 if (tipc_ref_table.first_free == 0) 238 tipc_ref_table.first_free = index;
|
H A D | name_table.c | 84 * @first_free: array index of first unused sub-sequence entry 94 u32 first_free; member in struct:name_seq 181 nseq, type, nseq->sseqs, nseq->first_free); 200 int high = nseq->first_free - 1; 229 int high = nseq->first_free - 1; 280 if ((inspos < nseq->first_free) && 289 if (nseq->first_free == nseq->alloc) { 308 dbg("ins in pos %u, ff = %u\n", inspos, nseq->first_free); 310 freesseq = &nseq->sseqs[nseq->first_free]; 313 nseq->first_free [all...] |
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/fs/hpfs/ |
H A D | map.c | 141 if (fnode->btree.first_free != 144 "bad first_free pointer in fnode %08lx", 190 if (anode->btree.first_free != 192 hpfs_error(s, "bad first_free pointer in anode %08x", ano); 230 if (dnode->first_free > 2048/* || dnode->first_free < 84*/) { 231 hpfs_error(s, "dnode %08x has first_free == %08x", secno, dnode->first_free); 234 for (p = 20; p < dnode->first_free; p += d[p] + (d[p+1] << 8)) { 254 if (p != dnode->first_free) { [all...] |
H A D | dnode.c | 148 if ((d->first_free += 4) > 2048) { 150 d->first_free -= 4; 187 d->first_free += d_size; 200 d->first_free -= de->length; 201 memmove(de, de_next_de(de), d->first_free + (char *)d - (char *)de); 265 if (d->first_free + de_size(namelen, down_ptr) <= 2048) { 289 memcpy(nd, d, d->first_free); 316 memmove((char *)nd + 20, de, nd->first_free + (char *)nd - (char *)de); 317 nd->first_free -= (char *)de - (char *)nd - 20; 318 memcpy(d, nd, nd->first_free); [all...] |
H A D | hpfs.h | 259 unsigned first_free; /* offset from start of dnode to member in struct:dnode 352 unsigned short first_free; /* offset from start of header to member in struct:bplus_header
|
H A D | hpfs_fn.h | 130 CHKCOND(dnode->first_free>=0x14 && dnode->first_free<=0xa00,("HPFS: dnode_end_de: dnode->first_free = %d\n",(int)dnode->first_free)); 131 return (void *) dnode + dnode->first_free;
|
H A D | anode.c | 134 anode->btree.first_free = btree->first_free; 140 btree->first_free = (char *)&(btree->u.internal[1]) - (char *)btree; 156 btree->first_free += 12; 177 btree->first_free += 8; 204 anode->btree.first_free = 16; 236 memcpy(&ranode->btree, btree, btree->first_free); 251 btree->first_free = (char *)&btree->u.internal[2] - (char *)btree; 414 btree->first_free = 8; 433 btree->first_free [all...] |
H A D | alloc.c | 414 d->first_free = 52; 436 f->btree.first_free = 8; 454 a->btree.first_free = 8;
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/fs/hpfs/ |
H A D | map.c | 141 if (fnode->btree.first_free != 144 "bad first_free pointer in fnode %08lx", 190 if (anode->btree.first_free != 192 hpfs_error(s, "bad first_free pointer in anode %08x", ano); 230 if (dnode->first_free > 2048/* || dnode->first_free < 84*/) { 231 hpfs_error(s, "dnode %08x has first_free == %08x", secno, dnode->first_free); 234 for (p = 20; p < dnode->first_free; p += d[p] + (d[p+1] << 8)) { 254 if (p != dnode->first_free) { [all...] |
H A D | dnode.c | 148 if ((d->first_free += 4) > 2048) { 150 d->first_free -= 4; 187 d->first_free += d_size; 200 d->first_free -= de->length; 201 memmove(de, de_next_de(de), d->first_free + (char *)d - (char *)de); 265 if (d->first_free + de_size(namelen, down_ptr) <= 2048) { 289 memcpy(nd, d, d->first_free); 316 memmove((char *)nd + 20, de, nd->first_free + (char *)nd - (char *)de); 317 nd->first_free -= (char *)de - (char *)nd - 20; 318 memcpy(d, nd, nd->first_free); [all...] |
H A D | hpfs.h | 259 unsigned first_free; /* offset from start of dnode to member in struct:dnode 352 unsigned short first_free; /* offset from start of header to member in struct:bplus_header
|
H A D | hpfs_fn.h | 130 CHKCOND(dnode->first_free>=0x14 && dnode->first_free<=0xa00,("HPFS: dnode_end_de: dnode->first_free = %d\n",(int)dnode->first_free)); 131 return (void *) dnode + dnode->first_free;
|
H A D | anode.c | 134 anode->btree.first_free = btree->first_free; 140 btree->first_free = (char *)&(btree->u.internal[1]) - (char *)btree; 156 btree->first_free += 12; 177 btree->first_free += 8; 204 anode->btree.first_free = 16; 236 memcpy(&ranode->btree, btree, btree->first_free); 251 btree->first_free = (char *)&btree->u.internal[2] - (char *)btree; 414 btree->first_free = 8; 433 btree->first_free [all...] |
H A D | alloc.c | 414 d->first_free = 52; 436 f->btree.first_free = 8; 454 a->btree.first_free = 8;
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/drivers/infiniband/hw/mthca/ |
H A D | mthca_srq.c | 289 srq->first_free = 0; 507 first_ind = srq->first_free; 510 ind = srq->first_free; 548 srq->first_free = next_ind; 564 first_ind = srq->first_free; 606 ind = srq->first_free; 637 srq->first_free = next_ind;
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/drivers/infiniband/hw/mthca/ |
H A D | mthca_srq.c | 289 srq->first_free = 0; 507 first_ind = srq->first_free; 510 ind = srq->first_free; 548 srq->first_free = next_ind; 564 first_ind = srq->first_free; 606 ind = srq->first_free; 637 srq->first_free = next_ind;
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/db-4.8.30/repmgr/ |
H A D | repmgr_windows.c | 32 * "first_free" points to a list of not-in-use slots threaded through the first 39 int first_free; member in struct:__ack_waiters_table 180 if (table->first_free == -1) { 208 i = table->first_free; 210 table->first_free = w->next_free; 228 slot->next_free = db_rep->waiters->first_free; 229 db_rep->waiters->first_free = slot_index; 374 table->first_free = -1;
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/db-4.8.30/repmgr/ |
H A D | repmgr_windows.c | 32 * "first_free" points to a list of not-in-use slots threaded through the first 39 int first_free; member in struct:__ack_waiters_table 180 if (table->first_free == -1) { 208 i = table->first_free; 210 table->first_free = w->next_free; 228 slot->next_free = db_rep->waiters->first_free; 229 db_rep->waiters->first_free = slot_index; 374 table->first_free = -1;
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/db-4.8.30/repmgr/ |
H A D | repmgr_windows.c | 32 * "first_free" points to a list of not-in-use slots threaded through the first 39 int first_free; member in struct:__ack_waiters_table 180 if (table->first_free == -1) { 208 i = table->first_free; 210 table->first_free = w->next_free; 228 slot->next_free = db_rep->waiters->first_free; 229 db_rep->waiters->first_free = slot_index; 374 table->first_free = -1;
|