Lines Matching defs:Size
273 unsigned Size = MemoryDependenceAnalysis::getLoadLoadClobberFullWidthSize(
274 MemLocBase, MemLocOffs, MemLoc.Size, LI);
275 return Size != 0;
280 /// and Size) and compares it against a load. If the specified load could
283 /// location value, then this function returns the size in bytes of the
309 // and "P+3". Check to see if increasing the size of the "LI" load up to its
317 // any legal integer up to this size without a problem. For example, if we're
328 // This is the size of the load to try. Start with the next larger power of
334 // If this load size is bigger than our known alignment or would not fit
716 if (Count == -1) Count = Cache.size();
768 //cerr << "CACHED CASE: " << DirtyBlocks.size() << " dirty: "
769 // << Cache.size() << " cached: " << *QueryInst;
783 unsigned NumSortedEntries = Cache.size();
1003 switch (Cache.size() - NumSortedEntries) {
1018 if (Cache.size() != 1) {
1058 // it'll be ignored, and we'll have to check to see if the cached size and
1061 InitialNLPI.Size = Loc.Size;
1073 if (CacheInfo->Size < Loc.Size) {
1074 // The query's Size is greater than the cached one. Throw out the
1075 // cached data and proceed with the query at the greater size.
1077 CacheInfo->Size = Loc.Size;
1083 } else if (CacheInfo->Size > Loc.Size) {
1084 // This query's Size is less than the cached one. Conservatively restart
1085 // the query using the greater size.
1087 Loc.getWithNewSize(CacheInfo->Size),
1177 unsigned NumSortedEntries = Cache->size();
1185 if (Result.size() > NumResultsLimit) {
1190 if (Cache && NumSortedEntries != Cache->size()) {
1251 for (unsigned i = 0; i < NewBlocks.size(); i++)
1270 if (Cache && NumSortedEntries != Cache->size()) {
1272 NumSortedEntries = Cache->size();
1311 for (unsigned i = 0, n = PredList.size(); i < n; ++i)
1323 for (unsigned i = 0, n = PredList.size(); i < n; ++i) {
1367 NumSortedEntries = Cache->size();
1386 NumSortedEntries = Cache->size();
1435 for (unsigned i = 0, e = PInfo.size(); i != e; ++i) {
