Searched refs:blocks (Results 51 - 75 of 131) sorted by relevance

123456

/freebsd-10.0-release/sys/dev/cxgb/
H A Dbin2h.pl61 $atime,$mtime,$ctime,$blksize,$blocks)
/freebsd-10.0-release/sys/fs/fuse/
H A Dfuse_internal.h231 vap->va_bytes = fat->blocks << 9;
233 vap->va_bytes = fat->blocks * S_BLKSIZE;
H A Dfuse_kernel.h68 __u64 blocks; member in struct:fuse_attr
83 __u64 blocks; member in struct:fuse_kstatfs
/freebsd-10.0-release/sys/gnu/fs/reiserfs/
H A Dreiserfs_inode.c29 #define GET_BLOCK_NO_CREATE 0 /* Don't create new blocks or convert
74 /* Read file blocks */
443 to_real_used_space(struct reiserfs_node *ip, unsigned long blocks, int sd_size) argument
450 return ((off_t)real_space_diff(ip, sd_size)) + (((off_t)blocks) << 9);
491 unsigned long blocks; local
526 blocks = (ip->i_size + 511) >> 9;
527 blocks = _ROUND_UP(blocks, ip->i_reiserfs->s_blocksize >> 9);
528 if (ip->i_blocks > blocks) {
538 ip->i_blocks = blocks;
[all...]
/freebsd-10.0-release/crypto/openssh/
H A Dpacket.c94 u_int64_t blocks; member in struct:packet_state
403 packet_get_state(int mode, u_int32_t *seqnr, u_int64_t *blocks, argument
412 if (blocks)
413 *blocks = state->blocks;
421 packet_set_state(int mode, u_int32_t seqnr, u_int64_t blocks, u_int32_t packets, argument
429 state->blocks = blocks;
754 active_state->p_send.packets = active_state->p_send.blocks = 0;
759 active_state->p_read.packets = active_state->p_read.blocks
[all...]
/freebsd-10.0-release/contrib/gcc/
H A Dsched-rgn.c24 /* This pass implements list scheduling within basic blocks. It is
29 different blocks in the same "region", and the second runs only
96 are allowed to move between blocks in the same region, along
100 /* Number of extended basic blocks in region. */
118 /* Array of lists of regions' blocks. */
121 /* Topological order of blocks in the region (if b2 is reachable from
166 while other blocks in the region from which insns can be moved to the
167 target are called "source" blocks. The candidate structure holds info
189 from 'source' to 'target'. The split blocks are those to be checked.
191 the 'update' blocks
2875 sbitmap blocks; local
2931 sbitmap large_region_blocks, blocks; local
3131 sbitmap blocks = sbitmap_alloc (last_basic_block); local
3246 check_dead_notes1(int rgn, sbitmap blocks) argument
[all...]
H A Drecog.c390 blocks, and clear num_changes. */
2743 sbitmap blocks;
2747 blocks = sbitmap_alloc (last_basic_block);
2748 sbitmap_zero (blocks);
2759 CODE_LABELS and short-out basic blocks. */
2768 break the code that handles REG_NO_CONFLICT blocks. */
2782 SET_BIT (blocks, bb->index);
2800 SET_BIT (blocks, bb->index);
2812 find_many_sub_basic_blocks (blocks);
2815 blocks
2730 sbitmap blocks; local
3041 sbitmap blocks; local
[all...]
H A Ddf-scan.c429 /* Rescan some BLOCKS or all the blocks defined by the last call to
433 df_rescan_blocks (struct df *df, bitmap blocks)
443 if (blocks)
463 bitmap_copy (local_blocks_to_scan, blocks);
465 EXECUTE_IF_SET_IN_BITMAP (blocks, 0, bb_index, bi)
476 bitmap_copy (blocks, local_blocks_to_scan);
501 /* This may be a mistake, but if an explicit blocks is passed in
502 and the set of blocks to analyze has been explicitly set, add
503 the extra blocks to blocks_to_analyze. The alternative is to
507 bitmap_ior_into (df->blocks_to_analyze, blocks);
431 df_rescan_blocks(struct df *df, bitmap blocks) argument
862 df_refs_delete(struct dataflow *dflow, bitmap blocks) argument
1767 df_refs_record(struct dataflow *dflow, bitmap blocks) argument
[all...]
H A Dcfgrtl.c172 blocks) we can delete a label that's a target of the vector
363 to post-process the stream to remove empty blocks, loops, ranges, etc. */
564 /* Detect basic blocks with nothing but a label. This can happen
573 /* Delete the basic block note and handle blocks containing just that
619 hanging out between the two blocks. */
644 /* If we are partitioning hot/cold basic blocks, we don't want to
649 be optimizable (or blocks that appear to be mergeable), but which really
657 /* There must be exactly one edge in between the blocks. */
704 /* If we are partitioning hot/cold basic blocks, we don't want to
709 be optimizable (or blocks tha
1500 sbitmap blocks; local
1545 sbitmap blocks; local
2750 rtl_flow_call_edges_add(sbitmap blocks) argument
[all...]
H A Dcfgloop.c470 /* Split blocks so that each loop has only single latch. */
781 /* Gets basic blocks of a LOOP. Header is the 0-th block, rest is in dfs
797 /* There may be blocks unreachable from EXIT_BLOCK. */
845 the latch, then only blocks dominated by s are be after it. */
872 basic_block *blocks;
881 blocks = XCNEWVEC (basic_block, loop->num_nodes);
894 blocks[i++] = bb;
904 blocks[i++] = e->dest;
911 bb = blocks[vc++];
915 return blocks;
871 basic_block *blocks; local
[all...]
H A Ddf-core.c50 df_set_blocks (df, blocks);
52 df_rescan_blocks (df, blocks);
100 contains those blocks and any edges that occur directly between the
101 blocks in the set. Care should be taken to call df_set_blocks right
103 optimizations that reorder blocks invalidate the bitvector.
108 (re)run over the set of blocks passed in. If blocks is NULL, the entire
109 function (or all of the blocks defined in df_set_blocks) is rescanned.
110 If blocks contains blocks tha
392 df_set_blocks(struct df *df, bitmap blocks) argument
712 df_prune_to_subcfg(int list[], unsigned len, bitmap blocks) argument
[all...]
H A Dtree-if-conv.c28 o Walk all loop basic blocks in breadth first order (BFS order).
30 and propagate condition into destination basic blocks'
34 o Merge all basic blocks
36 o Merge all basic blocks into header
132 /* List of basic blocks in if-conversion-suitable order. */
197 /* Now, all statements are if-converted and basic blocks are
243 /* Update destination blocks' predicate list and remove this
487 - It has two or more basic blocks.
490 - If its basic blocks and phi nodes are if convertible. See above for
518 fprintf (dump_file, "less than 2 basic blocks\
1060 basic_block *blocks, *blocks_in_bfs_order; local
[all...]
/freebsd-10.0-release/sbin/fsck_ffs/
H A Dsuj.c527 * to be freed. The mask value can be used to free partial blocks.
758 * Handle extattr blocks first.
800 * or ext blocks.
971 * Don't visit indirect blocks with contents we can't trust. This
1017 * callback function. The callback may inspect or free blocks. The
1078 * Null visitor function used when we just want to count blocks and
1099 uint64_t blocks; local
1111 * Visit all blocks and count them as well as recording the last
1114 * the blocks count.
1118 blocks
2446 int blocks; local
2486 jblocks_add(struct jblocks *jblocks, ufs2_daddr_t daddr, int blocks) argument
2542 int blocks; local
2671 uint64_t blocks; local
[all...]
/freebsd-10.0-release/sys/kern/
H A Dsubr_blist.c39 * free contiguous range of blocks under the node. It may contain a
68 * to cover the number of blocks requested at creation time even if it
72 * BLIST_BMAP_RADIX blocks per call. It will panic with 'allocation too
149 * number of blocks
151 * blocks - must be greater than 0
155 * managing BLIST_BMAP_RADIX blocks.
159 blist_create(daddr_t blocks, int flags) argument
170 while (radix < blocks) {
177 bl->bl_blocks = blocks;
181 blst_radix_init(NULL, bl->bl_radix, bl->bl_skip, blocks);
[all...]
/freebsd-10.0-release/sys/contrib/octeon-sdk/
H A Dcvmx-nand.c140 int blocks; member in struct:__anon6983
398 cvmx_nand_state[chip].blocks = cvmx_nand_default.blocks;
405 cvmx_dprintf("%s: Defaults: page size: %d, OOB size: %d, pages per block %d, blocks: %d, timing mode: %d\n",
407 cvmx_nand_state[chip].blocks, cvmx_nand_state[chip].onfi_timing);
583 cvmx_nand_state[chip].blocks = 100;
668 cvmx_nand_state[chip].blocks = cvmx_le32_to_cpu(onfi_param_page->blocks_per_lun) * onfi_param_page->number_lun;
732 cvmx_nand_state[chip].blocks = nand_size_bits/(8ULL*cvmx_nand_state[chip].page_size*cvmx_nand_state[chip].pages_per_block);
970 return cvmx_pop(cvmx_nand_state[chip].blocks-1) + cvmx_pop(cvmx_nand_state[chip].pages_per_block-1);
1398 /* The NAND DMA engine always does transfers in 8 byte blocks, s
1980 cvmx_nand_set_defaults(int page_size, int oob_size, int pages_per_block, int blocks, int onfi_timing_mode) argument
[all...]
/freebsd-10.0-release/usr.sbin/nandsim/
H A Dnandsim.c640 for (blkidx = 0; blkidx < cparams.blocks; blkidx++) {
874 * First loop acquires blocks states and writes them to
877 for (blkidx = 0; blkidx < cparams.blocks; blkidx++) {
900 for (blkidx = 0; blkidx < cparams.blocks; blkidx++) {
976 expfilesz = cparams.blocks * (blksz + sizeof(bs)) + sizeof(cparams);
1018 for (blkidx = 0; blkidx < cparams.blocks; blkidx++) {
1031 blkidx, cparams.blocks, dump.ctrl_num, dump.chip_num,
1045 for (blkidx = 0; blkidx < cparams.blocks; blkidx++) {
/freebsd-10.0-release/contrib/amd/amd/
H A Dnfs_subr.c594 u_int blocks, bfree, bavail, i; local
599 blocks = bfree = bavail = 0;
614 blocks++;
623 *out_blocks = blocks;
/freebsd-10.0-release/contrib/xz/src/liblzma/api/lzma/
H A Dindex.h287 lzma_vli streams, lzma_vli blocks) lzma_nothrow;
/freebsd-10.0-release/crypto/openssl/crypto/modes/
H A Dmodes_lcl.h124 u64 blocks; member in struct:ccm128_context
/freebsd-10.0-release/sys/fs/nandfs/
H A Dbmap.c155 DPRINTF(BMAP, ("%s: node %p reading blocks\n", __func__, node));
288 nandfs_lbn_t blocks; local
290 for (blocks = 1; level >= SINGLE; level--, nip++) {
292 blocks += nip->in_off * lbn_offset(fsdev, level);
295 return (blocks);
502 ("truncated wrong number of blocks (%jd should be 0)", left));
531 * path of indirect blocks required to access a data block. The first "pair"
559 /* The first NDADDR blocks are direct blocks. */
565 * is done, blockcnt indicates the number of data blocks possibl
[all...]
H A Dnandfs_segment.c221 info->blocks = 0;
267 seginfo->blocks++;
355 seginfo->blocks++;
413 seginfo->blocks++;
1043 if (seginfo->blocks) {
1059 /* Reiterate all blocks and assign physical block number */
1064 &ifile->nn_inode, seginfo->blocks);
1146 if (seginfo->blocks || flags) {
1156 /* Collect blocks from system files */
1180 /* Reiterate all blocks an
[all...]
/freebsd-10.0-release/contrib/wpa/src/eap_common/
H A Dikev2_common.c198 size_t i, blocks; local
208 blocks = len / 8;
210 for (i = 0; i < blocks; i++) {
257 size_t i, blocks; local
271 blocks = len / 8;
272 for (i = 0; i < blocks; i++) {
/freebsd-10.0-release/contrib/libarchive/libarchive/
H A Darchive_write_set_format_iso9660.c186 int blocks; member in struct:isofile::content
1749 iso9660->cur_file->cur_content->blocks = (int)
1841 iso9660->cur_file->cur_content->blocks = (int)
1855 int ret, blocks; local
1940 blocks = SYSTEM_AREA_BLOCK
1945 blocks += BOOT_RECORD_DESCRIPTOR_BLOCK;
1947 blocks += SUPPLEMENTARY_VOLUME_DESCRIPTOR_BLOCK;
1949 blocks += SUPPLEMENTARY_VOLUME_DESCRIPTOR_BLOCK;
1952 iso9660->primary.location_type_L_path_table = blocks;
1953 blocks
4501 int64_t blocks, offset; local
[all...]
/freebsd-10.0-release/contrib/llvm/tools/lldb/source/Symbol/
H A DSymbolContext.cpp270 std::vector<Block *> blocks; local
271 blocks.push_back (block);
276 blocks.push_back (parent_block);
280 std::vector<Block *>::reverse_iterator begin = blocks.rbegin();
281 std::vector<Block *>::reverse_iterator end = blocks.rend();
361 // Dump the block and pass it a negative depth to we print all the parent blocks
466 // this block or one of this blocks parents is an inlined function.
477 // If we get here we weren't able to find the return line entry using the nesting of the blocks and
/freebsd-10.0-release/contrib/xz/src/xz/
H A Dlist.c101 uint64_t blocks; member in struct:__anon4729
929 totals.blocks += lzma_index_block_count(xfi->idx);
961 uint64_to_str(totals.blocks, 1),
993 print_adv_helper(totals.streams, totals.blocks,
1017 totals.blocks,

Completed in 377 milliseconds

123456