| /external/owasp/sanitizer/src/tests/org/owasp/html/ |
| SanitizersTest.java | 55 assertEquals("", Sanitizers.BLOCKS.sanitize(null));
58 Sanitizers.BLOCKS.sanitize("Hello, World!"));
61 Sanitizers.BLOCKS.sanitize("Hello, <b>World</b>!"));
64 Sanitizers.BLOCKS.sanitize(
70 PolicyFactory s = Sanitizers.BLOCKS.and(Sanitizers.FORMATTING);
71 PolicyFactory r1 = Sanitizers.BLOCKS.and(Sanitizers.FORMATTING)
72 .and(Sanitizers.BLOCKS);
73 PolicyFactory r2 = Sanitizers.BLOCKS.and(Sanitizers.FORMATTING)
88 .and(Sanitizers.BLOCKS).and(Sanitizers.STYLES).and(Sanitizers.LINKS);
276 .and(Sanitizers.BLOCKS)
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
| LoopDeletion.cpp | 75 /// checked for unique exit and exiting blocks, and that the code is in LCSSA
92 // Make sure all exiting blocks produce the same incoming value for the exit
94 // blocks, then it is impossible to statically determine which value should
201 // Update the dominator tree and remove the instructions and blocks that will
223 // Erase the instructions and the blocks without having to worry
231 // Finally, the blocks from loopinfo. This has to happen late because
234 SmallPtrSet<BasicBlock*, 8> blocks; local
235 blocks.insert(L->block_begin(), L->block_end());
236 for (SmallPtrSet<BasicBlock*,8>::iterator I = blocks.begin(),
237 E = blocks.end(); I != E; ++I
[all...] |
| SimplifyCFGPass.cpp | 13 // * Removes basic blocks with no predecessors.
16 // * Eliminates PHI nodes for basic blocks with a single predecessor.
40 STATISTIC(NumSimpl, "Number of blocks simplified");
173 /// RemoveUnreachableBlocksFromFn - Remove blocks that are not reachable, even
180 // If there are unreachable blocks in the CFG...
187 // Loop over all of the basic blocks that are not reachable, dropping all of
209 /// node) return blocks, merge them together to promote recursive block merging.
215 // Scan all the blocks in the function, looking for empty return blocks.
219 // Only look at return blocks
[all...] |
| /external/v8/src/crankshaft/ |
| hydrogen-escape-analysis.cc | 43 int block_count = graph()->blocks()->length();
45 HBasicBlock* block = graph()->blocks()->at(i);
161 // over affected basic blocks. All non-escaping instructions are handled
165 block_states_.AddBlock(NULL, graph()->blocks()->length(), zone());
167 // Iterate all blocks starting with the allocation block, since the
168 // allocation cannot dominate blocks that come before.
170 for (int i = start; i < graph()->blocks()->length(); i++) {
171 HBasicBlock* block = graph()->blocks()->at(i);
174 // Skip blocks that are not dominated by the captured allocation.
251 // Propagate the block state forward to all successor blocks
[all...] |
| /external/valgrind/include/ |
| pub_tool_addrinfo.h | 41 // Different kinds of blocks.
43 // Client allocated heap blocks.
45 // list of blocks freed by the Client but not yet physically freed.
47 // blocks.
50 // information about Client allocated heap blocks.
52 // blocks of Valgrind internal heap.
144 // This covers heap blocks (normal and from mempools), user-defined
145 // blocks and Arena blocks.
148 // more detailed information about client blocks
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| LoopInfo.cpp | 263 // Sort the blocks vector so that we can use binary search to do quick
279 // block they are defined in. Also, blocks not reachable from the
303 // Sort the blocks vector so that we can use binary search to do quick
319 /// getUniqueExitBlocks - Return all unique successor blocks of this loop.
320 /// These are the blocks _outside of the current loop_ which are branched to.
328 // Sort the blocks vector so that we can use binary search to do quick
394 /// Find the new parent loop for all blocks within the "unloop" whose last
427 /// updateBlockParents - Update the parent loop for all blocks that are directly
431 // Perform a post order CFG traversal of all blocks within this loop,
459 // Iterate over the postorder list of blocks, propagating the nearest loo
[all...] |
| /device/google/marlin/ |
| media_codecs.xml | 123 <Limit name="blocks-per-second" min="1" max="489600" />
135 <Limit name="blocks-per-second" min="1" max="48600" />
148 <Limit name="blocks-per-second" min="1" max="979200" />
161 <Limit name="blocks-per-second" min="1" max="979200" />
174 <Limit name="blocks-per-second" min="1" max="979200" />
188 <Limit name="blocks-per-second" min="1" max="1958400" />
200 <Limit name="blocks-per-second" min="1" max="1958400" />
212 <Limit name="blocks-per-second" min="1" max="489600" />
223 <Limit name="blocks-per-second" min="1" max="489600" />
235 <Limit name="blocks-per-second" min="1" max="979200" /
[all...] |
| /external/kernel-headers/original/uapi/linux/ |
| nilfs2_ondisk.h | 37 * @i_blocks: blocks count
158 /*30*/ __le32 s_blocks_per_segment; /* number of blocks per full segment */
164 /*50*/ __le64 s_free_blocks_count; /* Free blocks count */
180 __le16 s_def_resuid; /* Default uid for reserved blocks */
181 __le16 s_def_resgid; /* Default gid for reserved blocks */
250 * Minimum number of blocks in
254 * Minimum number of blocks in
339 * @fi_nblocks: number of blocks (including intermediate blocks)
340 * @fi_ndatablk: number of file data blocks
[all...] |
| /external/llvm/lib/Target/AMDGPU/ |
| SIWholeQuadMode.cpp | 25 /// to enter WQM at the top of the function and surrounds blocks of Exact
37 /// Basic blocks are always exited in WQM as long as some successor needs WQM.
45 /// (2) when entire regions (e.g. if-else blocks or entire loops) only
99 DenseMap<MachineBasicBlock *, BlockInfo> Blocks;
202 Blocks[&MBB].OutNeeds = StateExact;
215 BlockInfo &BI = Blocks[MBB];
283 BlockInfo BI = Blocks[&MBB]; // Make a copy to prevent dangling references.
295 // Predecessor blocks must provide for our WQM/Exact needs.
297 BlockInfo &PredBI = Blocks[Pred];
308 BlockInfo &SuccBI = Blocks[Succ]
[all...] |
| /external/squashfs-tools/kernel/Documentation/filesystems/ |
| squashfs.txt | 6 Inodes in the system are very small and all blocks are packed to minimise
85 Compressed data blocks are written to the filesystem as files are read from
93 Metadata (inodes and directories) are compressed in 8Kbyte blocks. Each
98 Inodes are packed into the metadata blocks, and are not aligned to block
99 boundaries, therefore inodes overlap compressed blocks. Inodes are identified
116 Like inodes, directories are packed into compressed metadata blocks, stored
146 Regular files consist of a sequence of contiguous compressed blocks, and/or a
157 is split into slots, caching up to eight 224 GiB files (128 KiB blocks).
167 fragment lookup table is itself stored compressed into metadata blocks.
177 stored compressed into metadata blocks. A second index table is used t
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
| func_test.go | 29 // and the Blocks or Values used in the Func can be accessed
31 // fun.blocks["entry"] or fun.values["deadval"]
130 // corresponding Blocks and Values.
133 blocks map[string]*Block
149 blocks := make(map[string]*Block)
151 // Create all the blocks and values.
154 blocks[bloc.name] = b
160 // Connect the blocks together and specify control values.
161 f.Entry = blocks[entry]
163 b := blocks[bloc.name
[all...] |
| /prebuilts/go/darwin-x86/src/image/jpeg/ |
| dct_test.go | 17 blocks := make([]block, 0, b.N*len(testBlocks))
19 blocks = append(blocks, testBlocks[:]...)
22 for i := range blocks {
23 f(&blocks[i])
36 blocks := make([]block, len(testBlocks))
37 copy(blocks, testBlocks[:])
39 // Append some randomly generated blocks of varying sparseness.
47 blocks = append(blocks, b
[all...] |
| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
| func_test.go | 29 // and the Blocks or Values used in the Func can be accessed
31 // fun.blocks["entry"] or fun.values["deadval"]
130 // corresponding Blocks and Values.
133 blocks map[string]*Block
149 blocks := make(map[string]*Block)
151 // Create all the blocks and values.
154 blocks[bloc.name] = b
160 // Connect the blocks together and specify control values.
161 f.Entry = blocks[entry]
163 b := blocks[bloc.name
[all...] |
| /prebuilts/go/linux-x86/src/image/jpeg/ |
| dct_test.go | 17 blocks := make([]block, 0, b.N*len(testBlocks))
19 blocks = append(blocks, testBlocks[:]...)
22 for i := range blocks {
23 f(&blocks[i])
36 blocks := make([]block, len(testBlocks))
37 copy(blocks, testBlocks[:])
39 // Append some randomly generated blocks of varying sparseness.
47 blocks = append(blocks, b
[all...] |
| /external/e2fsprogs/tests/j_long_revoke_trans_mcsum_32bit/ |
| expect | 2 Creating filesystem with 524288 1k blocks and 32768 inodes
3 Superblock backups stored on blocks:
8 Creating journal (16384 blocks): done
11 Pass 1: Checking inodes, blocks, and sizes
16 test_filesys: 11/32768 files (0.0% non-contiguous), 27050/524288 blocks
111 Pass 1: Checking inodes, blocks, and sizes
116 test_filesys: 11/32768 files (0.0% non-contiguous), 27050/524288 blocks
|
| /external/e2fsprogs/tests/j_long_revoke_trans_mcsum_64bit/ |
| expect | 1 Creating filesystem with 524288 1k blocks and 32768 inodes
2 Superblock backups stored on blocks:
7 Creating journal (16384 blocks): done
10 Pass 1: Checking inodes, blocks, and sizes
15 test_filesys: 11/32768 files (0.0% non-contiguous), 27068/524288 blocks
126 Pass 1: Checking inodes, blocks, and sizes
131 test_filesys: 11/32768 files (0.0% non-contiguous), 27068/524288 blocks
|
| /external/eigen/doc/ |
| TutorialBlockOperations.dox | 6 A block is a rectangular part of a matrix or array. Blocks expressions can be used both
36 The following program uses the dynamic-size and fixed-size versions to print the values of several blocks inside a
49 it was only read from. However, blocks can also be used as \em lvalues, meaning that you can assign to a block.
51 This is illustrated in the following example. This example also demonstrates blocks in arrays, which works exactly like the above-demonstrated blocks in matrices.
71 Individual columns and rows are special cases of blocks. Eigen provides methods to easily address them:
105 Eigen also provides special methods for blocks that are flushed against one of the corners or sides of a
|
| /external/harfbuzz_ng/src/ |
| gen-arabic-table.py | 7 print >>sys.stderr, "usage: ./gen-arabic-table.py ArabicShaping.txt UnicodeData.txt Blocks.txt"
17 blocks = {} variable
19 global blocks
40 blocks[u] = t
74 all_blocks = set([blocks[u] for u in uu])
97 block = blocks.get(u, last_block)
248 print " * ./gen-arabic-table.py ArabicShaping.txt UnicodeData.txt Blocks.txt"
|
| /external/llvm/lib/Target/X86/ |
| X86PadShortFunction.cpp | 35 STATISTIC(NumBBsPadded, "Number of basic blocks padded");
80 // ReturnBBs - Maps basic blocks that return to the minimum number of
98 /// runOnMachineFunction - Loop over all of the basic blocks, inserting
114 // Search through basic blocks and mark the ones that have early returns
124 // Pad the identified basic blocks with NOOPs
152 /// basic blocks that contain a return to ReturnBBs.
191 // Mark basic blocks with a return instruction. Calls to other
|
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
| Passes.h | 31 /// work well with unreachable basic blocks (what live ranges make sense for a
33 /// not instruction select unreachable blocks, or run this pass as its
34 /// last LLVM modifying pass to clean up blocks that are not reachable from
88 /// basic blocks.
93 /// machine basic blocks.
147 /// successor blocks (creating fall throughs), and eliminating branches over
151 /// TailDuplicate Pass - Duplicate blocks with unconditional branches
|
| /frameworks/av/media/libstagefright/data/ |
| media_codecs_google_video.xml | 24 <Limit name="blocks-per-second" range="12-11880" />
42 <Limit name="blocks-per-second" range="1-1966080" />
52 <Limit name="blocks-per-second" range="1-2000000" />
61 <Limit name="blocks-per-second" range="1-1000000" />
70 <Limit name="blocks-per-second" range="1-500000" />
89 <Limit name="blocks-per-second" range="1-245760" />
98 <Limit name="blocks-per-second" range="12-1485" />
|
| /frameworks/base/services/tests/servicestests/src/com/android/server/ |
| BootReceiverFixFsckFsStatTest.java | 39 "Pass 1: Checking inodes, blocks, and sizes",
68 "Pass 1: Checking inodes, blocks, and sizes",
90 "Pass 1: Checking inodes, blocks, and sizes",
111 "Pass 1: Checking inodes, blocks, and sizes",
130 "Pass 1: Checking inodes, blocks, and sizes",
148 "Pass 1: Checking inodes, blocks, and sizes",
172 "Pass 1: Checking inodes, blocks, and sizes",
|
| /prebuilts/go/darwin-x86/src/runtime/ |
| mgcsweepbuf.go | 19 // growable spine that points to fixed-sized blocks. The spine
27 // The spine and all blocks are allocated off-heap, which
40 // of all blocks. It is accessed atomically.
88 // Blocks are allocated off-heap, so
107 // Blocks are allocated off-heap, so no write barrier.
138 // numBlocks returns the number of blocks in buffer b. numBlocks is
143 // appear in these blocks.
|
| /prebuilts/go/linux-x86/src/runtime/ |
| mgcsweepbuf.go | 19 // growable spine that points to fixed-sized blocks. The spine
27 // The spine and all blocks are allocated off-heap, which
40 // of all blocks. It is accessed atomically.
88 // Blocks are allocated off-heap, so
107 // Blocks are allocated off-heap, so no write barrier.
138 // numBlocks returns the number of blocks in buffer b. numBlocks is
143 // appear in these blocks.
|
| /external/mesa3d/src/gallium/drivers/nouveau/nv50/ |
| nv84_video_vp.c | 258 const int16_t *blocks; local
278 blocks = macrob->blocks;
299 * on whether the corresponding (16-bit) word in blocks is zero or non-zero. */
300 #define wordmask(blocks, zero) \
303 zero, _mm_load_si128((__m128i *)(blocks)))))
309 uint64_t bmask0 = wordmask(blocks, zero);
310 bmask0 |= wordmask(blocks + 8, zero) << 16;
311 bmask0 |= wordmask(blocks + 16, zero) << 32;
312 bmask0 |= wordmask(blocks + 24, zero) << 48
[all...] |
