Lines Matching defs:It
22 // WARNING: This file knows about certain library functions. It recognizes them
108 typename MapTy::const_iterator It = Map.find(Key);
109 if (It == Map.end()) return Vector.end();
110 return Vector.begin() + It->second;
118 typename MapTy::iterator It = Map.find(Key);
119 if (It == Map.end()) return;
120 Vector[It->second].first = KeyT();
121 Map.erase(It);
184 // It seemes intuitive to exclude function pointer types as well, since
530 // A constant pointer can't be pointing to an object on the heap. It may
961 // This recursion depth limit is arbitrary. It's just great
1070 // TODO: It should be possible to delete
1078 // know how to split edges. It should be possible to make the optimizer
3194 // A constant pointer can't be pointing to an object on the heap. It may
3222 MapVector<Value *, RRInfo>::const_iterator It = Retains.find(NewRetain);
3223 assert(It != Retains.end());
3224 const RRInfo &NewRetainRRI = It->second;
3277 DenseMap<Value *, RRInfo>::const_iterator It =
3279 assert(It != Releases.end());
3280 const RRInfo &NewReleaseRRI = It->second;
3304 // It's not possible to merge the sequences if one uses
3347 // TODO: It's theoretically possible to do code motion in this case, as
4053 // It seems that functions which "return twice" are also unsafe for the