/external/bouncycastle/bcpkix/src/main/java/org/bouncycastle/openssl/ |
H A D | CertificateTrustBlock.java | 20 private ASN1Sequence uses; field in class:CertificateTrustBlock 24 public CertificateTrustBlock(Set<ASN1ObjectIdentifier> uses) argument 26 this(null, uses, null); 29 public CertificateTrustBlock(String alias, Set<ASN1ObjectIdentifier> uses) argument 31 this(alias, uses, null); 34 public CertificateTrustBlock(String alias, Set<ASN1ObjectIdentifier> uses, Set<ASN1ObjectIdentifier> prohibitions) argument 37 this.uses = toSequence(uses); 51 this.uses = ASN1Sequence.getInstance(obj); 71 return toSet(uses); [all...] |
/external/mesa3d/src/gallium/drivers/r600/sb/ |
H A D | sb_def_use.cpp | 38 void def_use::process_phi(container_node *c, bool defs, bool uses) { argument 42 if (uses)
|
H A D | sb_pass.h | 163 void process_phi(container_node *c, bool defs, bool uses); 239 nuc_map uses; member in class:r600_sb::gcm 266 ready(), op_map(), uses(), nuc_stk(1), ucs_level(),
|
H A D | sb_ir.h | 477 def(), adef(), uses(), constraint(), chunk(), 502 uselist uses; member in class:r600_sb::value
|
/external/elfutils/backends/ |
H A D | 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/mesa3d/src/gallium/drivers/ilo/ |
H A D | ilo_blitter.h | 56 uint32_t uses; member in struct:ilo_blitter
|
H A D | ilo_blitter_rectlist.c | 199 ilo_blitter_set_uses(struct ilo_blitter *blitter, uint32_t uses) argument 201 blitter->uses = uses; 347 uint32_t uses, clear_value; local 427 uses = ILO_BLITTER_USE_DSA; 429 uses |= ILO_BLITTER_USE_VIEWPORT | ILO_BLITTER_USE_FB_DEPTH; 431 uses |= ILO_BLITTER_USE_CC | ILO_BLITTER_USE_FB_STENCIL; 432 ilo_blitter_set_uses(blitter, uses);
|
/external/mesa3d/src/mesa/drivers/dri/i965/ |
H A D | brw_fs_combine_constants.cpp | 106 * The instruction generating the immediate value, if all uses are contained 115 exec_list *uses; member in struct:imm 230 imm->uses->push_tail(link(const_ctx, &inst->src[i])); 238 imm->uses = new(const_ctx) exec_list(); 239 imm->uses->push_tail(link(const_ctx, &inst->src[i])); 249 /* Remove constants from the table that don't have enough uses to make them 295 foreach_list_typed(reg_link, link, link, table.imm[i].uses) {
|
/external/swiftshader/src/Reactor/ |
H A D | Optimizer.cpp | 64 std::unordered_map<Ice::Operand*, Uses> uses; member in class:__anon19534::Optimizer 126 const auto &addressEntry = uses.find(address); 140 for(Ice::Inst *use : uses[loadData]) 153 uses.erase(loadData); 159 uses.erase(addressEntry); 181 const auto &addressEntry = uses.find(address); 239 uses.erase(address); 241 auto &valueUses = uses[storeValue]; 255 uses.erase(storeValue); 282 const auto &addressEntry = uses 659 auto &uses = *this; local [all...] |
/external/v8/src/asmjs/ |
H A D | asm-js.cc | 200 wasm::AsmTyper::StdlibSet uses = builder.typer()->StdlibUses(); local 202 info->isolate()->factory()->NewFixedArray(static_cast<int>(uses.size())); 204 for (auto i : uses) { 245 i::Handle<i::FixedArray> uses( 247 for (int i = 0; i < uses->length(); ++i) { 249 uses->GetValueChecked<i::Object>(isolate, i))) {
|
/external/llvm/lib/Target/PowerPC/ |
H A D | PPCMachineFunctionInfo.h | 104 /// Whether this uses the PIC Base register or not. 201 void setUsesPICBase(bool uses) { UsesPICBase = uses; } argument
|
/external/vulkan-validation-layers/layers/ |
H A D | 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 [all...] |
/external/llvm/include/llvm/IR/ |
H A D | 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() cons function [all...] |
/external/mesa3d/src/compiler/nir/ |
H A D | nir_validate.c | 46 * equivalent to the uses and defs in nir_register, but built up by the 49 struct set *uses, *if_uses, *defs; member in struct:__anon14755 55 * equivalent to the uses in nir_ssa_def, but built up by the validator. 58 struct set *uses, *if_uses; member in struct:__anon14756 143 _mesa_set_add(reg_state->uses, src); 185 _mesa_set_add(def_state->uses, src); 296 list_validate(&def->uses); 302 def_state->uses = _mesa_set_create(def_state, _mesa_hash_pointer, 864 list_validate(®->uses); 869 reg_state->uses [all...] |
/external/r8/src/main/java/com/android/tools/r8/ir/regalloc/ |
H A D | LiveIntervals.java | 26 private TreeSet<LiveIntervalsUse> uses = new TreeSet<>(); field in class:LiveIntervals 91 // If one of the non-spilled splits uses a register that is higher than U8BIT_MAX we cannot 209 uses.add(use); 218 return uses; 321 for (LiveIntervalsUse use : uses) { 330 return uses.first().getPosition(); 334 for (LiveIntervalsUse use : uses) { 344 assert uses.size() == 0 || getFirstUse() != start; 379 while (!uses.isEmpty() && uses [all...] |
/external/swiftshader/third_party/LLVM/lib/VMCore/ |
H A D | 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);
|
/external/swiftshader/third_party/llvm-subzero/include/llvm/IR/ |
H A D | Value.h | 109 /// User uses this value to find the Use list. 266 /// \brief Change all uses of this to point to a new Value. 268 /// Go through the uses list for this definition and make each use point to 273 /// \brief Change non-metadata uses of this to point to a new Value. 275 /// Go through the uses list for this definition and make each use point to 279 /// replaceUsesOutsideBlock - Go through the uses list for this definition and 287 // Methods for handling the chain of uses of this Value. 289 // Materializing a function can introduce new uses, so these methods come in 291 // The methods that start with materialized_ check the uses that are 293 // when using them since you might not get all uses 325 iterator_range<use_iterator> uses() { function 329 iterator_range<const_use_iterator> uses() const { function [all...] |
/external/v8/src/compiler/ |
H A D | graph-visualizer.cc | 496 int uses = node->UseCount(); local 498 os_ << "0 " << uses << " "; local
|
H A D | node.h | 152 Uses uses() { return Uses(this); } function in class:v8::internal::compiler::final 545 // A forward iterator to visit the uses edges of a node. 587 // A forward iterator to visit the uses of a node.
|
H A D | store-store-elimination.cc | 146 UnobservablesSet RecomputeSet(Node* node, UnobservablesSet uses); 262 UnobservablesSet uses) { 270 bool isNotObservable = uses.Contains(observation); 277 return uses; 285 return uses; 291 return uses.Add(observation, temp_zone()); 299 return uses; 317 return uses.RemoveSameOffset(offset, temp_zone()); 324 return uses; 413 // Compute the intersection of the UnobservablesSets of all effect uses an 261 RecomputeSet(Node* node, UnobservablesSet uses) argument [all...] |
H A D | escape-analysis.cc | 773 // This node is already known to escape, uses do not have to be checked 783 bool EscapeStatusAnalysis::CheckUsesForEscape(Node* uses, Node* rep, argument 785 for (Edge edge : uses->use_edges()) { 856 uses->op()->EffectInputCount() > 0 && 1666 // Now fix uses of other objects.
|
/external/clang/lib/Sema/ |
H A D | 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:__anon1462::UninitValsDiagReporter 1375 MappedType &V = uses[vd]; 1391 for (const auto &P : uses) { 1398 // Specially handle the case where we have uses of an uninitialized 1407 // Sort the uses by their SourceLocations. While not strictly 1419 // If we have self-init, downgrade all uses to 'may be uninitialized'. 1429 // Release the uses vector. 1433 uses [all...] |
/external/mesa3d/src/gallium/drivers/nouveau/codegen/ |
H A D | nv50_ir_lowering_nvc0.cpp | 208 NVC0LegalizePostRA::addTexUse(std::list<TexUse> &uses, argument 216 // have nested loops, with the tex in the inner loop, and uses before it in 220 // However we can still use the eliding logic between uses dominated by the 223 for (std::list<TexUse>::iterator it = uses.begin(); it != uses.end();) { 230 it = uses.erase(it); 238 uses.push_back(TexUse(usei, texi, dominated)); 242 // uses, not all texture results are guaranteed to be used on all paths. In 249 Instruction *texi, std::list<TexUse> &uses) 255 findFirstUsesBB(minGPR, maxGPR, texi->next, texi, uses, visite 248 findFirstUses( Instruction *texi, std::list<TexUse> &uses) argument 259 findFirstUsesBB( int minGPR, int maxGPR, Instruction *start, const Instruction *texi, std::list<TexUse> &uses, unordered_set<const BasicBlock *> &visited) argument 318 std::list<TexUse> *uses; local [all...] |
/external/llvm/include/llvm/CodeGen/ |
H A D | 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() cons function in class:llvm::SDNode [all...] |
/external/valgrind/VEX/priv/ |
H A D | ir_opt.c | 712 /* Find any Get uses in st and invalidate any partially or fully 3089 uses to the set and keep on moving backwards. 3108 /* start off by recording IRTemp uses in the next field. */ 3142 /* Note any IRTemp uses made by the current statement. */ 5080 /* Given uses :: array of UShort, indexed by IRTemp 5084 static void aoccCount_Expr ( UShort* uses, IRExpr* e ) argument 5091 uses[e->Iex.RdTmp.tmp]++; 5095 aoccCount_Expr(uses, e->Iex.ITE.cond); 5096 aoccCount_Expr(uses, e->Iex.ITE.iftrue); 5097 aoccCount_Expr(uses, 5150 aoccCount_Stmt( UShort* uses, IRStmt* st ) argument 5741 UShort* uses = LibVEX_Alloc_inline(n_tmps * sizeof(UShort)); local [all...] |