HomeSort by relevance Sort by last modified time
    Searched full:blocks (Results 1276 - 1300 of 5464) sorted by null

<<51525354555657585960>>

  /external/kernel-headers/original/linux/raid/
md_k.h 53 sector_t size; /* Device size (in blocks) */
153 sector_t resync_mark_cnt;/* blocks written at resync_mark */
154 sector_t curr_mark_cnt; /* blocks scheduled now */
212 atomic_t recovery_active; /* blocks scheduled, but not written */
  /external/libnfc-nci/src/nfc/int/
rw_int.h 135 /* RW Type 1 Tag control blocks */
301 UINT8 tag_hdr[T2T_READ_DATA_LEN]; /* T2T Header blocks */
358 UINT8 nbr; /* NBr: number of blocks that can be read using one Check command */
359 UINT8 nbw; /* Nbw: number of blocks that can be written using one Update command */
360 UINT16 nmaxb; /* Nmaxb: maximum number of blocks available for NDEF data */
    [all...]
  /external/llvm/bindings/ocaml/analysis/
llvm_analysis.mli 43 include the contents of basic blocks into the nodes.
  /external/llvm/docs/CommandGuide/
llvm-prof.rst 36 particularly useful when trying to visualize how frequently basic blocks
  /external/llvm/examples/OCaml-Kaleidoscope/Chapter4/
toy.ml 41 (* Simplify the control flow graph (deleting unreachable blocks, etc). *)
  /external/llvm/examples/OCaml-Kaleidoscope/Chapter5/
toy.ml 41 (* Simplify the control flow graph (deleting unreachable blocks, etc). *)
  /external/llvm/examples/OCaml-Kaleidoscope/Chapter6/
toy.ml 41 (* Simplify the control flow graph (deleting unreachable blocks, etc). *)
  /external/llvm/examples/OCaml-Kaleidoscope/Chapter7/
toy.ml 45 (* Simplify the control flow graph (deleting unreachable blocks, etc). *)
  /external/llvm/include/llvm/CodeGen/
Passes.h 336 /// work well with unreachable basic blocks (what live ranges make sense for a
338 /// not instruction select unreachable blocks, or run this pass as its
339 /// last LLVM modifying pass to clean up blocks that are not reachable from
358 /// LiveVariables pass - This pass computes the set of blocks in which each
398 /// basic blocks.
406 /// machine basic blocks.
446 /// successor blocks (creating fall throughs), and eliminating branches over
453 /// TailDuplicate - Duplicate blocks with unconditional branches
472 /// MachineBlockPlacement - This pass places basic blocks based on branch
  /external/llvm/include/llvm/Support/
PredIteratorCache.h 26 /// wants the predecessor list for the same blocks.
  /external/llvm/include/llvm/Transforms/Utils/
UnifyFunctionExitNodes.h 38 // return, unwind, or unreachable basic blocks in the CFG.
  /external/llvm/lib/CodeGen/
RegAllocGreedy.cpp 179 /// All basic blocks where the current register has uses.
806 // Add constraints for use-blocks. Note that these are the only constraints
814 /// live-through blocks in Blocks.
816 ArrayRef<unsigned> Blocks) {
822 for (unsigned i = 0; i != Blocks.size(); ++i) {
823 unsigned Number = Blocks[i];
864 // Keep track of through blocks that have not been added to SpillPlacer.
874 // Find new through blocks in the periphery of PrefRegBundles.
877 // Look at all blocks connected to Bundle in the full graph
    [all...]
  /external/llvm/lib/Target/AArch64/
AArch64BranchFixupPass.cpp 44 /// blocks may need converting into an unconditional equivalent. For example:
196 // This pass invalidates liveness information when it splits basic blocks.
199 // Renumber all of the machine basic blocks in the function, guaranteeing that
259 // First thing, compute the size of all basic blocks, and see if the function
356 /// Split the basic block containing MI into two blocks, which are joined by
357 /// an unconditional branch. Update data structures and renumber blocks to
403 // All BBOffsets following these blocks must be modified.
419 // and we have updated 2 blocks. This is the maximum number of blocks
  /external/llvm/lib/Transforms/Utils/
LCSSA.cpp 104 /// one of the blocks in the specified list.
125 // Get the set of exiting blocks.
132 // Speed up queries by creating a sorted vector of blocks.
225 // Insert the LCSSA phi's into all of the exit blocks dominated by the
  /external/llvm/runtime/libprofile/
BasicBlockTracing.c 11 |* instrumentation pass. This should be used with the -trace-basic-blocks
  /external/llvm/test/Transforms/InstCombine/
sink_instruction.ll 3 ;; This tests that the instructions in the entry blocks are sunk into each
  /external/llvm/test/Transforms/SLPVectorizer/X86/
multi_block.ll 11 ; if (d) foo(); <----- This splits the blocks
  /external/llvm/tools/llvm-bcanalyzer/
llvm-bcanalyzer.cpp 22 // detailed and contains information about individual bitcode blocks and the
83 // Standard blocks for all bitcode files.
119 // Standard blocks for all bitcode files.
291 /// NumBits - The total size in bits of all of these blocks.
294 /// NumSubBlocks - The total number of blocks these blocks contain.
300 /// NumRecords - The total number of records these blocks contain, and the
521 // Parse the top-level structure. We only allow blocks at the top-level.
547 outs() << " # Toplevel Blocks: " << NumTopBlocks << "\n";
  /external/markdown/markdown/extensions/
imagelinks.py 46 blocks = []
  /external/mesa3d/src/gallium/auxiliary/util/
u_linear.h 61 /* size of each tile expressed in blocks */
u_slab.h 46 /* The page is an array of blocks (allocations). */
  /external/mesa3d/src/gallium/drivers/softpipe/
sp_quad_pipe.h 40 * Fragment processing is performed on 2x2 blocks of pixels called "quads".
  /external/mesa3d/src/gallium/drivers/svga/
svga_resource_texture.h 92 /* Height of the hardware buffer in pixel blocks */
  /external/mesa3d/src/gallium/state_trackers/xvmc/tests/
testlib.h 49 * intra_unsigned: OUT If 1, port uses unsigned values for intra-coded blocks
  /external/neven/Embedded/common/src/b_BasicEm/
MemSeg.h 60 * - Memory is arranged in blocks
123 /** returns effectively used memory amount allocated size - unused blocks - overhead */
127 /** counts amount of memory blocks allocated */
131 /** counts amount of memory blocks currently used */

Completed in 1484 milliseconds

<<51525354555657585960>>