1 /*===- InstrProfilingValue.c - Support library for PGO instrumentation ----===*\ 2 |* 3 |* Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 4 |* See https://llvm.org/LICENSE.txt for license information. 5 |* SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 6 |* 7 \*===----------------------------------------------------------------------===*/ 8 9 #include <assert.h> 10 #include <limits.h> 11 #include <stdio.h> 12 #include <stdlib.h> 13 #include <string.h> 14 15 #include "InstrProfiling.h" 16 #include "InstrProfilingInternal.h" 17 #include "InstrProfilingUtil.h" 18 19 #define INSTR_PROF_VALUE_PROF_DATA 20 #define INSTR_PROF_COMMON_API_IMPL 21 #define INSTR_PROF_VALUE_PROF_MEMOP_API 22 #include "profile/InstrProfData.inc" 23 24 static int hasStaticCounters = 1; 25 static int OutOfNodesWarnings = 0; 26 static int hasNonDefaultValsPerSite = 0; 27 #define INSTR_PROF_MAX_VP_WARNS 10 28 #define INSTR_PROF_DEFAULT_NUM_VAL_PER_SITE 24 29 #define INSTR_PROF_VNODE_POOL_SIZE 1024 30 31 #ifndef _MSC_VER 32 /* A shared static pool in addition to the vnodes statically 33 * allocated by the compiler. */ 34 COMPILER_RT_VISIBILITY ValueProfNode 35 lprofValueProfNodes[INSTR_PROF_VNODE_POOL_SIZE] COMPILER_RT_SECTION( 36 COMPILER_RT_SEG INSTR_PROF_VNODES_SECT_NAME); 37 #endif 38 39 COMPILER_RT_VISIBILITY uint32_t VPMaxNumValsPerSite = 40 INSTR_PROF_DEFAULT_NUM_VAL_PER_SITE; 41 42 COMPILER_RT_VISIBILITY void lprofSetupValueProfiler() { 43 const char *Str = 0; 44 Str = getenv("LLVM_VP_MAX_NUM_VALS_PER_SITE"); 45 if (Str && Str[0]) { 46 VPMaxNumValsPerSite = atoi(Str); 47 hasNonDefaultValsPerSite = 1; 48 } 49 if (VPMaxNumValsPerSite > INSTR_PROF_MAX_NUM_VAL_PER_SITE) 50 VPMaxNumValsPerSite = INSTR_PROF_MAX_NUM_VAL_PER_SITE; 51 } 52 53 COMPILER_RT_VISIBILITY void lprofSetMaxValsPerSite(uint32_t MaxVals) { 54 VPMaxNumValsPerSite = MaxVals; 55 hasNonDefaultValsPerSite = 1; 56 } 57 58 /* This method is only used in value profiler mock testing. */ 59 COMPILER_RT_VISIBILITY void 60 __llvm_profile_set_num_value_sites(__llvm_profile_data *Data, 61 uint32_t ValueKind, uint16_t NumValueSites) { 62 *((uint16_t *)&Data->NumValueSites[ValueKind]) = NumValueSites; 63 } 64 65 /* This method is only used in value profiler mock testing. */ 66 COMPILER_RT_VISIBILITY const __llvm_profile_data * 67 __llvm_profile_iterate_data(const __llvm_profile_data *Data) { 68 return Data + 1; 69 } 70 71 /* This method is only used in value profiler mock testing. */ 72 COMPILER_RT_VISIBILITY void * 73 __llvm_get_function_addr(const __llvm_profile_data *Data) { 74 return Data->FunctionPointer; 75 } 76 77 /* Allocate an array that holds the pointers to the linked lists of 78 * value profile counter nodes. The number of element of the array 79 * is the total number of value profile sites instrumented. Returns 80 * 0 if allocation fails. 81 */ 82 83 static int allocateValueProfileCounters(__llvm_profile_data *Data) { 84 uint64_t NumVSites = 0; 85 uint32_t VKI; 86 87 /* This function will never be called when value site array is allocated 88 statically at compile time. */ 89 hasStaticCounters = 0; 90 /* When dynamic allocation is enabled, allow tracking the max number of 91 * values allowd. */ 92 if (!hasNonDefaultValsPerSite) 93 VPMaxNumValsPerSite = INSTR_PROF_MAX_NUM_VAL_PER_SITE; 94 95 for (VKI = IPVK_First; VKI <= IPVK_Last; ++VKI) 96 NumVSites += Data->NumValueSites[VKI]; 97 98 // If NumVSites = 0, calloc is allowed to return a non-null pointer. 99 assert(NumVSites > 0 && "NumVSites can't be zero"); 100 ValueProfNode **Mem = 101 (ValueProfNode **)calloc(NumVSites, sizeof(ValueProfNode *)); 102 if (!Mem) 103 return 0; 104 if (!COMPILER_RT_BOOL_CMPXCHG(&Data->Values, 0, Mem)) { 105 free(Mem); 106 return 0; 107 } 108 return 1; 109 } 110 111 static ValueProfNode *allocateOneNode(void) { 112 ValueProfNode *Node; 113 114 if (!hasStaticCounters) 115 return (ValueProfNode *)calloc(1, sizeof(ValueProfNode)); 116 117 /* Early check to avoid value wrapping around. */ 118 if (CurrentVNode + 1 > EndVNode) { 119 if (OutOfNodesWarnings++ < INSTR_PROF_MAX_VP_WARNS) { 120 PROF_WARN("Unable to track new values: %s. " 121 " Consider using option -mllvm -vp-counters-per-site=<n> to " 122 "allocate more" 123 " value profile counters at compile time. \n", 124 "Running out of static counters"); 125 } 126 return 0; 127 } 128 Node = COMPILER_RT_PTR_FETCH_ADD(ValueProfNode, CurrentVNode, 1); 129 /* Due to section padding, EndVNode point to a byte which is one pass 130 * an incomplete VNode, so we need to skip the last incomplete node. */ 131 if (Node + 1 > EndVNode) 132 return 0; 133 134 return Node; 135 } 136 137 static COMPILER_RT_ALWAYS_INLINE void 138 instrumentTargetValueImpl(uint64_t TargetValue, void *Data, 139 uint32_t CounterIndex, uint64_t CountValue) { 140 __llvm_profile_data *PData = (__llvm_profile_data *)Data; 141 if (!PData) 142 return; 143 if (!CountValue) 144 return; 145 if (!PData->Values) { 146 if (!allocateValueProfileCounters(PData)) 147 return; 148 } 149 150 ValueProfNode **ValueCounters = (ValueProfNode **)PData->Values; 151 ValueProfNode *PrevVNode = NULL; 152 ValueProfNode *MinCountVNode = NULL; 153 ValueProfNode *CurVNode = ValueCounters[CounterIndex]; 154 uint64_t MinCount = UINT64_MAX; 155 156 uint8_t VDataCount = 0; 157 while (CurVNode) { 158 if (TargetValue == CurVNode->Value) { 159 CurVNode->Count += CountValue; 160 return; 161 } 162 if (CurVNode->Count < MinCount) { 163 MinCount = CurVNode->Count; 164 MinCountVNode = CurVNode; 165 } 166 PrevVNode = CurVNode; 167 CurVNode = CurVNode->Next; 168 ++VDataCount; 169 } 170 171 if (VDataCount >= VPMaxNumValsPerSite) { 172 /* Bump down the min count node's count. If it reaches 0, 173 * evict it. This eviction/replacement policy makes hot 174 * targets more sticky while cold targets less so. In other 175 * words, it makes it less likely for the hot targets to be 176 * prematurally evicted during warmup/establishment period, 177 * when their counts are still low. In a special case when 178 * the number of values tracked is reduced to only one, this 179 * policy will guarantee that the dominating target with >50% 180 * total count will survive in the end. Note that this scheme 181 * allows the runtime to track the min count node in an adaptive 182 * manner. It can correct previous mistakes and eventually 183 * lock on a cold target that is alread in stable state. 184 * 185 * In very rare cases, this replacement scheme may still lead 186 * to target loss. For instance, out of \c N value slots, \c N-1 187 * slots are occupied by luke warm targets during the warmup 188 * period and the remaining one slot is competed by two or more 189 * very hot targets. If those hot targets occur in an interleaved 190 * way, none of them will survive (gain enough weight to throw out 191 * other established entries) due to the ping-pong effect. 192 * To handle this situation, user can choose to increase the max 193 * number of tracked values per value site. Alternatively, a more 194 * expensive eviction mechanism can be implemented. It requires 195 * the runtime to track the total number of evictions per-site. 196 * When the total number of evictions reaches certain threshold, 197 * the runtime can wipe out more than one lowest count entries 198 * to give space for hot targets. 199 */ 200 if (MinCountVNode->Count <= CountValue) { 201 CurVNode = MinCountVNode; 202 CurVNode->Value = TargetValue; 203 CurVNode->Count = CountValue; 204 } else 205 MinCountVNode->Count -= CountValue; 206 207 return; 208 } 209 210 CurVNode = allocateOneNode(); 211 if (!CurVNode) 212 return; 213 CurVNode->Value = TargetValue; 214 CurVNode->Count += CountValue; 215 216 uint32_t Success = 0; 217 if (!ValueCounters[CounterIndex]) 218 Success = 219 COMPILER_RT_BOOL_CMPXCHG(&ValueCounters[CounterIndex], 0, CurVNode); 220 else if (PrevVNode && !PrevVNode->Next) 221 Success = COMPILER_RT_BOOL_CMPXCHG(&(PrevVNode->Next), 0, CurVNode); 222 223 if (!Success && !hasStaticCounters) { 224 free(CurVNode); 225 return; 226 } 227 } 228 229 COMPILER_RT_VISIBILITY void 230 __llvm_profile_instrument_target(uint64_t TargetValue, void *Data, 231 uint32_t CounterIndex) { 232 instrumentTargetValueImpl(TargetValue, Data, CounterIndex, 1); 233 } 234 COMPILER_RT_VISIBILITY void 235 __llvm_profile_instrument_target_value(uint64_t TargetValue, void *Data, 236 uint32_t CounterIndex, 237 uint64_t CountValue) { 238 instrumentTargetValueImpl(TargetValue, Data, CounterIndex, CountValue); 239 } 240 241 /* 242 * The target values are partitioned into multiple regions/ranges. There is one 243 * contiguous region which is precise -- every value in the range is tracked 244 * individually. A value outside the precise region will be collapsed into one 245 * value depending on the region it falls in. 246 * 247 * There are three regions: 248 * 1. (-inf, PreciseRangeStart) and (PreciseRangeLast, LargeRangeValue) belong 249 * to one region -- all values here should be mapped to one value of 250 * "PreciseRangeLast + 1". 251 * 2. [PreciseRangeStart, PreciseRangeLast] 252 * 3. Large values: [LargeValue, +inf) maps to one value of LargeValue. 253 * 254 * The range for large values is optional. The default value of INT64_MIN 255 * indicates it is not specified. 256 */ 257 /* FIXME: This is to be removed after switching to the new memop value 258 * profiling. */ 259 COMPILER_RT_VISIBILITY void __llvm_profile_instrument_range( 260 uint64_t TargetValue, void *Data, uint32_t CounterIndex, 261 int64_t PreciseRangeStart, int64_t PreciseRangeLast, int64_t LargeValue) { 262 263 if (LargeValue != INT64_MIN && (int64_t)TargetValue >= LargeValue) 264 TargetValue = LargeValue; 265 else if ((int64_t)TargetValue < PreciseRangeStart || 266 (int64_t)TargetValue > PreciseRangeLast) 267 TargetValue = PreciseRangeLast + 1; 268 269 __llvm_profile_instrument_target(TargetValue, Data, CounterIndex); 270 } 271 272 /* 273 * The target values are partitioned into multiple ranges. The range spec is 274 * defined in InstrProfData.inc. 275 */ 276 COMPILER_RT_VISIBILITY void 277 __llvm_profile_instrument_memop(uint64_t TargetValue, void *Data, 278 uint32_t CounterIndex) { 279 // Map the target value to the representative value of its range. 280 uint64_t RepValue = InstrProfGetRangeRepValue(TargetValue); 281 __llvm_profile_instrument_target(RepValue, Data, CounterIndex); 282 } 283 284 /* 285 * A wrapper struct that represents value profile runtime data. 286 * Like InstrProfRecord class which is used by profiling host tools, 287 * ValueProfRuntimeRecord also implements the abstract intefaces defined in 288 * ValueProfRecordClosure so that the runtime data can be serialized using 289 * shared C implementation. 290 */ 291 typedef struct ValueProfRuntimeRecord { 292 const __llvm_profile_data *Data; 293 ValueProfNode **NodesKind[IPVK_Last + 1]; 294 uint8_t **SiteCountArray; 295 } ValueProfRuntimeRecord; 296 297 /* ValueProfRecordClosure Interface implementation. */ 298 299 static uint32_t getNumValueSitesRT(const void *R, uint32_t VK) { 300 return ((const ValueProfRuntimeRecord *)R)->Data->NumValueSites[VK]; 301 } 302 303 static uint32_t getNumValueDataRT(const void *R, uint32_t VK) { 304 uint32_t S = 0, I; 305 const ValueProfRuntimeRecord *Record = (const ValueProfRuntimeRecord *)R; 306 if (Record->SiteCountArray[VK] == INSTR_PROF_NULLPTR) 307 return 0; 308 for (I = 0; I < Record->Data->NumValueSites[VK]; I++) 309 S += Record->SiteCountArray[VK][I]; 310 return S; 311 } 312 313 static uint32_t getNumValueDataForSiteRT(const void *R, uint32_t VK, 314 uint32_t S) { 315 const ValueProfRuntimeRecord *Record = (const ValueProfRuntimeRecord *)R; 316 return Record->SiteCountArray[VK][S]; 317 } 318 319 static ValueProfRuntimeRecord RTRecord; 320 static ValueProfRecordClosure RTRecordClosure = { 321 &RTRecord, INSTR_PROF_NULLPTR, /* GetNumValueKinds */ 322 getNumValueSitesRT, getNumValueDataRT, getNumValueDataForSiteRT, 323 INSTR_PROF_NULLPTR, /* RemapValueData */ 324 INSTR_PROF_NULLPTR, /* GetValueForSite, */ 325 INSTR_PROF_NULLPTR /* AllocValueProfData */ 326 }; 327 328 static uint32_t 329 initializeValueProfRuntimeRecord(const __llvm_profile_data *Data, 330 uint8_t *SiteCountArray[]) { 331 unsigned I, J, S = 0, NumValueKinds = 0; 332 ValueProfNode **Nodes = (ValueProfNode **)Data->Values; 333 RTRecord.Data = Data; 334 RTRecord.SiteCountArray = SiteCountArray; 335 for (I = 0; I <= IPVK_Last; I++) { 336 uint16_t N = Data->NumValueSites[I]; 337 if (!N) 338 continue; 339 340 NumValueKinds++; 341 342 RTRecord.NodesKind[I] = Nodes ? &Nodes[S] : INSTR_PROF_NULLPTR; 343 for (J = 0; J < N; J++) { 344 /* Compute value count for each site. */ 345 uint32_t C = 0; 346 ValueProfNode *Site = 347 Nodes ? RTRecord.NodesKind[I][J] : INSTR_PROF_NULLPTR; 348 while (Site) { 349 C++; 350 Site = Site->Next; 351 } 352 if (C > UCHAR_MAX) 353 C = UCHAR_MAX; 354 RTRecord.SiteCountArray[I][J] = C; 355 } 356 S += N; 357 } 358 return NumValueKinds; 359 } 360 361 static ValueProfNode *getNextNValueData(uint32_t VK, uint32_t Site, 362 InstrProfValueData *Dst, 363 ValueProfNode *StartNode, uint32_t N) { 364 unsigned I; 365 ValueProfNode *VNode = StartNode ? StartNode : RTRecord.NodesKind[VK][Site]; 366 for (I = 0; I < N; I++) { 367 Dst[I].Value = VNode->Value; 368 Dst[I].Count = VNode->Count; 369 VNode = VNode->Next; 370 } 371 return VNode; 372 } 373 374 static uint32_t getValueProfDataSizeWrapper(void) { 375 return getValueProfDataSize(&RTRecordClosure); 376 } 377 378 static uint32_t getNumValueDataForSiteWrapper(uint32_t VK, uint32_t S) { 379 return getNumValueDataForSiteRT(&RTRecord, VK, S); 380 } 381 382 static VPDataReaderType TheVPDataReader = { 383 initializeValueProfRuntimeRecord, getValueProfRecordHeaderSize, 384 getFirstValueProfRecord, getNumValueDataForSiteWrapper, 385 getValueProfDataSizeWrapper, getNextNValueData}; 386 387 COMPILER_RT_VISIBILITY VPDataReaderType *lprofGetVPDataReader() { 388 return &TheVPDataReader; 389 } 390