<div dir="ltr"><br><div class="gmail_extra"><br><div class="gmail_quote">On Thu, Dec 3, 2015 at 5:02 PM, Xinliang David Li via llvm-commits <span dir="ltr"><<a href="mailto:llvm-commits@lists.llvm.org" target="_blank">llvm-commits@lists.llvm.org</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left-width:1px;border-left-color:rgb(204,204,204);border-left-style:solid;padding-left:1ex">Author: davidxl<br>
Date: Thu Dec 3 19:02:24 2015<br>
New Revision: 254678<br>
<br>
URL: <a href="http://llvm.org/viewvc/llvm-project?rev=254678&view=rev" rel="noreferrer" target="_blank">http://llvm.org/viewvc/llvm-project?rev=254678&view=rev</a><br>
Log:<br>
[PGO] Unify VP data format between raw and indexed profile (runtime)<br>
<br>
With the latest refactoring and code sharing patches landed,<br>
it is possible to unify the value profile implementation between<br>
raw and indexed profile. This is part in prfofile runtime.<br>
<br>
Differential Revision: <a href="http://reviews.llvm.org/D15057" rel="noreferrer" target="_blank">http://reviews.llvm.org/D15057</a><br>
<br>
Added:<br>
compiler-rt/trunk/test/profile/instrprof-value-prof.c<br>
Modified:<br>
compiler-rt/trunk/lib/profile/InstrProfiling.c<br>
<br>
Modified: compiler-rt/trunk/lib/profile/InstrProfiling.c<br>
URL: <a href="http://llvm.org/viewvc/llvm-project/compiler-rt/trunk/lib/profile/InstrProfiling.c?rev=254678&r1=254677&r2=254678&view=diff" rel="noreferrer" target="_blank">http://llvm.org/viewvc/llvm-project/compiler-rt/trunk/lib/profile/InstrProfiling.c?rev=254678&r1=254677&r2=254678&view=diff</a><br>
==============================================================================<br>
--- compiler-rt/trunk/lib/profile/InstrProfiling.c (original)<br>
+++ compiler-rt/trunk/lib/profile/InstrProfiling.c Thu Dec 3 19:02:24 2015<br>
@@ -9,8 +9,19 @@<br>
<br>
#include "InstrProfiling.h"<br>
#include <limits.h><br>
+#include <stdio.h><br>
#include <stdlib.h><br>
#include <string.h><br>
+#define INSTR_PROF_VALUE_PROF_DATA<br>
+#define INSTR_PROF_COMMON_API_IMPL<br>
+#include "InstrProfData.inc"<br>
+<br>
+#define PROF_OOM(Msg) PROF_ERR(Msg ":%s\n", "Out of memory");<br>
+#define PROF_OOM_RETURN(Msg) \<br>
+ { \<br>
+ PROF_OOM(Msg) \<br>
+ return 0; \<br>
+ }<br>
<br>
LLVM_LIBRARY_VISIBILITY uint64_t __llvm_profile_get_magic(void) {<br>
return sizeof(void *) == sizeof(uint64_t) ? (INSTR_PROF_RAW_MAGIC_64)<br>
@@ -60,20 +71,29 @@ LLVM_LIBRARY_VISIBILITY void __llvm_prof<br>
}<br>
}<br>
<br>
-/* Total number of value profile data in bytes. */<br>
-static uint64_t TotalValueDataSize = 0;<br>
-<br>
-#ifdef _MIPS_ARCH<br>
+/* This method is only used in value profiler mock testing. */<br>
LLVM_LIBRARY_VISIBILITY void<br>
-__llvm_profile_instrument_target(uint64_t TargetValue, void *Data_,<br>
- uint32_t CounterIndex) {}<br>
+__llvm_profile_set_num_value_sites(__llvm_profile_data *Data,<br>
+ uint32_t ValueKind, uint16_t NumValueSites) {<br>
+ *((uint16_t *)&Data->NumValueSites[ValueKind]) = NumValueSites;<br>
+}<br>
+<br>
+/* This method is only used in value profiler mock testing. */<br>
+LLVM_LIBRARY_VISIBILITY const __llvm_profile_data *<br>
+__llvm_profile_iterate_data(const __llvm_profile_data *Data) {<br>
+ return Data + 1;<br>
+}<br>
<br>
-#else<br>
+/* This method is only used in value profiler mock testing. */<br>
+LLVM_LIBRARY_VISIBILITY void *<br>
+__llvm_get_function_addr(const __llvm_profile_data *Data) {<br>
+ return Data->FunctionPointer;<br>
+}<br>
<br>
/* Allocate an array that holds the pointers to the linked lists of<br>
* value profile counter nodes. The number of element of the array<br>
* is the total number of value profile sites instrumented. Returns<br>
- * 0 if allocation fails.<br>
+ * 0 if allocation fails.<br>
*/<br>
<br>
static int allocateValueProfileCounters(__llvm_profile_data *Data) {<br>
@@ -90,16 +110,27 @@ static int allocateValueProfileCounters(<br>
free(Mem);<br>
return 0;<br>
}<br>
- /* In the raw format, there will be an value count array preceding<br>
- * the value profile data. The element type of the array is uint8_t,<br>
- * and there is one element in array per value site. The element<br>
- * stores the number of values profiled for the corresponding site.<br>
- */<br>
- uint8_t Padding = __llvm_profile_get_num_padding_bytes(NumVSites);<br>
- __sync_fetch_and_add(&TotalValueDataSize, NumVSites + Padding);<br>
return 1;<br>
}<br>
<br>
+static void deallocateValueProfileCounters(__llvm_profile_data *Data) {<br>
+ uint64_t NumVSites = 0, I;<br>
+ uint32_t VKI;<br>
+ if (!Data->Values)<br>
+ return;<br>
+ for (VKI = IPVK_First; VKI <= IPVK_Last; ++VKI)<br>
+ NumVSites += Data->NumValueSites[VKI];<br>
+ for (I = 0; I < NumVSites; I++) {<br>
+ ValueProfNode *Node = ((ValueProfNode **)Data->Values)[I];<br>
+ while (Node) {<br>
+ ValueProfNode *Next = Node->Next;<br>
+ free(Node);<br>
+ Node = Next;<br>
+ }<br>
+ }<br>
+ free(Data->Values);<br>
+}<br>
+<br>
LLVM_LIBRARY_VISIBILITY void<br>
__llvm_profile_instrument_target(uint64_t TargetValue, void *Data,<br>
uint32_t CounterIndex) {<br>
@@ -149,61 +180,87 @@ __llvm_profile_instrument_target(uint64_<br>
free(CurrentVNode);<br>
return;<br>
}<br>
- __sync_fetch_and_add(&TotalValueDataSize, Success * sizeof(ValueProfNode));<br>
}<br>
-#endif<br>
+<br>
+/* For multi-threaded programs, while the profile is being dumped, other<br>
+ threads may still be updating the value profile data and creating new<br>
+ value entries. To accommadate this, we need to add extra bytes to the<br>
+ data buffer. The size of the extra space is controlled by an environment<br>
+ varaible. */<br></blockquote><div><br></div><div><br></div><div>Typo: varaible</div><div><br></div><div>-- Sean Silva</div><div> </div><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left-width:1px;border-left-color:rgb(204,204,204);border-left-style:solid;padding-left:1ex">
+static unsigned getVprofExtraBytes() {<br>
+ const char *ExtraStr = getenv("LLVM_VALUE_PROF_BUFFER_EXTRA");<br>
+ if (!ExtraStr || !ExtraStr[0])<br>
+ return 1024;<br>
+ return (unsigned)atoi(ExtraStr);<br>
+}<br>
<br>
LLVM_LIBRARY_VISIBILITY uint64_t<br>
__llvm_profile_gather_value_data(uint8_t **VDataArray) {<br>
+ size_t S = 0, RealSize = 0, BufferCapacity = 0, Extra = 0;<br>
+ __llvm_profile_data *I;<br>
+ if (!VDataArray)<br>
+ PROF_OOM_RETURN("Failed to write value profile data ");<br>
<br>
- if (!VDataArray || 0 == TotalValueDataSize)<br>
- return 0;<br>
-<br>
- uint64_t NumData = TotalValueDataSize;<br>
- *VDataArray = (uint8_t *)calloc(NumData, sizeof(uint8_t));<br>
- if (!*VDataArray)<br>
- return 0;<br>
-<br>
- uint8_t *VDataEnd = *VDataArray + NumData;<br>
- uint8_t *PerSiteCountsHead = *VDataArray;<br>
const __llvm_profile_data *DataEnd = __llvm_profile_end_data();<br>
const __llvm_profile_data *DataBegin = __llvm_profile_begin_data();<br>
- __llvm_profile_data *I;<br>
+<br>
+ /*<br>
+ * Compute the total Size of the buffer to hold ValueProfData<br>
+ * structures for functions with value profile data.<br>
+ */<br>
for (I = (__llvm_profile_data *)DataBegin; I != DataEnd; ++I) {<br>
+ ValueProfRuntimeRecord R;<br>
+ /* Extract the value profile data info from the runtime. */<br>
+ if (initializeValueProfRuntimeRecord(&R, I->NumValueSites, I->Values))<br>
+ PROF_OOM_RETURN("Failed to write value profile data ");<br>
+ /* Compute the size of ValueProfData from this runtime record. */<br>
+ if (getNumValueKindsRT(&R) != 0)<br>
+ S += getValueProfDataSizeRT(&R);<br>
+ finalizeValueProfRuntimeRecord(&R);<br>
+ }<br>
+ /* No value sites or no value profile data is collected. */<br>
+ if (!S)<br>
+ return 0;<br>
<br>
- uint64_t NumVSites = 0;<br>
- uint32_t VKI, i;<br>
+ Extra = getVprofExtraBytes();<br>
+ BufferCapacity = S + Extra;<br>
+ *VDataArray = calloc(BufferCapacity, sizeof(uint8_t));<br>
+ if (!*VDataArray)<br>
+ PROF_OOM_RETURN("Failed to write value profile data ");<br>
<br>
- if (!I->Values)<br>
+ ValueProfData *VD = (ValueProfData *)(*VDataArray);<br>
+ /*<br>
+ * Extract value profile data and write into ValueProfData structure<br>
+ * one by one. Note that new value profile data added to any value<br>
+ * site (from another thread) after the ValueProfRuntimeRecord is<br>
+ * initialized (when the profile data snapshot is taken) won't be<br>
+ * collected. This is not a problem as those dropped value will have<br>
+ * very low taken count.<br>
+ */<br>
+ for (I = (__llvm_profile_data *)DataBegin; I != DataEnd; ++I) {<br>
+ ValueProfRuntimeRecord R;<br>
+ if (initializeValueProfRuntimeRecord(&R, I->NumValueSites, I->Values))<br>
+ PROF_OOM_RETURN("Failed to write value profile data ");<br>
+ if (getNumValueKindsRT(&R) == 0)<br>
continue;<br>
<br>
- ValueProfNode **ValueCounters = (ValueProfNode **)I->Values;<br>
-<br>
- for (VKI = IPVK_First; VKI <= IPVK_Last; ++VKI)<br>
- NumVSites += I->NumValueSites[VKI];<br>
- uint8_t Padding = __llvm_profile_get_num_padding_bytes(NumVSites);<br>
-<br>
- uint8_t *PerSiteCountPtr = PerSiteCountsHead;<br>
- InstrProfValueData *VDataPtr =<br>
- (InstrProfValueData *)(PerSiteCountPtr + NumVSites + Padding);<br>
-<br>
- for (i = 0; i < NumVSites; ++i) {<br>
-<br>
- ValueProfNode *VNode = ValueCounters[i];<br>
-<br>
- uint8_t VDataCount = 0;<br>
- while (VNode && ((uint8_t *)(VDataPtr + 1) <= VDataEnd)) {<br>
- *VDataPtr = VNode->VData;<br>
- VNode = VNode->Next;<br>
- ++VDataPtr;<br>
- if (++VDataCount == UCHAR_MAX)<br>
- break;<br>
- }<br>
- *PerSiteCountPtr = VDataCount;<br>
- ++PerSiteCountPtr;<br>
+ /* Record R has taken a snapshot of the VP data at this point. Newly<br>
+ added VP data for this function will be dropped. */<br>
+ /* Check if there is enough space. */<br>
+ if (BufferCapacity - RealSize < getValueProfDataSizeRT(&R)) {<br>
+ PROF_ERR("Value profile data is dropped :%s \n",<br>
+ "Out of buffer space. Use environment "<br>
+ " LLVM_VALUE_PROF_BUFFER_EXTRA to allocate more");<br>
+ I->Values = 0;<br>
}<br>
- I->Values = (void *)PerSiteCountsHead;<br>
- PerSiteCountsHead = (uint8_t *)VDataPtr;<br>
+<br>
+ serializeValueProfDataFromRT(&R, VD);<br>
+ deallocateValueProfileCounters(I);<br>
+ I->Values = VD;<br>
+ finalizeValueProfRuntimeRecord(&R);<br>
+ RealSize += VD->TotalSize;<br>
+ VD = (ValueProfData *)((char *)VD + VD->TotalSize);<br>
}<br>
- return PerSiteCountsHead - *VDataArray;<br>
+<br>
+ return RealSize;<br>
}<br>
<br>
Added: compiler-rt/trunk/test/profile/instrprof-value-prof.c<br>
URL: <a href="http://llvm.org/viewvc/llvm-project/compiler-rt/trunk/test/profile/instrprof-value-prof.c?rev=254678&view=auto" rel="noreferrer" target="_blank">http://llvm.org/viewvc/llvm-project/compiler-rt/trunk/test/profile/instrprof-value-prof.c?rev=254678&view=auto</a><br>
==============================================================================<br>
--- compiler-rt/trunk/test/profile/instrprof-value-prof.c (added)<br>
+++ compiler-rt/trunk/test/profile/instrprof-value-prof.c Thu Dec 3 19:02:24 2015<br>
@@ -0,0 +1,183 @@<br>
+// RUN: %clang_profgen -O2 -o %t %s<br>
+// RUN: env LLVM_PROFILE_FILE=%t.profraw %run %t 1<br>
+// RUN: env LLVM_PROFILE_FILE=%t-2.profraw %run %t<br>
+// RUN: llvm-profdata merge -o %t.profdata %t.profraw<br>
+// RUN: llvm-profdata merge -o %t-2.profdata %t-2.profraw<br>
+// RUN: llvm-profdata merge -o %t-merged.profdata %t.profraw %t-2.profdata<br>
+// RUN: llvm-profdata show --all-functions -ic-targets %t-2.profdata | FileCheck %s -check-prefix=NO-VALUE<br>
+// RUN: llvm-profdata show --all-functions -ic-targets %t.profdata | FileCheck %s<br>
+// value profile merging current do sorting based on target values -- this will destroy the order of the target<br>
+// in the list leading to comparison problem. For now just check a small subset of output.<br>
+// RUN: llvm-profdata show --all-functions -ic-targets %t-merged.profdata | FileCheck %s -check-prefix=MERGE<br>
+<br>
+#include <stdint.h><br>
+#include <stdio.h><br>
+#include <stdlib.h><br>
+typedef struct __llvm_profile_data __llvm_profile_data;<br>
+const __llvm_profile_data *__llvm_profile_begin_data(void);<br>
+const __llvm_profile_data *__llvm_profile_end_data(void);<br>
+void __llvm_profile_set_num_value_sites(__llvm_profile_data *Data,<br>
+ uint32_t ValueKind,<br>
+ uint16_t NumValueSites);<br>
+__llvm_profile_data *<br>
+__llvm_profile_iterate_data(const __llvm_profile_data *Data);<br>
+void *__llvm_get_function_addr(const __llvm_profile_data *Data);<br>
+void __llvm_profile_instrument_target(uint64_t TargetValue, void *Data,<br>
+ uint32_t CounterIndex);<br>
+<br>
+#define DEF_FUNC(x) \<br>
+ void x() {}<br>
+#define DEF_2_FUNCS(x) DEF_FUNC(x##_1) DEF_FUNC(x##_2)<br>
+#define DEF_4_FUNCS(x) DEF_2_FUNCS(x##_1) DEF_2_FUNCS(x##_2)<br>
+#define DEF_8_FUNCS(x) DEF_4_FUNCS(x##_1) DEF_4_FUNCS(x##_2)<br>
+#define DEF_16_FUNCS(x) DEF_8_FUNCS(x##_1) DEF_8_FUNCS(x##_2)<br>
+#define DEF_32_FUNCS(x) DEF_16_FUNCS(x##_1) DEF_16_FUNCS(x##_2)<br>
+#define DEF_64_FUNCS(x) DEF_32_FUNCS(x##_1) DEF_32_FUNCS(x##_2)<br>
+#define DEF_128_FUNCS(x) DEF_64_FUNCS(x##_1) DEF_64_FUNCS(x##_2)<br>
+<br>
+#define FUNC_ADDR(x) &x,<br>
+#define FUNC_2_ADDRS(x) FUNC_ADDR(x##_1) FUNC_ADDR(x##_2)<br>
+#define FUNC_4_ADDRS(x) FUNC_2_ADDRS(x##_1) FUNC_2_ADDRS(x##_2)<br>
+#define FUNC_8_ADDRS(x) FUNC_4_ADDRS(x##_1) FUNC_4_ADDRS(x##_2)<br>
+#define FUNC_16_ADDRS(x) FUNC_8_ADDRS(x##_1) FUNC_8_ADDRS(x##_2)<br>
+#define FUNC_32_ADDRS(x) FUNC_16_ADDRS(x##_1) FUNC_16_ADDRS(x##_2)<br>
+#define FUNC_64_ADDRS(x) FUNC_32_ADDRS(x##_1) FUNC_32_ADDRS(x##_2)<br>
+#define FUNC_128_ADDRS(x) FUNC_64_ADDRS(x##_1) FUNC_64_ADDRS(x##_2)<br>
+<br>
+DEF_8_FUNCS(callee)<br>
+DEF_128_FUNCS(caller)<br>
+<br>
+void *CallerAddrs[] = {FUNC_128_ADDRS(caller)};<br>
+<br>
+void *CalleeAddrs[] = {FUNC_8_ADDRS(callee)};<br>
+<br>
+static int cmpaddr(const void *p1, const void *p2) {<br>
+ void *addr1 = *(void **)p1;<br>
+ void *addr2 = *(void **)p2;<br>
+ return (intptr_t)addr2 - (intptr_t)addr1;<br>
+}<br>
+<br>
+int main(int argc, const char *argv[]) {<br>
+ unsigned S, NS = 0, V, doInstrument = 1;<br>
+ const __llvm_profile_data *Data, *DataEnd;<br>
+<br>
+ if (argc < 2)<br>
+ doInstrument = 0;<br>
+<br>
+ qsort(CallerAddrs, sizeof(CallerAddrs) / sizeof(void *), sizeof(void *),<br>
+ cmpaddr);<br>
+<br>
+ /* We will synthesis value profile data for 128 callers functions.<br>
+ * The number of * value sites. The number values for each value site<br>
+ * ranges from 0 to 8. */<br>
+<br>
+ Data = __llvm_profile_begin_data();<br>
+ DataEnd = __llvm_profile_end_data();<br>
+<br>
+ for (; Data < DataEnd; Data = __llvm_profile_iterate_data(Data)) {<br>
+ void *func = __llvm_get_function_addr(Data);<br>
+ if (bsearch(&func, CallerAddrs, sizeof(CallerAddrs) / sizeof(void *),<br>
+ sizeof(void *), cmpaddr)) {<br>
+ __llvm_profile_set_num_value_sites((__llvm_profile_data *)Data,<br>
+ 0 /*IPVK_IndirectCallTarget */, NS);<br>
+ if (!doInstrument) {<br>
+ NS++;<br>
+ continue;<br>
+ }<br>
+ for (S = 0; S < NS; S++) {<br>
+ for (V = 0; V < S % 8; V++) {<br>
+ unsigned C;<br>
+ for (C = 0; C < V + 1; C++)<br>
+ __llvm_profile_instrument_target((uint64_t)CalleeAddrs[V],<br>
+ (void *)Data, S);<br>
+ }<br>
+ }<br>
+ NS++;<br>
+ }<br>
+ }<br>
+}<br>
+<br>
+// NO-VALUE: Indirect Call Site Count: 127<br>
+// NO-VALUE-NEXT: Indirect Target Results:<br>
+// MERGE: Indirect Call Site Count: 127<br>
+// MERGE-NEXT: Indirect Target Results:<br>
+// MERGE-NEXT: [ 1, callee_1_1_1, 1 ]<br>
+// CHECK: Indirect Call Site Count: 127<br>
+// CHECK-NEXT: Indirect Target Results:<br>
+// CHECK-NEXT: [ 1, callee_1_1_1, 1 ]<br>
+// CHECK-NEXT: [ 2, callee_1_1_1, 1 ]<br>
+// CHECK-NEXT: [ 2, callee_1_1_2, 2 ]<br>
+// CHECK-NEXT: [ 3, callee_1_1_1, 1 ]<br>
+// CHECK-NEXT: [ 3, callee_1_1_2, 2 ]<br>
+// CHECK-NEXT: [ 3, callee_1_2_1, 3 ]<br>
+// CHECK-NEXT: [ 4, callee_1_1_1, 1 ]<br>
+// CHECK-NEXT: [ 4, callee_1_1_2, 2 ]<br>
+// CHECK-NEXT: [ 4, callee_1_2_1, 3 ]<br>
+// CHECK-NEXT: [ 4, callee_1_2_2, 4 ]<br>
+// CHECK-NEXT: [ 5, callee_1_1_1, 1 ]<br>
+// CHECK-NEXT: [ 5, callee_1_1_2, 2 ]<br>
+// CHECK-NEXT: [ 5, callee_1_2_1, 3 ]<br>
+// CHECK-NEXT: [ 5, callee_1_2_2, 4 ]<br>
+// CHECK-NEXT: [ 5, callee_2_1_1, 5 ]<br>
+// CHECK-NEXT: [ 6, callee_1_1_1, 1 ]<br>
+// CHECK-NEXT: [ 6, callee_1_1_2, 2 ]<br>
+// CHECK-NEXT: [ 6, callee_1_2_1, 3 ]<br>
+// CHECK-NEXT: [ 6, callee_1_2_2, 4 ]<br>
+// CHECK-NEXT: [ 6, callee_2_1_1, 5 ]<br>
+// CHECK-NEXT: [ 6, callee_2_1_2, 6 ]<br>
+// CHECK-NEXT: [ 7, callee_1_1_1, 1 ]<br>
+// CHECK-NEXT: [ 7, callee_1_1_2, 2 ]<br>
+// CHECK-NEXT: [ 7, callee_1_2_1, 3 ]<br>
+// CHECK-NEXT: [ 7, callee_1_2_2, 4 ]<br>
+// CHECK-NEXT: [ 7, callee_2_1_1, 5 ]<br>
+// CHECK-NEXT: [ 7, callee_2_1_2, 6 ]<br>
+// CHECK-NEXT: [ 7, callee_2_2_1, 7 ]<br>
+// CHECK-NEXT: [ 9, callee_1_1_1, 1 ]<br>
+// CHECK-NEXT: [ 10, callee_1_1_1, 1 ]<br>
+// CHECK-NEXT: [ 10, callee_1_1_2, 2 ]<br>
+// CHECK-NEXT: [ 11, callee_1_1_1, 1 ]<br>
+// CHECK-NEXT: [ 11, callee_1_1_2, 2 ]<br>
+// CHECK-NEXT: [ 11, callee_1_2_1, 3 ]<br>
+// CHECK-NEXT: [ 12, callee_1_1_1, 1 ]<br>
+// CHECK-NEXT: [ 12, callee_1_1_2, 2 ]<br>
+// CHECK-NEXT: [ 12, callee_1_2_1, 3 ]<br>
+// CHECK-NEXT: [ 12, callee_1_2_2, 4 ]<br>
+// CHECK-NEXT: [ 13, callee_1_1_1, 1 ]<br>
+// CHECK-NEXT: [ 13, callee_1_1_2, 2 ]<br>
+// CHECK-NEXT: [ 13, callee_1_2_1, 3 ]<br>
+// CHECK-NEXT: [ 13, callee_1_2_2, 4 ]<br>
+// CHECK-NEXT: [ 13, callee_2_1_1, 5 ]<br>
+// CHECK-NEXT: [ 14, callee_1_1_1, 1 ]<br>
+// CHECK-NEXT: [ 14, callee_1_1_2, 2 ]<br>
+// CHECK-NEXT: [ 14, callee_1_2_1, 3 ]<br>
+// CHECK-NEXT: [ 14, callee_1_2_2, 4 ]<br>
+// CHECK-NEXT: [ 14, callee_2_1_1, 5 ]<br>
+// CHECK-NEXT: [ 14, callee_2_1_2, 6 ]<br>
+// CHECK-NEXT: [ 15, callee_1_1_1, 1 ]<br>
+// CHECK-NEXT: [ 15, callee_1_1_2, 2 ]<br>
+// CHECK-NEXT: [ 15, callee_1_2_1, 3 ]<br>
+// CHECK-NEXT: [ 15, callee_1_2_2, 4 ]<br>
+// CHECK-NEXT: [ 15, callee_2_1_1, 5 ]<br>
+// CHECK-NEXT: [ 15, callee_2_1_2, 6 ]<br>
+// CHECK-NEXT: [ 15, callee_2_2_1, 7 ]<br>
+// CHECK-NEXT: [ 17, callee_1_1_1, 1 ]<br>
+// CHECK-NEXT: [ 18, callee_1_1_1, 1 ]<br>
+// CHECK-NEXT: [ 18, callee_1_1_2, 2 ]<br>
+// CHECK-NEXT: [ 19, callee_1_1_1, 1 ]<br>
+// CHECK-NEXT: [ 19, callee_1_1_2, 2 ]<br>
+// CHECK-NEXT: [ 19, callee_1_2_1, 3 ]<br>
+// CHECK-NEXT: [ 20, callee_1_1_1, 1 ]<br>
+// CHECK-NEXT: [ 20, callee_1_1_2, 2 ]<br>
+// CHECK-NEXT: [ 20, callee_1_2_1, 3 ]<br>
+// CHECK-NEXT: [ 20, callee_1_2_2, 4 ]<br>
+// CHECK-NEXT: [ 21, callee_1_1_1, 1 ]<br>
+// CHECK-NEXT: [ 21, callee_1_1_2, 2 ]<br>
+// CHECK-NEXT: [ 21, callee_1_2_1, 3 ]<br>
+// CHECK-NEXT: [ 21, callee_1_2_2, 4 ]<br>
+// CHECK-NEXT: [ 21, callee_2_1_1, 5 ]<br>
+// CHECK-NEXT: [ 22, callee_1_1_1, 1 ]<br>
+// CHECK-NEXT: [ 22, callee_1_1_2, 2 ]<br>
+// CHECK-NEXT: [ 22, callee_1_2_1, 3 ]<br>
+// CHECK-NEXT: [ 22, callee_1_2_2, 4 ]<br>
+// CHECK-NEXT: [ 22, callee_2_1_1, 5 ]<br>
+<br>
<br>
<br>
_______________________________________________<br>
llvm-commits mailing list<br>
<a href="mailto:llvm-commits@lists.llvm.org">llvm-commits@lists.llvm.org</a><br>
<a href="http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-commits" rel="noreferrer" target="_blank">http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-commits</a><br>
</blockquote></div><br></div></div>