/external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
SDNodeOrdering.h | 40 DenseMap<const SDNode*, unsigned>::iterator Itr = OrderMap.find(Node); 41 if (Itr != OrderMap.end()) 42 OrderMap.erase(Itr);
|
/external/llvm/lib/Analysis/ |
CFLGraph.h | 81 auto Itr = ValueImpls.find(N.Val); 82 if (Itr == ValueImpls.end() || Itr->second.getNumLevels() <= N.DerefLevel) 84 return &Itr->second.getNodeInfoAtLevel(N.DerefLevel); 87 auto Itr = ValueImpls.find(N.Val); 88 if (Itr == ValueImpls.end() || Itr->second.getNumLevels() <= N.DerefLevel) 90 return &Itr->second.getNodeInfoAtLevel(N.DerefLevel);
|
CFLSteensAliasAnalysis.cpp | 152 auto Itr = InterfaceMap.find(SetIndex); 153 if (Itr != InterfaceMap.end()) { 154 if (CurrValue != Itr->second) 156 ExternalRelation{CurrValue, Itr->second});
|
/libcore/ojluni/src/main/java/java/util/concurrent/ |
ArrayBlockingQueue.java | 718 return new Itr(); 743 * held) of weak references to Itr. The list is cleaned up using 777 private class Node extends WeakReference<Itr> { 780 Node(Itr iterator, Node next) { 798 Itrs(Itr initial) { 836 final Itr it = p.get(); 866 void register(Itr itr) { 868 head = new Node(itr, head); 880 final Itr it = p.get() [all...] |
DelayQueue.java | 498 * Identity-based version for use in Itr.remove. 526 return new Itr(toArray()); 532 private class Itr implements Iterator<E> { 537 Itr(Object[] array) {
|
ConcurrentLinkedQueue.java | 685 return new Itr(); 688 private class Itr implements Iterator<E> { 707 Itr() { [all...] |
LinkedBlockingQueue.java | 753 return new Itr(); 756 private class Itr implements Iterator<E> { 767 Itr() { [all...] |
PriorityBlockingQueue.java | 674 * Identity-based version for use in Itr.remove. 855 return new Itr(toArray()); 861 final class Itr implements Iterator<E> { 866 Itr(Object[] array) { [all...] |
ScheduledThreadPoolExecutor.java | [all...] |
LinkedTransferQueue.java | [all...] |
ConcurrentLinkedDeque.java | [all...] |
/external/guava/guava-tests/benchmark/com/google/common/util/concurrent/ |
MonitorBasedPriorityBlockingQueue.java | 518 return new Itr(toArray()); 524 private class Itr implements Iterator<E> { 529 Itr(Object[] array) {
|
MonitorBasedArrayBlockingQueue.java | 673 return new Itr(); 682 private class Itr implements Iterator<E> { 703 Itr() {
|
/libcore/ojluni/src/main/java/java/util/ |
AbstractList.java | 288 return new Itr(); 330 private class Itr implements Iterator<E> { 390 private class ListItr extends Itr implements ListIterator<E> {
|
Vector.java | [all...] |
PriorityQueue.java | 484 return new Itr(); 487 private final class Itr implements Iterator<E> { [all...] |
ArrayList.java | 834 return new Itr(); 838 * An optimized version of AbstractList.Itr 840 private class Itr implements Iterator<E> { [all...] |
/external/llvm/lib/CodeGen/ |
ScheduleDAGInstrs.cpp | 752 iterator Itr = find(V); 753 if (Itr != end()) { 754 assert (NumNodes >= Itr->second.size()); 755 NumNodes -= Itr->second.size(); 757 Itr->second.clear(); 793 Value2SUsMap::iterator Itr = Val2SUsMap.find(V); 794 if (Itr != Val2SUsMap.end()) 795 addChainDependencies(SU, Itr->second, [all...] |
/external/guava/guava/src/com/google/common/collect/ |
HashBiMap.java | 331 abstract class Itr<T> implements Iterator<T> { 396 return new Itr<K>() { 434 return new Itr<Entry<K, V>>() { 561 return new Itr<V>() { 585 return new Itr<Entry<V, K>>() {
|
ImmutableMultimap.java | 532 private abstract class Itr<T> extends UnmodifiableIterator<T> { 557 return new Itr<Entry<K, V>>() { 633 return new Itr<V>() {
|
AbstractMapBasedMultimap.java | 1122 private abstract class Itr<T> implements Iterator<T> { 1128 Itr() { [all...] |
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
ImmutableMultimap.java | 519 private abstract class Itr<T> extends UnmodifiableIterator<T> { 544 return new Itr<Entry<K, V>>() { 620 return new Itr<V>() {
|
AbstractMapBasedMultimap.java | 960 private abstract class Itr<T> implements Iterator<T> { 966 Itr() { 1013 return new Itr<V>() { 1052 return new Itr<Map.Entry<K, V>>() { [all...] |
/external/llvm/lib/Transforms/Scalar/ |
ConstantHoisting.cpp | 194 ConstCandMapType::iterator Itr; 196 std::tie(Itr, Inserted) = ConstCandMap.insert(std::make_pair(ConstInt, 0)); 199 Itr->second = ConstCandVec.size() - 1; 201 ConstCandVec[Itr->second].addUser(Inst, Idx, Cost);
|
/external/llvm/tools/obj2yaml/ |
macho2yaml.cpp | 259 const uint8_t *Itr = Start; 260 for (; *Itr; ++Itr) 262 return StringRef(reinterpret_cast<const char *>(Start), Itr - Start);
|