<div dir="ltr">Hi Uri,<br><br>I tried to reproduce it on goldbolt with clang 12.0.0 and 12.0.1 but things seem fine when I run it there: <a href="https://godbolt.org/z/vrq8j6Kj7">https://godbolt.org/z/vrq8j6Kj7</a>.<br>Can you share your exact clang invocation? Does it only reproduce in some specific environment?<br><br>Also, it generally helps to reduce code bug reports as much as possible; creduce can help with that: <a href="https://embed.cs.utah.edu/creduce/using/">https://embed.cs.utah.edu/creduce/using/</a>.<br><br>-Jakub</div><br><div class="gmail_quote"><div dir="ltr" class="gmail_attr">On Thu, Sep 23, 2021 at 10:14 PM Blumenthal, Uri - 0553 - MITLL via llvm-dev <<a href="mailto:llvm-dev@lists.llvm.org">llvm-dev@lists.llvm.org</a>> wrote:<br></div><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex"><div lang="EN-US" style="overflow-wrap: break-word;"><div class="gmail-m_-5034582061467283498WordSection1"><p class="MsoNormal"><span style="font-size:12pt">I’m not sure if this is the correct list, so please direct me to the right one if this bug report shouldn’t go here.<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt"><u></u> <u></u></span></p><p class="MsoNormal"><span style="font-size:12pt">The problem is: invoking clang (v12) with -O2 or better optimization flags generates wrong object code for the following C++. Compiling it with -O1 generates working binary.<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt"><u></u> <u></u></span></p><p class="MsoNormal"><span style="font-size:12pt"><u></u> <u></u></span></p><p class="MsoNormal"><span style="font-size:12pt">=================<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt"><u></u> <u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier">#include <cstdint><u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier">#include <cassert><u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"><u></u> <u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier">template<size_t ROT, typename T><u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier">inline constexpr T rotl(T input)<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> {<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> static_assert(ROT > 0 && ROT < 8*sizeof(T), "Invalid rotation constant");<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> return static_cast<T>((input << ROT) | (input >> (8*sizeof(T) - ROT)));<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> }<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"><u></u> <u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier">inline void SHA3_round(uint64_t T[25], const uint64_t A[25], uint64_t RC)<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> {<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t C0 = A[0] ^ A[5] ^ A[10] ^ A[15] ^ A[20];<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t C1 = A[1] ^ A[6] ^ A[11] ^ A[16] ^ A[21];<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"><u></u> <u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> // the calculation of C2 fails for -O3 or -O2 with clang 12<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> // FWIW: it would produce a value that doesn't fit into a _signed_ 64-bit int<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t C2 = A[2] ^ A[7] ^ A[12] ^ A[17] ^ A[22];<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"><u></u> <u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t C3 = A[3] ^ A[8] ^ A[13] ^ A[18] ^ A[23];<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t C4 = A[4] ^ A[9] ^ A[14] ^ A[19] ^ A[24];<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"><u></u> <u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t D0 = rotl<1>(C0) ^ C3;<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t D1 = rotl<1>(C1) ^ C4;<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t D2 = rotl<1>(C2) ^ C0;<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t D3 = rotl<1>(C3) ^ C1;<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t D4 = rotl<1>(C4) ^ C2;<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"><u></u> <u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t B00 = A[ 0] ^ D1;<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t B01 = rotl<44>(A[ 6] ^ D2);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t B02 = rotl<43>(A[12] ^ D3);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t B03 = rotl<21>(A[18] ^ D4);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t B04 = rotl<14>(A[24] ^ D0);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> T[ 0] = B00 ^ (~B01 & B02) ^ RC;<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> T[ 1] = B01 ^ (~B02 & B03);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> T[ 2] = B02 ^ (~B03 & B04);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> T[ 3] = B03 ^ (~B04 & B00);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> T[ 4] = B04 ^ (~B00 & B01);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"><u></u> <u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t B05 = rotl<28>(A[ 3] ^ D4);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t B06 = rotl<20>(A[ 9] ^ D0);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t B07 = rotl< 3>(A[10] ^ D1);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t B08 = rotl<45>(A[16] ^ D2);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t B09 = rotl<61>(A[22] ^ D3);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> T[ 5] = B05 ^ (~B06 & B07);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> T[ 6] = B06 ^ (~B07 & B08);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> T[ 7] = B07 ^ (~B08 & B09);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> T[ 8] = B08 ^ (~B09 & B05);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> T[ 9] = B09 ^ (~B05 & B06);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"><u></u> <u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> // --- instructions starting from here can be removed<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> // and the -O3 dicrepancy is still triggered<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"><u></u> <u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t B10 = rotl< 1>(A[ 1] ^ D2);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t B11 = rotl< 6>(A[ 7] ^ D3);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t B12 = rotl<25>(A[13] ^ D4);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t B13 = rotl< 8>(A[19] ^ D0);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t B14 = rotl<18>(A[20] ^ D1);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> T[10] = B10 ^ (~B11 & B12);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> T[11] = B11 ^ (~B12 & B13);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> T[12] = B12 ^ (~B13 & B14);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> T[13] = B13 ^ (~B14 & B10);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> T[14] = B14 ^ (~B10 & B11);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"><u></u> <u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t B15 = rotl<27>(A[ 4] ^ D0);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t B16 = rotl<36>(A[ 5] ^ D1);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t B17 = rotl<10>(A[11] ^ D2);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t B18 = rotl<15>(A[17] ^ D3);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t B19 = rotl<56>(A[23] ^ D4);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> T[15] = B15 ^ (~B16 & B17);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> T[16] = B16 ^ (~B17 & B18);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> T[17] = B17 ^ (~B18 & B19);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> T[18] = B18 ^ (~B19 & B15);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> T[19] = B19 ^ (~B15 & B16);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"><u></u> <u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t B20 = rotl<62>(A[ 2] ^ D3);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t B21 = rotl<55>(A[ 8] ^ D4);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t B22 = rotl<39>(A[14] ^ D0);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t B23 = rotl<41>(A[15] ^ D1);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> const uint64_t B24 = rotl< 2>(A[21] ^ D2);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> T[20] = B20 ^ (~B21 & B22);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> T[21] = B21 ^ (~B22 & B23);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> T[22] = B22 ^ (~B23 & B24);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> T[23] = B23 ^ (~B24 & B20);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> T[24] = B24 ^ (~B20 & B21);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> }<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"><u></u> <u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier">int main()<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier">{<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> uint64_t T[25];<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"><u></u> <u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> uint64_t A[25] = {<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> 15515230172486u, 9751542238472685244u, 220181482233372672u,<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> 2303197730119u, 9537012007446913720u, 0u, 14782389640143539577u,<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> 2305843009213693952u, 1056340403235818873u, 16396894922196123648u,<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> 13438274300558u, 3440198220943040u, 0u, 3435902021559310u, 64u,<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> 14313837075027532897u, 32768u, 6880396441885696u, 14320469711924527201u,<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> 0u, 9814829303127743595u, 18014398509481984u, 14444556046857390455u,<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> 4611686018427387904u, 18041275058083100u };<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"><u></u> <u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> SHA3_round(T, A, 0x0000000000008082);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"><u></u> <u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> assert(T[0] == 16394434931424703552u);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> assert(T[1] == 10202638136074191489u);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> assert(T[2] == 6432602484395933614u);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> assert(T[3] == 10616058301262943899u);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> assert(T[4] == 14391824303596635982u);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> assert(T[5] == 5673590995284149638u);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> assert(T[6] == 15681872423764765508u);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> assert(T[7] == 11470206704342013341u);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> assert(T[8] == 8508807405493883168u);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> assert(T[9] == 9461805213344568570u);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> assert(T[10] == 8792313850970105187u);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> assert(T[11] == 13508586629627657374u);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> assert(T[12] == 5157283382205130943u);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> assert(T[13] == 375019647457809685u);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> assert(T[14] == 9294608398083155963u);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> assert(T[15] == 16923121173371064314u);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> assert(T[16] == 4737739424553008030u);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> assert(T[17] == 5823987023293412593u);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> assert(T[18] == 13908063749137376267u);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> assert(T[19] == 13781177305593198238u);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> assert(T[20] == 9673833001659673401u);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> assert(T[21] == 17282395057630454440u);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> assert(T[22] == 12906624984756985556u);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> assert(T[23] == 3081478361927354234u);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> assert(T[24] == 93297594635310132u);<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"><u></u> <u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier"> return 0;<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt;font-family:Courier">}<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt">=================<u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:12pt"><u></u> <u></u></span></p><p class="MsoNormal"><span style="font-size:12pt">Your help debugging and fixing this problem is appreciated!<u></u><u></u></span></p><div><div><p class="MsoNormal"><span style="color:black">--</span><span style="font-size:12pt;color:black"><u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:10pt;font-family:"Andale Mono";color:black">Regards,</span><span style="font-size:12pt;color:black"><u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:10pt;font-family:"Andale Mono";color:black">Uri Blumenthal Voice: (781) 981-1638 </span><span style="font-size:12pt;color:black"><u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:10pt;font-family:"Andale Mono";color:black">Secure Resilient Systems and Technologies Cell: (339) 223-5363</span><span style="font-size:12pt;color:black"><u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:10pt;font-family:"Andale Mono";color:black">MIT Lincoln Laboratory </span><span style="font-size:12pt;color:black"><u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:10pt;font-family:"Andale Mono";color:black">244 <a href="https://www.google.com/maps/search/Wood+Street,+Lexington,+MA+02420-9108?entry=gmail&source=g">Wood Street, Lexington, MA</a> <a href="https://www.google.com/maps/search/Wood+Street,+Lexington,+MA+02420-9108?entry=gmail&source=g">02420-9108</a> </span><span style="font-size:12pt;color:black"><u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:10pt;font-family:"Andale Mono";color:black"> </span><span style="font-size:12pt;color:black"><u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:10pt;font-family:"Andale Mono";color:black">Web: <a href="https://www.ll.mit.edu/biographies/uri-blumenthal" title="https://www.ll.mit.edu/biographies/uri-blumenthal" target="_blank"><span style="color:rgb(113,60,86)">https://www.ll.mit.edu/biographies/uri-blumenthal</span></a></span><span style="font-size:12pt;color:black"><u></u><u></u></span></p><p class="MsoNormal"><span style="font-size:10pt;font-family:"Andale Mono";color:black">Root CA: <a href="https://www.ll.mit.edu/llrca2.pem" title="https://www.ll.mit.edu/llrca2.pem" target="_blank"><span style="color:rgb(113,60,86)">https://www.ll.mit.edu/llrca2.pem</span></a></span><span style="font-size:12pt;color:black"><u></u><u></u></span></p><p class="MsoNormal"><span style="color:black"> </span><span style="font-size:12pt;color:black"><u></u><u></u></span></p><p class="MsoNormal"><i><span style="color:black">There are two ways to design a system. One is to make is so simple there are obviously no deficiencies.</span></i><span style="font-size:12pt;color:black"><u></u><u></u></span></p><p class="MsoNormal"><i><span style="color:black">The other is to make it so complex there are no obvious deficiencies.</span></i><span style="font-size:12pt;color:black"><u></u><u></u></span></p><p class="MsoNormal"><i><span style="color:black"> - C. A. R. Hoare</span></i><span style="font-size:12pt;color:black"><u></u><u></u></span></p></div></div><p class="MsoNormal"><u></u> <u></u></p></div></div>
_______________________________________________<br>
LLVM Developers mailing list<br>
<a href="mailto:llvm-dev@lists.llvm.org" target="_blank">llvm-dev@lists.llvm.org</a><br>
<a href="https://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-dev" rel="noreferrer" target="_blank">https://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-dev</a><br>
</blockquote></div><br clear="all"><div><br></div>-- <br><div dir="ltr" class="gmail_signature"><div>Jakub Kuderski</div></div>