| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Support/ |
| MD5.h | 52 MD5_u32plus block[16]; member in class:llvm::MD5
|
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Support/ |
| MD5.h | 52 MD5_u32plus block[16]; member in class:llvm::MD5
|
| /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/spirv-tools/source/val/ |
| instruction.h | 53 const BasicBlock* block() const { return block_; } function in class:libspirv::Instruction
96 /// The basic block in which this instruction was declared
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/values/ |
| ValuesTreePage.java | 101 UiTreeBlock block = new UiTreeBlock(mEditor, resources, local
106 block.createContent(managedForm);
|
| /system/iot/attestation/atap/test/ |
| atap_sysdeps_posix_testing.cpp | 68 AtapAllocatedBlock block; local
69 block.size = size;
70 allocated_blocks[ptr] = block;
77 atap_fatal("Tried to free pointer to non-allocated block.\n");
|
| /system/tools/aidl/ |
| ast_cpp_unittest.cpp | 178 StatementBlock block; local
179 block.AddStatement(unique_ptr<AstNode>(new Statement("foo")));
180 block.AddStatement(unique_ptr<AstNode>(new Statement("bar")));
181 CompareGeneratedCode(block, "{\nfoo;\nbar;\n}\n");
|
| /system/tools/hidl/utils/ |
| Formatter.cpp | 60 Formatter& Formatter::block(const std::function<void(void)>& func) { function in class:android::Formatter
78 Formatter& Formatter::sIf(const std::string& cond, const std::function<void(void)>& block) {
80 return this->block(block);
83 Formatter& Formatter::sElseIf(const std::string& cond, const std::function<void(void)>& block) {
85 return this->block(block);
88 Formatter& Formatter::sElse(const std::function<void(void)>& block) {
90 return this->block(block);
[all...] |
| /external/kotlinc/lib/ |
| kotlin-test.jar | |
| /dalvik/dx/src/com/android/dx/ssa/ |
| SsaConverter.java | 55 * The exit block, added here, is not considered for edge splitting
126 * requiring each block with a final instruction that returns a
149 * New blocks are added to the end of the block list during
153 SsaBasicBlock block = blocks.get(i); local
154 if (nodeNeedsUniquePredecessor(block)) {
155 block.insertNewPredecessor();
161 * @param block {@code non-null;} block in question
165 private static boolean nodeNeedsUniquePredecessor(SsaBasicBlock block) {
167 * Any block with that has both multiple successors and multipl
194 SsaBasicBlock block = blocks.get(i); local
239 SsaBasicBlock block = blocks.get(i); local
[all...] |
| LocalVariableExtractor.java | 38 /** {@code non-null;} block list for the method */
98 * Processes a single block.
100 * @param blockIndex {@code >= 0;} block index of the block to process
105 SsaBasicBlock block = blocks.get(blockIndex); local
106 List<SsaInsn> insns = block.getInsns();
109 // The exit block has no insns and no successors
190 * where the start state for a block changes).
193 IntList successors = block.getSuccessorList();
195 int primarySuccessor = block.getPrimarySuccessorIndex()
[all...] |
| SsaInsn.java | 30 /** {@code non-null;} the block that contains this instance */
31 private final SsaBasicBlock block; field in class:SsaInsn
40 * @param block {@code non-null;} block containing this insn. Can
43 protected SsaInsn(RegisterSpec result, SsaBasicBlock block) {
44 if (block == null) {
45 throw new NullPointerException("block == null");
48 this.block = block;
56 * @param block {@code non-null;} owning bloc
[all...] |
| /external/protobuf/ruby/src/main/java/com/google/protobuf/jruby/ |
| RubyDescriptor.java | 40 import org.jruby.runtime.Block;
156 * Descriptor.each(&block)
158 * Iterates over fields in this message type, yielding to the block on each one.
161 public IRubyObject each(ThreadContext context, Block block) {
163 block.yield(context, entry.getValue());
192 * Descriptor.each_oneof(&block) => nil
194 * Invokes the given block for each oneof in this message type, passing the
198 public IRubyObject eachOneof(ThreadContext context, Block block) {
[all...] |
| /packages/apps/Bluetooth/src/com/android/bluetooth/hfpclient/connserv/ |
| HfpClientConnectionService.java | 78 HfpClientDeviceBlock block = null;
79 if ((block = createBlockForDevice(device)) == null) {
80 Log.w(TAG, "Block already exists for device " + device + " ignoring.");
89 HfpClientDeviceBlock block = mDeviceBlocks.remove(device);
90 if (block == null) {
91 Log.w(TAG, "Disconnect for device but no block " + device);
94 block.cleanup();
95 // Block should be subsequently garbage collected
96 block = null;
103 HfpClientDeviceBlock block = findBlockForDevice(call.getDevice())
190 HfpClientDeviceBlock block = findBlockForHandle(connectionManagerAccount); local
209 HfpClientDeviceBlock block = findBlockForHandle(connectionManagerAccount); local
227 HfpClientDeviceBlock block = findBlockForHandle(connectionManagerAccount); local
255 HfpClientDeviceBlock block = findBlockForDevice(bd1); local
307 HfpClientDeviceBlock block = new HfpClientDeviceBlock(this, device, mHeadsetProfile); local
[all...] |
| /art/compiler/optimizing/ |
| block_builder.cc | 53 HBasicBlock* block = branch_targets_[store_dex_pc]; local
54 if (block == nullptr) {
55 block = new (allocator_) HBasicBlock(graph_, semantic_dex_pc);
56 branch_targets_[store_dex_pc] = block;
58 DCHECK_EQ(block->GetDexPc(), semantic_dex_pc);
59 return block;
63 // Create the first block for the dex instructions, single successor of the entry block.
68 // places where the program might fall through into/out of the a block and
76 // TODO: Do not create block if the last instruction cannot fall through
147 HBasicBlock* block = graph_->GetEntryBlock(); local
[all...] |
| constant_folding.cc | 29 void VisitBasicBlock(HBasicBlock* block) OVERRIDE;
81 void HConstantFoldingVisitor::VisitBasicBlock(HBasicBlock* block) {
82 // Traverse this block's instructions (phis don't need to be
85 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) {
291 HBasicBlock* block = instruction->GetBlock(); local
300 block->RemoveInstruction(instruction);
316 block->RemoveInstruction(instruction);
335 HBasicBlock* block = instruction->GetBlock(); local
349 block->RemoveInstruction(instruction);
364 HBasicBlock* block = instruction->GetBlock() local
[all...] |
| pc_relative_fixups_x86.cc | 37 // entry block) and relieve some pressure on the register allocator
139 HBasicBlock* block = neg->GetBlock(); variable
145 block->ReplaceAndRemoveInstructionWith(neg, x86_fp_neg);
158 HBasicBlock* block = switch_insn->GetBlock(); variable
165 block->ReplaceAndRemoveInstructionWith(switch_insn, x86_switch);
176 // Insert the base at the start of the entry block, move it to a better
256 // The generated HX86ComputeBaseMethodAddress in the entry block needed as an
|
| ssa_liveness_analysis_test.cc | 44 // Create entry block.
51 HBasicBlock* CreateSuccessor(HBasicBlock* block) {
52 HGraph* graph = block->GetGraph();
55 block->AddSuccessor(successor);
72 HBasicBlock* block = CreateSuccessor(entry_); local
74 block->AddInstruction(ret);
75 block->AddInstruction(new (GetAllocator()) HExit());
103 HBasicBlock* block = CreateSuccessor(entry_); local
105 block->AddInstruction(null_check);
114 block->AddInstruction(length)
172 HBasicBlock* block = CreateSuccessor(entry_); local
[all...] |
| superblock_cloner.h | 55 // Returns whether an edge represents a valid edge in CF graph: whether the from_ block
56 // has to_ block as a successor.
60 // Predecessor block id.
62 // Successor block id.
102 // Defining a set of basic block to copy (orig_bb_set) partitions all of the edges in the original
162 // Returns a clone of a basic block (orig_block).
164 // - The copy block will have no successors/predecessors; they should be set up manually.
165 // - For each instruction in the orig_block a copy is created and inserted into the copy block;
168 // same, as in the original block, PHIs do not reflect a correct correspondence between the
169 // value and predecessors (as the copy block has no predecessors by now), etc
183 HBasicBlock* block = bb_map_->Get(orig_block); local
278 HBasicBlock* block = graph_->GetBlocks()[block_id]; local
[all...] |
| /bionic/libc/upstream-netbsd/common/lib/libc/hash/sha1/ |
| sha1.c | 56 # define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
57 |(rol(block->l[i],8)&0x00FF00FF))
59 # define blk0(i) block->l[i]
61 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
62 ^block->l[(i+2)&15]^block->l[i&15],1))
107 do_R01(uint32_t *a, uint32_t *b, uint32_t *c, uint32_t *d, uint32_t *e, CHAR64LONG16 *block)
153 CHAR64LONG16 *block; local
[all...] |
| /dalvik/dx/src/com/android/dx/ssa/back/ |
| RegisterAllocator.java | 126 * last insn in a block.
129 * be last insn in block
135 SsaBasicBlock block = insn.getBlock(); local
136 ArrayList<SsaInsn> insns = block.getInsns();
141 "specified insn is not in this block");
165 RegisterSpecList.make(reg)), block);
173 * block and what's used by the final instruction.
176 IntSet liveOut = block.getLiveOutRegs();
|
| /device/google/contexthub/firmware/os/platform/stm32/ |
| usart.c | 95 struct StmUsart *block = (struct StmUsart*)mUsartPorts[usart->unit = --port]; local
113 block->CR2 = (block->CR2 &~ 0x3000) | stopBitsVals[stop_bits];
114 block->CR1 = (block->CR1 &~ 0x1600) | wordLengthVals[data_bits] | parityVals[parity] | 0x800C;
115 block->CR3 = (block->CR3 &~ 0x0300) | flowCtrlVals[flow_control];
126 block->BRR = intPart | fraPart;
129 block->CR1 |= 0x2000;
134 struct StmUsart *block = (struct StmUsart*)mUsartPorts[usart->unit] local
153 struct StmUsart *block = (struct StmUsart*)mUsartPorts[usart->unit]; local
160 struct StmUsart *block = (struct StmUsart*)mUsartPorts[usart->unit]; local
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Python/ |
| pyarena.c | 4 /* A simple arena block structure.
8 block.
20 /* Total number of bytes owned by this block available to pass out.
37 /* Pointer to the first allocatable byte owned by this block. Read-
41 } block;
typedef in typeref:struct:_block
49 /* Pointer to the first block allocated for the arena, never NULL.
50 It is used only to find the first block when the arena is
53 block *a_head;
55 /* Pointer to the block currently used for allocation. It's
57 call to block_alloc(), it means a new block has been allocated
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Python/ |
| pyarena.c | 4 /* A simple arena block structure.
8 block.
20 /* Total number of bytes owned by this block available to pass out.
37 /* Pointer to the first allocatable byte owned by this block. Read-
41 } block;
typedef in typeref:struct:_block
49 /* Pointer to the first block allocated for the arena, never NULL.
50 It is used only to find the first block when the arena is
53 block *a_head;
55 /* Pointer to the block currently used for allocation. It's
57 call to block_alloc(), it means a new block has been allocated
[all...] |
| /device/linaro/bootloader/edk2/OptionRomPkg/UndiRuntimeDxe/ |
| Undi32.h | 90 typedef VOID (*block)(UINT64, UINT32);
typedef
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| GrammarSerializerFoo.java | 112 public void block(int nalts) { method in class:GrammarSerializerFoo
|
