| /external/bluetooth/bluedroid/stack/include/ |
| gap_api.h | 34 #define GAP_ERR_NO_CTRL_BLK (GAP_ERR_GRP + 0x04) /* No control blocks available */
280 ** GAP_ERR_NO_CTRL_BLK if out of control blocks
300 ** GAP_ERR_NO_CTRL_BLK if out of control blocks
531 ** GAP_ERR_NO_CTRL_BLK if out of control blocks (too many commands pending)
724 ** Description Initializes the control blocks used by GAP.
[all...] |
| /external/chromium-trace/trace-viewer/third_party/pywebsocket/src/mod_pywebsocket/ |
| util.py | 284 # available bytes before invoking read which blocks until
410 """Reads at most size bytes. Blocks until there's at least one byte
430 # In 3.0.3 and prior of mod_python, read blocks until length bytes
435 # socket._fileobject.read also blocks until length bytes was read
477 # the errors that indicates that the socket blocks. Those
|
| /external/chromium_org/v8/src/x64/ |
| lithium-gap-resolver-x64.cc | 103 // as this one's destination blocks this one so recursively perform all
107 if (other_move.Blocks(destination) && !other_move.IsPending()) {
137 if (other_move.Blocks(destination)) {
324 if (other_move.Blocks(source)) {
326 } else if (other_move.Blocks(destination)) {
|
| /external/e2fsprogs/e2fsck/ |
| pass5.c | 109 blk_t blocks = 0; local
249 blocks ++;
250 if ((blocks == fs->super->s_blocks_per_group) ||
254 blocks = 0;
290 blocks = 0; free_blocks = 0; group_free = 0; group = 0;
|
| /external/e2fsprogs/misc/ |
| dumpe2fs.c | 182 printf (_("Group %lu: (Blocks "), i);
201 printf(_("\n Reserved GDT blocks at "));
231 printf (_("\n %u free blocks, %u free inodes, "
241 fputs(_(" Free blocks: "), stdout);
288 header = _("Bad blocks: %u");
|
| /external/emma/core/java12/com/vladium/emma/instr/ |
| InstrVisitor.java | 946 final BlockList blocks = new BlockList (blockCount); local
[all...] |
| /external/jmonkeyengine/engine/src/core-plugins/com/jme3/export/binary/ |
| BinaryExporter.java | 55 * CLASS TABLE: There will be X blocks each consisting of numbers 2 thru 9,
73 * 5. "number of fields" - four bytes - int value representing number of blocks
101 * DATA LOOKUP TABLE: There will be X blocks each consisting of numbers 11 and
120 * OBJECT DATA SECTION: There will be X blocks each consisting of numbers 15
130 * FIELD ENTRY: There will be X blocks each consisting of numbers 18 and 19
|
| /external/kernel-headers/original/linux/ |
| nfs_xdr.h | 44 __u32 blocks; member in struct:nfs_fattr::__anon22812::__anon22813
97 __u32 blocks; /* No. of "bsize" blocks on filesystem */ member in struct:nfs2_fsstat
98 __u32 bfree; /* No. of free "bsize" blocks */
99 __u32 bavail; /* No. of available "bsize" blocks */
|
| jbd.h | 142 * Standard header for all descriptor blocks:
162 * The revoke descriptor: used on disk to describe a series of blocks to
190 __be32 s_maxlen; /* total blocks in journal file */
216 __be32 s_max_transaction; /* Limit of journal blocks per trans.*/
217 __be32 s_max_trans_data; /* Limit of data blocks per trans. */
594 * @j_free: Journal free - how many free blocks are there in the journal?
621 * @j_revoke: The revoke table - maintains the list of revoked blocks in the
717 * Journal free: how many free blocks are there in the journal?
804 * The revoke table: maintains the list of revoked blocks in the
1058 * Return the minimum number of blocks which must be free in the journa
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| DominatorInternals.h | 166 // Step #1: Number blocks in depth-first order and initialize variables used
172 // it might be that some blocks did not get a DFS number (e.g., blocks of
250 // which postdominates all real exits if there are multiple exit blocks, or
257 // Loop over all of the reachable blocks in the function...
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineTraceMetrics.h | 16 // blocks at the same time. This makes it difficult to estimate the resource
27 // if the traces through basic blocks A and B ever cross when moving away from
214 /// include PHI uses in deeper blocks.
233 /// A trace represents a plausible sequence of executed basic blocks that
262 /// Any blocks in Extrablocks are included as if they were part of the
|
| /external/llvm/include/llvm/IR/ |
| Function.h | 13 // A function basically consists of a list of basic blocks, a list of arguments,
33 // Traits for intrusive list of basic blocks...
85 BasicBlockListType BasicBlocks; ///< The basic blocks
439 /// just like viewCFG, but it does not include the contents of basic blocks
460 /// including any contained basic blocks.
|
| /external/llvm/lib/CodeGen/ |
| MachineTraceMetrics.cpp | 250 /// by all blocks preceding MBB in its trace. It does not include instructions
265 /// by this block and all blocks following it in its trace.
284 // pickTracePred() is called on the post-ordered blocks. During the downwards
413 // revisit blocks.
417 MutableArrayRef<MachineTraceMetrics::TraceBlockInfo> Blocks;
421 LoopBounds(MutableArrayRef<MachineTraceMetrics::TraceBlockInfo> blocks,
423 : Blocks(blocks), Loops(loops), Downward(false) {}
438 // Skip already visited To blocks.
439 MachineTraceMetrics::TraceBlockInfo &TBI = LB.Blocks[To->getNumber()]
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| FlattenCFG.cpp | 35 /// \brief Compare a pair of blocks: \p Block1 and \p Block2, which
36 /// are from two if-regions whose entry blocks are \p Head1 and \p
170 // These are internal condition blocks to be merged from, e.g.,
176 // Instructions in the internal condition blocks should be safe
306 /// Compare blocks from two if-regions, where \param Head1 is the entry of the
|
| /external/llvm/tools/bugpoint/ |
| ExtractFunction.cpp | 195 // blocks, making it external.
358 /// ExtractMappedBlocksFromModule - Extract all but the specified basic blocks
390 errs() << "Error writing list of blocks to not extract\n";
397 std::string uniqueFN = "--extract-blocks-file=";
402 PI.push_back("extract-blocks");
|
| /external/svox/pico/lib/ |
| picoklex.c | 64 - 2 bytes searchindex nr -> 64K blocks possible
67 - 2 bytes blockadr in searchindex -> 64K blocks possible
75 - 500KB lex -> 1000 blocks,
79 - 100KB lex -> 200 blocks,
167 PICODBG_DEBUG(("nr blocks: %i, curpos: %i", klex->nrblocks,curpos));
|
| /external/v8/src/ia32/ |
| lithium-gap-resolver-ia32.cc | 107 // as this one's destination blocks this one so recursively perform all
111 if (other_move.Blocks(destination) && !other_move.IsPending()) {
141 if (other_move.Blocks(destination)) {
464 if (other_move.Blocks(source)) {
466 } else if (other_move.Blocks(destination)) {
|
| /hardware/ti/omap3/omx/video/src/openmax_il/video_encode/inc/ |
| OMX_VideoEnc_DSP.h | 147 IH264_INTRAREFRESH_NONE = 0 , /* Doesn't insert forcefully intra macro blocks*/
148 IH264_INTRAREFRESH_CYCLIC_MBS , /* Insters intra macro blocks in a cyclic fashion :*/
152 IH264_INTRAREFRESH_RDOPT_MBS /* position of intra macro blocks is intelligently */
154 /* intra macro blocks in a frame is gaurnteed to be */
238 OMX_U32 airMbPeriod ; /* Adaptive Intra Refesh MB Period: Period at which intra macro blocks should be insterted in a frame*/
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/bin/ |
| i686-linux-gcov | |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/email/ |
| generator.py | 259 blocks = []
268 blocks.append(NL.join(lines[:-1]))
270 blocks.append(text)
271 # Now join all the blocks with an empty line. This has the lovely
274 self._fp.write(NL.join(blocks))
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/email/ |
| generator.py | 259 blocks = []
268 blocks.append(NL.join(lines[:-1]))
270 blocks.append(text)
271 # Now join all the blocks with an empty line. This has the lovely
274 self._fp.write(NL.join(blocks))
|
| /external/clang/docs/ |
| Block-ABI-Apple.rst | 24 This document describes the Apple ABI implementation specification of Blocks.
37 The ABI of ``Blocks`` consist of their layout and the runtime functions required
468 Importing ``__block`` variables into ``Blocks``
552 Because ``Blocks`` referencing ``__block`` variables may have ``Block_copy()``
567 ``Blocks`` may contain ``Block`` literal expressions. Any variables used within
568 inner blocks are imported into all enclosing ``Block`` scopes even if the
572 Objective C Extensions to ``Blocks``
584 ``Blocks`` as Objects
587 The compiler will treat ``Blocks`` as objects when synthesizing property setters
899 heap. The following function is used to copy fields of types: blocks,
[all...] |
| /external/clang/lib/Analysis/ |
| CFG.cpp | 286 /// implicit fall-throughs without extra basic blocks.
310 // A list of blocks that end with a "goto" that must be backpatched to their
647 Block = NULL; // the EXIT block is empty. Create all other blocks lazily.
712 /// createBlock - Used to lazily create blocks that are connected
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| ext2fs.h | 213 errcode_t (*get_blocks)(ext2_filsys fs, ext2_ino_t ino, blk_t *blocks);
268 * function should be called on blocks where the block number is zero.
274 * the indirect, doubly indirect, etc. blocks should be called after
275 * all of the blocks containined in the indirect blocks are processed.
276 * This is useful if you are going to be deallocating blocks from an
280 * called for data blocks only.
323 __u32 e_len; /* number of blocks covered by extent */
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| DeadStoreElimination.cpp | 64 // Only check non-dead blocks. Dead blocks may have strange pointer
639 /// Find all blocks that will unconditionally lead to the block BB and append
641 static void FindUnconditionalPreds(SmallVectorImpl<BasicBlock *> &Blocks,
651 Blocks.push_back(Pred);
661 SmallVector<BasicBlock *, 16> Blocks;
662 Blocks.push_back(F->getParent());
664 while (!Blocks.empty()) {
665 BasicBlock *BB = Blocks.pop_back_val();
698 FindUnconditionalPreds(Blocks, BB, DT)
[all...] |
