You can not select more than 25 topics Topics must start with a chinese character,a letter or number, can include dashes ('-') and can be up to 35 characters long.

gi.cpp 78 kB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167
  1. /**
  2. * \file dnn/test/fallback/gi.cpp
  3. * MegEngine is Licensed under the Apache License, Version 2.0 (the "License")
  4. *
  5. * Copyright (c) 2014-2022 Megvii Inc. All rights reserved.
  6. *
  7. * Unless required by applicable law or agreed to in writing,
  8. * software distributed under the License is distributed on an
  9. * "AS IS" BASIS, WITHOUT ARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  10. */
  11. #include <vector>
  12. #include "test/fallback/fixture.h"
  13. #include "src/fallback/general_intrinsic/gi_float.h"
  14. #include "src/fallback/general_intrinsic/gi_int.h"
  15. namespace megdnn {
  16. namespace test {
  17. #define SIMD_LEN GI_SIMD_LEN_BYTE / sizeof(float)
  18. #define SIMD_LEN_16 GI_SIMD_LEN_BYTE / sizeof(int16_t)
  19. #define SIMD_LEN_8 GI_SIMD_LEN_BYTE / sizeof(int8_t)
  20. template <typename T>
  21. static void init(
  22. T* dst, const std::vector<T>& value, const size_t simd_len = SIMD_LEN) {
  23. for (size_t i = 0; i < simd_len; i++) {
  24. dst[i] = value[i];
  25. }
  26. }
  27. template <typename T>
  28. static void assert_eq(T* a, const std::vector<T>& b, const size_t simd_len = SIMD_LEN) {
  29. for (size_t i = 0; i < simd_len; i++) {
  30. ASSERT_EQ(a[i], b[i]);
  31. }
  32. }
  33. template <typename T>
  34. static void assert_eq_and_nan(
  35. T* a, const std::vector<T>& b, const size_t simd_len = SIMD_LEN) {
  36. for (size_t i = 0; i < simd_len; i++) {
  37. if (isnan(a[i]) && isnan(b[i])) {
  38. continue;
  39. }
  40. ASSERT_EQ(a[i], b[i]);
  41. }
  42. }
  43. static void assert_lt(
  44. float* a, const std::vector<float>& b, const float eps,
  45. const size_t simd_len = SIMD_LEN) {
  46. for (size_t i = 0; i < simd_len; i++) {
  47. ASSERT_LT(std::abs(a[i] - b[i]), eps);
  48. }
  49. }
  50. TEST_F(FALLBACK, GiGetSimdType) {
  51. auto t = GiGetSimdType();
  52. auto should_type = GI_UNKNOWN;
  53. #if defined(GI_AVX_INTRINSICS) || defined(GI_AVX2_INTRINSICS) || \
  54. defined(GI_FMA_INTRINSICS)
  55. should_type = GI_AVX;
  56. #elif defined(GI_NEON_INTRINSICS)
  57. should_type = GI_NEON;
  58. #elif defined(GI_SSE2_INTRINSICS) || defined(GI_SSE42_INTRINSICS)
  59. #if defined(GI_SSE42_INTRINSICS)
  60. should_type = GI_SSE42;
  61. #elif defined(GI_SSE2_INTRINSICS)
  62. should_type = GI_SSE2;
  63. #else
  64. should_type = GI_UNKNOWN;
  65. #error "code issue happened!!"
  66. #endif
  67. #else
  68. should_type = GI_NAIVE;
  69. #endif
  70. printf("test GiGetSimdType: %d, should_type: %d\n", t, should_type);
  71. ASSERT_EQ(t, should_type);
  72. }
  73. TEST_F(FALLBACK, GiAndInt32) {
  74. GI_INT32_t src0, src1, ret;
  75. std::vector<int32_t> s0{1, 2, 3, 4};
  76. s0.resize(SIMD_LEN);
  77. std::vector<int32_t> s1{5, 6, 7, 8};
  78. s1.resize(SIMD_LEN);
  79. init((int32_t*)&src0, s0);
  80. init((int32_t*)&src1, s1);
  81. ret = GiAndInt32(src0, src1);
  82. std::vector<int32_t> naive;
  83. for (size_t i = 0; i < SIMD_LEN; i++) {
  84. naive.push_back(s0[i] & s1[i]);
  85. }
  86. assert_eq((int32_t*)&ret, naive);
  87. }
  88. TEST_F(FALLBACK, GiOrInt32) {
  89. GI_INT32_t src0, src1, ret;
  90. std::vector<int32_t> s0{1, 2, 3, 4};
  91. s0.resize(SIMD_LEN);
  92. std::vector<int32_t> s1{5, 6, 7, 8};
  93. s1.resize(SIMD_LEN);
  94. init((int32_t*)&src0, s0);
  95. init((int32_t*)&src1, s1);
  96. ret = GiOrInt32(src0, src1);
  97. std::vector<int32_t> naive;
  98. for (size_t i = 0; i < SIMD_LEN; i++) {
  99. naive.push_back(s0[i] | s1[i]);
  100. }
  101. assert_eq((int*)&ret, naive);
  102. }
  103. TEST_F(FALLBACK, GiAndNotInt32) {
  104. GI_INT32_t src0, src1, ret;
  105. std::vector<int32_t> s0{1, 2, 3, 4};
  106. s0.resize(SIMD_LEN);
  107. std::vector<int32_t> s1{5, 6, 7, 8};
  108. s1.resize(SIMD_LEN);
  109. init((int32_t*)&src0, s0);
  110. init((int32_t*)&src1, s1);
  111. ret = GiAndNotInt32(src0, src1);
  112. std::vector<int32_t> naive;
  113. for (size_t i = 0; i < SIMD_LEN; i++) {
  114. naive.push_back(~s0[i] & s1[i]);
  115. }
  116. assert_eq((int32_t*)&ret, naive);
  117. }
  118. TEST_F(FALLBACK, GiXorInt32) {
  119. GI_INT32_t src0, src1, ret;
  120. std::vector<int32_t> s0{1, 2, 3, 4};
  121. s0.resize(SIMD_LEN);
  122. std::vector<int32_t> s1{5, 6, 7, 8};
  123. s1.resize(SIMD_LEN);
  124. init((int32_t*)&src0, s0);
  125. init((int32_t*)&src1, s1);
  126. ret = GiXorInt32(src0, src1);
  127. std::vector<int32_t> naive;
  128. for (size_t i = 0; i < SIMD_LEN; i++) {
  129. naive.push_back(s0[i] ^ s1[i]);
  130. }
  131. assert_eq((int32_t*)&ret, naive);
  132. }
  133. TEST_F(FALLBACK, GiBroadcastFloat32) {
  134. GI_FLOAT32_t ret;
  135. float b = 2022.0420;
  136. ret = GiBroadcastFloat32(b);
  137. std::vector<float> naive;
  138. for (size_t i = 0; i < SIMD_LEN; i++) {
  139. naive.push_back(b);
  140. }
  141. assert_eq((float*)&ret, naive);
  142. }
  143. TEST_F(FALLBACK, GiBroadcastInt32) {
  144. GI_INT32_t ret;
  145. int32_t b = 20220420;
  146. ret = GiBroadcastInt32(b);
  147. std::vector<int32_t> naive;
  148. for (size_t i = 0; i < SIMD_LEN; i++) {
  149. naive.push_back(b);
  150. }
  151. assert_eq((int32_t*)&ret, naive);
  152. }
  153. TEST_F(FALLBACK, GiReinterpretAsInt32) {
  154. GI_INT32_t ret;
  155. GI_FLOAT32_t src0;
  156. std::vector<float> s0{1.0f, 2.2f, 3.4f, 4.5f};
  157. s0.resize(SIMD_LEN);
  158. init((float*)&src0, s0);
  159. ret = GiReinterpretAsInt32(src0);
  160. std::vector<int32_t> naive;
  161. for (size_t i = 0; i < SIMD_LEN; i++) {
  162. int32_t tmp;
  163. memcpy(&tmp, &s0[i], sizeof(int32_t));
  164. naive.push_back(tmp);
  165. }
  166. assert_eq((int32_t*)&ret, naive);
  167. }
  168. TEST_F(FALLBACK, GiReinterpretAsUint32) {
  169. GI_UINT32_t ret;
  170. GI_FLOAT32_t src0;
  171. std::vector<float> s0{1.0f, 2.2f, 3.4f, 4.5f};
  172. s0.resize(SIMD_LEN);
  173. init((float*)&src0, s0);
  174. ret = GiReinterpretAsUint32(src0);
  175. std::vector<uint32_t> naive;
  176. for (size_t i = 0; i < SIMD_LEN; i++) {
  177. uint32_t tmp;
  178. memcpy(&tmp, &s0[i], sizeof(uint32_t));
  179. naive.push_back(tmp);
  180. }
  181. assert_eq((uint32_t*)&ret, naive);
  182. }
  183. TEST_F(FALLBACK, GiReintInt32ToFloat32) {
  184. GI_FLOAT32_t ret;
  185. GI_INT32_t src0;
  186. std::vector<int32_t> s0{1, 2, 3, 4};
  187. s0.resize(SIMD_LEN);
  188. init((int32_t*)&src0, s0);
  189. ret = GiReintInt32ToFloat32(src0);
  190. std::vector<float> naive;
  191. for (size_t i = 0; i < SIMD_LEN; i++) {
  192. float tmp;
  193. memcpy(&tmp, &s0[i], sizeof(float));
  194. naive.push_back(tmp);
  195. }
  196. assert_eq((float*)&ret, naive);
  197. }
  198. TEST_F(FALLBACK, GiReintUint32ToFloat32) {
  199. GI_FLOAT32_t ret;
  200. GI_UINT32_t src0;
  201. std::vector<uint32_t> s0{1, 2, 3, 4};
  202. s0.resize(SIMD_LEN);
  203. init((uint32_t*)&src0, s0);
  204. ret = GiReintUint32ToFloat32(src0);
  205. std::vector<float> naive;
  206. for (size_t i = 0; i < SIMD_LEN; i++) {
  207. float tmp;
  208. memcpy(&tmp, &s0[i], sizeof(float));
  209. naive.push_back(tmp);
  210. }
  211. assert_eq((float*)&ret, naive);
  212. }
  213. TEST_F(FALLBACK, GiRoundAsInt32) {
  214. GI_FLOAT32_t src0;
  215. GI_INT32_t ret;
  216. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  217. s0.resize(SIMD_LEN);
  218. init((float*)&src0, s0);
  219. ret = GiRoundAsInt32(src0);
  220. std::vector<int32_t> naive;
  221. for (size_t i = 0; i < SIMD_LEN; i++) {
  222. naive.push_back((int32_t)round(s0[i]));
  223. }
  224. assert_eq((int*)&ret, naive);
  225. }
  226. TEST_F(FALLBACK, GiCastToInt32) {
  227. GI_FLOAT32_t src0;
  228. GI_INT32_t ret;
  229. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  230. s0.resize(SIMD_LEN);
  231. init((float*)&src0, s0);
  232. ret = GiCastToInt32(src0);
  233. std::vector<int32_t> naive;
  234. for (size_t i = 0; i < SIMD_LEN; i++) {
  235. naive.push_back((int32_t)(s0[i]));
  236. }
  237. assert_eq((int*)&ret, naive);
  238. }
  239. TEST_F(FALLBACK, GiCastToFloat32) {
  240. GI_INT32_t src0;
  241. GI_FLOAT32_t ret;
  242. std::vector<int32_t> s0{100, 200, 300, 400};
  243. s0.resize(SIMD_LEN);
  244. init((int32_t*)&src0, s0);
  245. ret = GiCastToFloat32(src0);
  246. std::vector<float> naive;
  247. for (size_t i = 0; i < SIMD_LEN; i++) {
  248. naive.push_back((float)s0[i]);
  249. }
  250. assert_eq((float*)&ret, naive);
  251. }
  252. TEST_F(FALLBACK, GiLoadBroadcastFloat32) {
  253. GI_FLOAT32_t ret;
  254. float p = 2022.0420;
  255. ret = GiLoadBroadcastFloat32(&p);
  256. std::vector<float> naive;
  257. for (size_t i = 0; i < SIMD_LEN; i++) {
  258. naive.push_back(p);
  259. }
  260. assert_eq((float*)&ret, naive);
  261. }
  262. TEST_F(FALLBACK, GiZeroFloat32) {
  263. GI_FLOAT32_t ret;
  264. memset(&ret, 'f', sizeof(GI_FLOAT32_t));
  265. float p = 0;
  266. ret = GiZeroFloat32();
  267. std::vector<float> naive;
  268. for (size_t i = 0; i < SIMD_LEN; i++) {
  269. naive.push_back(p);
  270. }
  271. assert_eq((float*)&ret, naive);
  272. }
  273. TEST_F(FALLBACK, GiLoadFloat32) {
  274. GI_FLOAT32_t ret;
  275. std::vector<float> s0{2.3f, 4.7f, -1.4f, 1223.6f};
  276. s0.resize(SIMD_LEN);
  277. ret = GiLoadFloat32(s0.data());
  278. std::vector<float> naive;
  279. for (size_t i = 0; i < SIMD_LEN; i++) {
  280. naive.push_back(s0[i]);
  281. }
  282. assert_eq((float*)&ret, naive);
  283. }
  284. TEST_F(FALLBACK, GiLoadFloat32LowHalf) {
  285. GI_FLOAT32_t ret;
  286. std::vector<float> s0{2.3f, 4.7f, -1.4f, 1223.6f};
  287. s0.resize(SIMD_LEN);
  288. ret = GiLoadFloat32LowHalf(s0.data());
  289. std::vector<float> naive;
  290. for (size_t i = 0; i < SIMD_LEN; i++) {
  291. if (i < SIMD_LEN / 2) {
  292. naive.push_back(s0[i]);
  293. } else {
  294. naive.push_back(0);
  295. }
  296. }
  297. assert_eq((float*)&ret, naive);
  298. }
  299. TEST_F(FALLBACK, GiMlaqFloat32) {
  300. GI_FLOAT32_t src0, src1, src2, ret;
  301. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  302. std::vector<float> s1{2312.1f, 345.244f, 3.59f, -12.8f};
  303. std::vector<float> s2{1.2f, -3.1f, 9.0f, 11.2f};
  304. s0.resize(SIMD_LEN);
  305. s1.resize(SIMD_LEN);
  306. s2.resize(SIMD_LEN);
  307. init((float*)&src0, s0);
  308. init((float*)&src1, s1);
  309. init((float*)&src2, s2);
  310. ret = GiMlaqFloat32(src0, src1, src2);
  311. std::vector<float> naive;
  312. for (size_t i = 0; i < SIMD_LEN; i++) {
  313. naive.push_back(s0[i] + (s1[i] * s2[i]));
  314. }
  315. assert_eq((float*)&ret, naive);
  316. }
  317. TEST_F(FALLBACK, GiUzpqFloat32) {
  318. GI_FLOAT32_t src0, src1;
  319. GI_FLOAT32_V2_t ret;
  320. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  321. std::vector<float> s1{2312.1f, 345.244f, 3.59f, -12.8f};
  322. s0.resize(SIMD_LEN);
  323. s1.resize(SIMD_LEN);
  324. init((float*)&src0, s0);
  325. init((float*)&src1, s1);
  326. ret = GiUzpqFloat32(src0, src1);
  327. std::vector<float> naive0;
  328. std::vector<float> naive1;
  329. naive0.push_back(s0[0]);
  330. naive0.push_back(s0[2]);
  331. naive0.push_back(s1[0]);
  332. naive0.push_back(s1[2]);
  333. naive1.push_back(s0[1]);
  334. naive1.push_back(s0[3]);
  335. naive1.push_back(s1[1]);
  336. naive1.push_back(s1[3]);
  337. assert_eq((float*)&ret, naive0);
  338. assert_eq((float*)&ret + SIMD_LEN, naive1);
  339. }
  340. TEST_F(FALLBACK, GiDupFloat32) {
  341. float32x2_t ret;
  342. float t = 3.1415;
  343. ret = GiDupFloat32(t);
  344. auto r = (float*)&ret;
  345. ASSERT_EQ(*r, t);
  346. ASSERT_EQ(*(r + 1), t);
  347. }
  348. TEST_F(FALLBACK, GiLdFloat32) {
  349. float32x2_t ret;
  350. std::vector<float> s0{1.1f, -3.1415f};
  351. ret = GiLdFloat32(s0.data());
  352. auto r = (float*)&ret;
  353. ASSERT_EQ(*r, s0[0]);
  354. ASSERT_EQ(*(r + 1), s0[1]);
  355. }
  356. TEST_F(FALLBACK, GiAddDFloat32) {
  357. float32x2_t src0, src1, ret;
  358. std::vector<float> s0{1.1f, -3.1415f};
  359. std::vector<float> s1{2.3f, 3.14777f};
  360. memcpy(&src0, s0.data(), sizeof(float32x2_t));
  361. memcpy(&src1, s1.data(), sizeof(float32x2_t));
  362. ret = GiAddDFloat32(src0, src1);
  363. auto r = (float*)&ret;
  364. auto naive0 = s0[0] + s1[0];
  365. auto naive1 = s0[1] + s1[1];
  366. ASSERT_EQ(*r, naive0);
  367. ASSERT_EQ(*(r + 1), naive1);
  368. }
  369. TEST_F(FALLBACK, GiGetLaneFloat32) {
  370. float32x2_t src0;
  371. std::vector<float> s0{1.1f, -3.1415f};
  372. memcpy(&src0, s0.data(), sizeof(float32x2_t));
  373. auto ret = GiGetLaneFloat32(src0, 0);
  374. ASSERT_EQ(ret, s0[0]);
  375. ret = GiGetLaneFloat32(src0, 1);
  376. ASSERT_EQ(ret, s0[1]);
  377. }
  378. TEST_F(FALLBACK, GiSetLaneFloat32) {
  379. float32x2_t src0, ret;
  380. std::vector<float> s0{2.1f, -3.1415f};
  381. memcpy(&src0, s0.data(), sizeof(float32x2_t));
  382. float p = 2022.0420;
  383. auto r = (float*)&ret;
  384. ret = GiSetLaneFloat32(p, src0, 0);
  385. ASSERT_EQ(*r, p);
  386. ASSERT_EQ(*(r + 1), s0[1]);
  387. ret = GiSetLaneFloat32(p, src0, 1);
  388. ASSERT_EQ(*r, s0[0]);
  389. ASSERT_EQ(*(r + 1), p);
  390. }
  391. TEST_F(FALLBACK, GiSt1Float32) {
  392. float32x2_t src0;
  393. std::vector<float> s0{2.1f, -3.1415f};
  394. memcpy(&src0, s0.data(), sizeof(float32x2_t));
  395. std::vector<float> ret{0, 0};
  396. GiSt1Float32(ret.data(), src0);
  397. ASSERT_EQ(ret[0], s0[0]);
  398. ASSERT_EQ(ret[1], s0[1]);
  399. }
  400. TEST_F(FALLBACK, GiLd2qFloat32) {
  401. GI_FLOAT32_V2_t ret;
  402. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f, 2312.1f, 345.244f, 3.59f, -12.8f};
  403. ret = GiLd2qFloat32(s0.data());
  404. std::vector<float> naive0;
  405. std::vector<float> naive1;
  406. naive0.push_back(s0[0]);
  407. naive0.push_back(s0[2]);
  408. naive0.push_back(s0[4]);
  409. naive0.push_back(s0[6]);
  410. naive1.push_back(s0[1]);
  411. naive1.push_back(s0[3]);
  412. naive1.push_back(s0[5]);
  413. naive1.push_back(s0[7]);
  414. assert_eq((float*)&ret, naive0);
  415. assert_eq((float*)&ret + SIMD_LEN, naive1);
  416. }
  417. TEST_F(FALLBACK, GiExtqFloat32) {
  418. GI_FLOAT32_t src0, src1, ret;
  419. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  420. std::vector<float> s1{-9.1f, 34234.6f, 9.0f, 34.1f};
  421. s0.resize(SIMD_LEN);
  422. s1.resize(SIMD_LEN);
  423. init((float*)&src0, s0);
  424. init((float*)&src1, s1);
  425. std::vector<float> naive = {0, 0, 0, 0};
  426. auto compare = [&](const size_t n) {
  427. size_t t_count = SIMD_LEN;
  428. size_t a_count = t_count - n;
  429. for (size_t i = 0; i < a_count; i++) {
  430. naive[i] = s0[i + n];
  431. }
  432. for (size_t i = 0; i < n; i++) {
  433. naive[i + a_count] = s1[i];
  434. }
  435. assert_eq((float*)&ret, naive);
  436. };
  437. #define CB(n) \
  438. ret = GiExtqFloat32(src0, src1, n); \
  439. compare(n);
  440. CB(0)
  441. CB(1)
  442. CB(2)
  443. CB(3)
  444. #undef CB
  445. }
  446. TEST_F(FALLBACK, GiMultiplySubFloat32) {
  447. GI_FLOAT32_t src0, src1, src2, ret;
  448. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  449. std::vector<float> s1{-9.1f, 34234.6f, 9.0f, 34.1f};
  450. std::vector<float> s2{0.4f, 9.9f, 4.3f, 6.2f};
  451. s0.resize(SIMD_LEN);
  452. s1.resize(SIMD_LEN);
  453. s2.resize(SIMD_LEN);
  454. init((float*)&src0, s0);
  455. init((float*)&src1, s1);
  456. init((float*)&src2, s2);
  457. ret = GiMultiplySubFloat32(src0, src1, src2);
  458. std::vector<float> naive;
  459. for (size_t i = 0; i < SIMD_LEN; i++) {
  460. naive.push_back(s0[i] - (s1[i] * s2[i]));
  461. }
  462. assert_eq((float*)&ret, naive);
  463. }
  464. TEST_F(FALLBACK, GiLd1qLaneFloat32) {
  465. GI_FLOAT32_t src0, ret;
  466. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  467. s0.resize(SIMD_LEN);
  468. init((float*)&src0, s0);
  469. std::vector<float> naive = {0, 0, 0, 0};
  470. float buffer = 3.14159;
  471. auto compare = [&](const size_t n) {
  472. memcpy(naive.data(), s0.data(), sizeof(GI_FLOAT32_t));
  473. naive[n] = buffer;
  474. assert_eq((float*)&ret, naive);
  475. };
  476. #define CB(n) \
  477. ret = GiLd1qLaneFloat32(&buffer, src0, n); \
  478. compare(n);
  479. CB(0)
  480. CB(1)
  481. CB(2)
  482. CB(3)
  483. #undef CB
  484. }
  485. TEST_F(FALLBACK, GiSetqLaneFloat32) {
  486. GI_FLOAT32_t src0, ret;
  487. std::vector<float> s0{2.1f, 6.2f, -9.5f, 2.9f};
  488. s0.resize(SIMD_LEN);
  489. init((float*)&src0, s0);
  490. std::vector<float> naive = {0, 0, 0, 0};
  491. float buffer = 6.14159;
  492. auto compare = [&](const size_t n) {
  493. memcpy(naive.data(), s0.data(), sizeof(GI_FLOAT32_t));
  494. naive[n] = buffer;
  495. assert_eq((float*)&ret, naive);
  496. };
  497. #define CB(n) \
  498. ret = GiSetqLaneFloat32(buffer, src0, n); \
  499. compare(n);
  500. CB(0)
  501. CB(1)
  502. CB(2)
  503. CB(3)
  504. #undef CB
  505. }
  506. TEST_F(FALLBACK, GiMlaqLaneFloat32HighHalf) {
  507. GI_FLOAT32_t src0, src1, src2, ret;
  508. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  509. std::vector<float> s1{-9.1f, 34234.6f, 9.0f, 34.1f};
  510. std::vector<float> s2{0.4f, 9.9f, 4.3f, 6.2f};
  511. s0.resize(SIMD_LEN);
  512. s1.resize(SIMD_LEN);
  513. s2.resize(SIMD_LEN);
  514. init((float*)&src0, s0);
  515. init((float*)&src1, s1);
  516. init((float*)&src2, s2);
  517. std::vector<float> naive = {0, 0, 0, 0};
  518. auto compare = [&](const size_t n) {
  519. for (size_t i = 0; i < GI_SIMD_LEN_BYTE / sizeof(float); i++) {
  520. naive[i] = s0[i] + (s1[i] * s2[n + 2]);
  521. }
  522. assert_eq((float*)&ret, naive);
  523. };
  524. #define CB(n) \
  525. ret = GiMlaqLaneFloat32HighHalf(src0, src1, src2, n); \
  526. compare(n);
  527. CB(0)
  528. CB(1)
  529. #undef CB
  530. }
  531. TEST_F(FALLBACK, GiVmlaqLaneFloat32LowHalf) {
  532. GI_FLOAT32_t src0, src1, src2, ret;
  533. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  534. std::vector<float> s1{-9.1f, 34234.6f, 9.0f, 34.1f};
  535. std::vector<float> s2{0.4f, 9.9f, 4.3f, 6.2f};
  536. s0.resize(SIMD_LEN);
  537. s1.resize(SIMD_LEN);
  538. s2.resize(SIMD_LEN);
  539. init((float*)&src0, s0);
  540. init((float*)&src1, s1);
  541. init((float*)&src2, s2);
  542. std::vector<float> naive = {0, 0, 0, 0};
  543. auto compare = [&](const size_t n) {
  544. for (size_t i = 0; i < GI_SIMD_LEN_BYTE / sizeof(float); i++) {
  545. naive[i] = s0[i] + (s1[i] * s2[n]);
  546. }
  547. assert_eq((float*)&ret, naive);
  548. };
  549. #define CB(n) \
  550. ret = GiVmlaqLaneFloat32LowHalf(src0, src1, src2, n); \
  551. compare(n);
  552. CB(0)
  553. CB(1)
  554. #undef CB
  555. }
  556. TEST_F(FALLBACK, GiStoreFloat32) {
  557. GI_FLOAT32_t src0;
  558. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  559. s0.resize(SIMD_LEN);
  560. init((float*)&src0, s0);
  561. std::vector<float> ret{0};
  562. ret.resize(SIMD_LEN);
  563. GiStoreFloat32(ret.data(), src0);
  564. assert_eq(ret.data(), s0);
  565. }
  566. TEST_F(FALLBACK, GiStoreLaneXXFloat32) {
  567. GI_FLOAT32_t src0;
  568. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  569. s0.resize(SIMD_LEN);
  570. init((float*)&src0, s0);
  571. float ret{0};
  572. #define CB(n) \
  573. GiStoreLane##n##Float32(&ret, src0); \
  574. ASSERT_EQ(ret, s0[n]);
  575. CB(0)
  576. CB(1)
  577. CB(2)
  578. CB(3)
  579. #undef CB
  580. }
  581. TEST_F(FALLBACK, GiExtractLaneXXFloat32) {
  582. GI_FLOAT32_t src0;
  583. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  584. s0.resize(SIMD_LEN);
  585. init((float*)&src0, s0);
  586. float ret{0};
  587. #define CB(n) \
  588. ret = GiExtractLane##n##Float32(src0); \
  589. ASSERT_EQ(ret, s0[n]);
  590. CB(0)
  591. CB(1)
  592. CB(2)
  593. CB(3)
  594. #undef CB
  595. }
  596. TEST_F(FALLBACK, GiZipqFloat32) {
  597. GI_FLOAT32_t src0, src1;
  598. GI_FLOAT32_V2_t ret;
  599. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  600. std::vector<float> s1{2312.1f, 345.244f, 3.59f, -12.8f};
  601. s0.resize(SIMD_LEN);
  602. s1.resize(SIMD_LEN);
  603. init((float*)&src0, s0);
  604. init((float*)&src1, s1);
  605. ret = GiZipqFloat32(src0, src1);
  606. std::vector<float> naive0;
  607. std::vector<float> naive1;
  608. naive0.push_back(s0[0]);
  609. naive0.push_back(s1[0]);
  610. naive0.push_back(s0[1]);
  611. naive0.push_back(s1[1]);
  612. naive1.push_back(s0[2]);
  613. naive1.push_back(s1[2]);
  614. naive1.push_back(s0[3]);
  615. naive1.push_back(s1[3]);
  616. assert_eq((float*)&ret, naive0);
  617. assert_eq((float*)&ret + SIMD_LEN, naive1);
  618. }
  619. TEST_F(FALLBACK, GiInterleaveLowFloat32) {
  620. GI_FLOAT32_t src0, src1, ret;
  621. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  622. std::vector<float> s1{2312.1f, 345.244f, 3.59f, -12.8f};
  623. s0.resize(SIMD_LEN);
  624. s1.resize(SIMD_LEN);
  625. init((float*)&src0, s0);
  626. init((float*)&src1, s1);
  627. ret = GiInterleaveLowFloat32(src0, src1);
  628. std::vector<float> naive;
  629. naive.resize(SIMD_LEN);
  630. for (size_t i = 0; i < SIMD_LEN / 2; i++) {
  631. naive[2 * i] = s0[i];
  632. naive[2 * i + 1] = s1[i];
  633. }
  634. assert_eq((float*)&ret, naive);
  635. }
  636. TEST_F(FALLBACK, GiInterleaveHighFloat32) {
  637. GI_FLOAT32_t src0, src1, ret;
  638. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  639. std::vector<float> s1{2312.1f, 345.244f, 3.59f, -12.8f};
  640. s0.resize(SIMD_LEN);
  641. s1.resize(SIMD_LEN);
  642. init((float*)&src0, s0);
  643. init((float*)&src1, s1);
  644. ret = GiInterleaveHighFloat32(src0, src1);
  645. std::vector<float> naive;
  646. naive.resize(SIMD_LEN);
  647. for (size_t i = 0; i < SIMD_LEN / 2; i++) {
  648. naive[2 * i] = s0[i + SIMD_LEN / 2];
  649. naive[2 * i + 1] = s1[i + SIMD_LEN / 2];
  650. }
  651. assert_eq((float*)&ret, naive);
  652. }
  653. TEST_F(FALLBACK, GiAddFloat32) {
  654. GI_FLOAT32_t src0, src1, ret;
  655. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  656. std::vector<float> s1{2312.1f, 345.244f, 3.59f, -12.8f};
  657. s0.resize(SIMD_LEN);
  658. s1.resize(SIMD_LEN);
  659. init((float*)&src0, s0);
  660. init((float*)&src1, s1);
  661. ret = GiAddFloat32(src0, src1);
  662. std::vector<float> naive;
  663. for (size_t i = 0; i < SIMD_LEN; i++) {
  664. naive.push_back(s0[i] + s1[i]);
  665. }
  666. assert_eq((float*)&ret, naive);
  667. }
  668. TEST_F(FALLBACK, GiSubtractFloat32) {
  669. GI_FLOAT32_t src0, src1, ret;
  670. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  671. std::vector<float> s1{2312.1f, 345.244f, 3.59f, -12.8f};
  672. s0.resize(SIMD_LEN);
  673. s1.resize(SIMD_LEN);
  674. init((float*)&src0, s0);
  675. init((float*)&src1, s1);
  676. ret = GiSubtractFloat32(src0, src1);
  677. std::vector<float> naive;
  678. for (size_t i = 0; i < SIMD_LEN; i++) {
  679. naive.push_back(s0[i] - s1[i]);
  680. }
  681. assert_eq((float*)&ret, naive);
  682. }
  683. TEST_F(FALLBACK, GiMultiplyFloat32) {
  684. GI_FLOAT32_t src0, src1, ret;
  685. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  686. std::vector<float> s1{2312.1f, 345.244f, 3.59f, -12.8f};
  687. s0.resize(SIMD_LEN);
  688. s1.resize(SIMD_LEN);
  689. init((float*)&src0, s0);
  690. init((float*)&src1, s1);
  691. ret = GiMultiplyFloat32(src0, src1);
  692. std::vector<float> naive;
  693. for (size_t i = 0; i < SIMD_LEN; i++) {
  694. naive.push_back(s0[i] * s1[i]);
  695. }
  696. assert_eq((float*)&ret, naive);
  697. }
  698. TEST_F(FALLBACK, GiMultiplyScalerFloat32) {
  699. GI_FLOAT32_t src0, ret;
  700. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  701. s0.resize(SIMD_LEN);
  702. init((float*)&src0, s0);
  703. float scalar = 3.1415;
  704. ret = GiMultiplyScalerFloat32(src0, scalar);
  705. std::vector<float> naive;
  706. for (size_t i = 0; i < SIMD_LEN; i++) {
  707. naive.push_back(s0[i] * scalar);
  708. }
  709. assert_eq((float*)&ret, naive);
  710. }
  711. TEST_F(FALLBACK, GiMultiplyAddFloat32) {
  712. GI_FLOAT32_t src0, src1, src2, ret;
  713. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  714. std::vector<float> s1{2312.1f, 345.244f, 3.59f, -12.8f};
  715. std::vector<float> s2{12.1f, 35.244f, 23.59f, -112.8f};
  716. s0.resize(SIMD_LEN);
  717. s1.resize(SIMD_LEN);
  718. s2.resize(SIMD_LEN);
  719. init((float*)&src0, s0);
  720. init((float*)&src1, s1);
  721. init((float*)&src2, s2);
  722. ret = GiMultiplyAddFloat32(src0, src1, src2);
  723. std::vector<float> naive;
  724. for (size_t i = 0; i < SIMD_LEN; i++) {
  725. naive.push_back(s1[i] * s2[i] + s0[i]);
  726. }
  727. assert_lt((float*)&ret, naive, 1e-3);
  728. }
  729. TEST_F(FALLBACK, GiMultiplyAddScalarFloat32) {
  730. GI_FLOAT32_t src0, src1, ret;
  731. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  732. std::vector<float> s1{2312.1f, 345.244f, 3.59f, -12.8f};
  733. s0.resize(SIMD_LEN);
  734. s1.resize(SIMD_LEN);
  735. init((float*)&src0, s0);
  736. init((float*)&src1, s1);
  737. float scalar = 3.1415;
  738. ret = GiMultiplyAddScalarFloat32(src0, src1, scalar);
  739. std::vector<float> naive;
  740. for (size_t i = 0; i < SIMD_LEN; i++) {
  741. naive.push_back(s1[i] * scalar + s0[i]);
  742. }
  743. assert_eq((float*)&ret, naive);
  744. }
  745. TEST_F(FALLBACK, GiMultiplyAddLanXXFloat32) {
  746. GI_FLOAT32_t src0, src1, src2, ret;
  747. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  748. std::vector<float> s1{2312.1f, 345.244f, 3.59f, -12.8f};
  749. std::vector<float> s2{12.1f, 35.244f, 23.59f, -112.8f};
  750. s0.resize(SIMD_LEN);
  751. s1.resize(SIMD_LEN);
  752. s2.resize(SIMD_LEN);
  753. init((float*)&src0, s0);
  754. init((float*)&src1, s1);
  755. init((float*)&src2, s2);
  756. std::vector<float> naive = {0, 0, 0, 0};
  757. auto compare = [&](const size_t n) {
  758. for (size_t i = 0; i < GI_SIMD_LEN_BYTE / sizeof(float); i++) {
  759. naive[i] = s0[i] + (s1[i] * s2[n]);
  760. }
  761. assert_eq((float*)&ret, naive);
  762. };
  763. #define CB(n) \
  764. ret = GiMultiplyAddLan##n##Float32(src0, src1, src2); \
  765. compare(n);
  766. CB(0)
  767. CB(1)
  768. CB(2)
  769. CB(3)
  770. #undef CB
  771. }
  772. TEST_F(FALLBACK, GiDivideFloat32) {
  773. GI_FLOAT32_t src0, src1, ret;
  774. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  775. std::vector<float> s1{2312.1f, 345.244f, 3.59f, -12.8f};
  776. s0.resize(SIMD_LEN);
  777. s1.resize(SIMD_LEN);
  778. init((float*)&src0, s0);
  779. init((float*)&src1, s1);
  780. ret = GiDivideFloat32(src0, src1);
  781. std::vector<float> naive;
  782. for (size_t i = 0; i < SIMD_LEN; i++) {
  783. naive.push_back(s0[i] / s1[i]);
  784. }
  785. assert_lt((float*)&ret, naive, 1e-3);
  786. }
  787. TEST_F(FALLBACK, GiRecpeSFloat32) {
  788. GI_FLOAT32_t src0, src1, ret;
  789. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  790. std::vector<float> s1{2312.1f, 345.244f, 3.59f, -12.8f};
  791. s0.resize(SIMD_LEN);
  792. s1.resize(SIMD_LEN);
  793. init((float*)&src0, s0);
  794. init((float*)&src1, s1);
  795. ret = GiRecpeSFloat32(src0, src1);
  796. std::vector<float> naive;
  797. for (size_t i = 0; i < SIMD_LEN; i++) {
  798. naive.push_back(2.0f - s0[i] * s1[i]);
  799. }
  800. assert_eq((float*)&ret, naive);
  801. }
  802. TEST_F(FALLBACK, GiRecpeFloat32) {
  803. GI_FLOAT32_t src0, ret;
  804. std::vector<float> s0{100.1f, 2.2f, 3.5f, 4.9f};
  805. s0.resize(SIMD_LEN);
  806. init((float*)&src0, s0);
  807. ret = GiRecpeFloat32(src0);
  808. std::vector<float> naive;
  809. for (size_t i = 0; i < SIMD_LEN; i++) {
  810. naive.push_back(1.0f / s0[i]);
  811. }
  812. assert_lt((float*)&ret, naive, 1e-3);
  813. }
  814. TEST_F(FALLBACK, GiNegFloat32) {
  815. GI_FLOAT32_t src0, ret;
  816. std::vector<float> s0{-1.1f, 2.2f, 3.5f, 4.9f};
  817. s0.resize(SIMD_LEN);
  818. init((float*)&src0, s0);
  819. ret = GiNegFloat32(src0);
  820. std::vector<float> naive;
  821. for (size_t i = 0; i < SIMD_LEN; i++) {
  822. naive.push_back(-s0[i]);
  823. }
  824. assert_eq((float*)&ret, naive);
  825. }
  826. TEST_F(FALLBACK, GiGreaterThanFloat32) {
  827. GI_FLOAT32_t src0, src1;
  828. GI_UINT32_t ret;
  829. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  830. std::vector<float> s1{2312.1f, 0.1f, 3.59f, -12.8f};
  831. s0.resize(SIMD_LEN);
  832. s1.resize(SIMD_LEN);
  833. init((float*)&src0, s0);
  834. init((float*)&src1, s1);
  835. ret = GiGreaterThanFloat32(src0, src1);
  836. std::vector<int32_t> naive;
  837. for (size_t i = 0; i < SIMD_LEN; i++) {
  838. naive.push_back(s0[i] > s1[i] ? 0xFFFFFFFF : 0);
  839. }
  840. assert_eq((int32_t*)&ret, naive);
  841. }
  842. TEST_F(FALLBACK, GiLessThanEqFloat32) {
  843. GI_FLOAT32_t src0, src1;
  844. GI_UINT32_t ret;
  845. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  846. std::vector<float> s1{2312.1f, 0.1f, 3.59f, -12.8f};
  847. s0.resize(SIMD_LEN);
  848. s1.resize(SIMD_LEN);
  849. init((float*)&src0, s0);
  850. init((float*)&src1, s1);
  851. ret = GiLessThanEqFloat32(src0, src1);
  852. std::vector<int32_t> naive;
  853. for (size_t i = 0; i < SIMD_LEN; i++) {
  854. naive.push_back(s0[i] <= s1[i] ? 0xFFFFFFFF : 0);
  855. }
  856. assert_eq((int32_t*)&ret, naive);
  857. }
  858. TEST_F(FALLBACK, GiLessThanFloat32) {
  859. GI_FLOAT32_t src0, src1;
  860. GI_UINT32_t ret;
  861. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  862. std::vector<float> s1{1.1f, 0.1f, 3.59f, -12.8f};
  863. s0.resize(SIMD_LEN);
  864. s1.resize(SIMD_LEN);
  865. init((float*)&src0, s0);
  866. init((float*)&src1, s1);
  867. ret = GiLessThanFloat32(src0, src1);
  868. std::vector<int32_t> naive;
  869. for (size_t i = 0; i < SIMD_LEN; i++) {
  870. naive.push_back(s0[i] < s1[i] ? 0xFFFFFFFF : 0);
  871. }
  872. assert_eq((int32_t*)&ret, naive);
  873. }
  874. TEST_F(FALLBACK, GiAndFloat32) {
  875. GI_FLOAT32_t src0, src1, ret;
  876. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  877. std::vector<float> s1{2312.1f, 345.244f, 3.59f, -12.8f};
  878. s0.resize(SIMD_LEN);
  879. s1.resize(SIMD_LEN);
  880. init((float*)&src0, s0);
  881. init((float*)&src1, s1);
  882. ret = GiAndFloat32(src0, src1);
  883. std::vector<float> naive;
  884. for (size_t i = 0; i < SIMD_LEN; i++) {
  885. int32_t tmp0, tmp1, tmp;
  886. float tmp2;
  887. memcpy(&tmp0, &s0[i], sizeof(int32_t));
  888. memcpy(&tmp1, &s1[i], sizeof(int32_t));
  889. tmp = tmp0 & tmp1;
  890. memcpy(&tmp2, &tmp, sizeof(float));
  891. naive.push_back(tmp2);
  892. }
  893. assert_eq((float*)&ret, naive);
  894. }
  895. TEST_F(FALLBACK, GiOrFloat32) {
  896. GI_FLOAT32_t src0, src1, ret;
  897. std::vector<float> s0{2, 2, 3, 4};
  898. std::vector<float> s1{6, 6, 7, 8};
  899. s0.resize(SIMD_LEN);
  900. s1.resize(SIMD_LEN);
  901. init((float*)&src0, s0);
  902. init((float*)&src1, s1);
  903. ret = GiOrFloat32(src0, src1);
  904. std::vector<float> naive;
  905. for (size_t i = 0; i < SIMD_LEN; i++) {
  906. int32_t tmp0, tmp1, tmp;
  907. float tmp2;
  908. memcpy(&tmp0, &s0[i], sizeof(int32_t));
  909. memcpy(&tmp1, &s1[i], sizeof(int32_t));
  910. tmp = tmp0 | tmp1;
  911. memcpy(&tmp2, &tmp, sizeof(float));
  912. naive.push_back(tmp2);
  913. }
  914. assert_eq((float*)&ret, naive);
  915. }
  916. TEST_F(FALLBACK, GiAndNotFloat32) {
  917. GI_FLOAT32_t src0, src1, ret;
  918. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  919. std::vector<float> s1{2312.1f, 345.244f, 3.59f, -12.8f};
  920. s0.resize(SIMD_LEN);
  921. s1.resize(SIMD_LEN);
  922. init((float*)&src0, s0);
  923. init((float*)&src1, s1);
  924. ret = GiAndNotFloat32(src0, src1);
  925. std::vector<float> naive;
  926. for (size_t i = 0; i < SIMD_LEN; i++) {
  927. int32_t tmp0, tmp1, tmp;
  928. float tmp2;
  929. memcpy(&tmp0, &s0[i], sizeof(int32_t));
  930. memcpy(&tmp1, &s1[i], sizeof(int32_t));
  931. tmp = ~tmp0 & tmp1;
  932. memcpy(&tmp2, &tmp, sizeof(float));
  933. naive.push_back(tmp2);
  934. }
  935. assert_eq((float*)&ret, naive);
  936. }
  937. TEST_F(FALLBACK, GiXorFloat32) {
  938. GI_FLOAT32_t src0, src1, ret;
  939. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  940. std::vector<float> s1{2312.1f, 345.244f, 3.59f, -12.8f};
  941. s0.resize(SIMD_LEN);
  942. s1.resize(SIMD_LEN);
  943. init((float*)&src0, s0);
  944. init((float*)&src1, s1);
  945. ret = GiXorFloat32(src0, src1);
  946. std::vector<float> naive;
  947. for (size_t i = 0; i < SIMD_LEN; i++) {
  948. int32_t tmp0, tmp1, tmp;
  949. float tmp2;
  950. memcpy(&tmp0, &s0[i], sizeof(int32_t));
  951. memcpy(&tmp1, &s1[i], sizeof(int32_t));
  952. tmp = tmp0 ^ tmp1;
  953. memcpy(&tmp2, &tmp, sizeof(float));
  954. naive.push_back(tmp2);
  955. }
  956. assert_eq((float*)&ret, naive);
  957. }
  958. TEST_F(FALLBACK, GiBSLFloat32) {
  959. GI_FLOAT32_t src0, src1, ret, na;
  960. GI_UINT32_t mask;
  961. std::vector<float> s0{1.1f, 2.2f, 4.5f, 4.9f};
  962. std::vector<float> s1{2312.1f, 345.244f, 3.59f, -12.8f};
  963. std::vector<std::vector<uint32_t>> s2s = {
  964. {1, 2, 3, 0}, {0u, 0u, 0u, 0u}, {~0u, 0u, 0u, 0u},
  965. {~0u, ~0u, 0u, 0u}, {~0u, ~0u, ~0u, 0u}, {~0u, ~0u, ~0u, ~0u}};
  966. s0.resize(SIMD_LEN);
  967. s1.resize(SIMD_LEN);
  968. init((float*)&src0, s0);
  969. init((float*)&src1, s1);
  970. for (auto& s2 : s2s) {
  971. init((uint32_t*)&mask, s2);
  972. ret = GiBSLFloat32(mask, src0, src1);
  973. na = GiBlendFloat32(src0, src1, GiReintUint32ToFloat32(mask));
  974. std::vector<float> naive;
  975. naive.resize(SIMD_LEN);
  976. memcpy(naive.data(), &na, sizeof(GI_FLOAT32_t));
  977. assert_eq((float*)&ret, naive);
  978. }
  979. }
  980. TEST_F(FALLBACK, GiMaximumFloat32) {
  981. GI_FLOAT32_t src0, src1, ret;
  982. std::vector<float> s0{1.1f, 2.2f, 4.5f, 4.9f};
  983. std::vector<float> s1{2312.1f, 345.244f, 3.59f, -12.8f};
  984. s0.resize(SIMD_LEN);
  985. s1.resize(SIMD_LEN);
  986. init((float*)&src0, s0);
  987. init((float*)&src1, s1);
  988. ret = GiMaximumFloat32(src0, src1);
  989. std::vector<float> naive;
  990. for (size_t i = 0; i < SIMD_LEN; i++) {
  991. naive.push_back(Max(s0[i], s1[i]));
  992. }
  993. assert_eq((float*)&ret, naive);
  994. }
  995. TEST_F(FALLBACK, GiMinimumFloat32) {
  996. GI_FLOAT32_t src0, src1, ret;
  997. std::vector<float> s0{1.1f, 2.2f, 4.5f, 4.9f};
  998. std::vector<float> s1{2312.1f, 345.244f, 3.59f, -12.8f};
  999. s0.resize(SIMD_LEN);
  1000. s1.resize(SIMD_LEN);
  1001. init((float*)&src0, s0);
  1002. init((float*)&src1, s1);
  1003. ret = GiMinimumFloat32(src0, src1);
  1004. std::vector<float> naive;
  1005. for (size_t i = 0; i < SIMD_LEN; i++) {
  1006. naive.push_back(Min(s0[i], s1[i]));
  1007. }
  1008. assert_eq((float*)&ret, naive);
  1009. }
  1010. TEST_F(FALLBACK, GiMaxNanFloat32) {
  1011. GI_FLOAT32_t src0, src1, ret;
  1012. std::vector<float> s0{1.1f, 2.2f, 4.5f, NAN};
  1013. std::vector<float> s1{2312.1f, 345.244f, NAN, -12.8f};
  1014. s0.resize(SIMD_LEN);
  1015. s1.resize(SIMD_LEN);
  1016. init((float*)&src0, s0);
  1017. init((float*)&src1, s1);
  1018. ret = GiMaxNanFloat32(src0, src1);
  1019. std::vector<float> naive;
  1020. for (size_t i = 0; i < SIMD_LEN; i++) {
  1021. auto t = MAX_NAN(s0[i], s1[i]);
  1022. naive.push_back(t);
  1023. }
  1024. assert_eq_and_nan((float*)&ret, naive);
  1025. }
  1026. TEST_F(FALLBACK, GiMinNanFloat32) {
  1027. GI_FLOAT32_t src0, src1, ret;
  1028. std::vector<float> s0{NAN, 2.2f, NAN, 4.9f};
  1029. std::vector<float> s1{2312.1f, 345.244f, 3.59f, -12.8f};
  1030. s0.resize(SIMD_LEN);
  1031. s1.resize(SIMD_LEN);
  1032. init((float*)&src0, s0);
  1033. init((float*)&src1, s1);
  1034. ret = GiMinNanFloat32(src0, src1);
  1035. std::vector<float> naive;
  1036. for (size_t i = 0; i < SIMD_LEN; i++) {
  1037. auto t = MIN_NAN(s0[i], s1[i]);
  1038. naive.push_back(t);
  1039. }
  1040. assert_eq_and_nan((float*)&ret, naive);
  1041. }
  1042. TEST_F(FALLBACK, GiClampFloat32) {
  1043. GI_FLOAT32_t src0, src1, ret, na;
  1044. std::vector<float> s0{1.1f, 2.2f, 4.5f, 4.9f};
  1045. std::vector<float> s1{1.1f, 2.2f, 4.5f, 4.9f};
  1046. s0.resize(SIMD_LEN);
  1047. s1.resize(SIMD_LEN);
  1048. init((float*)&src0, s0);
  1049. init((float*)&src1, s1);
  1050. float LowerRange = 3.1415;
  1051. float UpperRange = 4.876;
  1052. auto naive_c = [](GI_FLOAT32_t Value, float LowerRange,
  1053. float UpperRange) -> GI_FLOAT32_t {
  1054. Value = GiMaximumFloat32(GiBroadcastFloat32(LowerRange), Value);
  1055. Value = GiMinimumFloat32(GiBroadcastFloat32(UpperRange), Value);
  1056. return Value;
  1057. };
  1058. ret = GiClampFloat32(src0, LowerRange, UpperRange);
  1059. na = naive_c(src1, LowerRange, UpperRange);
  1060. std::vector<float> naive;
  1061. naive.resize(SIMD_LEN);
  1062. memcpy(naive.data(), &na, sizeof(GI_FLOAT32_t));
  1063. assert_eq((float*)&ret, naive);
  1064. }
  1065. TEST_F(FALLBACK, GiReduceAddFloat32) {
  1066. GI_FLOAT32_t src0;
  1067. float ret{0};
  1068. std::vector<float> s0{1.1f, 2.2f, 4.5f, -4.9f};
  1069. s0.resize(SIMD_LEN);
  1070. init((float*)&src0, s0);
  1071. ret = GiReduceAddFloat32(src0);
  1072. float naive{0};
  1073. for (size_t i = 0; i < SIMD_LEN; i++) {
  1074. naive += s0[i];
  1075. }
  1076. ASSERT_LT(std::abs(ret - naive), 1e-3);
  1077. }
  1078. TEST_F(FALLBACK, GiReduceMultiplyFloat32) {
  1079. GI_FLOAT32_t src0;
  1080. float ret{0};
  1081. std::vector<float> s0{1.1f, 2.2f, 4.5f, -4.9f};
  1082. s0.resize(SIMD_LEN);
  1083. init((float*)&src0, s0);
  1084. ret = GiReduceMultiplyFloat32(src0);
  1085. float naive{1};
  1086. for (size_t i = 0; i < SIMD_LEN; i++) {
  1087. naive *= s0[i];
  1088. }
  1089. ASSERT_LT(std::abs(ret - naive), 1e-3);
  1090. }
  1091. TEST_F(FALLBACK, GiReduceMaxNanFloat32) {
  1092. GI_FLOAT32_t src0;
  1093. float ret{0};
  1094. std::vector<float> s0{1.1f, 2.2f, 4.9f, -4.9f};
  1095. s0.resize(SIMD_LEN);
  1096. init((float*)&src0, s0);
  1097. ret = GiReduceMaxNanFloat32(src0);
  1098. float naive = s0[0];
  1099. for (size_t i = 0; i < SIMD_LEN; i++) {
  1100. naive = MAX_NAN(naive, s0[i]);
  1101. }
  1102. ASSERT_EQ(ret, naive);
  1103. ret = 0;
  1104. s0 = {1.1f, 2.2f, 4.9f, NAN};
  1105. init((float*)&src0, s0);
  1106. ret = GiReduceMaxNanFloat32(src0);
  1107. ASSERT_TRUE(isnan(ret));
  1108. }
  1109. TEST_F(FALLBACK, GiReduceMinNanFloat32) {
  1110. GI_FLOAT32_t src0;
  1111. float ret{0};
  1112. std::vector<float> s0{1.1f, 2.2f, 4.5f, -4.9f};
  1113. s0.resize(SIMD_LEN);
  1114. init((float*)&src0, s0);
  1115. ret = GiReduceMinNanFloat32(src0);
  1116. float naive = s0[0];
  1117. for (size_t i = 0; i < SIMD_LEN; i++) {
  1118. naive = MIN_NAN(naive, s0[i]);
  1119. }
  1120. ASSERT_EQ(ret, naive);
  1121. ret = 0;
  1122. s0 = {-1.1f, 2.2f, 4.9f, NAN};
  1123. init((float*)&src0, s0);
  1124. ret = GiReduceMaxNanFloat32(src0);
  1125. ASSERT_TRUE(isnan(ret));
  1126. }
  1127. TEST_F(FALLBACK, GiAbsFloat32) {
  1128. GI_FLOAT32_t src0, ret;
  1129. std::vector<float> s0{2312.1f, 345.244f, 3.59f, -12.8f};
  1130. s0.resize(SIMD_LEN);
  1131. init((float*)&src0, s0);
  1132. ret = GiAbsFloat32(src0);
  1133. std::vector<float> naive;
  1134. for (size_t i = 0; i < SIMD_LEN; i++) {
  1135. naive.push_back(s0[i] > 0 ? s0[i] : -s0[i]);
  1136. }
  1137. assert_eq((float*)&ret, naive);
  1138. }
  1139. TEST_F(FALLBACK, GiZip1qS64) {
  1140. GI_INT64_t src0, src1, ret;
  1141. std::vector<int64_t> s0{234242423424245, 42342342422323};
  1142. std::vector<int64_t> s1{23424245, -4234234242232};
  1143. s0.resize(SIMD_LEN / 2);
  1144. s1.resize(SIMD_LEN / 2);
  1145. memcpy(&src0, s0.data(), sizeof(GI_INT64_t));
  1146. memcpy(&src1, s1.data(), sizeof(GI_INT64_t));
  1147. ret = GiZip1qS64(src0, src1);
  1148. std::vector<int64_t> naive;
  1149. naive.push_back(s0[0]);
  1150. naive.push_back(s1[0]);
  1151. auto p = (int64_t*)&ret;
  1152. ASSERT_EQ(naive[0], p[0]);
  1153. ASSERT_EQ(naive[1], p[1]);
  1154. }
  1155. TEST_F(FALLBACK, GiZip2qS64) {
  1156. GI_INT64_t src0, src1, ret;
  1157. std::vector<int64_t> s0{234242423424245, 42342342422323};
  1158. std::vector<int64_t> s1{23424245, -4234234242232};
  1159. s0.resize(SIMD_LEN / 2);
  1160. s1.resize(SIMD_LEN / 2);
  1161. memcpy(&src0, s0.data(), sizeof(GI_INT64_t));
  1162. memcpy(&src1, s1.data(), sizeof(GI_INT64_t));
  1163. ret = GiZip2qS64(src0, src1);
  1164. std::vector<int64_t> naive;
  1165. naive.push_back(s0[1]);
  1166. naive.push_back(s1[1]);
  1167. auto p = (int64_t*)&ret;
  1168. ASSERT_EQ(naive[0], p[0]);
  1169. ASSERT_EQ(naive[1], p[1]);
  1170. }
  1171. TEST_F(FALLBACK, GiReinterpretqS64ToFloat32) {
  1172. GI_INT64_t src0;
  1173. GI_FLOAT32_t ret;
  1174. std::vector<int64_t> s0{234242423424245, 42342342422323};
  1175. s0.resize(SIMD_LEN / 2);
  1176. memcpy(&src0, s0.data(), sizeof(GI_INT64_t));
  1177. ret = GiReinterpretqS64ToFloat32(src0);
  1178. std::vector<float> naive;
  1179. naive.resize(SIMD_LEN);
  1180. memcpy(naive.data(), s0.data(), sizeof(GI_FLOAT32_t));
  1181. assert_eq((float*)&ret, naive);
  1182. }
  1183. TEST_F(FALLBACK, GiReinterpretqFloat32ToS64) {
  1184. GI_FLOAT32_t src0;
  1185. GI_INT64_t ret;
  1186. std::vector<float> s0{2312.1f, 345.244f, 3.59f, -12.8f};
  1187. s0.resize(SIMD_LEN);
  1188. init((float*)&src0, s0);
  1189. ret = GiReinterpretqFloat32ToS64(src0);
  1190. std::vector<float> naive;
  1191. naive.resize(SIMD_LEN);
  1192. memcpy(naive.data(), s0.data(), sizeof(GI_INT64_t));
  1193. assert_eq((float*)&ret, naive);
  1194. }
  1195. TEST_F(FALLBACK, GiSimdFmaLane) {
  1196. GI_FLOAT32_t src0, src1, src2, ret;
  1197. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  1198. std::vector<float> s1{2312.1f, 345.244f, 3.59f, -12.8f};
  1199. std::vector<float> s2{12.1f, 2.2f, 89.0f, -112.8f};
  1200. s0.resize(SIMD_LEN);
  1201. s1.resize(SIMD_LEN);
  1202. s2.resize(SIMD_LEN);
  1203. init((float*)&src0, s0);
  1204. init((float*)&src1, s1);
  1205. init((float*)&src2, s2);
  1206. std::vector<float> naive = {0, 0, 0, 0};
  1207. auto compare = [&](const size_t n) {
  1208. for (size_t i = 0; i < GI_SIMD_LEN_BYTE / sizeof(float); i++) {
  1209. naive[i] = s0[i] + (s1[i] * s2[n]);
  1210. }
  1211. assert_eq((float*)&ret, naive);
  1212. };
  1213. #define CB(n) \
  1214. ret = GiSimdFmaLane(src0, src1, src2, n); \
  1215. compare(n);
  1216. CB(0)
  1217. CB(1)
  1218. CB(2)
  1219. CB(3)
  1220. #undef CB
  1221. }
  1222. TEST_F(FALLBACK, GiMlaqLowLaneFloat32) {
  1223. GI_FLOAT32_t src0, src1, src2, ret;
  1224. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  1225. std::vector<float> s1{2312.1f, 345.244f, 3.59f, -12.8f};
  1226. std::vector<float> s2{12.1f, 2.2f, 89.0f, -112.8f};
  1227. s0.resize(SIMD_LEN);
  1228. s1.resize(SIMD_LEN);
  1229. s2.resize(SIMD_LEN);
  1230. init((float*)&src0, s0);
  1231. init((float*)&src1, s1);
  1232. init((float*)&src2, s2);
  1233. std::vector<float> naive = {0, 0, 0, 0};
  1234. auto compare = [&](const size_t n) {
  1235. for (size_t i = 0; i < GI_SIMD_LEN_BYTE / sizeof(float); i++) {
  1236. naive[i] = s0[i] + (s1[i] * s2[n]);
  1237. }
  1238. assert_eq((float*)&ret, naive);
  1239. };
  1240. #define CB(n) \
  1241. ret = GiMlaqLowLaneFloat32(src0, src1, src2, n); \
  1242. compare(n);
  1243. CB(0)
  1244. CB(1)
  1245. #undef CB
  1246. }
  1247. TEST_F(FALLBACK, GiMlaqHighLaneFloat32) {
  1248. GI_FLOAT32_t src0, src1, src2, ret;
  1249. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  1250. std::vector<float> s1{2312.1f, 345.244f, 3.59f, -12.8f};
  1251. std::vector<float> s2{12.1f, 2.2f, 89.0f, -112.8f};
  1252. s0.resize(SIMD_LEN);
  1253. s1.resize(SIMD_LEN);
  1254. s2.resize(SIMD_LEN);
  1255. init((float*)&src0, s0);
  1256. init((float*)&src1, s1);
  1257. init((float*)&src2, s2);
  1258. std::vector<float> naive = {0, 0, 0, 0};
  1259. auto compare = [&](const size_t n) {
  1260. for (size_t i = 0; i < GI_SIMD_LEN_BYTE / sizeof(float); i++) {
  1261. naive[i] = s0[i] + (s1[i] * s2[n]);
  1262. }
  1263. assert_eq((float*)&ret, naive);
  1264. };
  1265. #define CB(n) \
  1266. ret = GiMlaqHighLaneFloat32(src0, src1, src2, n); \
  1267. compare(n);
  1268. CB(2)
  1269. CB(3)
  1270. #undef CB
  1271. }
  1272. TEST_F(FALLBACK, GiFmsqLaneQFloat32) {
  1273. GI_FLOAT32_t src0, src1, src2, ret;
  1274. std::vector<float> s0{1.1f, 2.2f, 3.5f, 4.9f};
  1275. std::vector<float> s1{2312.1f, 345.244f, 3.59f, -12.8f};
  1276. std::vector<float> s2{12.1f, 2.2f, 89.0f, -112.8f};
  1277. s0.resize(SIMD_LEN);
  1278. s1.resize(SIMD_LEN);
  1279. s2.resize(SIMD_LEN);
  1280. init((float*)&src0, s0);
  1281. init((float*)&src1, s1);
  1282. init((float*)&src2, s2);
  1283. std::vector<float> naive = {0, 0, 0, 0};
  1284. auto compare = [&](const size_t n) {
  1285. for (size_t i = 0; i < GI_SIMD_LEN_BYTE / sizeof(float); i++) {
  1286. naive[i] = s0[i] - (s1[i] * s2[n]);
  1287. }
  1288. assert_eq((float*)&ret, naive);
  1289. };
  1290. #define CB(n) \
  1291. ret = GiFmsqLaneQFloat32(src0, src1, src2, n); \
  1292. compare(n);
  1293. CB(0)
  1294. CB(1)
  1295. CB(2)
  1296. CB(3)
  1297. #undef CB
  1298. }
  1299. TEST_F(FALLBACK, GiBroadcastUint32) {
  1300. int32_t src0 = 20220422;
  1301. GI_UINT32_t ret;
  1302. ret = GiBroadcastUint32(src0);
  1303. std::vector<uint32_t> naive;
  1304. for (size_t i = 0; i < SIMD_LEN; i++) {
  1305. naive.push_back(src0);
  1306. }
  1307. assert_eq((uint32_t*)&ret, naive);
  1308. }
  1309. TEST_F(FALLBACK, GiLoadInt32) {
  1310. std::vector<int32_t> s0{1, 2, -200, 999};
  1311. GI_INT32_t ret;
  1312. ret = GiLoadInt32(s0.data());
  1313. std::vector<uint32_t> naive;
  1314. for (size_t i = 0; i < SIMD_LEN; i++) {
  1315. naive.push_back(s0[i]);
  1316. }
  1317. assert_eq((uint32_t*)&ret, naive);
  1318. }
  1319. TEST_F(FALLBACK, GiLoadInt16) {
  1320. std::vector<int16_t> s0{1, 2, -200, 32767, -32768, 45, 3, 0};
  1321. GI_INT16_t ret;
  1322. ret = GiLoadInt16(s0.data());
  1323. auto p = (int16_t*)&ret;
  1324. for (size_t i = 0; i < SIMD_LEN_16; i++) {
  1325. ASSERT_EQ(p[i], s0[i]);
  1326. }
  1327. }
  1328. TEST_F(FALLBACK, GiLoadInt8) {
  1329. std::vector<int8_t> s0{9, 2, -128, 127, 2, 45, 3, 0,
  1330. 11, 2, -128, 127, 2, 55, 3, -1};
  1331. GI_INT8_t ret;
  1332. ret = GiLoadInt8(s0.data());
  1333. auto p = (int8_t*)&ret;
  1334. for (size_t i = 0; i < SIMD_LEN_8; i++) {
  1335. ASSERT_EQ(p[i], s0[i]);
  1336. }
  1337. }
  1338. TEST_F(FALLBACK, GiStoreInt32) {
  1339. GI_INT32_t src0;
  1340. std::vector<int32_t> s0{1, 2, -200, 999};
  1341. s0.resize(SIMD_LEN);
  1342. init((int32_t*)&src0, s0);
  1343. std::vector<int32_t> ret;
  1344. ret.resize(SIMD_LEN);
  1345. GiStoreInt32(ret.data(), src0);
  1346. assert_eq<int32_t>(ret.data(), s0);
  1347. }
  1348. TEST_F(FALLBACK, GiStoreLaneXXInt32) {
  1349. GI_INT32_t src0;
  1350. std::vector<int32_t> s0{1, 2, -200, 999};
  1351. s0.resize(SIMD_LEN);
  1352. init((int32_t*)&src0, s0);
  1353. int32_t ret = 8888;
  1354. #define CB(n) \
  1355. GiStoreLane##n##Int32(&ret, src0); \
  1356. ASSERT_EQ(s0[n], ret);
  1357. CB(0)
  1358. CB(1)
  1359. CB(2)
  1360. CB(3)
  1361. }
  1362. TEST_F(FALLBACK, GiReinterInt32ToInt8) {
  1363. GI_INT32_t src0;
  1364. GI_INT8_t ret, naive;
  1365. std::vector<int32_t> s0{65536, 2, -200, 999};
  1366. s0.resize(SIMD_LEN);
  1367. init((int32_t*)&src0, s0);
  1368. ret = GiReinterInt32ToInt8(src0);
  1369. naive = (GI_INT8_t)src0;
  1370. ASSERT_FALSE(memcmp(&ret, &naive, sizeof(GI_INT8_t)));
  1371. }
  1372. TEST_F(FALLBACK, GiStoreInt16) {
  1373. GI_INT16_t src0;
  1374. std::vector<int16_t> s0{32767, 2, -200, -32768, 1, 2, 3, 4};
  1375. s0.resize(SIMD_LEN_16);
  1376. init((int16_t*)&src0, s0, SIMD_LEN_16);
  1377. std::vector<int16_t> ret;
  1378. ret.resize(SIMD_LEN_16);
  1379. GiStoreInt16(ret.data(), src0);
  1380. assert_eq<int16_t>(ret.data(), s0, SIMD_LEN_16);
  1381. }
  1382. TEST_F(FALLBACK, GiStoreInt8) {
  1383. GI_INT8_t src0;
  1384. std::vector<int8_t> s0{127, 2, 56, -128, 1, 2, 3, 4, 127, 2, 56, -128, 1, 2, 3, 4};
  1385. s0.resize(SIMD_LEN_8);
  1386. init((int8_t*)&src0, s0, SIMD_LEN_8);
  1387. std::vector<int8_t> ret;
  1388. ret.resize(SIMD_LEN_8);
  1389. GiStoreInt8(ret.data(), src0);
  1390. assert_eq<int8_t>(ret.data(), s0, SIMD_LEN_8);
  1391. }
  1392. TEST_F(FALLBACK, GiStoreLowInt8) {
  1393. GI_INT8_t src0;
  1394. std::vector<int8_t> s0{127, 2, 56, -128, 1, 2, 3, 4, 127, 2, 56, -128, 1, 2, 3, 4};
  1395. s0.resize(SIMD_LEN_8);
  1396. init((int8_t*)&src0, s0, SIMD_LEN_8);
  1397. std::vector<int8_t> ret;
  1398. ret.resize(SIMD_LEN_8 / 2);
  1399. GiStoreLowInt8(ret.data(), src0);
  1400. assert_eq<int8_t>(ret.data(), s0, SIMD_LEN_8 / 2);
  1401. }
  1402. TEST_F(FALLBACK, GiStoreHihgInt8) {
  1403. GI_INT8_t src0;
  1404. std::vector<int8_t> s0{127, 2, 56, -128, 1, 2, 3, 4, 127, 2, 56, -128, 1, 2, 3, 4};
  1405. s0.resize(SIMD_LEN_8);
  1406. init((int8_t*)&src0, s0, SIMD_LEN_8);
  1407. std::vector<int8_t> ret;
  1408. ret.resize(SIMD_LEN_8 / 2);
  1409. GiStoreHihgInt8(ret.data(), src0);
  1410. std::vector<int8_t> naive;
  1411. for (size_t i = 0; i < SIMD_LEN_8 / 2; i++) {
  1412. naive.push_back(s0[SIMD_LEN_8 / 2 + i]);
  1413. }
  1414. assert_eq<int8_t>(ret.data(), naive, SIMD_LEN_8 / 2);
  1415. }
  1416. TEST_F(FALLBACK, GiNegInt32) {
  1417. GI_INT32_t src0, ret;
  1418. std::vector<int32_t> s0{
  1419. std::numeric_limits<int32_t>::max(), std::numeric_limits<int32_t>::min(),
  1420. -3, 4};
  1421. s0.resize(SIMD_LEN);
  1422. init((int32_t*)&src0, s0);
  1423. ret = GiNegInt32(src0);
  1424. std::vector<int32_t> naive;
  1425. for (size_t i = 0; i < SIMD_LEN; i++) {
  1426. naive.push_back(-s0[i]);
  1427. }
  1428. assert_eq((int32_t*)&ret, naive);
  1429. }
  1430. TEST_F(FALLBACK, GiNegInt8) {
  1431. GI_INT8_t src0, ret;
  1432. std::vector<int8_t> s0{
  1433. std::numeric_limits<int8_t>::max(),
  1434. std::numeric_limits<int8_t>::min(),
  1435. 56,
  1436. -128,
  1437. 1,
  1438. 2,
  1439. 3,
  1440. 4,
  1441. 127,
  1442. 2,
  1443. 56,
  1444. -128,
  1445. 1,
  1446. 2,
  1447. 3,
  1448. 4};
  1449. s0.resize(SIMD_LEN_8);
  1450. init((int8_t*)&src0, s0, SIMD_LEN_8);
  1451. ret = GiNegInt8(src0);
  1452. std::vector<int8_t> naive;
  1453. for (size_t i = 0; i < SIMD_LEN_8; i++) {
  1454. naive.push_back(-s0[i]);
  1455. }
  1456. assert_eq<int8_t>((int8_t*)&ret, naive, SIMD_LEN_8);
  1457. }
  1458. TEST_F(FALLBACK, GiTestAndSetUint32) {
  1459. GI_UINT32_t src0, src1, ret;
  1460. std::vector<uint32_t> s0{
  1461. 8, 2, std::numeric_limits<uint32_t>::max(),
  1462. std::numeric_limits<uint32_t>::min()};
  1463. std::vector<uint32_t> s1{
  1464. 8, 4, std::numeric_limits<uint32_t>::max(),
  1465. std::numeric_limits<uint32_t>::max()};
  1466. s0.resize(SIMD_LEN);
  1467. s1.resize(SIMD_LEN);
  1468. init((uint32_t*)&src0, s0);
  1469. init((uint32_t*)&src1, s1);
  1470. ret = GiTestAndSetUint32(src0, src1);
  1471. std::vector<uint32_t> naive;
  1472. for (size_t i = 0; i < SIMD_LEN; i++) {
  1473. naive.push_back(s0[i] & s1[i] ? 0xFFFFFFFF : 0);
  1474. }
  1475. assert_eq<uint32_t>((uint32_t*)&ret, naive);
  1476. }
  1477. TEST_F(FALLBACK, GiAddInt32) {
  1478. GI_INT32_t src0, src1, ret;
  1479. std::vector<int32_t> s0{127, 2, std::numeric_limits<int32_t>::max(), 9999};
  1480. std::vector<int32_t> s1{1, 2, std::numeric_limits<int32_t>::max(), -9};
  1481. s0.resize(SIMD_LEN);
  1482. s1.resize(SIMD_LEN);
  1483. init((int32_t*)&src0, s0);
  1484. init((int32_t*)&src1, s1);
  1485. ret = GiAddInt32(src0, src1);
  1486. std::vector<int32_t> naive;
  1487. for (size_t i = 0; i < SIMD_LEN; i++) {
  1488. naive.push_back(s0[i] + s1[i]);
  1489. }
  1490. assert_eq((int32_t*)&ret, naive);
  1491. }
  1492. TEST_F(FALLBACK, GiAddUint32) {
  1493. GI_UINT32_t src0, src1, ret;
  1494. std::vector<uint32_t> s0{127, 2, std::numeric_limits<uint32_t>::max(), 9999};
  1495. std::vector<uint32_t> s1{1, 2, std::numeric_limits<uint32_t>::max(), 9};
  1496. s0.resize(SIMD_LEN);
  1497. s1.resize(SIMD_LEN);
  1498. init((uint32_t*)&src0, s0);
  1499. init((uint32_t*)&src1, s1);
  1500. ret = GiAddUint32(src0, src1);
  1501. std::vector<uint32_t> naive;
  1502. for (size_t i = 0; i < SIMD_LEN; i++) {
  1503. naive.push_back(s0[i] + s1[i]);
  1504. }
  1505. assert_eq((uint32_t*)&ret, naive);
  1506. }
  1507. TEST_F(FALLBACK, GiAddInt16) {
  1508. GI_INT16_t src0, src1, ret;
  1509. std::vector<int16_t> s0{-127, 2, std::numeric_limits<int16_t>::max(), 9999, 1, 2,
  1510. 3, 4};
  1511. std::vector<int16_t> s1{1,
  1512. 2,
  1513. std::numeric_limits<int16_t>::max(),
  1514. std::numeric_limits<int16_t>::min(),
  1515. -1,
  1516. 23,
  1517. -3,
  1518. -5};
  1519. s0.resize(SIMD_LEN_16);
  1520. s1.resize(SIMD_LEN_16);
  1521. init((int16_t*)&src0, s0, SIMD_LEN_16);
  1522. init((int16_t*)&src1, s1, SIMD_LEN_16);
  1523. ret = GiAddInt16(src0, src1);
  1524. std::vector<int16_t> naive;
  1525. for (size_t i = 0; i < SIMD_LEN_16; i++) {
  1526. naive.push_back(s0[i] + s1[i]);
  1527. }
  1528. assert_eq<int16_t>((int16_t*)&ret, naive, SIMD_LEN_16);
  1529. }
  1530. TEST_F(FALLBACK, GiAddInt8) {
  1531. GI_INT8_t src0, src1, ret;
  1532. std::vector<int8_t> s0{
  1533. std::numeric_limits<int8_t>::max(),
  1534. std::numeric_limits<int8_t>::min(),
  1535. 56,
  1536. -128,
  1537. 1,
  1538. 2,
  1539. 3,
  1540. 4,
  1541. 127,
  1542. 2,
  1543. 56,
  1544. -128,
  1545. 1,
  1546. 2,
  1547. 3,
  1548. 4};
  1549. std::vector<int8_t> s1{
  1550. 3,
  1551. std::numeric_limits<int8_t>::max(),
  1552. std::numeric_limits<int8_t>::min(),
  1553. 56,
  1554. -128,
  1555. 1,
  1556. 2,
  1557. 3,
  1558. 4,
  1559. 127,
  1560. 2,
  1561. 56,
  1562. -128,
  1563. 1,
  1564. 2,
  1565. 4};
  1566. s0.resize(SIMD_LEN_8);
  1567. s1.resize(SIMD_LEN_8);
  1568. init((int8_t*)&src0, s0, SIMD_LEN_8);
  1569. init((int8_t*)&src1, s1, SIMD_LEN_8);
  1570. ret = GiAddInt8(src0, src1);
  1571. std::vector<int8_t> naive;
  1572. for (size_t i = 0; i < SIMD_LEN_8; i++) {
  1573. naive.push_back(s0[i] + s1[i]);
  1574. }
  1575. assert_eq<int8_t>((int8_t*)&ret, naive, SIMD_LEN_8);
  1576. }
  1577. TEST_F(FALLBACK, GiSubtractInt32) {
  1578. GI_INT32_t src0, src1, ret;
  1579. std::vector<int32_t> s0{127, 2, std::numeric_limits<int32_t>::max(), 9999};
  1580. std::vector<int32_t> s1{1, 2, std::numeric_limits<int32_t>::max(), -9};
  1581. s0.resize(SIMD_LEN);
  1582. s1.resize(SIMD_LEN);
  1583. init((int32_t*)&src0, s0);
  1584. init((int32_t*)&src1, s1);
  1585. ret = GiSubtractInt32(src0, src1);
  1586. std::vector<int32_t> naive;
  1587. for (size_t i = 0; i < SIMD_LEN; i++) {
  1588. naive.push_back(s0[i] - s1[i]);
  1589. }
  1590. assert_eq((int32_t*)&ret, naive);
  1591. }
  1592. TEST_F(FALLBACK, GiSubtractUint32) {
  1593. GI_UINT32_t src0, src1, ret;
  1594. std::vector<uint32_t> s0{127, 2, std::numeric_limits<uint32_t>::max(), 9999};
  1595. std::vector<uint32_t> s1{1, 2, std::numeric_limits<uint32_t>::max(), 9};
  1596. s0.resize(SIMD_LEN);
  1597. s1.resize(SIMD_LEN);
  1598. init((uint32_t*)&src0, s0);
  1599. init((uint32_t*)&src1, s1);
  1600. ret = GiSubtractUint32(src0, src1);
  1601. std::vector<uint32_t> naive;
  1602. for (size_t i = 0; i < SIMD_LEN; i++) {
  1603. naive.push_back(s0[i] - s1[i]);
  1604. }
  1605. assert_eq((uint32_t*)&ret, naive);
  1606. }
  1607. TEST_F(FALLBACK, GiSubtractInt8) {
  1608. GI_INT8_t src0, src1, ret;
  1609. std::vector<int8_t> s0{
  1610. std::numeric_limits<int8_t>::max(),
  1611. std::numeric_limits<int8_t>::min(),
  1612. 56,
  1613. -128,
  1614. 1,
  1615. 2,
  1616. 3,
  1617. 4,
  1618. 127,
  1619. 2,
  1620. 56,
  1621. -128,
  1622. 1,
  1623. 2,
  1624. 3,
  1625. 4};
  1626. std::vector<int8_t> s1{
  1627. 3,
  1628. std::numeric_limits<int8_t>::max(),
  1629. std::numeric_limits<int8_t>::min(),
  1630. 56,
  1631. -128,
  1632. 1,
  1633. 2,
  1634. 3,
  1635. 4,
  1636. 127,
  1637. 2,
  1638. 56,
  1639. -128,
  1640. 1,
  1641. 2,
  1642. 4};
  1643. s0.resize(SIMD_LEN_8);
  1644. s1.resize(SIMD_LEN_8);
  1645. init((int8_t*)&src0, s0, SIMD_LEN_8);
  1646. init((int8_t*)&src1, s1, SIMD_LEN_8);
  1647. ret = GiSubtractInt8(src0, src1);
  1648. std::vector<int8_t> naive;
  1649. for (size_t i = 0; i < SIMD_LEN_8; i++) {
  1650. naive.push_back(s0[i] - s1[i]);
  1651. }
  1652. assert_eq<int8_t>((int8_t*)&ret, naive, SIMD_LEN_8);
  1653. }
  1654. TEST_F(FALLBACK, GiMultiplyInt32) {
  1655. GI_INT32_t src0, src1, ret;
  1656. std::vector<int32_t> s0{127, 2, 202204, 99};
  1657. std::vector<int32_t> s1{1, 2, -4, -9};
  1658. s0.resize(SIMD_LEN);
  1659. s1.resize(SIMD_LEN);
  1660. init((int32_t*)&src0, s0);
  1661. init((int32_t*)&src1, s1);
  1662. ret = GiMultiplyInt32(src0, src1);
  1663. std::vector<int32_t> naive;
  1664. for (size_t i = 0; i < SIMD_LEN; i++) {
  1665. naive.push_back(s0[i] * s1[i]);
  1666. }
  1667. assert_eq((int32_t*)&ret, naive);
  1668. }
  1669. TEST_F(FALLBACK, GiMultiplyInt8) {
  1670. GI_INT8_t src0, src1, ret;
  1671. std::vector<int8_t> s0{
  1672. std::numeric_limits<int8_t>::max(),
  1673. std::numeric_limits<int8_t>::min(),
  1674. 56,
  1675. -128,
  1676. 1,
  1677. 2,
  1678. 3,
  1679. 4,
  1680. 127,
  1681. 2,
  1682. 56,
  1683. -128,
  1684. 1,
  1685. 2,
  1686. 3,
  1687. 4};
  1688. std::vector<int8_t> s1{
  1689. 3,
  1690. std::numeric_limits<int8_t>::max(),
  1691. std::numeric_limits<int8_t>::min(),
  1692. 56,
  1693. -128,
  1694. 1,
  1695. 2,
  1696. 3,
  1697. 4,
  1698. 127,
  1699. 2,
  1700. 56,
  1701. -128,
  1702. 1,
  1703. 2,
  1704. 4};
  1705. s0.resize(SIMD_LEN_8);
  1706. s1.resize(SIMD_LEN_8);
  1707. init((int8_t*)&src0, s0, SIMD_LEN_8);
  1708. init((int8_t*)&src1, s1, SIMD_LEN_8);
  1709. ret = GiMultiplyInt8(src0, src1);
  1710. std::vector<int8_t> naive;
  1711. for (size_t i = 0; i < SIMD_LEN_8; i++) {
  1712. naive.push_back(s0[i] * s1[i]);
  1713. }
  1714. assert_eq<int8_t>((int8_t*)&ret, naive, SIMD_LEN_8);
  1715. }
  1716. TEST_F(FALLBACK, GiMultiplyAddInt32) {
  1717. GI_INT32_t src0, src1, src2, ret;
  1718. std::vector<int32_t> s0{127, 2, 67, 9999};
  1719. std::vector<int32_t> s1{1, 2, 90, -9};
  1720. std::vector<int32_t> s2{-1, 12, 4, -9};
  1721. s0.resize(SIMD_LEN);
  1722. s1.resize(SIMD_LEN);
  1723. s2.resize(SIMD_LEN);
  1724. init((int32_t*)&src0, s0);
  1725. init((int32_t*)&src1, s1);
  1726. init((int32_t*)&src2, s2);
  1727. ret = GiMultiplyAddInt32(src0, src1, src2);
  1728. std::vector<int32_t> naive;
  1729. for (size_t i = 0; i < SIMD_LEN; i++) {
  1730. naive.push_back(s0[i] + s1[i] * s2[i]);
  1731. }
  1732. assert_eq((int32_t*)&ret, naive);
  1733. }
  1734. TEST_F(FALLBACK, GiMultiplyAddInt8) {
  1735. GI_INT8_t src0, src1, src2, ret;
  1736. std::vector<int8_t> s0{
  1737. std::numeric_limits<int8_t>::max(),
  1738. std::numeric_limits<int8_t>::min(),
  1739. 56,
  1740. -128,
  1741. 1,
  1742. 2,
  1743. 3,
  1744. 4,
  1745. 127,
  1746. 2,
  1747. 56,
  1748. -128,
  1749. 1,
  1750. 2,
  1751. 3,
  1752. 4};
  1753. std::vector<int8_t> s1{
  1754. 3,
  1755. std::numeric_limits<int8_t>::max(),
  1756. std::numeric_limits<int8_t>::min(),
  1757. 56,
  1758. -128,
  1759. 1,
  1760. 2,
  1761. 3,
  1762. 4,
  1763. 127,
  1764. 2,
  1765. 56,
  1766. -128,
  1767. 1,
  1768. 2,
  1769. 4};
  1770. std::vector<int8_t> s2{
  1771. std::numeric_limits<int8_t>::min(),
  1772. 56,
  1773. -128,
  1774. 1,
  1775. 2,
  1776. 3,
  1777. 4,
  1778. 127,
  1779. 2,
  1780. 56,
  1781. -128,
  1782. 1,
  1783. 2,
  1784. 5,
  1785. 8,
  1786. 4};
  1787. s0.resize(SIMD_LEN_8);
  1788. s1.resize(SIMD_LEN_8);
  1789. s2.resize(SIMD_LEN_8);
  1790. init((int8_t*)&src0, s0, SIMD_LEN_8);
  1791. init((int8_t*)&src1, s1, SIMD_LEN_8);
  1792. init((int8_t*)&src2, s2, SIMD_LEN_8);
  1793. ret = GiMultiplyAddInt8(src0, src1, src2);
  1794. std::vector<int8_t> naive;
  1795. for (size_t i = 0; i < SIMD_LEN_8; i++) {
  1796. naive.push_back(s0[i] + s1[i] * s2[i]);
  1797. }
  1798. assert_eq<int8_t>((int8_t*)&ret, naive, SIMD_LEN_8);
  1799. }
  1800. TEST_F(FALLBACK, GiAndInt8) {
  1801. GI_INT8_t src0, src1, ret;
  1802. std::vector<int8_t> s0{
  1803. std::numeric_limits<int8_t>::max(),
  1804. std::numeric_limits<int8_t>::min(),
  1805. 56,
  1806. -128,
  1807. 1,
  1808. 2,
  1809. 3,
  1810. 4,
  1811. 127,
  1812. 2,
  1813. 56,
  1814. -128,
  1815. 1,
  1816. 2,
  1817. 3,
  1818. 4};
  1819. std::vector<int8_t> s1{
  1820. 3,
  1821. std::numeric_limits<int8_t>::max(),
  1822. std::numeric_limits<int8_t>::min(),
  1823. 56,
  1824. -128,
  1825. 1,
  1826. 2,
  1827. 3,
  1828. 4,
  1829. 127,
  1830. 2,
  1831. 56,
  1832. -128,
  1833. 1,
  1834. 2,
  1835. 4};
  1836. s0.resize(SIMD_LEN_8);
  1837. s1.resize(SIMD_LEN_8);
  1838. init((int8_t*)&src0, s0, SIMD_LEN_8);
  1839. init((int8_t*)&src1, s1, SIMD_LEN_8);
  1840. ret = GiAndInt8(src0, src1);
  1841. std::vector<int8_t> naive;
  1842. for (size_t i = 0; i < SIMD_LEN_8; i++) {
  1843. naive.push_back(s0[i] & s1[i]);
  1844. }
  1845. assert_eq<int8_t>((int8_t*)&ret, naive, SIMD_LEN_8);
  1846. }
  1847. TEST_F(FALLBACK, GiEOrUint32) {
  1848. GI_UINT32_t src0, src1, ret;
  1849. std::vector<uint32_t> s0{127, 2, std::numeric_limits<uint32_t>::max(), 9999};
  1850. std::vector<uint32_t> s1{1, 2, std::numeric_limits<uint32_t>::max(), 9};
  1851. s0.resize(SIMD_LEN);
  1852. s1.resize(SIMD_LEN);
  1853. init((uint32_t*)&src0, s0);
  1854. init((uint32_t*)&src1, s1);
  1855. ret = GiEOrUint32(src0, src1);
  1856. std::vector<uint32_t> naive;
  1857. for (size_t i = 0; i < SIMD_LEN; i++) {
  1858. naive.push_back(s0[i] ^ s1[i]);
  1859. }
  1860. assert_eq((uint32_t*)&ret, naive);
  1861. }
  1862. TEST_F(FALLBACK, GiOrInt8) {
  1863. GI_INT8_t src0, src1, ret;
  1864. std::vector<int8_t> s0{
  1865. std::numeric_limits<int8_t>::max(),
  1866. std::numeric_limits<int8_t>::min(),
  1867. 56,
  1868. -128,
  1869. 1,
  1870. 2,
  1871. 3,
  1872. 4,
  1873. 127,
  1874. 2,
  1875. 56,
  1876. -128,
  1877. 1,
  1878. 2,
  1879. 3,
  1880. 4};
  1881. std::vector<int8_t> s1{
  1882. 3,
  1883. std::numeric_limits<int8_t>::max(),
  1884. std::numeric_limits<int8_t>::min(),
  1885. 56,
  1886. -128,
  1887. 1,
  1888. 2,
  1889. 3,
  1890. 4,
  1891. 127,
  1892. 2,
  1893. 56,
  1894. -128,
  1895. 1,
  1896. 2,
  1897. 4};
  1898. s0.resize(SIMD_LEN_8);
  1899. s1.resize(SIMD_LEN_8);
  1900. init((int8_t*)&src0, s0, SIMD_LEN_8);
  1901. init((int8_t*)&src1, s1, SIMD_LEN_8);
  1902. ret = GiOrInt8(src0, src1);
  1903. std::vector<int8_t> naive;
  1904. for (size_t i = 0; i < SIMD_LEN_8; i++) {
  1905. naive.push_back(s0[i] | s1[i]);
  1906. }
  1907. assert_eq<int8_t>((int8_t*)&ret, naive, SIMD_LEN_8);
  1908. }
  1909. TEST_F(FALLBACK, GiAndNotInt8) {
  1910. GI_INT8_t src0, src1, ret;
  1911. std::vector<int8_t> s0{
  1912. std::numeric_limits<int8_t>::max(),
  1913. std::numeric_limits<int8_t>::min(),
  1914. 56,
  1915. -128,
  1916. 1,
  1917. 2,
  1918. 3,
  1919. 4,
  1920. 127,
  1921. 2,
  1922. 56,
  1923. -128,
  1924. 1,
  1925. 2,
  1926. 3,
  1927. 4};
  1928. std::vector<int8_t> s1{
  1929. 3,
  1930. std::numeric_limits<int8_t>::max(),
  1931. std::numeric_limits<int8_t>::min(),
  1932. 56,
  1933. -128,
  1934. 1,
  1935. 2,
  1936. 3,
  1937. 4,
  1938. 127,
  1939. 2,
  1940. 56,
  1941. -128,
  1942. 1,
  1943. 2,
  1944. 4};
  1945. s0.resize(SIMD_LEN_8);
  1946. s1.resize(SIMD_LEN_8);
  1947. init((int8_t*)&src0, s0, SIMD_LEN_8);
  1948. init((int8_t*)&src1, s1, SIMD_LEN_8);
  1949. ret = GiAndNotInt8(src0, src1);
  1950. std::vector<int8_t> naive;
  1951. for (size_t i = 0; i < SIMD_LEN_8; i++) {
  1952. naive.push_back((~s0[i]) & s1[i]);
  1953. }
  1954. assert_eq<int8_t>((int8_t*)&ret, naive, SIMD_LEN_8);
  1955. }
  1956. TEST_F(FALLBACK, GiXorInt8) {
  1957. GI_INT8_t src0, src1, ret;
  1958. std::vector<int8_t> s0{
  1959. std::numeric_limits<int8_t>::max(),
  1960. std::numeric_limits<int8_t>::min(),
  1961. 56,
  1962. -128,
  1963. 1,
  1964. 2,
  1965. 3,
  1966. 4,
  1967. 127,
  1968. 2,
  1969. 56,
  1970. -128,
  1971. 1,
  1972. 2,
  1973. 3,
  1974. 4};
  1975. std::vector<int8_t> s1{
  1976. 3,
  1977. std::numeric_limits<int8_t>::max(),
  1978. std::numeric_limits<int8_t>::min(),
  1979. 56,
  1980. -128,
  1981. 1,
  1982. 2,
  1983. 3,
  1984. 4,
  1985. 127,
  1986. 2,
  1987. 56,
  1988. -128,
  1989. 1,
  1990. 2,
  1991. 4};
  1992. s0.resize(SIMD_LEN_8);
  1993. s1.resize(SIMD_LEN_8);
  1994. init((int8_t*)&src0, s0, SIMD_LEN_8);
  1995. init((int8_t*)&src1, s1, SIMD_LEN_8);
  1996. ret = GiXorInt8(src0, src1);
  1997. std::vector<int8_t> naive;
  1998. for (size_t i = 0; i < SIMD_LEN_8; i++) {
  1999. naive.push_back((s0[i]) ^ s1[i]);
  2000. }
  2001. assert_eq<int8_t>((int8_t*)&ret, naive, SIMD_LEN_8);
  2002. }
  2003. TEST_F(FALLBACK, GiShiftRight23Int32) {
  2004. GI_INT32_t src0, ret;
  2005. std::vector<int32_t> s0{1, 2, 3, -4};
  2006. s0.resize(SIMD_LEN);
  2007. init((int32_t*)&src0, s0);
  2008. ret = GiShiftRight23Int32(src0);
  2009. std::vector<int32_t> naive;
  2010. for (size_t i = 0; i < SIMD_LEN; i++) {
  2011. naive.push_back(s0[i] >> 23);
  2012. }
  2013. assert_eq((int32_t*)&ret, naive);
  2014. }
  2015. TEST_F(FALLBACK, GiBlendInt32) {
  2016. GI_INT32_t src0, src1, src2, ret, na;
  2017. std::vector<int32_t> s0{1, 2, 3, -4};
  2018. std::vector<int32_t> s1{12, 22, 32, -43};
  2019. std::vector<int32_t> s2{-1, 21, 34, 4};
  2020. s0.resize(SIMD_LEN);
  2021. s1.resize(SIMD_LEN);
  2022. s2.resize(SIMD_LEN);
  2023. init((int32_t*)&src0, s0);
  2024. init((int32_t*)&src1, s1);
  2025. init((int32_t*)&src2, s2);
  2026. ret = GiBlendInt32(src0, src1, src2);
  2027. na = GiOrInt32(GiAndInt32(src1, src2), GiAndNotInt32(src2, src0));
  2028. std::vector<int32_t> naive;
  2029. auto p = (int32_t*)&na;
  2030. for (size_t i = 0; i < SIMD_LEN; i++) {
  2031. naive.push_back(p[i]);
  2032. }
  2033. assert_eq((int32_t*)&ret, naive);
  2034. }
  2035. TEST_F(FALLBACK, GiBlendInt8) {
  2036. GI_INT8_t src0, src1, src2, ret, na;
  2037. std::vector<int8_t> s0{
  2038. std::numeric_limits<int8_t>::max(),
  2039. std::numeric_limits<int8_t>::min(),
  2040. 56,
  2041. -128,
  2042. 1,
  2043. 2,
  2044. 3,
  2045. 4,
  2046. 127,
  2047. 2,
  2048. 56,
  2049. -128,
  2050. 1,
  2051. 2,
  2052. 3,
  2053. 4};
  2054. std::vector<int8_t> s1{
  2055. 3,
  2056. std::numeric_limits<int8_t>::max(),
  2057. std::numeric_limits<int8_t>::min(),
  2058. 56,
  2059. -128,
  2060. 1,
  2061. 2,
  2062. 3,
  2063. 4,
  2064. 127,
  2065. 2,
  2066. 56,
  2067. -128,
  2068. 1,
  2069. 2,
  2070. 4};
  2071. std::vector<int8_t> s2{
  2072. std::numeric_limits<int8_t>::min(),
  2073. 56,
  2074. -128,
  2075. 1,
  2076. 2,
  2077. 3,
  2078. 4,
  2079. 127,
  2080. 2,
  2081. 56,
  2082. -128,
  2083. 1,
  2084. 2,
  2085. 5,
  2086. 8,
  2087. 4};
  2088. s0.resize(SIMD_LEN_8);
  2089. s1.resize(SIMD_LEN_8);
  2090. s2.resize(SIMD_LEN_8);
  2091. init((int8_t*)&src0, s0, SIMD_LEN_8);
  2092. init((int8_t*)&src1, s1, SIMD_LEN_8);
  2093. init((int8_t*)&src2, s2, SIMD_LEN_8);
  2094. ret = GiBlendInt8(src0, src1, src2);
  2095. na = GiOrInt8(GiAndInt8(src1, src2), GiAndNotInt8(src2, src0));
  2096. std::vector<int8_t> naive;
  2097. auto p = (int8_t*)&na;
  2098. for (size_t i = 0; i < SIMD_LEN_8; i++) {
  2099. naive.push_back(p[i]);
  2100. }
  2101. assert_eq<int8_t>((int8_t*)&ret, naive, SIMD_LEN_8);
  2102. }
  2103. TEST_F(FALLBACK, GiAbsInt32) {
  2104. GI_INT32_t src0, ret;
  2105. std::vector<int32_t> s0{-1, 2, -3, 4};
  2106. s0.resize(SIMD_LEN);
  2107. init((int32_t*)&src0, s0);
  2108. ret = GiAbsInt32(src0);
  2109. std::vector<int32_t> naive;
  2110. for (size_t i = 0; i < SIMD_LEN; i++) {
  2111. naive.push_back(s0[i] > 0 ? s0[i] : -s0[i]);
  2112. }
  2113. assert_eq((int32_t*)&ret, naive);
  2114. }
  2115. TEST_F(FALLBACK, GiAbsInt16) {
  2116. GI_INT16_t src0, ret;
  2117. std::vector<int16_t> s0{-127, 2, std::numeric_limits<int16_t>::max(), 9999, 1, 2,
  2118. 3, 4};
  2119. s0.resize(SIMD_LEN_16);
  2120. init((int16_t*)&src0, s0, SIMD_LEN_16);
  2121. ret = GiAbsInt16(src0);
  2122. std::vector<int16_t> naive;
  2123. for (size_t i = 0; i < SIMD_LEN_16; i++) {
  2124. naive.push_back(s0[i] > 0 ? s0[i] : -s0[i]);
  2125. }
  2126. assert_eq<int16_t>((int16_t*)&ret, naive, SIMD_LEN_16);
  2127. }
  2128. TEST_F(FALLBACK, GiAbsInt8) {
  2129. GI_INT8_t src0, ret;
  2130. std::vector<int8_t> s0{
  2131. std::numeric_limits<int8_t>::max(),
  2132. std::numeric_limits<int8_t>::min(),
  2133. 56,
  2134. -128,
  2135. 1,
  2136. 2,
  2137. 3,
  2138. 4,
  2139. 127,
  2140. 2,
  2141. 56,
  2142. -128,
  2143. 1,
  2144. 2,
  2145. 3,
  2146. 4};
  2147. s0.resize(SIMD_LEN_8);
  2148. init((int8_t*)&src0, s0, SIMD_LEN_8);
  2149. ret = GiAbsInt8(src0);
  2150. std::vector<int8_t> naive;
  2151. for (size_t i = 0; i < SIMD_LEN_8; i++) {
  2152. naive.push_back(s0[i] > 0 ? s0[i] : -s0[i]);
  2153. }
  2154. assert_eq<int8_t>((int8_t*)&ret, naive, SIMD_LEN_8);
  2155. }
  2156. TEST_F(FALLBACK, GiMaximumInt32) {
  2157. GI_INT32_t src0, src1, src2, ret, na;
  2158. std::vector<int32_t> s0{1, -2, 3, 4};
  2159. s0.resize(SIMD_LEN);
  2160. std::vector<int32_t> s1{5, 6, 7, -8};
  2161. s1.resize(SIMD_LEN);
  2162. init((int32_t*)&src0, s0);
  2163. init((int32_t*)&src1, s1);
  2164. std::vector<int32_t> s2;
  2165. for (size_t i = 0; i < SIMD_LEN; i++) {
  2166. s2.push_back(s0[i] > s1[i] ? 0xFFFFFFFF : 0);
  2167. }
  2168. s2.resize(SIMD_LEN);
  2169. init((int32_t*)&src2, s2);
  2170. ret = GiMaximumInt32(src0, src1);
  2171. na = GiBlendInt32(src1, src0, src2);
  2172. std::vector<int32_t> naive;
  2173. auto p = (int32_t*)&na;
  2174. for (size_t i = 0; i < SIMD_LEN; i++) {
  2175. naive.push_back(p[i]);
  2176. }
  2177. assert_eq((int32_t*)&ret, naive);
  2178. }
  2179. TEST_F(FALLBACK, GiMinimumInt32) {
  2180. GI_INT32_t src0, src1, src2, ret, na;
  2181. std::vector<int32_t> s0{1, -2, 3, 4};
  2182. s0.resize(SIMD_LEN);
  2183. std::vector<int32_t> s1{5, 6, 7, -8};
  2184. s1.resize(SIMD_LEN);
  2185. init((int32_t*)&src0, s0);
  2186. init((int32_t*)&src1, s1);
  2187. std::vector<int32_t> s2;
  2188. for (size_t i = 0; i < SIMD_LEN; i++) {
  2189. s2.push_back(s1[i] > s0[i] ? 0xFFFFFFFF : 0);
  2190. }
  2191. s2.resize(SIMD_LEN);
  2192. init((int32_t*)&src2, s2);
  2193. ret = GiMinimumInt32(src0, src1);
  2194. na = GiBlendInt32(src1, src0, src2);
  2195. std::vector<int32_t> naive;
  2196. auto p = (int32_t*)&na;
  2197. for (size_t i = 0; i < SIMD_LEN; i++) {
  2198. naive.push_back(p[i]);
  2199. }
  2200. assert_eq((int32_t*)&ret, naive);
  2201. }
  2202. TEST_F(FALLBACK, GiBlendInt8x16) {
  2203. GI_INT8_t src0, src1, src2, ret, na;
  2204. std::vector<int8_t> s0{
  2205. std::numeric_limits<int8_t>::max(),
  2206. std::numeric_limits<int8_t>::min(),
  2207. 56,
  2208. -128,
  2209. 1,
  2210. 2,
  2211. 3,
  2212. 4,
  2213. 127,
  2214. 2,
  2215. 56,
  2216. -128,
  2217. 1,
  2218. 2,
  2219. 3,
  2220. 4};
  2221. std::vector<int8_t> s1{
  2222. 3,
  2223. std::numeric_limits<int8_t>::max(),
  2224. std::numeric_limits<int8_t>::min(),
  2225. 56,
  2226. -128,
  2227. 1,
  2228. 2,
  2229. 3,
  2230. 4,
  2231. 127,
  2232. 2,
  2233. 56,
  2234. -128,
  2235. 1,
  2236. 2,
  2237. 4};
  2238. std::vector<int8_t> s2{
  2239. std::numeric_limits<int8_t>::min(),
  2240. 56,
  2241. -128,
  2242. 1,
  2243. 2,
  2244. 3,
  2245. 4,
  2246. 127,
  2247. 2,
  2248. 56,
  2249. -128,
  2250. 1,
  2251. 2,
  2252. 5,
  2253. 8,
  2254. 4};
  2255. s0.resize(SIMD_LEN_8);
  2256. s1.resize(SIMD_LEN_8);
  2257. s2.resize(SIMD_LEN_8);
  2258. init((int8_t*)&src0, s0, SIMD_LEN_8);
  2259. init((int8_t*)&src1, s1, SIMD_LEN_8);
  2260. init((int8_t*)&src2, s2, SIMD_LEN_8);
  2261. ret = GiBlendInt8x16(src0, src1, src2);
  2262. na = GiOrInt8(GiAndInt8(src1, src2), GiAndNotInt8(src2, src0));
  2263. std::vector<int8_t> naive;
  2264. auto p = (int8_t*)&na;
  2265. for (size_t i = 0; i < SIMD_LEN_8; i++) {
  2266. naive.push_back(p[i]);
  2267. }
  2268. assert_eq<int8_t>((int8_t*)&ret, naive, SIMD_LEN_8);
  2269. }
  2270. TEST_F(FALLBACK, GiMaximumInt8) {
  2271. GI_INT8_t src0, src1, src2, ret, na;
  2272. std::vector<int8_t> s0{
  2273. std::numeric_limits<int8_t>::max(),
  2274. std::numeric_limits<int8_t>::min(),
  2275. 56,
  2276. -128,
  2277. 1,
  2278. 2,
  2279. 3,
  2280. 4,
  2281. 127,
  2282. 2,
  2283. 56,
  2284. -128,
  2285. 1,
  2286. 2,
  2287. 3,
  2288. 4};
  2289. std::vector<int8_t> s1{
  2290. 3,
  2291. std::numeric_limits<int8_t>::max(),
  2292. std::numeric_limits<int8_t>::min(),
  2293. 56,
  2294. -128,
  2295. 1,
  2296. 2,
  2297. 3,
  2298. 4,
  2299. 127,
  2300. 2,
  2301. 56,
  2302. -128,
  2303. 1,
  2304. 2,
  2305. 4};
  2306. s0.resize(SIMD_LEN_8);
  2307. s1.resize(SIMD_LEN_8);
  2308. init((int8_t*)&src0, s0, SIMD_LEN_8);
  2309. init((int8_t*)&src1, s1, SIMD_LEN_8);
  2310. std::vector<int8_t> s2;
  2311. for (size_t i = 0; i < SIMD_LEN_8; i++) {
  2312. s2.push_back(s1[i] < s0[i] ? 0xFF : 0);
  2313. }
  2314. s2.resize(SIMD_LEN_8);
  2315. init((int8_t*)&src2, s2, SIMD_LEN_8);
  2316. ret = GiMaximumInt8(src0, src1);
  2317. na = GiBlendInt8(src1, src0, src2);
  2318. std::vector<int8_t> naive;
  2319. auto p = (int8_t*)&na;
  2320. for (size_t i = 0; i < SIMD_LEN_8; i++) {
  2321. naive.push_back(p[i]);
  2322. }
  2323. assert_eq<int8_t>((int8_t*)&ret, naive, SIMD_LEN_8);
  2324. }
  2325. TEST_F(FALLBACK, GiMinimumInt8) {
  2326. GI_INT8_t src0, src1, src2, ret, na;
  2327. std::vector<int8_t> s0{
  2328. std::numeric_limits<int8_t>::max(),
  2329. std::numeric_limits<int8_t>::min(),
  2330. 56,
  2331. -128,
  2332. 1,
  2333. 2,
  2334. 3,
  2335. 4,
  2336. 127,
  2337. 2,
  2338. 56,
  2339. -128,
  2340. 1,
  2341. 2,
  2342. 3,
  2343. 4};
  2344. std::vector<int8_t> s1{
  2345. 3,
  2346. std::numeric_limits<int8_t>::max(),
  2347. std::numeric_limits<int8_t>::min(),
  2348. 56,
  2349. -128,
  2350. 1,
  2351. 2,
  2352. 3,
  2353. 4,
  2354. 127,
  2355. 2,
  2356. 56,
  2357. -128,
  2358. 1,
  2359. 2,
  2360. 4};
  2361. s0.resize(SIMD_LEN_8);
  2362. s1.resize(SIMD_LEN_8);
  2363. init((int8_t*)&src0, s0, SIMD_LEN_8);
  2364. init((int8_t*)&src1, s1, SIMD_LEN_8);
  2365. std::vector<int8_t> s2;
  2366. for (size_t i = 0; i < SIMD_LEN_8; i++) {
  2367. s2.push_back(s1[i] > s0[i] ? 0xFF : 0);
  2368. }
  2369. s2.resize(SIMD_LEN_8);
  2370. init((int8_t*)&src2, s2, SIMD_LEN_8);
  2371. ret = GiMinimumInt8(src0, src1);
  2372. na = GiBlendInt8(src1, src0, src2);
  2373. std::vector<int8_t> naive;
  2374. auto p = (int8_t*)&na;
  2375. for (size_t i = 0; i < SIMD_LEN_8; i++) {
  2376. naive.push_back(p[i]);
  2377. }
  2378. assert_eq<int8_t>((int8_t*)&ret, naive, SIMD_LEN_8);
  2379. }
  2380. TEST_F(FALLBACK, GiMoveHighLongInt8) {
  2381. GI_INT8_t src0;
  2382. GI_INT16_t ret;
  2383. std::vector<int8_t> s0{
  2384. std::numeric_limits<int8_t>::max(),
  2385. std::numeric_limits<int8_t>::min(),
  2386. 56,
  2387. -128,
  2388. 1,
  2389. 2,
  2390. 3,
  2391. 4,
  2392. 127,
  2393. 2,
  2394. 56,
  2395. -128,
  2396. std::numeric_limits<int8_t>::max(),
  2397. std::numeric_limits<int8_t>::min(),
  2398. 3,
  2399. 4};
  2400. s0.resize(SIMD_LEN_8);
  2401. init((int8_t*)&src0, s0, SIMD_LEN_8);
  2402. ret = GiMoveHighLongInt8(src0);
  2403. std::vector<int16_t> naive;
  2404. for (size_t i = 0; i < SIMD_LEN_8 / 2; i++) {
  2405. naive.push_back(s0[i + SIMD_LEN_8 / 2]);
  2406. }
  2407. assert_eq<int16_t>((int16_t*)&ret, naive, SIMD_LEN_16);
  2408. }
  2409. TEST_F(FALLBACK, GiMoveLowLongInt8) {
  2410. GI_INT8_t src0;
  2411. GI_INT16_t ret;
  2412. std::vector<int8_t> s0{
  2413. std::numeric_limits<int8_t>::max(),
  2414. std::numeric_limits<int8_t>::min(),
  2415. 56,
  2416. -128,
  2417. 1,
  2418. 2,
  2419. 3,
  2420. 4,
  2421. 127,
  2422. 2,
  2423. 56,
  2424. -128,
  2425. std::numeric_limits<int8_t>::max(),
  2426. std::numeric_limits<int8_t>::min(),
  2427. 3,
  2428. 4};
  2429. s0.resize(SIMD_LEN_8);
  2430. init((int8_t*)&src0, s0, SIMD_LEN_8);
  2431. ret = GiMoveLowLongInt8(src0);
  2432. std::vector<int16_t> naive;
  2433. for (size_t i = 0; i < SIMD_LEN_8 / 2; i++) {
  2434. naive.push_back(s0[i]);
  2435. }
  2436. assert_eq<int16_t>((int16_t*)&ret, naive, SIMD_LEN_16);
  2437. }
  2438. TEST_F(FALLBACK, GiMoveHighLongInt16) {
  2439. GI_INT16_t src0;
  2440. GI_INT32_t ret;
  2441. std::vector<int16_t> s0{-127, 2, std::numeric_limits<int16_t>::max(), 9999, 1, 2,
  2442. 3, 4};
  2443. s0.resize(SIMD_LEN_16);
  2444. init((int16_t*)&src0, s0, SIMD_LEN_16);
  2445. ret = GiMoveHighLongInt16(src0);
  2446. std::vector<int32_t> naive;
  2447. for (size_t i = 0; i < SIMD_LEN_16 / 2; i++) {
  2448. naive.push_back(s0[i + SIMD_LEN_16 / 2]);
  2449. }
  2450. assert_eq<int32_t>((int32_t*)&ret, naive, SIMD_LEN);
  2451. }
  2452. TEST_F(FALLBACK, GiMoveLowLongInt16) {
  2453. GI_INT16_t src0;
  2454. GI_INT32_t ret;
  2455. std::vector<int16_t> s0{-127, 2, std::numeric_limits<int16_t>::max(), 9999, 1, 2,
  2456. 3, 4};
  2457. s0.resize(SIMD_LEN_16);
  2458. init((int16_t*)&src0, s0, SIMD_LEN_16);
  2459. ret = GiMoveLowLongInt16(src0);
  2460. std::vector<int32_t> naive;
  2461. for (size_t i = 0; i < SIMD_LEN_16 / 2; i++) {
  2462. naive.push_back(s0[i]);
  2463. }
  2464. assert_eq<int32_t>((int32_t*)&ret, naive, SIMD_LEN);
  2465. }
  2466. TEST_F(FALLBACK, GiReduceAddInt8) {
  2467. GI_INT8_t src0;
  2468. int32_t ret{0};
  2469. std::vector<int8_t> s0{127, 2, 56, -128, 1, 2, 3, 4, 127, 2, 56, -128, 1, 2, 3, 4};
  2470. s0.resize(SIMD_LEN_8);
  2471. init((int8_t*)&src0, s0, SIMD_LEN_8);
  2472. ret = GiReduceAddInt8(src0);
  2473. int32_t naive{0};
  2474. for (auto i : s0) {
  2475. naive += i;
  2476. }
  2477. ASSERT_EQ(ret, naive);
  2478. }
  2479. TEST_F(FALLBACK, GiReduceMaxInt8) {
  2480. GI_INT8_t src0;
  2481. int8_t ret{0};
  2482. std::vector<int8_t> s0{127, 2, 56, -128, 1, 2, 3, 4, 127, 2, 56, -128, 1, 2, 3, 4};
  2483. s0.resize(SIMD_LEN_8);
  2484. init((int8_t*)&src0, s0, SIMD_LEN_8);
  2485. ret = GiReduceMaxInt8(src0);
  2486. int8_t naive{s0[0]};
  2487. for (size_t i = 0; i < SIMD_LEN_8; i++) {
  2488. naive = Max(naive, s0[i]);
  2489. }
  2490. ASSERT_EQ(ret, naive);
  2491. }
  2492. TEST_F(FALLBACK, GiReduceMinInt8) {
  2493. GI_INT8_t src0;
  2494. int8_t ret{0};
  2495. std::vector<int8_t> s0{127, 2, 56, -128, 1, 2, 3, 4, 127, 2, 56, -128, 1, 2, 3, 4};
  2496. s0.resize(SIMD_LEN_8);
  2497. init((int8_t*)&src0, s0, SIMD_LEN_8);
  2498. ret = GiReduceMinInt8(src0);
  2499. int8_t naive{s0[0]};
  2500. for (size_t i = 0; i < SIMD_LEN_8; i++) {
  2501. naive = Min(naive, s0[i]);
  2502. }
  2503. ASSERT_EQ(ret, naive);
  2504. }
  2505. TEST_F(FALLBACK, GiCvtFromFloat32ToInt8) {
  2506. GI_INT8_t ret;
  2507. GI_FLOAT32_t src0;
  2508. std::vector<float> s0{
  2509. 1.0f, -2.2f, std::numeric_limits<float>::max(),
  2510. std::numeric_limits<float>::min()};
  2511. s0.resize(SIMD_LEN);
  2512. init((float*)&src0, s0);
  2513. ret = GiCvtFromFloat32ToInt8(src0);
  2514. std::vector<int8_t> naive;
  2515. naive.resize(SIMD_LEN_8);
  2516. for (size_t i = 0; i < SIMD_LEN; i++) {
  2517. int8_t data = Saturate(round(s0[i]), -128, 127);
  2518. naive[i] = data;
  2519. naive[SIMD_LEN + i] = data;
  2520. naive[2 * SIMD_LEN + i] = data;
  2521. naive[3 * SIMD_LEN + i] = data;
  2522. }
  2523. assert_eq<int8_t>((int8_t*)&ret, naive, SIMD_LEN_8);
  2524. }
  2525. TEST_F(FALLBACK, GiCvtFromFloat32V2ToInt8) {
  2526. GI_INT8_t ret;
  2527. GI_FLOAT32_V2_t src0;
  2528. std::vector<float> s0{
  2529. 1.0f,
  2530. -2.2f,
  2531. std::numeric_limits<float>::max(),
  2532. std::numeric_limits<float>::min(),
  2533. 1.1f,
  2534. 2.2f,
  2535. -9.0f,
  2536. 899999.0f};
  2537. s0.resize(SIMD_LEN * 2);
  2538. init((float*)&src0, s0, SIMD_LEN * 2);
  2539. ret = GiCvtFromFloat32V2ToInt8(src0);
  2540. std::vector<int8_t> naive;
  2541. for (size_t i = 0; i < SIMD_LEN * 2; i++) {
  2542. naive.push_back(Saturate(round(s0[i]), -128, 127));
  2543. }
  2544. for (size_t i = 0; i < SIMD_LEN * 2; i++) {
  2545. naive.push_back(Saturate(round(s0[i]), -128, 127));
  2546. }
  2547. assert_eq<int8_t>((int8_t*)&ret, naive, SIMD_LEN_8);
  2548. }
  2549. TEST_F(FALLBACK, GiCvtFromFloat32V4ToInt8) {
  2550. GI_INT8_t ret;
  2551. GI_FLOAT32_V4_t src0;
  2552. std::vector<float> s0{
  2553. std::numeric_limits<float>::max(),
  2554. std::numeric_limits<float>::min(),
  2555. 1.0f,
  2556. -2.2f,
  2557. 3.1f,
  2558. 4.2f,
  2559. -5.0f,
  2560. 6.0f,
  2561. 7.0f,
  2562. 8.0f,
  2563. -9.9f,
  2564. 10.9f,
  2565. -11.9f,
  2566. 12.9f,
  2567. 13.9f,
  2568. -14.9f};
  2569. s0.resize(SIMD_LEN * 4);
  2570. init((float*)&src0, s0, SIMD_LEN * 4);
  2571. ret = GiCvtFromFloat32V4ToInt8(src0);
  2572. std::vector<int8_t> naive;
  2573. for (size_t i = 0; i < SIMD_LEN * 4; i++) {
  2574. naive.push_back(Saturate(round(s0[i]), -128, 127));
  2575. }
  2576. assert_eq<int8_t>((int8_t*)&ret, naive, SIMD_LEN_8);
  2577. }
  2578. TEST_F(FALLBACK, GiCombineFloat32) {
  2579. float32x2_t src0, src1;
  2580. GI_FLOAT32_t ret;
  2581. std::vector<float> s0{1.1f, -3.1415f};
  2582. std::vector<float> s1{2.3f, 3.14777f};
  2583. memcpy(&src0, s0.data(), sizeof(float32x2_t));
  2584. memcpy(&src1, s1.data(), sizeof(float32x2_t));
  2585. ret = GiCombineFloat32(src0, src1);
  2586. std::vector<float> naive;
  2587. naive.push_back(s0[0]);
  2588. naive.push_back(s0[1]);
  2589. naive.push_back(s1[0]);
  2590. naive.push_back(s1[1]);
  2591. assert_eq<float>((float*)&ret, naive);
  2592. }
  2593. TEST_F(FALLBACK, GiGetLowFloat32) {
  2594. float32x2_t ret;
  2595. GI_FLOAT32_t src0;
  2596. std::vector<float> s0{1.0f, 2.2f, 3.4f, 4.5f};
  2597. s0.resize(SIMD_LEN);
  2598. init((float*)&src0, s0);
  2599. ret = GiGetLowFloat32(src0);
  2600. auto r = (float*)&ret;
  2601. ASSERT_EQ(*r, s0[0]);
  2602. ASSERT_EQ(*(r + 1), s0[1]);
  2603. }
  2604. TEST_F(FALLBACK, GiGetHighFloat32) {
  2605. float32x2_t ret;
  2606. GI_FLOAT32_t src0;
  2607. std::vector<float> s0{1.0f, 2.2f, 3.4f, 4.5f};
  2608. s0.resize(SIMD_LEN);
  2609. init((float*)&src0, s0);
  2610. ret = GiGetHighFloat32(src0);
  2611. auto r = (float*)&ret;
  2612. ASSERT_EQ(*r, s0[2]);
  2613. ASSERT_EQ(*(r + 1), s0[3]);
  2614. }
  2615. } // namespace test
  2616. } // namespace megdnn
  2617. // vim: syntax=cpp.doxygen