/art/compiler/optimizing/ |
instruction_simplifier_arm.cc | 106 // Merge a bitfield move instruction into its uses if it can be merged in all of them. 114 const HUseList<HInstruction*>& uses = bitfield_op->GetUses(); local 117 for (const HUseListNode<HInstruction*>& use : uses) { 127 // Merge the instruction into its uses. 128 for (auto it = uses.begin(), end = uses.end(); it != end; /* ++it below */) {
|
prepare_for_register_allocation.cc | 45 // Replace the uses with the actual guarded instruction. 110 const HUseList<HInstruction*>& uses = check->GetUses(); local 111 for (auto it = uses.begin(), end = uses.end(); it != end; /* ++it below */) { 113 // All other uses must be dominated.
|
instruction_simplifier_arm64.cc | 103 // Merge a bitfield move instruction into its uses if it can be merged in all of them. 111 const HUseList<HInstruction*>& uses = bitfield_op->GetUses(); local 114 for (const HUseListNode<HInstruction*>& use : uses) { 124 // Merge the instruction into its uses. 125 for (auto it = uses.begin(), end = uses.end(); it != end; /* ++it below */) {
|
loop_optimization.cc | 350 // uses when we compile 'debuggable'. 368 // cycle that is only used outside the loop. Replace these uses, if any, with 377 // Note that it's ok to have replaced uses after the loop with the last value, without 378 // being able to remove the cycle. Environment uses (which are the reason we may not be 458 // a trivial loop (just iterating once). Replace subsequent index uses, if any, 732 // Note that actual uses are inspected during right-hand-side tree traversal. 1381 const HUseList<HInstruction*>& uses = instruction->GetUses(); local [all...] |
reference_type_propagation.cc | 169 // In this case we also assert that there are no other uses of the object (except 186 // Check that the existing HBoundType dominates all the uses. 215 // We only need to bound the type if we have uses in the relevant block. 219 const HUseList<HInstruction*>& uses = receiver->GetUses(); local 220 for (auto it = uses.begin(), end = uses.end(); it != end; /* ++it below */) { 387 // We only need to bound the type if we have uses in the relevant block. [all...] |
bounds_check_elimination.cc | 1746 const HUseList<HInstruction*>& uses = instruction->GetUses(); local [all...] |
nodes.cc | 153 // users can be safely removed before uses later. 1094 const HUseList<HInstruction*>& uses = GetUses(); local [all...] |
/external/bouncycastle/bcpkix/src/main/java/org/bouncycastle/openssl/ |
CertificateTrustBlock.java | 20 private ASN1Sequence uses; field in class:CertificateTrustBlock 24 public CertificateTrustBlock(Set<ASN1ObjectIdentifier> uses) 26 this(null, uses, null); 29 public CertificateTrustBlock(String alias, Set<ASN1ObjectIdentifier> uses) 31 this(alias, uses, null); 34 public CertificateTrustBlock(String alias, Set<ASN1ObjectIdentifier> uses, Set<ASN1ObjectIdentifier> prohibitions) 37 this.uses = toSequence(uses); 51 this.uses = ASN1Sequence.getInstance(obj); 71 return toSet(uses); [all...] |
/external/elfutils/backends/ |
common-reloc.c | 49 #define RELOC_TYPE(type, uses) \ 56 #define RELOC_TYPE(type, uses) R_NAME (type), 64 #define RELOC_TYPE(type, uses) \ 77 #define RELOC_TYPE(type, uses) [R_TYPE (type)] = uses, 112 uint8_t uses; local 123 uses = EBLHOOK(reloc_valid)[reloc]; 124 return type > ET_NONE && type < ET_CORE && (uses & (1 << (type - 1)));
|
/external/v8/src/asmjs/ |
asm-js.cc | 176 wasm::AsmTyper::StdlibSet uses = typer.StdlibUses(); local 178 info->isolate()->factory()->NewFixedArray(static_cast<int>(uses.size())); 180 for (auto i : uses) { 193 i::Handle<i::FixedArray> uses(i::FixedArray::cast(wasm_data->get(2))); 194 for (int i = 0; i < uses->length(); ++i) { 196 uses->GetValueChecked<i::Object>(isolate, i))) {
|
/frameworks/base/tools/preload2/src/com/android/preload/actions/ |
ComputeThresholdAction.java | 81 Map<String, Set<String>> uses = new HashMap<String, Set<String>>(); local 84 updateClassUse(d.getPackageName(), uses, getBootClassPathClasses(d.getDumpData())); local 88 Set<String> result = fromThreshold(uses, blacklist, threshold);
|
/external/swiftshader/third_party/LLVM/lib/VMCore/ |
ConstantsContext.h | 381 static unsigned uses(const std::vector<T, Alloc>& v) { function in struct:llvm::ConstantTraits 388 static unsigned uses(Constant * const & v) { function in struct:llvm::ConstantTraits 396 return new(ConstantTraits<ValType>::uses(V)) ConstantClass(Ty, V);
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/ |
term_entry.h | 62 uses[MAX_USES]; member in struct:entry
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/ |
term_entry.h | 62 uses[MAX_USES]; member in struct:entry
|
/system/bt/stack/mcap/ |
mca_csm.cc | 144 * It uses the state and action function tables to execute 314 bool uses = false; local 322 uses = true; 327 return uses;
|
/external/vulkan-validation-layers/layers/ |
threading.h | 75 std::unordered_map<T, object_use_data> uses; member in class:counter 82 if (uses.find(object) == uses.end()) { 84 struct object_use_data *use_data = &uses[object]; 89 struct object_use_data *use_data = &uses[object]; 99 while (uses.find(object) != uses.end()) { 103 struct object_use_data *use_data = &uses[object]; 126 while (uses.find(object) != uses.end()) [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
tree-ssa-operands.h | 128 use_optype_p uses; member in struct:ssa_operand_iterator_d
|
/prebuilts/ndk/r13/sources/third_party/vulkan/src/layers/ |
threading.h | 58 std::unordered_map<T, object_use_data> uses; member in class:counter 63 if (uses.find(object) == uses.end()) { 65 struct object_use_data *use_data = &uses[object]; 70 struct object_use_data *use_data = &uses[object]; 80 while (uses.find(object) != uses.end()) { 84 struct object_use_data *use_data = &uses[object]; 107 while (uses.find(object) != uses.end()) [all...] |
/external/llvm/include/llvm/IR/ |
Value.h | 108 /// User uses this value to find the Use list. 263 /// \brief Change all uses of this to point to a new Value. 265 /// Go through the uses list for this definition and make each use point to 270 /// replaceUsesOutsideBlock - Go through the uses list for this definition and 278 // Methods for handling the chain of uses of this Value. 280 // Materializing a function can introduce new uses, so these methods come in 282 // The methods that start with materialized_ check the uses that are 284 // when using them since you might not get all uses. 316 iterator_range<use_iterator> uses() { function 320 iterator_range<const_use_iterator> uses() const function [all...] |
/external/v8/src/compiler/ |
graph-visualizer.cc | 489 int uses = node->UseCount(); local 491 os_ << "0 " << uses << " "; local
|
node.h | 166 class V8_EXPORT_PRIVATE Uses final { 176 explicit Uses(Node* node) : node_(node) {} 182 Uses uses() { return Uses(this); } function in class:v8::internal::compiler::final 478 // A forward iterator to visit the uses edges of a node. 520 // A forward iterator to visit the uses of a node. 521 class Node::Uses::const_iterator final { 546 friend class Node::Uses; 555 Node::Uses::const_iterator Node::Uses::begin() const [all...] |
/external/mesa3d/src/gallium/drivers/nvc0/codegen/ |
nv50_ir_lowering_nvc0.cpp | 179 NVC0LegalizePostRA::addTexUse(std::list<TexUse> &uses, 183 for (std::list<TexUse>::iterator it = uses.begin(); 184 it != uses.end();) { 190 it = uses.erase(it); 195 uses.push_back(TexUse(usei, insn)); 202 std::list<TexUse> &uses) 221 uses); 225 addTexUse(uses, insn, texi); 233 std::list<TexUse> &uses) 237 for (Value::UseIterator u = v->uses.begin(); u != v->uses.end(); ++u) 277 std::list<TexUse> *uses; local [all...] |
/external/clang/lib/Sema/ |
AnalysisBasedWarnings.cpp | 843 /// DiagnoseUninitializedUse -- Helper function for diagnosing uses of an 845 /// emitted for particular types of uses. Returns true if the use was diagnosed 1368 UsesMap uses; member in class:__anon14062::UninitValsDiagReporter [all...] |
/external/llvm/include/llvm/CodeGen/ |
SelectionDAGNodes.h | 232 /// which link together all the uses of an SDNode. 239 /// Prev, Next - Pointers to the uses list of the SDNode referred by 424 /// List of uses for this SDNode. 505 /// Return true if there are no uses of this node. 513 /// Return the number of uses of this node. This method takes 514 /// time proportional to the number of uses. 560 /// Return true if this iterator is at the end of uses list. 591 /// Provide iteration support to walk over all uses of an SDNode. 598 inline iterator_range<use_iterator> uses() { function in class:llvm::SDNode 601 inline iterator_range<use_iterator> uses() const function in class:llvm::SDNode [all...] |
/external/mesa3d/src/gallium/drivers/nv50/codegen/ |
nv50_ir.h | 440 void replace(const ValueRef &, bool doSet); // replace all uses of the old value 476 inline int refCount() { return uses.size(); } 488 std::list<ValueRef *> uses; member in class:nv50_ir::Value
|