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 82 kB

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