| /external/lldb/include/lldb/Utility/ |
| Range.h | 62 Intersection (const Range& other);
|
| /external/lldb/source/Utility/ |
| Range.cpp | 63 Range::Intersection (const Range& other)
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfExpression.cpp | 141 // Intersection between the bits we already emitted and the bits
143 SmallBitVector Intersection(RegSize, false);
144 Intersection.set(Offset, Offset + Size);
145 Intersection ^= Coverage;
149 if (Reg >= 0 && Intersection.any()) {
|
| /art/compiler/dex/quick/ |
| local_optimizations.cc | 178 ResourceMask this_mem_mask = kEncodeMem.Intersection(this_lir->u.m.use_mask->Union(
219 ResourceMask check_mem_mask = kEncodeMem.Intersection(check_lir->u.m.use_mask->Union(
221 ResourceMask alias_mem_mask = this_mem_mask.Intersection(check_mem_mask);
379 ResourceMask check_mem_mask = check_lir->u.m.def_mask->Intersection(kEncodeMem);
380 ResourceMask alias_condition = stop_use_all_mask.Intersection(check_mem_mask);
|
| resource_mask.h | 101 constexpr ResourceMask Intersection(const ResourceMask& other) const {
|
| codegen_util.cc | 183 DCHECK((is_load ? lir->u.m.use_mask : lir->u.m.def_mask)->Intersection(kEncodeMem).Equals(
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/ |
| distance_regular.py | 64 """Return global parameters for a given intersection array.
73 intersection array [b_0,b_1,.....b_{d-1};c_1,c_2,.....c_d]
112 """Returns the intersection array of a distance-regular graph.
138 .. [1] Weisstein, Eric W. "Intersection Array."
159 bint = {} # 'b' intersection array
160 cint = {} # 'c' intersection array
|
| /external/llvm/utils/TableGen/ |
| CodeGenRegisters.cpp | [all...] |
| /external/jmonkeyengine/engine/src/core/com/jme3/bounding/ |
| Intersection.java | 42 * This class includes some utility methods for computing intersection
46 public class Intersection {
|
| BoundingBox.java | 638 * intersection has occurred, true is returned, otherwise false is returned.
782 return Intersection.intersect(this, v1, v2, v3);
[all...] |
| /external/llvm/lib/Analysis/ |
| DependenceAnalysis.cpp | 411 // Updates X with the intersection
461 // the result of an intersection.
565 llvm_unreachable("shouldn't reach the end of Constraint intersection");
[all...] |
| /external/vixl/src/vixl/a64/ |
| assembler-a64.cc | 106 CPURegList CPURegList::Intersection(const CPURegList& list_1,
109 return Intersection(list_1, Intersection(list_2, list_3));
113 CPURegList CPURegList::Intersection(const CPURegList& list_1,
117 return Intersection(Intersection(list_1, list_2),
118 Intersection(list_3, list_4));
[all...] |
| assembler-a64.h | 546 static CPURegList Intersection(const CPURegList& list_1,
552 static CPURegList Intersection(const CPURegList& list_1,
555 static CPURegList Intersection(const CPURegList& list_1,
[all...] |
| /cts/suite/cts/deviceTests/browserbench/assets/octane/ |
| raytrace.js | 436 if(D > 0){ // intersection!
482 if(Vd == 0) return info; // no intersection
536 return 'Intersection [' + this.position + ']';
|
| pdfjs.js | [all...] |
| /external/v8/benchmarks/ |
| raytrace.js | 436 if(D > 0){ // intersection!
482 if(Vd == 0) return info; // no intersection
536 return 'Intersection [' + this.position + ']';
|
| /external/llvm/lib/Transforms/Vectorize/ |
| SLPVectorizer.cpp | 193 /// Get the intersection (logical and) of all of the potential IR flags
198 if (auto *Intersection = dyn_cast<BinaryOperator>(VL[0])) {
199 // Intersection is initialized to the 0th scalar,
203 Intersection->andIRFlags(Scalar);
205 VecOp->copyIRFlags(Intersection);
[all...] |
