HomeSort by: relevance | last modified time | path
    Searched refs:nodesize (Results 1 - 6 of 6) sorted by relevancy

  /src/common/lib/libc/rpc/
xdr_array.c 95 u_int nodesize; local in function:__weak_alias
105 nodesize = c * elsize;
116 *addrp = target = mem_alloc(nodesize);
121 memset(target, 0, nodesize);
143 mem_free(*addrp, nodesize);
xdr.c 603 u_int nodesize; local in function:xdr_bytes
618 nodesize = *sizep;
619 if ((nodesize > maxsize) && (xdrs->x_op != XDR_FREE)) {
629 if (nodesize == 0) {
633 *cpp = sp = mem_alloc(nodesize);
643 ret = xdr_opaque(xdrs, sp, nodesize);
646 mem_free(sp, nodesize);
654 mem_free(sp, nodesize);
748 u_int nodesize; local in function:xdr_string
780 nodesize = size + 1
    [all...]
  /src/bin/sh/
nodes.c.pat 52 struct nodesize {
68 STATIC void calcsize(union node *, struct nodesize *);
69 STATIC void sizenodelist(struct nodelist *, struct nodesize *);
87 struct nodesize sz;
114 calcsize(union node *n, struct nodesize *res)
122 sizenodelist(struct nodelist *lp, struct nodesize *res)
mknodes.sh 161 echo "static const short nodesize[$tagno] = {"
171 echo " res->bsize += nodesize[n->type];"
206 echo " st->block = (char *) st->block + nodesize[n->type];"
  /src/sys/fs/nilfs/
nilfs_fs.h 128 #define NILFS_BTREE_NODE_NCHILDREN_MAX(nodesize) \
129 (((nodesize) - sizeof(struct nilfs_btree_node) - \
132 #define NILFS_BTREE_NODE_NCHILDREN_MIN(nodesize) \
133 ((NILFS_BTREE_NODE_NCHILDREN_MAX(nodesize) - 1) / 2 + 1)
  /src/sys/fs/hfs/
libhfs.c 1359 uint16_t nodesize; local in function:hfslib_reada_node
1443 nodesize = inout_volume->chr.node_size;
1448 nodesize = inout_volume->ehr.node_size;
1478 last_bytes_read = hfslib_reada_node_offsets((uint8_t*)in_bytes + nodesize -
1485 free_space_offset = be16toh(*(uint16_t*)((uint8_t*)in_bytes + nodesize -

Completed in 17 milliseconds