HomeSort by relevance Sort by last modified time
    Searched refs:block (Results 1 - 25 of 292) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /onnv/onnv-gate/usr/src/cmd/sgs/rtld/common/
malloc.c 38 * Each page is divided in blocks. There is at least one block in a page.
51 struct block { struct
55 struct block *next;
62 struct block block[1]; member in struct:page
68 #define HDR_BLOCK (sizeof (struct block) - sizeof (void *))
109 struct block *block; local
111 for (block = page->block; block; block = block->next)
161 struct block *block; local
221 struct block *block; local
279 struct block *block; local
307 struct block *block; local
    [all...]
  /onnv/onnv-gate/usr/src/lib/libtecla/common/
freelist.c 42 FreeListBlock *next; /* The next block in the list */
48 unsigned blocking_factor; /* The number of nodes per block */
51 FreeListBlock *block; /* The head of the list of free-list blocks */ member in struct:FreeList
57 static void _thread_FreeListBlock(FreeList *fl, FreeListBlock *block);
68 * to allocate per block.
86 * Enfore a minimum block size.
107 fl->block = NULL;
110 * Allocate the first block of memory.
112 fl->block = _new_FreeListBlock(fl);
113 if(!fl->block) {
138 FreeListBlock *block; local
200 FreeListBlock *block = next; local
239 FreeListBlock *block = _new_FreeListBlock(fl); local
337 FreeListBlock *block; \/* The new block to be returned *\/ local
    [all...]
  /onnv/onnv-gate/usr/src/lib/libmapmalloc/common/
textmem.c 45 * Each page is divided in blocks. There is at least one block in a page.
62 struct block { struct
66 struct block *next;
73 struct block block[1]; member in struct:page
79 #define HDR_BLOCK (sizeof (struct block) - sizeof (void *))
91 static void split(struct block *, size_t);
109 struct block *block; local
121 for (block = page->block; block; block = block->next)
159 struct block *block; local
198 struct block *block; local
245 struct block *block; local
    [all...]
  /onnv/onnv-gate/usr/src/cmd/rpcsvc/nis/rpc.nisd/resolv_server/
nres_search.c 50 nres_search(struct nres *block)
58 block->retries = 0; /* start clock */
60 if (block->search_index < 0)
64 if (block->reverse == REVERSE_PTR) {
65 if (block->af_type == AF_INET6) { /* IPv6 */
73 if (block->search_index == 0) {
75 (void) nres_querydomain(block->name,
76 "ip6.arpa", block->search_name);
77 block->search_index = 1;
80 (void) nres_querydomain(block->name
    [all...]
  /onnv/onnv-gate/usr/src/cmd/ipf/examples/
example.1 2 # block all incoming TCP packets on le0 from host 10.1.1.1 to any destination.
4 block in on le0 proto tcp from 10.1.1.1/32 to any
example.12 4 block in proto tcp all with short
8 block in log all with ipopts
16 block in quick all with opt lsrr
17 block in quick all with opt ssrr
example.2 2 # block all outgoing TCP packets on le0 from any host to port 23 of
5 block out on le0 proto tcp from any to 10.1.1.3/32 port = 23
example.4 2 # block all ICMP packets.
4 block in proto icmp from any to any
example.8 2 # block all incoming TCP connections but send back a TCP-RST for ones to
5 block in proto tcp from any to any flags S/SA
6 block return-rst in quick proto tcp from any to any port = 113 flags S/SA
8 # block all inbound UDP packets and send back an ICMP error.
10 block return-icmp in proto udp from any to any
example.9 4 block in all
9 block out on le1 all
11 block in on le1 all
example.6 2 # block all TCP packets with only the SYN flag set (this is the first
5 block in proto tcp from any to any flags S/SA
tcpstate 6 block out on le0 proto tcp all
7 block in on le0 proto tcp all
12 block out on le0 proto udp all
13 block in on le0 proto udp all
BASIC_2.FW 17 block in log quick all with short
21 # By default, block and log everything. This maybe too much logging
24 block in log on ppp0 all head 100
25 block out log on ppp0 all head 150
26 block in log on ed0 from w.x.y.z/24 to any head 200
27 block out log on ed0 all head 250
34 block in log quick from 10.0.0.0/8 to any group 100
35 block in log quick from 192.168.0.0/16 to any group 100
36 block in log quick from 172.16.0.0/12 to any group 100
40 block in log quick from a.b.c.d/24 to any group 10
    [all...]
example.sr 6 # block any inbound packets on le0 which are fragmented and "too short" to
11 block in log quick on le0 from any to any with short frag
20 # block and log any inbound ICMP unreachables
22 block in log on le0 proto icmp from any to any icmp-type unreach
24 # block and log any inbound UDP packets on le0 which are going to port 2049
27 block in log on le0 proto udp from any to any port = 2049
36 # block (and stop matching) any packet with IP options present.
38 block in quick on le0 from any to any with ipopts
44 # block any inbound UDP packets destined for these subnets.
46 block in on le0 proto udp from any to 10.1.3.0/2
    [all...]
server 3 # 128.1.2.1 (le1), we want to block all IP spoofing attacks. le1 is
9 block in log quick on le0 from any to any
10 block in log quick on le1 from 128.1.1.0/24 to any
example.11 12 # block anything trying to get to X terminal ports, X:0 to X:9
14 block in proto tcp from any to any port 5999 >< 6010
19 block in proto tcp/udp all
26 block in proto tcp/udp from any to any port 511 >< 516
BASIC_1.FW 17 block in log quick all with short
21 # By default, block and log everything. This maybe too much logging
24 block in log on ppp0 all head 100
25 block in log proto tcp all flags S/SA head 101 group 100
26 block out log on ppp0 all head 150
27 block in log on ed0 from w.x.y.z/24 to any head 200
28 block in log proto tcp all flags S/SA head 201 group 200
29 block in log proto udp all head 202 group 200
30 block out log on ed0 all head 250
36 block in log quick from 127.0.0.0/8 to any group 10
    [all...]
  /onnv/onnv-gate/usr/src/uts/common/tnf/
tnf_buf.c 68 * (Private) Allocate a new block. Return NULL on failure and mark
69 * tracing as broken. 'istag' is non-zero if the block is to be
76 tnf_block_header_t *block; local
91 * Check reserved area first for tag block allocations
99 * Search for a block, using hint as starting point.
102 bcount = fh->com.block_count; /* total block count */
105 bn = fh->next_alloc.block[gen & TNFW_B_ALLOC_LO];
110 * Calculate next (not this) block to look for.
120 * Try to reserve candidate block
123 block = (tnf_block_header_t *
231 tnf_block_header_t *block, *new_block; local
343 tnf_block_header_t *block; local
    [all...]
  /onnv/onnv-gate/usr/src/lib/libtnfprobe/
tnf_buf.c 80 * for file header and block header are.
92 * (Private) Allocate a new block. Return NULL on failure. 'istag'
93 * is true if the block is to be non-reclaimable.
98 tnf_block_header_t *block; local
132 /* Get the block shift and generation shift values. */
149 * If we need a tag block, check the reserved tag block space
157 block = (tnf_block_header_t *) ((char *) fh + i);
158 if (!tnfw_b_get_lock(&block->A_lock) &&
159 block->generation == 0
343 tnf_block_header_t *block; local
443 tnf_block_header_t *block, *new_block; local
559 tnf_block_header_t *block; local
628 tnf_block_header_t *block, *next; local
    [all...]
  /onnv/onnv-gate/usr/src/lib/libldap4/include/
ch_malloc.h 9 char * ch_realloc( char *block, unsigned long size );
  /onnv/onnv-gate/usr/src/lib/libparted/common/libparted/fs/amiga/
asfs.c 36 _asfs_probe_root (PedGeometry *geom, uint32_t *block, int blocksize, PedSector root) {
40 if (PED_BE32_TO_CPU (block[0]) != 0x53465300) return 0;
41 for (i = 0, sum = 1; i < 128*blocksize; i++) sum += PED_BE32_TO_CPU (block[i]);
43 if (PED_BE32_TO_CPU (block[2]) * blocksize + geom->start != root) {
46 start = ((((PedSector) PED_BE32_TO_CPU (block[8])) << 32)
47 + (PedSector) PED_BE32_TO_CPU (block[9])) / 512;
48 end = (((((PedSector) PED_BE32_TO_CPU (block[10])) << 32)
49 + (PedSector) PED_BE32_TO_CPU (block[11])) / 512) - 1;
57 uint32_t *block; local
66 /* Finds the blocksize, prealloc and reserved values of the partition block */
    [all...]
  /onnv/onnv-gate/usr/src/lib/libparted/common/libparted/fs/ext2/
ext2_buffer.c 30 static __inline__ int ext2_block_hash(blk_t block)
34 x = block ^ (block >> 8) ^ (block >> 16) ^ (block >> 24);
91 static struct ext2_buffer_head *ext2_bh_alloc(struct ext2_buffer_cache *bc, blk_t block)
117 bh->block = block;
132 "deallocing() a dirty buffer! %i\n", bh->block);
139 static struct ext2_buffer_head *ext2_bh_find(struct ext2_buffer_cache *bc, blk_t block)
    [all...]
ext2.h 82 blk_t block; member in struct:ext2_buffer_head
95 int (*read)(void *cookie, void *ptr, blk_t block, blk_t num);
98 int (*write)(void *cookie, void *ptr, blk_t block, blk_t num);
162 off_t ext2_get_inode_offset (struct ext2_fs *fs, ino_t inode, blk_t *block);
169 int ext2_read_blocks (struct ext2_fs *fs, void *ptr, blk_t block, blk_t numblocks);
172 int ext2_do_inode (struct ext2_fs *fs, struct ext2_inode *inode, blk_t block, int action);
174 int ext2_write_blocks (struct ext2_fs *fs, void *ptr, blk_t block, blk_t numblocks);
176 int ext2_zero_blocks (struct ext2_fs *fs, blk_t block, blk_t num);
179 /* block related */
183 int ext2_get_block_state (struct ext2_fs *, blk_t block);
    [all...]
  /onnv/onnv-gate/usr/src/lib/libast/common/misc/
stack.c 58 stack->position.block = b;
92 stack->position.block = stack->blocks;
104 else return(stack->position.block->stack[stack->position.index]);
118 b = stack->position.block;
127 b->prev = stack->position.block;
130 stack->position.block = b;
133 stack->position.block->stack[stack->position.index] = value;
155 if (!stack->position.block->prev) return(0);
156 stack->position.block = stack->position.block->prev
    [all...]
  /onnv/onnv-gate/usr/src/lib/libparted/common/libparted/fs/hfs/
advfs.c 42 /* CNID, then fork type, then start block */
187 unsigned int block, last_start, first_pass = 1; local
193 last_start = -1; block = 0;
197 search.start = PED_CPU_TO_BE16 (block);
224 block += PED_BE16_TO_CPU (
240 /* This function check if fblock is a bad block */
262 /* This function returns the first sector of the last free block of an
272 unsigned int block, last_bad, end_free_blocks; local
274 /* find the next block to the last bad block of the volume *
311 unsigned int block; local
    [all...]

Completed in 360 milliseconds

1 2 3 4 5 6 7 8 91011>>