123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724872587268727872887298730873187328733873487358736873787388739874087418742874387448745874687478748874987508751875287538754875587568757875887598760876187628763876487658766876787688769877087718772877387748775877687778778877987808781878287838784878587868787878887898790879187928793879487958796879787988799880088018802880388048805880688078808880988108811881288138814881588168817881888198820882188228823882488258826882788288829883088318832883388348835883688378838883988408841884288438844884588468847884888498850885188528853885488558856885788588859886088618862886388648865886688678868886988708871887288738874887588768877887888798880888188828883888488858886888788888889889088918892889388948895889688978898889989008901890289038904890589068907890889098910891189128913891489158916891789188919892089218922892389248925892689278928892989308931893289338934893589368937893889398940894189428943894489458946894789488949895089518952895389548955895689578958895989608961896289638964896589668967896889698970897189728973897489758976897789788979898089818982898389848985898689878988898989908991899289938994899589968997899889999000900190029003900490059006900790089009901090119012901390149015901690179018901990209021902290239024902590269027902890299030903190329033903490359036903790389039904090419042904390449045904690479048904990509051905290539054905590569057905890599060906190629063906490659066906790689069907090719072907390749075907690779078907990809081908290839084908590869087908890899090909190929093909490959096909790989099910091019102910391049105910691079108910991109111911291139114911591169117911891199120912191229123912491259126912791289129913091319132913391349135913691379138913991409141914291439144914591469147914891499150915191529153915491559156915791589159916091619162916391649165916691679168916991709171917291739174917591769177917891799180918191829183918491859186918791889189919091919192919391949195919691979198919992009201920292039204920592069207920892099210921192129213921492159216921792189219922092219222922392249225922692279228922992309231923292339234923592369237923892399240924192429243924492459246924792489249925092519252925392549255925692579258925992609261926292639264926592669267926892699270927192729273927492759276927792789279928092819282928392849285928692879288928992909291929292939294929592969297929892999300930193029303930493059306930793089309931093119312931393149315931693179318931993209321932293239324932593269327932893299330933193329333933493359336933793389339934093419342934393449345934693479348934993509351935293539354935593569357935893599360936193629363936493659366936793689369937093719372937393749375937693779378937993809381938293839384938593869387938893899390939193929393939493959396939793989399940094019402940394049405940694079408940994109411941294139414941594169417941894199420942194229423942494259426942794289429943094319432943394349435943694379438943994409441944294439444944594469447944894499450945194529453945494559456945794589459946094619462946394649465946694679468946994709471947294739474947594769477947894799480948194829483948494859486948794889489949094919492949394949495949694979498949995009501950295039504950595069507950895099510951195129513951495159516951795189519952095219522952395249525952695279528952995309531953295339534953595369537953895399540954195429543954495459546954795489549955095519552955395549555955695579558955995609561956295639564956595669567956895699570957195729573957495759576957795789579958095819582958395849585958695879588958995909591959295939594959595969597959895999600960196029603960496059606960796089609961096119612961396149615961696179618961996209621962296239624962596269627962896299630963196329633963496359636963796389639964096419642964396449645964696479648964996509651965296539654965596569657965896599660966196629663966496659666966796689669967096719672967396749675967696779678967996809681968296839684968596869687968896899690969196929693969496959696969796989699970097019702970397049705970697079708970997109711971297139714971597169717971897199720972197229723972497259726972797289729973097319732973397349735973697379738973997409741974297439744974597469747974897499750975197529753975497559756975797589759976097619762976397649765976697679768976997709771977297739774977597769777977897799780978197829783978497859786978797889789979097919792979397949795979697979798979998009801980298039804980598069807980898099810981198129813981498159816981798189819982098219822982398249825982698279828982998309831983298339834983598369837983898399840984198429843984498459846984798489849985098519852985398549855985698579858985998609861986298639864986598669867986898699870987198729873987498759876987798789879988098819882988398849885988698879888988998909891989298939894989598969897989898999900990199029903990499059906990799089909991099119912991399149915991699179918991999209921992299239924992599269927992899299930993199329933993499359936993799389939994099419942994399449945994699479948994999509951995299539954995599569957995899599960996199629963996499659966996799689969997099719972997399749975997699779978997999809981998299839984998599869987998899899990999199929993999499959996999799989999100001000110002100031000410005100061000710008100091001010011100121001310014100151001610017100181001910020100211002210023100241002510026100271002810029100301003110032100331003410035100361003710038100391004010041100421004310044100451004610047100481004910050100511005210053100541005510056100571005810059100601006110062100631006410065100661006710068100691007010071100721007310074100751007610077100781007910080100811008210083100841008510086100871008810089100901009110092100931009410095100961009710098100991010010101101021010310104101051010610107101081010910110101111011210113101141011510116101171011810119101201012110122101231012410125101261012710128101291013010131101321013310134101351013610137101381013910140101411014210143101441014510146101471014810149101501015110152101531015410155101561015710158101591016010161101621016310164101651016610167101681016910170101711017210173101741017510176101771017810179101801018110182101831018410185101861018710188101891019010191101921019310194101951019610197101981019910200102011020210203102041020510206102071020810209102101021110212102131021410215102161021710218102191022010221102221022310224102251022610227102281022910230102311023210233102341023510236102371023810239102401024110242102431024410245102461024710248102491025010251102521025310254102551025610257102581025910260102611026210263102641026510266102671026810269102701027110272102731027410275102761027710278102791028010281102821028310284102851028610287102881028910290102911029210293102941029510296102971029810299103001030110302103031030410305103061030710308103091031010311103121031310314103151031610317103181031910320103211032210323103241032510326103271032810329103301033110332103331033410335103361033710338103391034010341103421034310344103451034610347103481034910350103511035210353103541035510356103571035810359103601036110362103631036410365103661036710368103691037010371103721037310374103751037610377103781037910380103811038210383103841038510386103871038810389103901039110392103931039410395103961039710398103991040010401104021040310404104051040610407104081040910410104111041210413104141041510416104171041810419104201042110422104231042410425104261042710428104291043010431104321043310434104351043610437104381043910440104411044210443104441044510446104471044810449104501045110452104531045410455104561045710458104591046010461104621046310464104651046610467104681046910470104711047210473104741047510476104771047810479104801048110482104831048410485104861048710488104891049010491104921049310494104951049610497104981049910500105011050210503105041050510506105071050810509105101051110512105131051410515105161051710518105191052010521105221052310524105251052610527105281052910530105311053210533105341053510536105371053810539105401054110542105431054410545105461054710548105491055010551105521055310554105551055610557105581055910560105611056210563105641056510566105671056810569105701057110572105731057410575105761057710578105791058010581105821058310584105851058610587105881058910590105911059210593105941059510596105971059810599106001060110602106031060410605106061060710608106091061010611106121061310614106151061610617106181061910620106211062210623106241062510626106271062810629106301063110632106331063410635106361063710638106391064010641106421064310644106451064610647106481064910650106511065210653106541065510656106571065810659106601066110662106631066410665106661066710668106691067010671106721067310674106751067610677106781067910680106811068210683106841068510686106871068810689106901069110692106931069410695106961069710698106991070010701107021070310704107051070610707107081070910710107111071210713107141071510716107171071810719107201072110722107231072410725107261072710728107291073010731107321073310734107351073610737107381073910740107411074210743107441074510746107471074810749107501075110752107531075410755107561075710758107591076010761107621076310764107651076610767107681076910770107711077210773107741077510776107771077810779107801078110782107831078410785107861078710788107891079010791107921079310794107951079610797107981079910800108011080210803108041080510806108071080810809108101081110812108131081410815108161081710818108191082010821108221082310824108251082610827108281082910830108311083210833108341083510836108371083810839108401084110842108431084410845108461084710848108491085010851108521085310854108551085610857108581085910860108611086210863108641086510866108671086810869108701087110872108731087410875108761087710878108791088010881108821088310884108851088610887108881088910890108911089210893108941089510896108971089810899109001090110902109031090410905109061090710908109091091010911109121091310914109151091610917109181091910920109211092210923109241092510926109271092810929109301093110932109331093410935109361093710938109391094010941109421094310944109451094610947109481094910950109511095210953109541095510956109571095810959109601096110962109631096410965109661096710968109691097010971109721097310974109751097610977109781097910980109811098210983109841098510986109871098810989109901099110992109931099410995109961099710998109991100011001110021100311004110051100611007110081100911010110111101211013110141101511016110171101811019110201102111022110231102411025110261102711028110291103011031110321103311034110351103611037110381103911040110411104211043110441104511046110471104811049110501105111052110531105411055110561105711058110591106011061110621106311064110651106611067110681106911070110711107211073110741107511076110771107811079110801108111082110831108411085110861108711088110891109011091110921109311094110951109611097110981109911100111011110211103111041110511106111071110811109111101111111112111131111411115111161111711118111191112011121111221112311124111251112611127111281112911130111311113211133111341113511136111371113811139111401114111142111431114411145111461114711148111491115011151111521115311154111551115611157111581115911160111611116211163111641116511166111671116811169111701117111172111731117411175111761117711178111791118011181111821118311184111851118611187111881118911190111911119211193111941119511196111971119811199112001120111202112031120411205112061120711208112091121011211112121121311214112151121611217112181121911220112211122211223112241122511226112271122811229112301123111232112331123411235112361123711238112391124011241112421124311244112451124611247112481124911250112511125211253112541125511256112571125811259112601126111262112631126411265112661126711268112691127011271112721127311274112751127611277112781127911280112811128211283112841128511286112871128811289112901129111292112931129411295112961129711298112991130011301113021130311304113051130611307113081130911310113111131211313113141131511316113171131811319113201132111322113231132411325113261132711328113291133011331113321133311334113351133611337113381133911340113411134211343113441134511346113471134811349113501135111352113531135411355113561135711358113591136011361113621136311364113651136611367113681136911370113711137211373113741137511376113771137811379113801138111382113831138411385113861138711388113891139011391113921139311394113951139611397113981139911400114011140211403114041140511406114071140811409114101141111412114131141411415114161141711418114191142011421114221142311424114251142611427114281142911430114311143211433114341143511436114371143811439114401144111442114431144411445114461144711448114491145011451114521145311454114551145611457114581145911460114611146211463114641146511466114671146811469114701147111472114731147411475114761147711478114791148011481114821148311484114851148611487114881148911490114911149211493114941149511496114971149811499115001150111502115031150411505115061150711508115091151011511115121151311514115151151611517115181151911520115211152211523115241152511526115271152811529115301153111532115331153411535115361153711538115391154011541115421154311544115451154611547115481154911550115511155211553115541155511556115571155811559115601156111562115631156411565115661156711568115691157011571115721157311574115751157611577115781157911580115811158211583115841158511586115871158811589115901159111592115931159411595115961159711598115991160011601116021160311604116051160611607116081160911610116111161211613116141161511616116171161811619116201162111622116231162411625116261162711628116291163011631116321163311634116351163611637116381163911640116411164211643116441164511646116471164811649116501165111652116531165411655116561165711658116591166011661116621166311664116651166611667116681166911670116711167211673116741167511676116771167811679116801168111682116831168411685116861168711688116891169011691116921169311694116951169611697116981169911700117011170211703117041170511706117071170811709117101171111712117131171411715117161171711718117191172011721117221172311724117251172611727117281172911730117311173211733117341173511736117371173811739117401174111742117431174411745117461174711748117491175011751117521175311754117551175611757117581175911760117611176211763117641176511766117671176811769117701177111772117731177411775117761177711778117791178011781117821178311784117851178611787117881178911790117911179211793117941179511796117971179811799118001180111802118031180411805118061180711808118091181011811118121181311814118151181611817118181181911820118211182211823118241182511826118271182811829118301183111832118331183411835118361183711838118391184011841118421184311844118451184611847118481184911850118511185211853118541185511856118571185811859118601186111862118631186411865118661186711868118691187011871118721187311874118751187611877118781187911880118811188211883118841188511886118871188811889118901189111892118931189411895118961189711898118991190011901119021190311904119051190611907119081190911910119111191211913119141191511916119171191811919119201192111922119231192411925119261192711928119291193011931119321193311934119351193611937119381193911940119411194211943119441194511946119471194811949119501195111952119531195411955119561195711958119591196011961119621196311964119651196611967119681196911970119711197211973119741197511976119771197811979119801198111982119831198411985119861198711988119891199011991119921199311994119951199611997119981199912000120011200212003120041200512006120071200812009120101201112012120131201412015120161201712018120191202012021120221202312024120251202612027120281202912030120311203212033120341203512036120371203812039120401204112042120431204412045120461204712048120491205012051120521205312054120551205612057120581205912060120611206212063120641206512066120671206812069120701207112072120731207412075120761207712078120791208012081120821208312084120851208612087120881208912090120911209212093120941209512096120971209812099121001210112102121031210412105121061210712108121091211012111121121211312114121151211612117121181211912120121211212212123121241212512126121271212812129121301213112132121331213412135121361213712138121391214012141121421214312144121451214612147121481214912150121511215212153121541215512156121571215812159121601216112162121631216412165121661216712168121691217012171121721217312174121751217612177121781217912180121811218212183121841218512186121871218812189121901219112192121931219412195121961219712198121991220012201122021220312204122051220612207122081220912210122111221212213122141221512216122171221812219122201222112222122231222412225122261222712228122291223012231122321223312234122351223612237122381223912240122411224212243122441224512246122471224812249122501225112252122531225412255122561225712258122591226012261122621226312264122651226612267122681226912270122711227212273122741227512276122771227812279122801228112282122831228412285122861228712288122891229012291122921229312294122951229612297122981229912300123011230212303123041230512306123071230812309123101231112312123131231412315123161231712318123191232012321123221232312324123251232612327123281232912330123311233212333123341233512336123371233812339123401234112342123431234412345123461234712348123491235012351123521235312354123551235612357123581235912360123611236212363123641236512366123671236812369123701237112372123731237412375123761237712378123791238012381123821238312384123851238612387123881238912390123911239212393123941239512396123971239812399124001240112402124031240412405124061240712408124091241012411124121241312414124151241612417124181241912420124211242212423124241242512426124271242812429124301243112432124331243412435124361243712438124391244012441124421244312444124451244612447124481244912450124511245212453124541245512456124571245812459124601246112462124631246412465124661246712468124691247012471124721247312474124751247612477124781247912480124811248212483124841248512486124871248812489124901249112492124931249412495124961249712498124991250012501125021250312504125051250612507125081250912510125111251212513125141251512516125171251812519125201252112522125231252412525125261252712528125291253012531125321253312534125351253612537125381253912540125411254212543125441254512546125471254812549125501255112552125531255412555125561255712558125591256012561125621256312564125651256612567125681256912570125711257212573125741257512576125771257812579125801258112582125831258412585125861258712588125891259012591125921259312594125951259612597125981259912600126011260212603126041260512606126071260812609126101261112612126131261412615126161261712618126191262012621126221262312624126251262612627126281262912630126311263212633126341263512636126371263812639126401264112642126431264412645126461264712648126491265012651126521265312654126551265612657126581265912660126611266212663126641266512666126671266812669126701267112672126731267412675126761267712678126791268012681126821268312684126851268612687126881268912690126911269212693126941269512696126971269812699127001270112702127031270412705127061270712708127091271012711127121271312714127151271612717127181271912720127211272212723127241272512726127271272812729127301273112732127331273412735127361273712738127391274012741127421274312744127451274612747127481274912750127511275212753127541275512756127571275812759127601276112762127631276412765127661276712768127691277012771127721277312774127751277612777127781277912780127811278212783127841278512786127871278812789127901279112792127931279412795127961279712798127991280012801128021280312804128051280612807128081280912810128111281212813128141281512816128171281812819128201282112822128231282412825128261282712828128291283012831128321283312834128351283612837128381283912840128411284212843128441284512846128471284812849128501285112852128531285412855128561285712858128591286012861128621286312864128651286612867128681286912870128711287212873128741287512876128771287812879128801288112882128831288412885128861288712888128891289012891128921289312894128951289612897128981289912900129011290212903129041290512906129071290812909129101291112912129131291412915129161291712918129191292012921129221292312924129251292612927129281292912930129311293212933129341293512936129371293812939129401294112942129431294412945129461294712948129491295012951129521295312954129551295612957129581295912960129611296212963129641296512966129671296812969129701297112972129731297412975129761297712978129791298012981129821298312984129851298612987129881298912990129911299212993129941299512996129971299812999130001300113002130031300413005130061300713008130091301013011130121301313014130151301613017130181301913020130211302213023130241302513026130271302813029130301303113032130331303413035130361303713038130391304013041130421304313044130451304613047130481304913050130511305213053130541305513056130571305813059130601306113062130631306413065130661306713068130691307013071130721307313074130751307613077130781307913080130811308213083130841308513086130871308813089130901309113092130931309413095130961309713098130991310013101131021310313104131051310613107131081310913110131111311213113131141311513116131171311813119131201312113122131231312413125131261312713128131291313013131131321313313134131351313613137131381313913140131411314213143131441314513146131471314813149131501315113152131531315413155131561315713158131591316013161131621316313164131651316613167131681316913170131711317213173131741317513176131771317813179131801318113182131831318413185131861318713188131891319013191131921319313194131951319613197131981319913200132011320213203132041320513206132071320813209132101321113212132131321413215132161321713218132191322013221132221322313224132251322613227132281322913230132311323213233132341323513236132371323813239132401324113242132431324413245132461324713248132491325013251132521325313254132551325613257132581325913260132611326213263132641326513266132671326813269132701327113272132731327413275132761327713278132791328013281132821328313284132851328613287132881328913290132911329213293132941329513296132971329813299133001330113302133031330413305133061330713308133091331013311133121331313314133151331613317133181331913320133211332213323133241332513326133271332813329133301333113332133331333413335133361333713338133391334013341133421334313344133451334613347133481334913350133511335213353133541335513356133571335813359133601336113362133631336413365133661336713368133691337013371133721337313374133751337613377133781337913380133811338213383133841338513386133871338813389133901339113392133931339413395133961339713398133991340013401134021340313404134051340613407134081340913410134111341213413134141341513416134171341813419134201342113422134231342413425134261342713428134291343013431134321343313434134351343613437134381343913440134411344213443134441344513446134471344813449134501345113452134531345413455134561345713458134591346013461134621346313464134651346613467134681346913470134711347213473134741347513476134771347813479134801348113482134831348413485134861348713488134891349013491134921349313494134951349613497134981349913500135011350213503135041350513506135071350813509135101351113512135131351413515135161351713518135191352013521135221352313524135251352613527135281352913530135311353213533135341353513536135371353813539135401354113542135431354413545135461354713548135491355013551135521355313554135551355613557135581355913560135611356213563135641356513566135671356813569135701357113572135731357413575135761357713578135791358013581135821358313584135851358613587135881358913590135911359213593135941359513596135971359813599136001360113602136031360413605136061360713608136091361013611136121361313614136151361613617136181361913620136211362213623136241362513626136271362813629136301363113632136331363413635136361363713638136391364013641136421364313644136451364613647136481364913650136511365213653136541365513656136571365813659136601366113662136631366413665136661366713668136691367013671136721367313674136751367613677136781367913680136811368213683136841368513686136871368813689136901369113692136931369413695136961369713698136991370013701137021370313704137051370613707137081370913710137111371213713137141371513716137171371813719137201372113722137231372413725137261372713728137291373013731137321373313734137351373613737137381373913740137411374213743137441374513746137471374813749137501375113752137531375413755137561375713758137591376013761137621376313764137651376613767137681376913770137711377213773137741377513776137771377813779137801378113782137831378413785137861378713788137891379013791137921379313794137951379613797137981379913800138011380213803138041380513806138071380813809138101381113812138131381413815138161381713818138191382013821138221382313824138251382613827138281382913830138311383213833138341383513836138371383813839138401384113842138431384413845138461384713848138491385013851138521385313854138551385613857138581385913860138611386213863138641386513866138671386813869138701387113872138731387413875138761387713878138791388013881138821388313884138851388613887138881388913890138911389213893138941389513896138971389813899139001390113902139031390413905139061390713908139091391013911139121391313914139151391613917139181391913920139211392213923139241392513926139271392813929139301393113932139331393413935139361393713938139391394013941139421394313944139451394613947139481394913950139511395213953139541395513956139571395813959139601396113962139631396413965139661396713968139691397013971139721397313974139751397613977139781397913980139811398213983139841398513986139871398813989139901399113992139931399413995139961399713998139991400014001140021400314004140051400614007140081400914010140111401214013140141401514016140171401814019140201402114022140231402414025140261402714028140291403014031140321403314034140351403614037140381403914040140411404214043140441404514046140471404814049140501405114052140531405414055140561405714058140591406014061140621406314064140651406614067140681406914070140711407214073140741407514076140771407814079140801408114082140831408414085140861408714088140891409014091140921409314094140951409614097140981409914100141011410214103141041410514106141071410814109141101411114112141131411414115141161411714118141191412014121141221412314124141251412614127141281412914130141311413214133141341413514136141371413814139141401414114142141431414414145141461414714148141491415014151141521415314154141551415614157141581415914160141611416214163141641416514166141671416814169141701417114172141731417414175141761417714178141791418014181141821418314184141851418614187141881418914190141911419214193141941419514196141971419814199142001420114202142031420414205142061420714208142091421014211142121421314214142151421614217142181421914220142211422214223142241422514226142271422814229142301423114232142331423414235142361423714238142391424014241142421424314244142451424614247142481424914250142511425214253142541425514256142571425814259142601426114262142631426414265142661426714268142691427014271142721427314274142751427614277142781427914280142811428214283142841428514286142871428814289142901429114292142931429414295142961429714298142991430014301143021430314304143051430614307143081430914310143111431214313143141431514316143171431814319143201432114322143231432414325143261432714328143291433014331143321433314334143351433614337143381433914340143411434214343143441434514346143471434814349143501435114352143531435414355143561435714358143591436014361143621436314364143651436614367143681436914370143711437214373143741437514376143771437814379143801438114382143831438414385143861438714388143891439014391143921439314394143951439614397143981439914400144011440214403144041440514406144071440814409144101441114412144131441414415144161441714418144191442014421144221442314424144251442614427144281442914430144311443214433144341443514436144371443814439144401444114442144431444414445144461444714448144491445014451144521445314454144551445614457144581445914460144611446214463144641446514466144671446814469144701447114472144731447414475144761447714478144791448014481144821448314484144851448614487144881448914490144911449214493144941449514496144971449814499145001450114502145031450414505145061450714508145091451014511145121451314514145151451614517145181451914520145211452214523145241452514526145271452814529145301453114532145331453414535145361453714538145391454014541145421454314544145451454614547145481454914550145511455214553145541455514556145571455814559145601456114562145631456414565145661456714568145691457014571145721457314574145751457614577145781457914580145811458214583145841458514586145871458814589145901459114592145931459414595145961459714598145991460014601146021460314604146051460614607146081460914610146111461214613146141461514616146171461814619146201462114622146231462414625146261462714628146291463014631146321463314634146351463614637146381463914640146411464214643146441464514646146471464814649146501465114652146531465414655146561465714658146591466014661146621466314664146651466614667146681466914670146711467214673146741467514676146771467814679146801468114682146831468414685146861468714688146891469014691146921469314694146951469614697146981469914700147011470214703147041470514706147071470814709147101471114712147131471414715147161471714718147191472014721147221472314724147251472614727147281472914730147311473214733147341473514736147371473814739147401474114742147431474414745147461474714748147491475014751147521475314754147551475614757147581475914760147611476214763147641476514766147671476814769147701477114772147731477414775147761477714778147791478014781147821478314784147851478614787147881478914790147911479214793147941479514796147971479814799148001480114802148031480414805148061480714808148091481014811148121481314814148151481614817148181481914820148211482214823148241482514826148271482814829148301483114832148331483414835148361483714838148391484014841148421484314844148451484614847148481484914850148511485214853148541485514856148571485814859148601486114862148631486414865148661486714868148691487014871148721487314874148751487614877148781487914880148811488214883148841488514886148871488814889148901489114892148931489414895148961489714898148991490014901149021490314904149051490614907149081490914910149111491214913149141491514916149171491814919149201492114922149231492414925149261492714928149291493014931149321493314934149351493614937149381493914940149411494214943149441494514946149471494814949149501495114952149531495414955149561495714958149591496014961149621496314964149651496614967149681496914970149711497214973149741497514976149771497814979149801498114982149831498414985149861498714988149891499014991149921499314994149951499614997149981499915000150011500215003150041500515006150071500815009150101501115012150131501415015150161501715018150191502015021150221502315024150251502615027150281502915030150311503215033150341503515036150371503815039150401504115042150431504415045150461504715048150491505015051150521505315054150551505615057150581505915060150611506215063150641506515066150671506815069150701507115072150731507415075150761507715078150791508015081150821508315084150851508615087150881508915090150911509215093150941509515096150971509815099151001510115102151031510415105151061510715108151091511015111151121511315114151151511615117151181511915120151211512215123151241512515126151271512815129151301513115132151331513415135151361513715138151391514015141151421514315144151451514615147151481514915150151511515215153151541515515156151571515815159151601516115162151631516415165151661516715168151691517015171151721517315174151751517615177151781517915180151811518215183151841518515186151871518815189151901519115192151931519415195151961519715198151991520015201152021520315204152051520615207152081520915210152111521215213152141521515216152171521815219152201522115222152231522415225152261522715228152291523015231152321523315234152351523615237152381523915240152411524215243152441524515246152471524815249152501525115252152531525415255152561525715258152591526015261152621526315264152651526615267152681526915270152711527215273152741527515276152771527815279152801528115282152831528415285152861528715288152891529015291152921529315294152951529615297 |
- // Copyright (c) 2004-2013 Sergey Lyubka
- // Copyright (c) 2013-2024 Cesanta Software Limited
- // All rights reserved
- //
- // This software is dual-licensed: you can redistribute it and/or modify
- // it under the terms of the GNU General Public License version 2 as
- // published by the Free Software Foundation. For the terms of this
- // license, see http://www.gnu.org/licenses/
- //
- // You are free to use this software under the terms of the GNU General
- // Public License, but WITHOUT ANY WARRANTY; without even the implied
- // warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
- // See the GNU General Public License for more details.
- //
- // Alternatively, you can license this software under a commercial
- // license, as set out in https://www.mongoose.ws/licensing/
- //
- // SPDX-License-Identifier: GPL-2.0-only or commercial
- #include "mongoose.h"
- #ifdef MG_ENABLE_LINES
- #line 1 "src/base64.c"
- #endif
- static int mg_base64_encode_single(int c) {
- if (c < 26) {
- return c + 'A';
- } else if (c < 52) {
- return c - 26 + 'a';
- } else if (c < 62) {
- return c - 52 + '0';
- } else {
- return c == 62 ? '+' : '/';
- }
- }
- static int mg_base64_decode_single(int c) {
- if (c >= 'A' && c <= 'Z') {
- return c - 'A';
- } else if (c >= 'a' && c <= 'z') {
- return c + 26 - 'a';
- } else if (c >= '0' && c <= '9') {
- return c + 52 - '0';
- } else if (c == '+') {
- return 62;
- } else if (c == '/') {
- return 63;
- } else if (c == '=') {
- return 64;
- } else {
- return -1;
- }
- }
- size_t mg_base64_update(unsigned char ch, char *to, size_t n) {
- unsigned long rem = (n & 3) % 3;
- if (rem == 0) {
- to[n] = (char) mg_base64_encode_single(ch >> 2);
- to[++n] = (char) ((ch & 3) << 4);
- } else if (rem == 1) {
- to[n] = (char) mg_base64_encode_single(to[n] | (ch >> 4));
- to[++n] = (char) ((ch & 15) << 2);
- } else {
- to[n] = (char) mg_base64_encode_single(to[n] | (ch >> 6));
- to[++n] = (char) mg_base64_encode_single(ch & 63);
- n++;
- }
- return n;
- }
- size_t mg_base64_final(char *to, size_t n) {
- size_t saved = n;
- // printf("---[%.*s]\n", n, to);
- if (n & 3) n = mg_base64_update(0, to, n);
- if ((saved & 3) == 2) n--;
- // printf(" %d[%.*s]\n", n, n, to);
- while (n & 3) to[n++] = '=';
- to[n] = '\0';
- return n;
- }
- size_t mg_base64_encode(const unsigned char *p, size_t n, char *to, size_t dl) {
- size_t i, len = 0;
- if (dl > 0) to[0] = '\0';
- if (dl < ((n / 3) + (n % 3 ? 1 : 0)) * 4 + 1) return 0;
- for (i = 0; i < n; i++) len = mg_base64_update(p[i], to, len);
- len = mg_base64_final(to, len);
- return len;
- }
- size_t mg_base64_decode(const char *src, size_t n, char *dst, size_t dl) {
- const char *end = src == NULL ? NULL : src + n; // Cannot add to NULL
- size_t len = 0;
- if (dl < n / 4 * 3 + 1) goto fail;
- while (src != NULL && src + 3 < end) {
- int a = mg_base64_decode_single(src[0]),
- b = mg_base64_decode_single(src[1]),
- c = mg_base64_decode_single(src[2]),
- d = mg_base64_decode_single(src[3]);
- if (a == 64 || a < 0 || b == 64 || b < 0 || c < 0 || d < 0) {
- goto fail;
- }
- dst[len++] = (char) ((a << 2) | (b >> 4));
- if (src[2] != '=') {
- dst[len++] = (char) ((b << 4) | (c >> 2));
- if (src[3] != '=') dst[len++] = (char) ((c << 6) | d);
- }
- src += 4;
- }
- dst[len] = '\0';
- return len;
- fail:
- if (dl > 0) dst[0] = '\0';
- return 0;
- }
- #ifdef MG_ENABLE_LINES
- #line 1 "src/device_ch32v307.c"
- #endif
- #if MG_DEVICE == MG_DEVICE_CH32V307
- // RM: https://www.wch-ic.com/downloads/CH32FV2x_V3xRM_PDF.html
- #define FLASH_BASE 0x40022000
- #define FLASH_ACTLR (FLASH_BASE + 0)
- #define FLASH_KEYR (FLASH_BASE + 4)
- #define FLASH_OBKEYR (FLASH_BASE + 8)
- #define FLASH_STATR (FLASH_BASE + 12)
- #define FLASH_CTLR (FLASH_BASE + 16)
- #define FLASH_ADDR (FLASH_BASE + 20)
- #define FLASH_OBR (FLASH_BASE + 28)
- #define FLASH_WPR (FLASH_BASE + 32)
- void *mg_flash_start(void) {
- return (void *) 0x08000000;
- }
- size_t mg_flash_size(void) {
- return 480 * 1024; // First 320k is 0-wait
- }
- size_t mg_flash_sector_size(void) {
- return 4096;
- }
- size_t mg_flash_write_align(void) {
- return 4;
- }
- int mg_flash_bank(void) {
- return 0;
- }
- void mg_device_reset(void) {
- *((volatile uint32_t *) 0xbeef0000) |= 1U << 7; // NVIC_SystemReset()
- }
- static void flash_unlock(void) {
- static bool unlocked;
- if (unlocked == false) {
- MG_REG(FLASH_KEYR) = 0x45670123;
- MG_REG(FLASH_KEYR) = 0xcdef89ab;
- unlocked = true;
- }
- }
- static void flash_wait(void) {
- while (MG_REG(FLASH_STATR) & MG_BIT(0)) (void) 0;
- }
- bool mg_flash_erase(void *addr) {
- //MG_INFO(("%p", addr));
- flash_unlock();
- flash_wait();
- MG_REG(FLASH_ADDR) = (uint32_t) addr;
- MG_REG(FLASH_CTLR) |= MG_BIT(1) | MG_BIT(6); // PER | STRT;
- flash_wait();
- return true;
- }
- static bool is_page_boundary(const void *addr) {
- uint32_t val = (uint32_t) addr;
- return (val & (mg_flash_sector_size() - 1)) == 0;
- }
- bool mg_flash_write(void *addr, const void *buf, size_t len) {
- //MG_INFO(("%p %p %lu", addr, buf, len));
- //mg_hexdump(buf, len);
- flash_unlock();
- const uint16_t *src = (uint16_t *) buf, *end = &src[len / 2];
- uint16_t *dst = (uint16_t *) addr;
- MG_REG(FLASH_CTLR) |= MG_BIT(0); // Set PG
- //MG_INFO(("CTLR: %#lx", MG_REG(FLASH_CTLR)));
- while (src < end) {
- if (is_page_boundary(dst)) mg_flash_erase(dst);
- *dst++ = *src++;
- flash_wait();
- }
- MG_REG(FLASH_CTLR) &= ~MG_BIT(0); // Clear PG
- return true;
- }
- #endif
- #ifdef MG_ENABLE_LINES
- #line 1 "src/device_dummy.c"
- #endif
- #if MG_DEVICE == MG_DEVICE_NONE
- void *mg_flash_start(void) {
- return NULL;
- }
- size_t mg_flash_size(void) {
- return 0;
- }
- size_t mg_flash_sector_size(void) {
- return 0;
- }
- size_t mg_flash_write_align(void) {
- return 0;
- }
- int mg_flash_bank(void) {
- return 0;
- }
- bool mg_flash_erase(void *location) {
- (void) location;
- return false;
- }
- bool mg_flash_swap_bank(void) {
- return true;
- }
- bool mg_flash_write(void *addr, const void *buf, size_t len) {
- (void) addr, (void) buf, (void) len;
- return false;
- }
- void mg_device_reset(void) {
- }
- #endif
- #ifdef MG_ENABLE_LINES
- #line 1 "src/device_flash.c"
- #endif
- #if MG_DEVICE == MG_DEVICE_STM32H7 || MG_DEVICE == MG_DEVICE_STM32H5
- // Flash can be written only if it is erased. Erased flash is 0xff (all bits 1)
- // Writes must be mg_flash_write_align() - aligned. Thus if we want to save an
- // object, we pad it at the end for alignment.
- //
- // Objects in the flash sector are stored sequentially:
- // | 32-bit size | 32-bit KEY | ..data.. | ..pad.. | 32-bit size | ......
- //
- // In order to get to the next object, read its size, then align up.
- // Traverse the list of saved objects
- size_t mg_flash_next(char *p, char *end, uint32_t *key, size_t *size) {
- size_t aligned_size = 0, align = mg_flash_write_align(), left = end - p;
- uint32_t *p32 = (uint32_t *) p, min_size = sizeof(uint32_t) * 2;
- if (p32[0] != 0xffffffff && left > MG_ROUND_UP(min_size, align)) {
- if (size) *size = (size_t) p32[0];
- if (key) *key = p32[1];
- aligned_size = MG_ROUND_UP(p32[0] + sizeof(uint32_t) * 2, align);
- if (left < aligned_size) aligned_size = 0; // Out of bounds, fail
- }
- return aligned_size;
- }
- // Return the last sector of Bank 2
- static char *flash_last_sector(void) {
- size_t ss = mg_flash_sector_size(), size = mg_flash_size();
- char *base = (char *) mg_flash_start(), *last = base + size - ss;
- if (mg_flash_bank() == 2) last -= size / 2;
- return last;
- }
- // Find a saved object with a given key
- bool mg_flash_load(void *sector, uint32_t key, void *buf, size_t len) {
- char *base = (char *) mg_flash_start(), *s = (char *) sector, *res = NULL;
- size_t ss = mg_flash_sector_size(), ofs = 0, n, sz;
- bool ok = false;
- if (s == NULL) s = flash_last_sector();
- if (s < base || s >= base + mg_flash_size()) {
- MG_ERROR(("%p is outsize of flash", sector));
- } else if (((s - base) % ss) != 0) {
- MG_ERROR(("%p is not a sector boundary", sector));
- } else {
- uint32_t k, scanned = 0;
- while ((n = mg_flash_next(s + ofs, s + ss, &k, &sz)) > 0) {
- // MG_DEBUG((" > obj %lu, ofs %lu, key %x/%x", scanned, ofs, k, key));
- // mg_hexdump(s + ofs, n);
- if (k == key && sz == len) {
- res = s + ofs + sizeof(uint32_t) * 2;
- memcpy(buf, res, len); // Copy object
- ok = true; // Keep scanning for the newer versions of it
- }
- ofs += n, scanned++;
- }
- MG_DEBUG(("Scanned %u objects, key %x is @ %p", scanned, key, res));
- }
- return ok;
- }
- // For all saved objects in the sector, delete old versions of objects
- static void mg_flash_sector_cleanup(char *sector) {
- // Buffer all saved objects into an IO buffer (backed by RAM)
- // erase sector, and re-save them.
- struct mg_iobuf io = {0, 0, 0, 2048};
- size_t ss = mg_flash_sector_size();
- size_t n, size, size2, ofs = 0, hs = sizeof(uint32_t) * 2;
- uint32_t key;
- // Traverse all objects
- MG_DEBUG(("Cleaning up sector %p", sector));
- while ((n = mg_flash_next(sector + ofs, sector + ss, &key, &size)) > 0) {
- // Delete an old copy of this object in the cache
- for (size_t o = 0; o < io.len; o += size2 + hs) {
- uint32_t k = *(uint32_t *) (io.buf + o + sizeof(uint32_t));
- size2 = *(uint32_t *) (io.buf + o);
- if (k == key) {
- mg_iobuf_del(&io, o, size2 + hs);
- break;
- }
- }
- // And add the new copy
- mg_iobuf_add(&io, io.len, sector + ofs, size + hs);
- ofs += n;
- }
- // All objects are cached in RAM now
- if (mg_flash_erase(sector)) { // Erase sector. If successful,
- for (ofs = 0; ofs < io.len; ofs += size + hs) { // Traverse cached objects
- size = *(uint32_t *) (io.buf + ofs);
- key = *(uint32_t *) (io.buf + ofs + sizeof(uint32_t));
- mg_flash_save(sector, key, io.buf + ofs + hs, size); // Save to flash
- }
- }
- mg_iobuf_free(&io);
- }
- // Save an object with a given key - append to the end of an object list
- bool mg_flash_save(void *sector, uint32_t key, const void *buf, size_t len) {
- char *base = (char *) mg_flash_start(), *s = (char *) sector;
- size_t ss = mg_flash_sector_size(), ofs = 0, n;
- bool ok = false;
- if (s == NULL) s = flash_last_sector();
- if (s < base || s >= base + mg_flash_size()) {
- MG_ERROR(("%p is outsize of flash", sector));
- } else if (((s - base) % ss) != 0) {
- MG_ERROR(("%p is not a sector boundary", sector));
- } else {
- char ab[mg_flash_write_align()]; // Aligned write block
- uint32_t hdr[2] = {(uint32_t) len, key};
- size_t needed = sizeof(hdr) + len;
- size_t needed_aligned = MG_ROUND_UP(needed, sizeof(ab));
- while ((n = mg_flash_next(s + ofs, s + ss, NULL, NULL)) > 0) ofs += n;
- // If there is not enough space left, cleanup sector and re-eval ofs
- if (ofs + needed_aligned > ss) {
- mg_flash_sector_cleanup(s);
- ofs = 0;
- while ((n = mg_flash_next(s + ofs, s + ss, NULL, NULL)) > 0) ofs += n;
- }
- if (ofs + needed_aligned <= ss) {
- // Enough space to save this object
- if (sizeof(ab) < sizeof(hdr)) {
- // Flash write granularity is 32 bit or less, write with no buffering
- ok = mg_flash_write(s + ofs, hdr, sizeof(hdr));
- if (ok) mg_flash_write(s + ofs + sizeof(hdr), buf, len);
- } else {
- // Flash granularity is sizeof(hdr) or more. We need to save in
- // 3 chunks: initial block, bulk, rest. This is because we have
- // two memory chunks to write: hdr and buf, on aligned boundaries.
- n = sizeof(ab) - sizeof(hdr); // Initial chunk that we write
- if (n > len) n = len; // is
- memset(ab, 0xff, sizeof(ab)); // initialized to all-one
- memcpy(ab, hdr, sizeof(hdr)); // contains the header (key + size)
- memcpy(ab + sizeof(hdr), buf, n); // and an initial part of buf
- MG_INFO(("saving initial block of %lu", sizeof(ab)));
- ok = mg_flash_write(s + ofs, ab, sizeof(ab));
- if (ok && len > n) {
- size_t n2 = MG_ROUND_DOWN(len - n, sizeof(ab));
- if (n2 > 0) {
- MG_INFO(("saving bulk, %lu", n2));
- ok = mg_flash_write(s + ofs + sizeof(ab), (char *) buf + n, n2);
- }
- if (ok && len > n) {
- size_t n3 = len - n - n2;
- if (n3 > sizeof(ab)) n3 = sizeof(ab);
- memset(ab, 0xff, sizeof(ab));
- memcpy(ab, (char *) buf + n + n2, n3);
- MG_INFO(("saving rest, %lu", n3));
- ok = mg_flash_write(s + ofs + sizeof(ab) + n2, ab, sizeof(ab));
- }
- }
- }
- MG_DEBUG(("Saved %lu/%lu bytes @ %p, key %x: %d", len, needed_aligned,
- s + ofs, key, ok));
- MG_DEBUG(("Sector space left: %lu bytes", ss - ofs - needed_aligned));
- } else {
- MG_ERROR(("Sector is full"));
- }
- }
- return ok;
- }
- #else
- bool mg_flash_save(void *sector, uint32_t key, const void *buf, size_t len) {
- (void) sector, (void) key, (void) buf, (void) len;
- return false;
- }
- bool mg_flash_load(void *sector, uint32_t key, void *buf, size_t len) {
- (void) sector, (void) key, (void) buf, (void) len;
- return false;
- }
- #endif
- #ifdef MG_ENABLE_LINES
- #line 1 "src/device_stm32h5.c"
- #endif
- #if MG_DEVICE == MG_DEVICE_STM32H5
- #define FLASH_BASE 0x40022000 // Base address of the flash controller
- #define FLASH_KEYR (FLASH_BASE + 0x4) // See RM0481 7.11
- #define FLASH_OPTKEYR (FLASH_BASE + 0xc)
- #define FLASH_OPTCR (FLASH_BASE + 0x1c)
- #define FLASH_NSSR (FLASH_BASE + 0x20)
- #define FLASH_NSCR (FLASH_BASE + 0x28)
- #define FLASH_NSCCR (FLASH_BASE + 0x30)
- #define FLASH_OPTSR_CUR (FLASH_BASE + 0x50)
- #define FLASH_OPTSR_PRG (FLASH_BASE + 0x54)
- void *mg_flash_start(void) {
- return (void *) 0x08000000;
- }
- size_t mg_flash_size(void) {
- return 2 * 1024 * 1024; // 2Mb
- }
- size_t mg_flash_sector_size(void) {
- return 8 * 1024; // 8k
- }
- size_t mg_flash_write_align(void) {
- return 16; // 128 bit
- }
- int mg_flash_bank(void) {
- return MG_REG(FLASH_OPTCR) & MG_BIT(31) ? 2 : 1;
- }
- static void flash_unlock(void) {
- static bool unlocked = false;
- if (unlocked == false) {
- MG_REG(FLASH_KEYR) = 0x45670123;
- MG_REG(FLASH_KEYR) = 0Xcdef89ab;
- MG_REG(FLASH_OPTKEYR) = 0x08192a3b;
- MG_REG(FLASH_OPTKEYR) = 0x4c5d6e7f;
- unlocked = true;
- }
- }
- static int flash_page_start(volatile uint32_t *dst) {
- char *base = (char *) mg_flash_start(), *end = base + mg_flash_size();
- volatile char *p = (char *) dst;
- return p >= base && p < end && ((p - base) % mg_flash_sector_size()) == 0;
- }
- static bool flash_is_err(void) {
- return MG_REG(FLASH_NSSR) & ((MG_BIT(8) - 1) << 17); // RM0481 7.11.9
- }
- static void flash_wait(void) {
- while ((MG_REG(FLASH_NSSR) & MG_BIT(0)) &&
- (MG_REG(FLASH_NSSR) & MG_BIT(16)) == 0) {
- (void) 0;
- }
- }
- static void flash_clear_err(void) {
- flash_wait(); // Wait until ready
- MG_REG(FLASH_NSCCR) = ((MG_BIT(9) - 1) << 16U); // Clear all errors
- }
- static bool flash_bank_is_swapped(void) {
- return MG_REG(FLASH_OPTCR) & MG_BIT(31); // RM0481 7.11.8
- }
- bool mg_flash_erase(void *location) {
- bool ok = false;
- if (flash_page_start(location) == false) {
- MG_ERROR(("%p is not on a sector boundary"));
- } else {
- uintptr_t diff = (char *) location - (char *) mg_flash_start();
- uint32_t sector = diff / mg_flash_sector_size();
- uint32_t saved_cr = MG_REG(FLASH_NSCR); // Save CR value
- flash_unlock();
- flash_clear_err();
- MG_REG(FLASH_NSCR) = 0;
- if ((sector < 128 && flash_bank_is_swapped()) ||
- (sector > 127 && !flash_bank_is_swapped())) {
- MG_REG(FLASH_NSCR) |= MG_BIT(31); // Set FLASH_CR_BKSEL
- }
- if (sector > 127) sector -= 128;
- MG_REG(FLASH_NSCR) |= MG_BIT(2) | (sector << 6); // Erase | sector_num
- MG_REG(FLASH_NSCR) |= MG_BIT(5); // Start erasing
- flash_wait();
- ok = !flash_is_err();
- MG_DEBUG(("Erase sector %lu @ %p: %s. CR %#lx SR %#lx", sector, location,
- ok ? "ok" : "fail", MG_REG(FLASH_NSCR), MG_REG(FLASH_NSSR)));
- // mg_hexdump(location, 32);
- MG_REG(FLASH_NSCR) = saved_cr; // Restore saved CR
- }
- return ok;
- }
- bool mg_flash_swap_bank(void) {
- uint32_t desired = flash_bank_is_swapped() ? 0 : MG_BIT(31);
- flash_unlock();
- flash_clear_err();
- // printf("OPTSR_PRG 1 %#lx\n", FLASH->OPTSR_PRG);
- MG_SET_BITS(MG_REG(FLASH_OPTSR_PRG), MG_BIT(31), desired);
- // printf("OPTSR_PRG 2 %#lx\n", FLASH->OPTSR_PRG);
- MG_REG(FLASH_OPTCR) |= MG_BIT(1); // OPTSTART
- while ((MG_REG(FLASH_OPTSR_CUR) & MG_BIT(31)) != desired) (void) 0;
- return true;
- }
- bool mg_flash_write(void *addr, const void *buf, size_t len) {
- if ((len % mg_flash_write_align()) != 0) {
- MG_ERROR(("%lu is not aligned to %lu", len, mg_flash_write_align()));
- return false;
- }
- uint32_t *dst = (uint32_t *) addr;
- uint32_t *src = (uint32_t *) buf;
- uint32_t *end = (uint32_t *) ((char *) buf + len);
- bool ok = true;
- flash_unlock();
- flash_clear_err();
- MG_ARM_DISABLE_IRQ();
- // MG_DEBUG(("Starting flash write %lu bytes @ %p", len, addr));
- MG_REG(FLASH_NSCR) = MG_BIT(1); // Set programming flag
- while (ok && src < end) {
- if (flash_page_start(dst) && mg_flash_erase(dst) == false) break;
- *(volatile uint32_t *) dst++ = *src++;
- flash_wait();
- if (flash_is_err()) ok = false;
- }
- MG_ARM_ENABLE_IRQ();
- MG_DEBUG(("Flash write %lu bytes @ %p: %s. CR %#lx SR %#lx", len, dst,
- flash_is_err() ? "fail" : "ok", MG_REG(FLASH_NSCR),
- MG_REG(FLASH_NSSR)));
- MG_REG(FLASH_NSCR) = 0; // Clear flags
- return ok;
- }
- void mg_device_reset(void) {
- // SCB->AIRCR = ((0x5fa << SCB_AIRCR_VECTKEY_Pos)|SCB_AIRCR_SYSRESETREQ_Msk);
- *(volatile unsigned long *) 0xe000ed0c = 0x5fa0004;
- }
- #endif
- #ifdef MG_ENABLE_LINES
- #line 1 "src/device_stm32h7.c"
- #endif
- #if MG_DEVICE == MG_DEVICE_STM32H7
- #define FLASH_BASE1 0x52002000 // Base address for bank1
- #define FLASH_BASE2 0x52002100 // Base address for bank2
- #define FLASH_KEYR 0x04 // See RM0433 4.9.2
- #define FLASH_OPTKEYR 0x08
- #define FLASH_OPTCR 0x18
- #define FLASH_SR 0x10
- #define FLASH_CR 0x0c
- #define FLASH_CCR 0x14
- #define FLASH_OPTSR_CUR 0x1c
- #define FLASH_OPTSR_PRG 0x20
- #define FLASH_SIZE_REG 0x1ff1e880
- MG_IRAM void *mg_flash_start(void) {
- return (void *) 0x08000000;
- }
- MG_IRAM size_t mg_flash_size(void) {
- return MG_REG(FLASH_SIZE_REG) * 1024;
- }
- MG_IRAM size_t mg_flash_sector_size(void) {
- return 128 * 1024; // 128k
- }
- MG_IRAM size_t mg_flash_write_align(void) {
- return 32; // 256 bit
- }
- MG_IRAM int mg_flash_bank(void) {
- if (mg_flash_size() < 2 * 1024 * 1024) return 0; // No dual bank support
- return MG_REG(FLASH_BASE1 + FLASH_OPTCR) & MG_BIT(31) ? 2 : 1;
- }
- MG_IRAM static void flash_unlock(void) {
- static bool unlocked = false;
- if (unlocked == false) {
- MG_REG(FLASH_BASE1 + FLASH_KEYR) = 0x45670123;
- MG_REG(FLASH_BASE1 + FLASH_KEYR) = 0xcdef89ab;
- if (mg_flash_bank() > 0) {
- MG_REG(FLASH_BASE2 + FLASH_KEYR) = 0x45670123;
- MG_REG(FLASH_BASE2 + FLASH_KEYR) = 0xcdef89ab;
- }
- MG_REG(FLASH_BASE1 + FLASH_OPTKEYR) = 0x08192a3b; // opt reg is "shared"
- MG_REG(FLASH_BASE1 + FLASH_OPTKEYR) = 0x4c5d6e7f; // thus unlock once
- unlocked = true;
- }
- }
- MG_IRAM static bool flash_page_start(volatile uint32_t *dst) {
- char *base = (char *) mg_flash_start(), *end = base + mg_flash_size();
- volatile char *p = (char *) dst;
- return p >= base && p < end && ((p - base) % mg_flash_sector_size()) == 0;
- }
- MG_IRAM static bool flash_is_err(uint32_t bank) {
- return MG_REG(bank + FLASH_SR) & ((MG_BIT(11) - 1) << 17); // RM0433 4.9.5
- }
- MG_IRAM static void flash_wait(uint32_t bank) {
- while (MG_REG(bank + FLASH_SR) & (MG_BIT(0) | MG_BIT(2))) (void) 0;
- }
- MG_IRAM static void flash_clear_err(uint32_t bank) {
- flash_wait(bank); // Wait until ready
- MG_REG(bank + FLASH_CCR) = ((MG_BIT(11) - 1) << 16U); // Clear all errors
- }
- MG_IRAM static bool flash_bank_is_swapped(uint32_t bank) {
- return MG_REG(bank + FLASH_OPTCR) & MG_BIT(31); // RM0433 4.9.7
- }
- // Figure out flash bank based on the address
- MG_IRAM static uint32_t flash_bank(void *addr) {
- size_t ofs = (char *) addr - (char *) mg_flash_start();
- if (mg_flash_bank() == 0) return FLASH_BASE1;
- return ofs < mg_flash_size() / 2 ? FLASH_BASE1 : FLASH_BASE2;
- }
- MG_IRAM bool mg_flash_erase(void *addr) {
- bool ok = false;
- if (flash_page_start(addr) == false) {
- MG_ERROR(("%p is not on a sector boundary", addr));
- } else {
- uintptr_t diff = (char *) addr - (char *) mg_flash_start();
- uint32_t sector = diff / mg_flash_sector_size();
- uint32_t bank = flash_bank(addr);
- uint32_t saved_cr = MG_REG(bank + FLASH_CR); // Save CR value
- flash_unlock();
- if (sector > 7) sector -= 8;
- flash_clear_err(bank);
- MG_REG(bank + FLASH_CR) = MG_BIT(5); // 32-bit write parallelism
- MG_REG(bank + FLASH_CR) |= (sector & 7U) << 8U; // Sector to erase
- MG_REG(bank + FLASH_CR) |= MG_BIT(2); // Sector erase bit
- MG_REG(bank + FLASH_CR) |= MG_BIT(7); // Start erasing
- ok = !flash_is_err(bank);
- MG_DEBUG(("Erase sector %lu @ %p %s. CR %#lx SR %#lx", sector, addr,
- ok ? "ok" : "fail", MG_REG(bank + FLASH_CR),
- MG_REG(bank + FLASH_SR)));
- MG_REG(bank + FLASH_CR) = saved_cr; // Restore CR
- }
- return ok;
- }
- MG_IRAM bool mg_flash_swap_bank() {
- if (mg_flash_bank() == 0) return true;
- uint32_t bank = FLASH_BASE1;
- uint32_t desired = flash_bank_is_swapped(bank) ? 0 : MG_BIT(31);
- flash_unlock();
- flash_clear_err(bank);
- // printf("OPTSR_PRG 1 %#lx\n", FLASH->OPTSR_PRG);
- MG_SET_BITS(MG_REG(bank + FLASH_OPTSR_PRG), MG_BIT(31), desired);
- // printf("OPTSR_PRG 2 %#lx\n", FLASH->OPTSR_PRG);
- MG_REG(bank + FLASH_OPTCR) |= MG_BIT(1); // OPTSTART
- while ((MG_REG(bank + FLASH_OPTSR_CUR) & MG_BIT(31)) != desired) (void) 0;
- return true;
- }
- MG_IRAM bool mg_flash_write(void *addr, const void *buf, size_t len) {
- if ((len % mg_flash_write_align()) != 0) {
- MG_ERROR(("%lu is not aligned to %lu", len, mg_flash_write_align()));
- return false;
- }
- uint32_t bank = flash_bank(addr);
- uint32_t *dst = (uint32_t *) addr;
- uint32_t *src = (uint32_t *) buf;
- uint32_t *end = (uint32_t *) ((char *) buf + len);
- bool ok = true;
- flash_unlock();
- flash_clear_err(bank);
- MG_REG(bank + FLASH_CR) = MG_BIT(1); // Set programming flag
- MG_REG(bank + FLASH_CR) |= MG_BIT(5); // 32-bit write parallelism
- MG_DEBUG(("Writing flash @ %p, %lu bytes", addr, len));
- MG_ARM_DISABLE_IRQ();
- while (ok && src < end) {
- if (flash_page_start(dst) && mg_flash_erase(dst) == false) break;
- *(volatile uint32_t *) dst++ = *src++;
- flash_wait(bank);
- if (flash_is_err(bank)) ok = false;
- }
- MG_ARM_ENABLE_IRQ();
- MG_DEBUG(("Flash write %lu bytes @ %p: %s. CR %#lx SR %#lx", len, dst,
- ok ? "ok" : "fail", MG_REG(bank + FLASH_CR),
- MG_REG(bank + FLASH_SR)));
- MG_REG(bank + FLASH_CR) &= ~MG_BIT(1); // Clear programming flag
- return ok;
- }
- MG_IRAM void mg_device_reset(void) {
- // SCB->AIRCR = ((0x5fa << SCB_AIRCR_VECTKEY_Pos)|SCB_AIRCR_SYSRESETREQ_Msk);
- *(volatile unsigned long *) 0xe000ed0c = 0x5fa0004;
- }
- #endif
- #ifdef MG_ENABLE_LINES
- #line 1 "src/dns.c"
- #endif
- struct dns_data {
- struct dns_data *next;
- struct mg_connection *c;
- uint64_t expire;
- uint16_t txnid;
- };
- static void mg_sendnsreq(struct mg_connection *, struct mg_str *, int,
- struct mg_dns *, bool);
- static void mg_dns_free(struct dns_data **head, struct dns_data *d) {
- LIST_DELETE(struct dns_data, head, d);
- free(d);
- }
- void mg_resolve_cancel(struct mg_connection *c) {
- struct dns_data *tmp, *d;
- struct dns_data **head = (struct dns_data **) &c->mgr->active_dns_requests;
- for (d = *head; d != NULL; d = tmp) {
- tmp = d->next;
- if (d->c == c) mg_dns_free(head, d);
- }
- }
- static size_t mg_dns_parse_name_depth(const uint8_t *s, size_t len, size_t ofs,
- char *to, size_t tolen, size_t j,
- int depth) {
- size_t i = 0;
- if (tolen > 0 && depth == 0) to[0] = '\0';
- if (depth > 5) return 0;
- // MG_INFO(("ofs %lx %x %x", (unsigned long) ofs, s[ofs], s[ofs + 1]));
- while (ofs + i + 1 < len) {
- size_t n = s[ofs + i];
- if (n == 0) {
- i++;
- break;
- }
- if (n & 0xc0) {
- size_t ptr = (((n & 0x3f) << 8) | s[ofs + i + 1]); // 12 is hdr len
- // MG_INFO(("PTR %lx", (unsigned long) ptr));
- if (ptr + 1 < len && (s[ptr] & 0xc0) == 0 &&
- mg_dns_parse_name_depth(s, len, ptr, to, tolen, j, depth + 1) == 0)
- return 0;
- i += 2;
- break;
- }
- if (ofs + i + n + 1 >= len) return 0;
- if (j > 0) {
- if (j < tolen) to[j] = '.';
- j++;
- }
- if (j + n < tolen) memcpy(&to[j], &s[ofs + i + 1], n);
- j += n;
- i += n + 1;
- if (j < tolen) to[j] = '\0'; // Zero-terminate this chunk
- // MG_INFO(("--> [%s]", to));
- }
- if (tolen > 0) to[tolen - 1] = '\0'; // Make sure make sure it is nul-term
- return i;
- }
- static size_t mg_dns_parse_name(const uint8_t *s, size_t n, size_t ofs,
- char *dst, size_t dstlen) {
- return mg_dns_parse_name_depth(s, n, ofs, dst, dstlen, 0, 0);
- }
- size_t mg_dns_parse_rr(const uint8_t *buf, size_t len, size_t ofs,
- bool is_question, struct mg_dns_rr *rr) {
- const uint8_t *s = buf + ofs, *e = &buf[len];
- memset(rr, 0, sizeof(*rr));
- if (len < sizeof(struct mg_dns_header)) return 0; // Too small
- if (len > 512) return 0; // Too large, we don't expect that
- if (s >= e) return 0; // Overflow
- if ((rr->nlen = (uint16_t) mg_dns_parse_name(buf, len, ofs, NULL, 0)) == 0)
- return 0;
- s += rr->nlen + 4;
- if (s > e) return 0;
- rr->atype = (uint16_t) (((uint16_t) s[-4] << 8) | s[-3]);
- rr->aclass = (uint16_t) (((uint16_t) s[-2] << 8) | s[-1]);
- if (is_question) return (size_t) (rr->nlen + 4);
- s += 6;
- if (s > e) return 0;
- rr->alen = (uint16_t) (((uint16_t) s[-2] << 8) | s[-1]);
- if (s + rr->alen > e) return 0;
- return (size_t) (rr->nlen + rr->alen + 10);
- }
- bool mg_dns_parse(const uint8_t *buf, size_t len, struct mg_dns_message *dm) {
- const struct mg_dns_header *h = (struct mg_dns_header *) buf;
- struct mg_dns_rr rr;
- size_t i, n, ofs = sizeof(*h);
- memset(dm, 0, sizeof(*dm));
- if (len < sizeof(*h)) return 0; // Too small, headers dont fit
- if (mg_ntohs(h->num_questions) > 1) return 0; // Sanity
- if (mg_ntohs(h->num_answers) > 15) return 0; // Sanity
- dm->txnid = mg_ntohs(h->txnid);
- for (i = 0; i < mg_ntohs(h->num_questions); i++) {
- if ((n = mg_dns_parse_rr(buf, len, ofs, true, &rr)) == 0) return false;
- // MG_INFO(("Q %lu %lu %hu/%hu", ofs, n, rr.atype, rr.aclass));
- ofs += n;
- }
- for (i = 0; i < mg_ntohs(h->num_answers); i++) {
- if ((n = mg_dns_parse_rr(buf, len, ofs, false, &rr)) == 0) return false;
- // MG_INFO(("A -- %lu %lu %hu/%hu %s", ofs, n, rr.atype, rr.aclass,
- // dm->name));
- mg_dns_parse_name(buf, len, ofs, dm->name, sizeof(dm->name));
- ofs += n;
- if (rr.alen == 4 && rr.atype == 1 && rr.aclass == 1) {
- dm->addr.is_ip6 = false;
- memcpy(&dm->addr.ip, &buf[ofs - 4], 4);
- dm->resolved = true;
- break; // Return success
- } else if (rr.alen == 16 && rr.atype == 28 && rr.aclass == 1) {
- dm->addr.is_ip6 = true;
- memcpy(&dm->addr.ip, &buf[ofs - 16], 16);
- dm->resolved = true;
- break; // Return success
- }
- }
- return true;
- }
- static void dns_cb(struct mg_connection *c, int ev, void *ev_data) {
- struct dns_data *d, *tmp;
- struct dns_data **head = (struct dns_data **) &c->mgr->active_dns_requests;
- if (ev == MG_EV_POLL) {
- uint64_t now = *(uint64_t *) ev_data;
- for (d = *head; d != NULL; d = tmp) {
- tmp = d->next;
- // MG_DEBUG ("%lu %lu dns poll", d->expire, now));
- if (now > d->expire) mg_error(d->c, "DNS timeout");
- }
- } else if (ev == MG_EV_READ) {
- struct mg_dns_message dm;
- int resolved = 0;
- if (mg_dns_parse(c->recv.buf, c->recv.len, &dm) == false) {
- MG_ERROR(("Unexpected DNS response:"));
- mg_hexdump(c->recv.buf, c->recv.len);
- } else {
- // MG_VERBOSE(("%s %d", dm.name, dm.resolved));
- for (d = *head; d != NULL; d = tmp) {
- tmp = d->next;
- // MG_INFO(("d %p %hu %hu", d, d->txnid, dm.txnid));
- if (dm.txnid != d->txnid) continue;
- if (d->c->is_resolving) {
- if (dm.resolved) {
- dm.addr.port = d->c->rem.port; // Save port
- d->c->rem = dm.addr; // Copy resolved address
- MG_DEBUG(
- ("%lu %s is %M", d->c->id, dm.name, mg_print_ip, &d->c->rem));
- mg_connect_resolved(d->c);
- #if MG_ENABLE_IPV6
- } else if (dm.addr.is_ip6 == false && dm.name[0] != '\0' &&
- c->mgr->use_dns6 == false) {
- struct mg_str x = mg_str(dm.name);
- mg_sendnsreq(d->c, &x, c->mgr->dnstimeout, &c->mgr->dns6, true);
- #endif
- } else {
- mg_error(d->c, "%s DNS lookup failed", dm.name);
- }
- } else {
- MG_ERROR(("%lu already resolved", d->c->id));
- }
- mg_dns_free(head, d);
- resolved = 1;
- }
- }
- if (!resolved) MG_ERROR(("stray DNS reply"));
- c->recv.len = 0;
- } else if (ev == MG_EV_CLOSE) {
- for (d = *head; d != NULL; d = tmp) {
- tmp = d->next;
- mg_error(d->c, "DNS error");
- mg_dns_free(head, d);
- }
- }
- }
- static bool mg_dns_send(struct mg_connection *c, const struct mg_str *name,
- uint16_t txnid, bool ipv6) {
- struct {
- struct mg_dns_header header;
- uint8_t data[256];
- } pkt;
- size_t i, n;
- memset(&pkt, 0, sizeof(pkt));
- pkt.header.txnid = mg_htons(txnid);
- pkt.header.flags = mg_htons(0x100);
- pkt.header.num_questions = mg_htons(1);
- for (i = n = 0; i < sizeof(pkt.data) - 5; i++) {
- if (name->ptr[i] == '.' || i >= name->len) {
- pkt.data[n] = (uint8_t) (i - n);
- memcpy(&pkt.data[n + 1], name->ptr + n, i - n);
- n = i + 1;
- }
- if (i >= name->len) break;
- }
- memcpy(&pkt.data[n], "\x00\x00\x01\x00\x01", 5); // A query
- n += 5;
- if (ipv6) pkt.data[n - 3] = 0x1c; // AAAA query
- // memcpy(&pkt.data[n], "\xc0\x0c\x00\x1c\x00\x01", 6); // AAAA query
- // n += 6;
- return mg_send(c, &pkt, sizeof(pkt.header) + n);
- }
- static void mg_sendnsreq(struct mg_connection *c, struct mg_str *name, int ms,
- struct mg_dns *dnsc, bool ipv6) {
- struct dns_data *d = NULL;
- if (dnsc->url == NULL) {
- mg_error(c, "DNS server URL is NULL. Call mg_mgr_init()");
- } else if (dnsc->c == NULL) {
- dnsc->c = mg_connect(c->mgr, dnsc->url, NULL, NULL);
- if (dnsc->c != NULL) {
- dnsc->c->pfn = dns_cb;
- // dnsc->c->is_hexdumping = 1;
- }
- }
- if (dnsc->c == NULL) {
- mg_error(c, "resolver");
- } else if ((d = (struct dns_data *) calloc(1, sizeof(*d))) == NULL) {
- mg_error(c, "resolve OOM");
- } else {
- struct dns_data *reqs = (struct dns_data *) c->mgr->active_dns_requests;
- d->txnid = reqs ? (uint16_t) (reqs->txnid + 1) : 1;
- d->next = (struct dns_data *) c->mgr->active_dns_requests;
- c->mgr->active_dns_requests = d;
- d->expire = mg_millis() + (uint64_t) ms;
- d->c = c;
- c->is_resolving = 1;
- MG_VERBOSE(("%lu resolving %.*s @ %s, txnid %hu", c->id, (int) name->len,
- name->ptr, dnsc->url, d->txnid));
- if (!mg_dns_send(dnsc->c, name, d->txnid, ipv6)) {
- mg_error(dnsc->c, "DNS send");
- }
- }
- }
- void mg_resolve(struct mg_connection *c, const char *url) {
- struct mg_str host = mg_url_host(url);
- c->rem.port = mg_htons(mg_url_port(url));
- if (mg_aton(host, &c->rem)) {
- // host is an IP address, do not fire name resolution
- mg_connect_resolved(c);
- } else {
- // host is not an IP, send DNS resolution request
- struct mg_dns *dns = c->mgr->use_dns6 ? &c->mgr->dns6 : &c->mgr->dns4;
- mg_sendnsreq(c, &host, c->mgr->dnstimeout, dns, c->mgr->use_dns6);
- }
- }
- #ifdef MG_ENABLE_LINES
- #line 1 "src/event.c"
- #endif
- void mg_call(struct mg_connection *c, int ev, void *ev_data) {
- #if MG_ENABLE_PROFILE
- const char *names[] = {
- "EV_ERROR", "EV_OPEN", "EV_POLL", "EV_RESOLVE",
- "EV_CONNECT", "EV_ACCEPT", "EV_TLS_HS", "EV_READ",
- "EV_WRITE", "EV_CLOSE", "EV_HTTP_MSG", "EV_HTTP_CHUNK",
- "EV_WS_OPEN", "EV_WS_MSG", "EV_WS_CTL", "EV_MQTT_CMD",
- "EV_MQTT_MSG", "EV_MQTT_OPEN", "EV_SNTP_TIME", "EV_USER"};
- if (ev != MG_EV_POLL && ev < (int) (sizeof(names) / sizeof(names[0]))) {
- MG_PROF_ADD(c, names[ev]);
- }
- #endif
- // Run user-defined handler first, in order to give it an ability
- // to intercept processing (e.g. clean input buffer) before the
- // protocol handler kicks in
- if (c->fn != NULL) c->fn(c, ev, ev_data);
- if (c->pfn != NULL) c->pfn(c, ev, ev_data);
- }
- void mg_error(struct mg_connection *c, const char *fmt, ...) {
- char buf[64];
- va_list ap;
- va_start(ap, fmt);
- mg_vsnprintf(buf, sizeof(buf), fmt, &ap);
- va_end(ap);
- MG_ERROR(("%lu %ld %s", c->id, c->fd, buf));
- c->is_closing = 1; // Set is_closing before sending MG_EV_CALL
- mg_call(c, MG_EV_ERROR, buf); // Let user handler override it
- }
- #ifdef MG_ENABLE_LINES
- #line 1 "src/fmt.c"
- #endif
- static bool is_digit(int c) {
- return c >= '0' && c <= '9';
- }
- static int addexp(char *buf, int e, int sign) {
- int n = 0;
- buf[n++] = 'e';
- buf[n++] = (char) sign;
- if (e > 400) return 0;
- if (e < 10) buf[n++] = '0';
- if (e >= 100) buf[n++] = (char) (e / 100 + '0'), e -= 100 * (e / 100);
- if (e >= 10) buf[n++] = (char) (e / 10 + '0'), e -= 10 * (e / 10);
- buf[n++] = (char) (e + '0');
- return n;
- }
- static int xisinf(double x) {
- union {
- double f;
- uint64_t u;
- } ieee754 = {x};
- return ((unsigned) (ieee754.u >> 32) & 0x7fffffff) == 0x7ff00000 &&
- ((unsigned) ieee754.u == 0);
- }
- static int xisnan(double x) {
- union {
- double f;
- uint64_t u;
- } ieee754 = {x};
- return ((unsigned) (ieee754.u >> 32) & 0x7fffffff) +
- ((unsigned) ieee754.u != 0) >
- 0x7ff00000;
- }
- static size_t mg_dtoa(char *dst, size_t dstlen, double d, int width, bool tz) {
- char buf[40];
- int i, s = 0, n = 0, e = 0;
- double t, mul, saved;
- if (d == 0.0) return mg_snprintf(dst, dstlen, "%s", "0");
- if (xisinf(d)) return mg_snprintf(dst, dstlen, "%s", d > 0 ? "inf" : "-inf");
- if (xisnan(d)) return mg_snprintf(dst, dstlen, "%s", "nan");
- if (d < 0.0) d = -d, buf[s++] = '-';
- // Round
- saved = d;
- mul = 1.0;
- while (d >= 10.0 && d / mul >= 10.0) mul *= 10.0;
- while (d <= 1.0 && d / mul <= 1.0) mul /= 10.0;
- for (i = 0, t = mul * 5; i < width; i++) t /= 10.0;
- d += t;
- // Calculate exponent, and 'mul' for scientific representation
- mul = 1.0;
- while (d >= 10.0 && d / mul >= 10.0) mul *= 10.0, e++;
- while (d < 1.0 && d / mul < 1.0) mul /= 10.0, e--;
- // printf(" --> %g %d %g %g\n", saved, e, t, mul);
- if (e >= width && width > 1) {
- n = (int) mg_dtoa(buf, sizeof(buf), saved / mul, width, tz);
- // printf(" --> %.*g %d [%.*s]\n", 10, d / t, e, n, buf);
- n += addexp(buf + s + n, e, '+');
- return mg_snprintf(dst, dstlen, "%.*s", n, buf);
- } else if (e <= -width && width > 1) {
- n = (int) mg_dtoa(buf, sizeof(buf), saved / mul, width, tz);
- // printf(" --> %.*g %d [%.*s]\n", 10, d / mul, e, n, buf);
- n += addexp(buf + s + n, -e, '-');
- return mg_snprintf(dst, dstlen, "%.*s", n, buf);
- } else {
- for (i = 0, t = mul; t >= 1.0 && s + n < (int) sizeof(buf); i++) {
- int ch = (int) (d / t);
- if (n > 0 || ch > 0) buf[s + n++] = (char) (ch + '0');
- d -= ch * t;
- t /= 10.0;
- }
- // printf(" --> [%g] -> %g %g (%d) [%.*s]\n", saved, d, t, n, s + n, buf);
- if (n == 0) buf[s++] = '0';
- while (t >= 1.0 && n + s < (int) sizeof(buf)) buf[n++] = '0', t /= 10.0;
- if (s + n < (int) sizeof(buf)) buf[n + s++] = '.';
- // printf(" 1--> [%g] -> [%.*s]\n", saved, s + n, buf);
- for (i = 0, t = 0.1; s + n < (int) sizeof(buf) && n < width; i++) {
- int ch = (int) (d / t);
- buf[s + n++] = (char) (ch + '0');
- d -= ch * t;
- t /= 10.0;
- }
- }
- while (tz && n > 0 && buf[s + n - 1] == '0') n--; // Trim trailing zeroes
- if (n > 0 && buf[s + n - 1] == '.') n--; // Trim trailing dot
- n += s;
- if (n >= (int) sizeof(buf)) n = (int) sizeof(buf) - 1;
- buf[n] = '\0';
- return mg_snprintf(dst, dstlen, "%s", buf);
- }
- static size_t mg_lld(char *buf, int64_t val, bool is_signed, bool is_hex) {
- const char *letters = "0123456789abcdef";
- uint64_t v = (uint64_t) val;
- size_t s = 0, n, i;
- if (is_signed && val < 0) buf[s++] = '-', v = (uint64_t) (-val);
- // This loop prints a number in reverse order. I guess this is because we
- // write numbers from right to left: least significant digit comes last.
- // Maybe because we use Arabic numbers, and Arabs write RTL?
- if (is_hex) {
- for (n = 0; v; v >>= 4) buf[s + n++] = letters[v & 15];
- } else {
- for (n = 0; v; v /= 10) buf[s + n++] = letters[v % 10];
- }
- // Reverse a string
- for (i = 0; i < n / 2; i++) {
- char t = buf[s + i];
- buf[s + i] = buf[s + n - i - 1], buf[s + n - i - 1] = t;
- }
- if (val == 0) buf[n++] = '0'; // Handle special case
- return n + s;
- }
- static size_t scpy(void (*out)(char, void *), void *ptr, char *buf,
- size_t len) {
- size_t i = 0;
- while (i < len && buf[i] != '\0') out(buf[i++], ptr);
- return i;
- }
- size_t mg_xprintf(void (*out)(char, void *), void *ptr, const char *fmt, ...) {
- size_t len = 0;
- va_list ap;
- va_start(ap, fmt);
- len = mg_vxprintf(out, ptr, fmt, &ap);
- va_end(ap);
- return len;
- }
- size_t mg_vxprintf(void (*out)(char, void *), void *param, const char *fmt,
- va_list *ap) {
- size_t i = 0, n = 0;
- while (fmt[i] != '\0') {
- if (fmt[i] == '%') {
- size_t j, k, x = 0, is_long = 0, w = 0 /* width */, pr = ~0U /* prec */;
- char pad = ' ', minus = 0, c = fmt[++i];
- if (c == '#') x++, c = fmt[++i];
- if (c == '-') minus++, c = fmt[++i];
- if (c == '0') pad = '0', c = fmt[++i];
- while (is_digit(c)) w *= 10, w += (size_t) (c - '0'), c = fmt[++i];
- if (c == '.') {
- c = fmt[++i];
- if (c == '*') {
- pr = (size_t) va_arg(*ap, int);
- c = fmt[++i];
- } else {
- pr = 0;
- while (is_digit(c)) pr *= 10, pr += (size_t) (c - '0'), c = fmt[++i];
- }
- }
- while (c == 'h') c = fmt[++i]; // Treat h and hh as int
- if (c == 'l') {
- is_long++, c = fmt[++i];
- if (c == 'l') is_long++, c = fmt[++i];
- }
- if (c == 'p') x = 1, is_long = 1;
- if (c == 'd' || c == 'u' || c == 'x' || c == 'X' || c == 'p' ||
- c == 'g' || c == 'f') {
- bool s = (c == 'd'), h = (c == 'x' || c == 'X' || c == 'p');
- char tmp[40];
- size_t xl = x ? 2 : 0;
- if (c == 'g' || c == 'f') {
- double v = va_arg(*ap, double);
- if (pr == ~0U) pr = 6;
- k = mg_dtoa(tmp, sizeof(tmp), v, (int) pr, c == 'g');
- } else if (is_long == 2) {
- int64_t v = va_arg(*ap, int64_t);
- k = mg_lld(tmp, v, s, h);
- } else if (is_long == 1) {
- long v = va_arg(*ap, long);
- k = mg_lld(tmp, s ? (int64_t) v : (int64_t) (unsigned long) v, s, h);
- } else {
- int v = va_arg(*ap, int);
- k = mg_lld(tmp, s ? (int64_t) v : (int64_t) (unsigned) v, s, h);
- }
- for (j = 0; j < xl && w > 0; j++) w--;
- for (j = 0; pad == ' ' && !minus && k < w && j + k < w; j++)
- n += scpy(out, param, &pad, 1);
- n += scpy(out, param, (char *) "0x", xl);
- for (j = 0; pad == '0' && k < w && j + k < w; j++)
- n += scpy(out, param, &pad, 1);
- n += scpy(out, param, tmp, k);
- for (j = 0; pad == ' ' && minus && k < w && j + k < w; j++)
- n += scpy(out, param, &pad, 1);
- } else if (c == 'm' || c == 'M') {
- mg_pm_t f = va_arg(*ap, mg_pm_t);
- if (c == 'm') out('"', param);
- n += f(out, param, ap);
- if (c == 'm') n += 2, out('"', param);
- } else if (c == 'c') {
- int ch = va_arg(*ap, int);
- out((char) ch, param);
- n++;
- } else if (c == 's') {
- char *p = va_arg(*ap, char *);
- if (pr == ~0U) pr = p == NULL ? 0 : strlen(p);
- for (j = 0; !minus && pr < w && j + pr < w; j++)
- n += scpy(out, param, &pad, 1);
- n += scpy(out, param, p, pr);
- for (j = 0; minus && pr < w && j + pr < w; j++)
- n += scpy(out, param, &pad, 1);
- } else if (c == '%') {
- out('%', param);
- n++;
- } else {
- out('%', param);
- out(c, param);
- n += 2;
- }
- i++;
- } else {
- out(fmt[i], param), n++, i++;
- }
- }
- return n;
- }
- #ifdef MG_ENABLE_LINES
- #line 1 "src/fs.c"
- #endif
- struct mg_fd *mg_fs_open(struct mg_fs *fs, const char *path, int flags) {
- struct mg_fd *fd = (struct mg_fd *) calloc(1, sizeof(*fd));
- if (fd != NULL) {
- fd->fd = fs->op(path, flags);
- fd->fs = fs;
- if (fd->fd == NULL) {
- free(fd);
- fd = NULL;
- }
- }
- return fd;
- }
- void mg_fs_close(struct mg_fd *fd) {
- if (fd != NULL) {
- fd->fs->cl(fd->fd);
- free(fd);
- }
- }
- char *mg_file_read(struct mg_fs *fs, const char *path, size_t *sizep) {
- struct mg_fd *fd;
- char *data = NULL;
- size_t size = 0;
- fs->st(path, &size, NULL);
- if ((fd = mg_fs_open(fs, path, MG_FS_READ)) != NULL) {
- data = (char *) calloc(1, size + 1);
- if (data != NULL) {
- if (fs->rd(fd->fd, data, size) != size) {
- free(data);
- data = NULL;
- } else {
- data[size] = '\0';
- if (sizep != NULL) *sizep = size;
- }
- }
- mg_fs_close(fd);
- }
- return data;
- }
- bool mg_file_write(struct mg_fs *fs, const char *path, const void *buf,
- size_t len) {
- bool result = false;
- struct mg_fd *fd;
- char tmp[MG_PATH_MAX];
- mg_snprintf(tmp, sizeof(tmp), "%s..%d", path, rand());
- if ((fd = mg_fs_open(fs, tmp, MG_FS_WRITE)) != NULL) {
- result = fs->wr(fd->fd, buf, len) == len;
- mg_fs_close(fd);
- if (result) {
- fs->rm(path);
- fs->mv(tmp, path);
- } else {
- fs->rm(tmp);
- }
- }
- return result;
- }
- bool mg_file_printf(struct mg_fs *fs, const char *path, const char *fmt, ...) {
- va_list ap;
- char *data;
- bool result = false;
- va_start(ap, fmt);
- data = mg_vmprintf(fmt, &ap);
- va_end(ap);
- result = mg_file_write(fs, path, data, strlen(data));
- free(data);
- return result;
- }
- #ifdef MG_ENABLE_LINES
- #line 1 "src/fs_fat.c"
- #endif
- #if MG_ENABLE_FATFS
- #include <ff.h>
- static int mg_days_from_epoch(int y, int m, int d) {
- y -= m <= 2;
- int era = y / 400;
- int yoe = y - era * 400;
- int doy = (153 * (m + (m > 2 ? -3 : 9)) + 2) / 5 + d - 1;
- int doe = yoe * 365 + yoe / 4 - yoe / 100 + doy;
- return era * 146097 + doe - 719468;
- }
- static time_t mg_timegm(const struct tm *t) {
- int year = t->tm_year + 1900;
- int month = t->tm_mon; // 0-11
- if (month > 11) {
- year += month / 12;
- month %= 12;
- } else if (month < 0) {
- int years_diff = (11 - month) / 12;
- year -= years_diff;
- month += 12 * years_diff;
- }
- int x = mg_days_from_epoch(year, month + 1, t->tm_mday);
- return 60 * (60 * (24L * x + t->tm_hour) + t->tm_min) + t->tm_sec;
- }
- static time_t ff_time_to_epoch(uint16_t fdate, uint16_t ftime) {
- struct tm tm;
- memset(&tm, 0, sizeof(struct tm));
- tm.tm_sec = (ftime << 1) & 0x3e;
- tm.tm_min = ((ftime >> 5) & 0x3f);
- tm.tm_hour = ((ftime >> 11) & 0x1f);
- tm.tm_mday = (fdate & 0x1f);
- tm.tm_mon = ((fdate >> 5) & 0x0f) - 1;
- tm.tm_year = ((fdate >> 9) & 0x7f) + 80;
- return mg_timegm(&tm);
- }
- static int ff_stat(const char *path, size_t *size, time_t *mtime) {
- FILINFO fi;
- if (path[0] == '\0') {
- if (size) *size = 0;
- if (mtime) *mtime = 0;
- return MG_FS_DIR;
- } else if (f_stat(path, &fi) == 0) {
- if (size) *size = (size_t) fi.fsize;
- if (mtime) *mtime = ff_time_to_epoch(fi.fdate, fi.ftime);
- return MG_FS_READ | MG_FS_WRITE | ((fi.fattrib & AM_DIR) ? MG_FS_DIR : 0);
- } else {
- return 0;
- }
- }
- static void ff_list(const char *dir, void (*fn)(const char *, void *),
- void *userdata) {
- DIR d;
- FILINFO fi;
- if (f_opendir(&d, dir) == FR_OK) {
- while (f_readdir(&d, &fi) == FR_OK && fi.fname[0] != '\0') {
- if (!strcmp(fi.fname, ".") || !strcmp(fi.fname, "..")) continue;
- fn(fi.fname, userdata);
- }
- f_closedir(&d);
- }
- }
- static void *ff_open(const char *path, int flags) {
- FIL f;
- unsigned char mode = FA_READ;
- if (flags & MG_FS_WRITE) mode |= FA_WRITE | FA_OPEN_ALWAYS | FA_OPEN_APPEND;
- if (f_open(&f, path, mode) == 0) {
- FIL *fp;
- if ((fp = calloc(1, sizeof(*fp))) != NULL) {
- memcpy(fp, &f, sizeof(*fp));
- return fp;
- }
- }
- return NULL;
- }
- static void ff_close(void *fp) {
- if (fp != NULL) {
- f_close((FIL *) fp);
- free(fp);
- }
- }
- static size_t ff_read(void *fp, void *buf, size_t len) {
- UINT n = 0, misalign = ((size_t) buf) & 3;
- if (misalign) {
- char aligned[4];
- f_read((FIL *) fp, aligned, len > misalign ? misalign : len, &n);
- memcpy(buf, aligned, n);
- } else {
- f_read((FIL *) fp, buf, len, &n);
- }
- return n;
- }
- static size_t ff_write(void *fp, const void *buf, size_t len) {
- UINT n = 0;
- return f_write((FIL *) fp, (char *) buf, len, &n) == FR_OK ? n : 0;
- }
- static size_t ff_seek(void *fp, size_t offset) {
- f_lseek((FIL *) fp, offset);
- return offset;
- }
- static bool ff_rename(const char *from, const char *to) {
- return f_rename(from, to) == FR_OK;
- }
- static bool ff_remove(const char *path) {
- return f_unlink(path) == FR_OK;
- }
- static bool ff_mkdir(const char *path) {
- return f_mkdir(path) == FR_OK;
- }
- struct mg_fs mg_fs_fat = {ff_stat, ff_list, ff_open, ff_close, ff_read,
- ff_write, ff_seek, ff_rename, ff_remove, ff_mkdir};
- #endif
- #ifdef MG_ENABLE_LINES
- #line 1 "src/fs_packed.c"
- #endif
- struct packed_file {
- const char *data;
- size_t size;
- size_t pos;
- };
- #if MG_ENABLE_PACKED_FS
- #else
- const char *mg_unpack(const char *path, size_t *size, time_t *mtime) {
- *size = 0, *mtime = 0;
- (void) path;
- return NULL;
- }
- const char *mg_unlist(size_t no) {
- (void) no;
- return NULL;
- }
- #endif
- struct mg_str mg_unpacked(const char *path) {
- size_t len = 0;
- const char *buf = mg_unpack(path, &len, NULL);
- return mg_str_n(buf, len);
- }
- static int is_dir_prefix(const char *prefix, size_t n, const char *path) {
- // MG_INFO(("[%.*s] [%s] %c", (int) n, prefix, path, path[n]));
- return n < strlen(path) && strncmp(prefix, path, n) == 0 &&
- (n == 0 || path[n] == '/' || path[n - 1] == '/');
- }
- static int packed_stat(const char *path, size_t *size, time_t *mtime) {
- const char *p;
- size_t i, n = strlen(path);
- if (mg_unpack(path, size, mtime)) return MG_FS_READ; // Regular file
- // Scan all files. If `path` is a dir prefix for any of them, it's a dir
- for (i = 0; (p = mg_unlist(i)) != NULL; i++) {
- if (is_dir_prefix(path, n, p)) return MG_FS_DIR;
- }
- return 0;
- }
- static void packed_list(const char *dir, void (*fn)(const char *, void *),
- void *userdata) {
- char buf[MG_PATH_MAX], tmp[sizeof(buf)];
- const char *path, *begin, *end;
- size_t i, n = strlen(dir);
- tmp[0] = '\0'; // Previously listed entry
- for (i = 0; (path = mg_unlist(i)) != NULL; i++) {
- if (!is_dir_prefix(dir, n, path)) continue;
- begin = &path[n + 1];
- end = strchr(begin, '/');
- if (end == NULL) end = begin + strlen(begin);
- mg_snprintf(buf, sizeof(buf), "%.*s", (int) (end - begin), begin);
- buf[sizeof(buf) - 1] = '\0';
- // If this entry has been already listed, skip
- // NOTE: we're assuming that file list is sorted alphabetically
- if (strcmp(buf, tmp) == 0) continue;
- fn(buf, userdata); // Not yet listed, call user function
- strcpy(tmp, buf); // And save this entry as listed
- }
- }
- static void *packed_open(const char *path, int flags) {
- size_t size = 0;
- const char *data = mg_unpack(path, &size, NULL);
- struct packed_file *fp = NULL;
- if (data == NULL) return NULL;
- if (flags & MG_FS_WRITE) return NULL;
- if ((fp = (struct packed_file *) calloc(1, sizeof(*fp))) != NULL) {
- fp->size = size;
- fp->data = data;
- }
- return (void *) fp;
- }
- static void packed_close(void *fp) {
- if (fp != NULL) free(fp);
- }
- static size_t packed_read(void *fd, void *buf, size_t len) {
- struct packed_file *fp = (struct packed_file *) fd;
- if (fp->pos + len > fp->size) len = fp->size - fp->pos;
- memcpy(buf, &fp->data[fp->pos], len);
- fp->pos += len;
- return len;
- }
- static size_t packed_write(void *fd, const void *buf, size_t len) {
- (void) fd, (void) buf, (void) len;
- return 0;
- }
- static size_t packed_seek(void *fd, size_t offset) {
- struct packed_file *fp = (struct packed_file *) fd;
- fp->pos = offset;
- if (fp->pos > fp->size) fp->pos = fp->size;
- return fp->pos;
- }
- static bool packed_rename(const char *from, const char *to) {
- (void) from, (void) to;
- return false;
- }
- static bool packed_remove(const char *path) {
- (void) path;
- return false;
- }
- static bool packed_mkdir(const char *path) {
- (void) path;
- return false;
- }
- struct mg_fs mg_fs_packed = {
- packed_stat, packed_list, packed_open, packed_close, packed_read,
- packed_write, packed_seek, packed_rename, packed_remove, packed_mkdir};
- #ifdef MG_ENABLE_LINES
- #line 1 "src/fs_posix.c"
- #endif
- #if MG_ENABLE_FILE
- #ifndef MG_STAT_STRUCT
- #define MG_STAT_STRUCT stat
- #endif
- #ifndef MG_STAT_FUNC
- #define MG_STAT_FUNC stat
- #endif
- static int p_stat(const char *path, size_t *size, time_t *mtime) {
- #if !defined(S_ISDIR)
- MG_ERROR(("stat() API is not supported. %p %p %p", path, size, mtime));
- return 0;
- #else
- #if MG_ARCH == MG_ARCH_WIN32
- struct _stati64 st;
- wchar_t tmp[MG_PATH_MAX];
- MultiByteToWideChar(CP_UTF8, 0, path, -1, tmp, sizeof(tmp) / sizeof(tmp[0]));
- if (_wstati64(tmp, &st) != 0) return 0;
- // If path is a symlink, windows reports 0 in st.st_size.
- // Get a real file size by opening it and jumping to the end
- if (st.st_size == 0 && (st.st_mode & _S_IFREG)) {
- FILE *fp = _wfopen(tmp, L"rb");
- if (fp != NULL) {
- fseek(fp, 0, SEEK_END);
- if (ftell(fp) > 0) st.st_size = ftell(fp); // Use _ftelli64 on win10+
- fclose(fp);
- }
- }
- #else
- struct MG_STAT_STRUCT st;
- if (MG_STAT_FUNC(path, &st) != 0) return 0;
- #endif
- if (size) *size = (size_t) st.st_size;
- if (mtime) *mtime = st.st_mtime;
- return MG_FS_READ | MG_FS_WRITE | (S_ISDIR(st.st_mode) ? MG_FS_DIR : 0);
- #endif
- }
- #if MG_ARCH == MG_ARCH_WIN32
- struct dirent {
- char d_name[MAX_PATH];
- };
- typedef struct win32_dir {
- HANDLE handle;
- WIN32_FIND_DATAW info;
- struct dirent result;
- } DIR;
- #if 0
- int gettimeofday(struct timeval *tv, void *tz) {
- FILETIME ft;
- unsigned __int64 tmpres = 0;
- if (tv != NULL) {
- GetSystemTimeAsFileTime(&ft);
- tmpres |= ft.dwHighDateTime;
- tmpres <<= 32;
- tmpres |= ft.dwLowDateTime;
- tmpres /= 10; // convert into microseconds
- tmpres -= (int64_t) 11644473600000000;
- tv->tv_sec = (long) (tmpres / 1000000UL);
- tv->tv_usec = (long) (tmpres % 1000000UL);
- }
- (void) tz;
- return 0;
- }
- #endif
- static int to_wchar(const char *path, wchar_t *wbuf, size_t wbuf_len) {
- int ret;
- char buf[MAX_PATH * 2], buf2[MAX_PATH * 2], *p;
- strncpy(buf, path, sizeof(buf));
- buf[sizeof(buf) - 1] = '\0';
- // Trim trailing slashes. Leave backslash for paths like "X:\"
- p = buf + strlen(buf) - 1;
- while (p > buf && p[-1] != ':' && (p[0] == '\\' || p[0] == '/')) *p-- = '\0';
- memset(wbuf, 0, wbuf_len * sizeof(wchar_t));
- ret = MultiByteToWideChar(CP_UTF8, 0, buf, -1, wbuf, (int) wbuf_len);
- // Convert back to Unicode. If doubly-converted string does not match the
- // original, something is fishy, reject.
- WideCharToMultiByte(CP_UTF8, 0, wbuf, (int) wbuf_len, buf2, sizeof(buf2),
- NULL, NULL);
- if (strcmp(buf, buf2) != 0) {
- wbuf[0] = L'\0';
- ret = 0;
- }
- return ret;
- }
- DIR *opendir(const char *name) {
- DIR *d = NULL;
- wchar_t wpath[MAX_PATH];
- DWORD attrs;
- if (name == NULL) {
- SetLastError(ERROR_BAD_ARGUMENTS);
- } else if ((d = (DIR *) calloc(1, sizeof(*d))) == NULL) {
- SetLastError(ERROR_NOT_ENOUGH_MEMORY);
- } else {
- to_wchar(name, wpath, sizeof(wpath) / sizeof(wpath[0]));
- attrs = GetFileAttributesW(wpath);
- if (attrs != 0Xffffffff && (attrs & FILE_ATTRIBUTE_DIRECTORY)) {
- (void) wcscat(wpath, L"\\*");
- d->handle = FindFirstFileW(wpath, &d->info);
- d->result.d_name[0] = '\0';
- } else {
- free(d);
- d = NULL;
- }
- }
- return d;
- }
- int closedir(DIR *d) {
- int result = 0;
- if (d != NULL) {
- if (d->handle != INVALID_HANDLE_VALUE)
- result = FindClose(d->handle) ? 0 : -1;
- free(d);
- } else {
- result = -1;
- SetLastError(ERROR_BAD_ARGUMENTS);
- }
- return result;
- }
- struct dirent *readdir(DIR *d) {
- struct dirent *result = NULL;
- if (d != NULL) {
- memset(&d->result, 0, sizeof(d->result));
- if (d->handle != INVALID_HANDLE_VALUE) {
- result = &d->result;
- WideCharToMultiByte(CP_UTF8, 0, d->info.cFileName, -1, result->d_name,
- sizeof(result->d_name), NULL, NULL);
- if (!FindNextFileW(d->handle, &d->info)) {
- FindClose(d->handle);
- d->handle = INVALID_HANDLE_VALUE;
- }
- } else {
- SetLastError(ERROR_FILE_NOT_FOUND);
- }
- } else {
- SetLastError(ERROR_BAD_ARGUMENTS);
- }
- return result;
- }
- #endif
- static void p_list(const char *dir, void (*fn)(const char *, void *),
- void *userdata) {
- #if MG_ENABLE_DIRLIST
- struct dirent *dp;
- DIR *dirp;
- if ((dirp = (opendir(dir))) == NULL) return;
- while ((dp = readdir(dirp)) != NULL) {
- if (!strcmp(dp->d_name, ".") || !strcmp(dp->d_name, "..")) continue;
- fn(dp->d_name, userdata);
- }
- closedir(dirp);
- #else
- (void) dir, (void) fn, (void) userdata;
- #endif
- }
- static void *p_open(const char *path, int flags) {
- #if MG_ARCH == MG_ARCH_WIN32
- const char *mode = flags == MG_FS_READ ? "rb" : "a+b";
- wchar_t b1[MG_PATH_MAX], b2[10];
- MultiByteToWideChar(CP_UTF8, 0, path, -1, b1, sizeof(b1) / sizeof(b1[0]));
- MultiByteToWideChar(CP_UTF8, 0, mode, -1, b2, sizeof(b2) / sizeof(b2[0]));
- return (void *) _wfopen(b1, b2);
- #else
- const char *mode = flags == MG_FS_READ ? "rbe" : "a+be"; // e for CLOEXEC
- return (void *) fopen(path, mode);
- #endif
- }
- static void p_close(void *fp) {
- fclose((FILE *) fp);
- }
- static size_t p_read(void *fp, void *buf, size_t len) {
- return fread(buf, 1, len, (FILE *) fp);
- }
- static size_t p_write(void *fp, const void *buf, size_t len) {
- return fwrite(buf, 1, len, (FILE *) fp);
- }
- static size_t p_seek(void *fp, size_t offset) {
- #if (defined(_FILE_OFFSET_BITS) && _FILE_OFFSET_BITS == 64) || \
- (defined(_POSIX_C_SOURCE) && _POSIX_C_SOURCE >= 200112L) || \
- (defined(_XOPEN_SOURCE) && _XOPEN_SOURCE >= 600)
- if (fseeko((FILE *) fp, (off_t) offset, SEEK_SET) != 0) (void) 0;
- #else
- if (fseek((FILE *) fp, (long) offset, SEEK_SET) != 0) (void) 0;
- #endif
- return (size_t) ftell((FILE *) fp);
- }
- static bool p_rename(const char *from, const char *to) {
- return rename(from, to) == 0;
- }
- static bool p_remove(const char *path) {
- return remove(path) == 0;
- }
- static bool p_mkdir(const char *path) {
- return mkdir(path, 0775) == 0;
- }
- #else
- static int p_stat(const char *path, size_t *size, time_t *mtime) {
- (void) path, (void) size, (void) mtime;
- return 0;
- }
- static void p_list(const char *path, void (*fn)(const char *, void *),
- void *userdata) {
- (void) path, (void) fn, (void) userdata;
- }
- static void *p_open(const char *path, int flags) {
- (void) path, (void) flags;
- return NULL;
- }
- static void p_close(void *fp) {
- (void) fp;
- }
- static size_t p_read(void *fd, void *buf, size_t len) {
- (void) fd, (void) buf, (void) len;
- return 0;
- }
- static size_t p_write(void *fd, const void *buf, size_t len) {
- (void) fd, (void) buf, (void) len;
- return 0;
- }
- static size_t p_seek(void *fd, size_t offset) {
- (void) fd, (void) offset;
- return (size_t) ~0;
- }
- static bool p_rename(const char *from, const char *to) {
- (void) from, (void) to;
- return false;
- }
- static bool p_remove(const char *path) {
- (void) path;
- return false;
- }
- static bool p_mkdir(const char *path) {
- (void) path;
- return false;
- }
- #endif
- struct mg_fs mg_fs_posix = {p_stat, p_list, p_open, p_close, p_read,
- p_write, p_seek, p_rename, p_remove, p_mkdir};
- #ifdef MG_ENABLE_LINES
- #line 1 "src/http.c"
- #endif
- bool mg_to_size_t(struct mg_str str, size_t *val);
- bool mg_to_size_t(struct mg_str str, size_t *val) {
- size_t i = 0, max = (size_t) -1, max2 = max / 10, result = 0, ndigits = 0;
- while (i < str.len && (str.ptr[i] == ' ' || str.ptr[i] == '\t')) i++;
- if (i < str.len && str.ptr[i] == '-') return false;
- while (i < str.len && str.ptr[i] >= '0' && str.ptr[i] <= '9') {
- size_t digit = (size_t) (str.ptr[i] - '0');
- if (result > max2) return false; // Overflow
- result *= 10;
- if (result > max - digit) return false; // Overflow
- result += digit;
- i++, ndigits++;
- }
- while (i < str.len && (str.ptr[i] == ' ' || str.ptr[i] == '\t')) i++;
- if (ndigits == 0) return false; // #2322: Content-Length = 1 * DIGIT
- if (i != str.len) return false; // Ditto
- *val = (size_t) result;
- return true;
- }
- // Chunk deletion marker is the MSB in the "processed" counter
- #define MG_DMARK ((size_t) 1 << (sizeof(size_t) * 8 - 1))
- // Multipart POST example:
- // --xyz
- // Content-Disposition: form-data; name="val"
- //
- // abcdef
- // --xyz
- // Content-Disposition: form-data; name="foo"; filename="a.txt"
- // Content-Type: text/plain
- //
- // hello world
- //
- // --xyz--
- size_t mg_http_next_multipart(struct mg_str body, size_t ofs,
- struct mg_http_part *part) {
- struct mg_str cd = mg_str_n("Content-Disposition", 19);
- const char *s = body.ptr;
- size_t b = ofs, h1, h2, b1, b2, max = body.len;
- // Init part params
- if (part != NULL) part->name = part->filename = part->body = mg_str_n(0, 0);
- // Skip boundary
- while (b + 2 < max && s[b] != '\r' && s[b + 1] != '\n') b++;
- if (b <= ofs || b + 2 >= max) return 0;
- // MG_INFO(("B: %zu %zu [%.*s]", ofs, b - ofs, (int) (b - ofs), s));
- // Skip headers
- h1 = h2 = b + 2;
- for (;;) {
- while (h2 + 2 < max && s[h2] != '\r' && s[h2 + 1] != '\n') h2++;
- if (h2 == h1) break;
- if (h2 + 2 >= max) return 0;
- // MG_INFO(("Header: [%.*s]", (int) (h2 - h1), &s[h1]));
- if (part != NULL && h1 + cd.len + 2 < h2 && s[h1 + cd.len] == ':' &&
- mg_ncasecmp(&s[h1], cd.ptr, cd.len) == 0) {
- struct mg_str v = mg_str_n(&s[h1 + cd.len + 2], h2 - (h1 + cd.len + 2));
- part->name = mg_http_get_header_var(v, mg_str_n("name", 4));
- part->filename = mg_http_get_header_var(v, mg_str_n("filename", 8));
- }
- h1 = h2 = h2 + 2;
- }
- b1 = b2 = h2 + 2;
- while (b2 + 2 + (b - ofs) + 2 < max && !(s[b2] == '\r' && s[b2 + 1] == '\n' &&
- memcmp(&s[b2 + 2], s, b - ofs) == 0))
- b2++;
- if (b2 + 2 >= max) return 0;
- if (part != NULL) part->body = mg_str_n(&s[b1], b2 - b1);
- // MG_INFO(("Body: [%.*s]", (int) (b2 - b1), &s[b1]));
- return b2 + 2;
- }
- void mg_http_bauth(struct mg_connection *c, const char *user,
- const char *pass) {
- struct mg_str u = mg_str(user), p = mg_str(pass);
- size_t need = c->send.len + 36 + (u.len + p.len) * 2;
- if (c->send.size < need) mg_iobuf_resize(&c->send, need);
- if (c->send.size >= need) {
- size_t i, n = 0;
- char *buf = (char *) &c->send.buf[c->send.len];
- memcpy(buf, "Authorization: Basic ", 21); // DON'T use mg_send!
- for (i = 0; i < u.len; i++) {
- n = mg_base64_update(((unsigned char *) u.ptr)[i], buf + 21, n);
- }
- if (p.len > 0) {
- n = mg_base64_update(':', buf + 21, n);
- for (i = 0; i < p.len; i++) {
- n = mg_base64_update(((unsigned char *) p.ptr)[i], buf + 21, n);
- }
- }
- n = mg_base64_final(buf + 21, n);
- c->send.len += 21 + (size_t) n + 2;
- memcpy(&c->send.buf[c->send.len - 2], "\r\n", 2);
- } else {
- MG_ERROR(("%lu oom %d->%d ", c->id, (int) c->send.size, (int) need));
- }
- }
- struct mg_str mg_http_var(struct mg_str buf, struct mg_str name) {
- struct mg_str k, v, result = mg_str_n(NULL, 0);
- while (mg_split(&buf, &k, &v, '&')) {
- if (name.len == k.len && mg_ncasecmp(name.ptr, k.ptr, k.len) == 0) {
- result = v;
- break;
- }
- }
- return result;
- }
- int mg_http_get_var(const struct mg_str *buf, const char *name, char *dst,
- size_t dst_len) {
- int len;
- if (dst == NULL || dst_len == 0) {
- len = -2; // Bad destination
- } else if (buf->ptr == NULL || name == NULL || buf->len == 0) {
- len = -1; // Bad source
- dst[0] = '\0';
- } else {
- struct mg_str v = mg_http_var(*buf, mg_str(name));
- if (v.ptr == NULL) {
- len = -4; // Name does not exist
- } else {
- len = mg_url_decode(v.ptr, v.len, dst, dst_len, 1);
- if (len < 0) len = -3; // Failed to decode
- }
- }
- return len;
- }
- static bool isx(int c) {
- return (c >= '0' && c <= '9') || (c >= 'a' && c <= 'f') ||
- (c >= 'A' && c <= 'F');
- }
- int mg_url_decode(const char *src, size_t src_len, char *dst, size_t dst_len,
- int is_form_url_encoded) {
- size_t i, j;
- for (i = j = 0; i < src_len && j + 1 < dst_len; i++, j++) {
- if (src[i] == '%') {
- // Use `i + 2 < src_len`, not `i < src_len - 2`, note small src_len
- if (i + 2 < src_len && isx(src[i + 1]) && isx(src[i + 2])) {
- mg_unhex(src + i + 1, 2, (uint8_t *) &dst[j]);
- i += 2;
- } else {
- return -1;
- }
- } else if (is_form_url_encoded && src[i] == '+') {
- dst[j] = ' ';
- } else {
- dst[j] = src[i];
- }
- }
- if (j < dst_len) dst[j] = '\0'; // Null-terminate the destination
- return i >= src_len && j < dst_len ? (int) j : -1;
- }
- static bool isok(uint8_t c) {
- return c == '\n' || c == '\r' || c >= ' ';
- }
- int mg_http_get_request_len(const unsigned char *buf, size_t buf_len) {
- size_t i;
- for (i = 0; i < buf_len; i++) {
- if (!isok(buf[i])) return -1;
- if ((i > 0 && buf[i] == '\n' && buf[i - 1] == '\n') ||
- (i > 3 && buf[i] == '\n' && buf[i - 1] == '\r' && buf[i - 2] == '\n'))
- return (int) i + 1;
- }
- return 0;
- }
- struct mg_str *mg_http_get_header(struct mg_http_message *h, const char *name) {
- size_t i, n = strlen(name), max = sizeof(h->headers) / sizeof(h->headers[0]);
- for (i = 0; i < max && h->headers[i].name.len > 0; i++) {
- struct mg_str *k = &h->headers[i].name, *v = &h->headers[i].value;
- if (n == k->len && mg_ncasecmp(k->ptr, name, n) == 0) return v;
- }
- return NULL;
- }
- // Is it a valid utf-8 continuation byte
- static bool vcb(uint8_t c) {
- return (c & 0xc0) == 0x80;
- }
- // Get character length (valid utf-8). Used to parse method, URI, headers
- static size_t clen(const char *s, const char *end) {
- const unsigned char *u = (unsigned char *) s, c = *u;
- long n = (long) (end - s);
- if (c > ' ' && c < '~') return 1; // Usual ascii printed char
- if ((c & 0xe0) == 0xc0 && n > 1 && vcb(u[1])) return 2; // 2-byte UTF8
- if ((c & 0xf0) == 0xe0 && n > 2 && vcb(u[1]) && vcb(u[2])) return 3;
- if ((c & 0xf8) == 0xf0 && n > 3 && vcb(u[1]) && vcb(u[2]) && vcb(u[3]))
- return 4;
- return 0;
- }
- // Skip until the newline. Return advanced `s`, or NULL on error
- static const char *skiptorn(const char *s, const char *end, struct mg_str *v) {
- v->ptr = s;
- while (s < end && s[0] != '\n' && s[0] != '\r') s++, v->len++; // To newline
- if (s >= end || (s[0] == '\r' && s[1] != '\n')) return NULL; // Stray \r
- if (s < end && s[0] == '\r') s++; // Skip \r
- if (s >= end || *s++ != '\n') return NULL; // Skip \n
- return s;
- }
- static bool mg_http_parse_headers(const char *s, const char *end,
- struct mg_http_header *h, size_t max_hdrs) {
- size_t i, n;
- for (i = 0; i < max_hdrs; i++) {
- struct mg_str k = {NULL, 0}, v = {NULL, 0};
- if (s >= end) return false;
- if (s[0] == '\n' || (s[0] == '\r' && s[1] == '\n')) break;
- k.ptr = s;
- while (s < end && s[0] != ':' && (n = clen(s, end)) > 0) s += n, k.len += n;
- if (k.len == 0) return false; // Empty name
- if (s >= end || clen(s, end) == 0) return false; // Invalid UTF-8
- if (*s++ != ':') return false; // Invalid, not followed by :
- // if (clen(s, end) == 0) return false; // Invalid UTF-8
- while (s < end && s[0] == ' ') s++; // Skip spaces
- if ((s = skiptorn(s, end, &v)) == NULL) return false;
- while (v.len > 0 && v.ptr[v.len - 1] == ' ') v.len--; // Trim spaces
- // MG_INFO(("--HH [%.*s] [%.*s]", (int) k.len, k.ptr, (int) v.len, v.ptr));
- h[i].name = k, h[i].value = v; // Success. Assign values
- }
- return true;
- }
- int mg_http_parse(const char *s, size_t len, struct mg_http_message *hm) {
- int is_response, req_len = mg_http_get_request_len((unsigned char *) s, len);
- const char *end = s == NULL ? NULL : s + req_len, *qs; // Cannot add to NULL
- struct mg_str *cl;
- size_t n;
- memset(hm, 0, sizeof(*hm));
- if (req_len <= 0) return req_len;
- hm->message.ptr = hm->head.ptr = s;
- hm->body.ptr = end;
- hm->head.len = (size_t) req_len;
- hm->message.len = hm->body.len = (size_t) -1; // Set body length to infinite
- // Parse request line
- hm->method.ptr = s;
- while (s < end && (n = clen(s, end)) > 0) s += n, hm->method.len += n;
- while (s < end && s[0] == ' ') s++; // Skip spaces
- hm->uri.ptr = s;
- while (s < end && (n = clen(s, end)) > 0) s += n, hm->uri.len += n;
- while (s < end && s[0] == ' ') s++; // Skip spaces
- if ((s = skiptorn(s, end, &hm->proto)) == NULL) return false;
- // If URI contains '?' character, setup query string
- if ((qs = (const char *) memchr(hm->uri.ptr, '?', hm->uri.len)) != NULL) {
- hm->query.ptr = qs + 1;
- hm->query.len = (size_t) (&hm->uri.ptr[hm->uri.len] - (qs + 1));
- hm->uri.len = (size_t) (qs - hm->uri.ptr);
- }
- // Sanity check. Allow protocol/reason to be empty
- // Do this check after hm->method.len and hm->uri.len are finalised
- if (hm->method.len == 0 || hm->uri.len == 0) return -1;
- if (!mg_http_parse_headers(s, end, hm->headers,
- sizeof(hm->headers) / sizeof(hm->headers[0])))
- return -1; // error when parsing
- if ((cl = mg_http_get_header(hm, "Content-Length")) != NULL) {
- if (mg_to_size_t(*cl, &hm->body.len) == false) return -1;
- hm->message.len = (size_t) req_len + hm->body.len;
- }
- // mg_http_parse() is used to parse both HTTP requests and HTTP
- // responses. If HTTP response does not have Content-Length set, then
- // body is read until socket is closed, i.e. body.len is infinite (~0).
- //
- // For HTTP requests though, according to
- // http://tools.ietf.org/html/rfc7231#section-8.1.3,
- // only POST and PUT methods have defined body semantics.
- // Therefore, if Content-Length is not specified and methods are
- // not one of PUT or POST, set body length to 0.
- //
- // So, if it is HTTP request, and Content-Length is not set,
- // and method is not (PUT or POST) then reset body length to zero.
- is_response = mg_ncasecmp(hm->method.ptr, "HTTP/", 5) == 0;
- if (hm->body.len == (size_t) ~0 && !is_response &&
- mg_vcasecmp(&hm->method, "PUT") != 0 &&
- mg_vcasecmp(&hm->method, "POST") != 0) {
- hm->body.len = 0;
- hm->message.len = (size_t) req_len;
- }
- // The 204 (No content) responses also have 0 body length
- if (hm->body.len == (size_t) ~0 && is_response &&
- mg_vcasecmp(&hm->uri, "204") == 0) {
- hm->body.len = 0;
- hm->message.len = (size_t) req_len;
- }
- if (hm->message.len < (size_t) req_len) return -1; // Overflow protection
- return req_len;
- }
- static void mg_http_vprintf_chunk(struct mg_connection *c, const char *fmt,
- va_list *ap) {
- size_t len = c->send.len;
- mg_send(c, " \r\n", 10);
- mg_vxprintf(mg_pfn_iobuf, &c->send, fmt, ap);
- if (c->send.len >= len + 10) {
- mg_snprintf((char *) c->send.buf + len, 9, "%08lx", c->send.len - len - 10);
- c->send.buf[len + 8] = '\r';
- if (c->send.len == len + 10) c->is_resp = 0; // Last chunk, reset marker
- }
- mg_send(c, "\r\n", 2);
- }
- void mg_http_printf_chunk(struct mg_connection *c, const char *fmt, ...) {
- va_list ap;
- va_start(ap, fmt);
- mg_http_vprintf_chunk(c, fmt, &ap);
- va_end(ap);
- }
- void mg_http_write_chunk(struct mg_connection *c, const char *buf, size_t len) {
- mg_printf(c, "%lx\r\n", (unsigned long) len);
- mg_send(c, buf, len);
- mg_send(c, "\r\n", 2);
- if (len == 0) c->is_resp = 0;
- }
- // clang-format off
- static const char *mg_http_status_code_str(int status_code) {
- switch (status_code) {
- case 100: return "Continue";
- case 101: return "Switching Protocols";
- case 102: return "Processing";
- case 200: return "OK";
- case 201: return "Created";
- case 202: return "Accepted";
- case 203: return "Non-authoritative Information";
- case 204: return "No Content";
- case 205: return "Reset Content";
- case 206: return "Partial Content";
- case 207: return "Multi-Status";
- case 208: return "Already Reported";
- case 226: return "IM Used";
- case 300: return "Multiple Choices";
- case 301: return "Moved Permanently";
- case 302: return "Found";
- case 303: return "See Other";
- case 304: return "Not Modified";
- case 305: return "Use Proxy";
- case 307: return "Temporary Redirect";
- case 308: return "Permanent Redirect";
- case 400: return "Bad Request";
- case 401: return "Unauthorized";
- case 402: return "Payment Required";
- case 403: return "Forbidden";
- case 404: return "Not Found";
- case 405: return "Method Not Allowed";
- case 406: return "Not Acceptable";
- case 407: return "Proxy Authentication Required";
- case 408: return "Request Timeout";
- case 409: return "Conflict";
- case 410: return "Gone";
- case 411: return "Length Required";
- case 412: return "Precondition Failed";
- case 413: return "Payload Too Large";
- case 414: return "Request-URI Too Long";
- case 415: return "Unsupported Media Type";
- case 416: return "Requested Range Not Satisfiable";
- case 417: return "Expectation Failed";
- case 418: return "I'm a teapot";
- case 421: return "Misdirected Request";
- case 422: return "Unprocessable Entity";
- case 423: return "Locked";
- case 424: return "Failed Dependency";
- case 426: return "Upgrade Required";
- case 428: return "Precondition Required";
- case 429: return "Too Many Requests";
- case 431: return "Request Header Fields Too Large";
- case 444: return "Connection Closed Without Response";
- case 451: return "Unavailable For Legal Reasons";
- case 499: return "Client Closed Request";
- case 500: return "Internal Server Error";
- case 501: return "Not Implemented";
- case 502: return "Bad Gateway";
- case 503: return "Service Unavailable";
- case 504: return "Gateway Timeout";
- case 505: return "HTTP Version Not Supported";
- case 506: return "Variant Also Negotiates";
- case 507: return "Insufficient Storage";
- case 508: return "Loop Detected";
- case 510: return "Not Extended";
- case 511: return "Network Authentication Required";
- case 599: return "Network Connect Timeout Error";
- default: return "";
- }
- }
- // clang-format on
- void mg_http_reply(struct mg_connection *c, int code, const char *headers,
- const char *fmt, ...) {
- va_list ap;
- size_t len;
- mg_printf(c, "HTTP/1.1 %d %s\r\n%sContent-Length: \r\n\r\n", code,
- mg_http_status_code_str(code), headers == NULL ? "" : headers);
- len = c->send.len;
- va_start(ap, fmt);
- mg_vxprintf(mg_pfn_iobuf, &c->send, fmt, &ap);
- va_end(ap);
- if (c->send.len > 16) {
- size_t n = mg_snprintf((char *) &c->send.buf[len - 15], 11, "%-10lu",
- (unsigned long) (c->send.len - len));
- c->send.buf[len - 15 + n] = ' '; // Change ending 0 to space
- }
- c->is_resp = 0;
- }
- static void http_cb(struct mg_connection *, int, void *);
- static void restore_http_cb(struct mg_connection *c) {
- mg_fs_close((struct mg_fd *) c->pfn_data);
- c->pfn_data = NULL;
- c->pfn = http_cb;
- c->is_resp = 0;
- }
- char *mg_http_etag(char *buf, size_t len, size_t size, time_t mtime);
- char *mg_http_etag(char *buf, size_t len, size_t size, time_t mtime) {
- mg_snprintf(buf, len, "\"%lld.%lld\"", (int64_t) mtime, (int64_t) size);
- return buf;
- }
- static void static_cb(struct mg_connection *c, int ev, void *ev_data) {
- if (ev == MG_EV_WRITE || ev == MG_EV_POLL) {
- struct mg_fd *fd = (struct mg_fd *) c->pfn_data;
- // Read to send IO buffer directly, avoid extra on-stack buffer
- size_t n, max = MG_IO_SIZE, space;
- size_t *cl = (size_t *) &c->data[(sizeof(c->data) - sizeof(size_t)) /
- sizeof(size_t) * sizeof(size_t)];
- if (c->send.size < max) mg_iobuf_resize(&c->send, max);
- if (c->send.len >= c->send.size) return; // Rate limit
- if ((space = c->send.size - c->send.len) > *cl) space = *cl;
- n = fd->fs->rd(fd->fd, c->send.buf + c->send.len, space);
- c->send.len += n;
- *cl -= n;
- if (n == 0) restore_http_cb(c);
- } else if (ev == MG_EV_CLOSE) {
- restore_http_cb(c);
- }
- (void) ev_data;
- }
- // Known mime types. Keep it outside guess_content_type() function, since
- // some environments don't like it defined there.
- // clang-format off
- static struct mg_str s_known_types[] = {
- MG_C_STR("html"), MG_C_STR("text/html; charset=utf-8"),
- MG_C_STR("htm"), MG_C_STR("text/html; charset=utf-8"),
- MG_C_STR("css"), MG_C_STR("text/css; charset=utf-8"),
- MG_C_STR("js"), MG_C_STR("text/javascript; charset=utf-8"),
- MG_C_STR("gif"), MG_C_STR("image/gif"),
- MG_C_STR("png"), MG_C_STR("image/png"),
- MG_C_STR("jpg"), MG_C_STR("image/jpeg"),
- MG_C_STR("jpeg"), MG_C_STR("image/jpeg"),
- MG_C_STR("woff"), MG_C_STR("font/woff"),
- MG_C_STR("ttf"), MG_C_STR("font/ttf"),
- MG_C_STR("svg"), MG_C_STR("image/svg+xml"),
- MG_C_STR("txt"), MG_C_STR("text/plain; charset=utf-8"),
- MG_C_STR("avi"), MG_C_STR("video/x-msvideo"),
- MG_C_STR("csv"), MG_C_STR("text/csv"),
- MG_C_STR("doc"), MG_C_STR("application/msword"),
- MG_C_STR("exe"), MG_C_STR("application/octet-stream"),
- MG_C_STR("gz"), MG_C_STR("application/gzip"),
- MG_C_STR("ico"), MG_C_STR("image/x-icon"),
- MG_C_STR("json"), MG_C_STR("application/json"),
- MG_C_STR("mov"), MG_C_STR("video/quicktime"),
- MG_C_STR("mp3"), MG_C_STR("audio/mpeg"),
- MG_C_STR("mp4"), MG_C_STR("video/mp4"),
- MG_C_STR("mpeg"), MG_C_STR("video/mpeg"),
- MG_C_STR("pdf"), MG_C_STR("application/pdf"),
- MG_C_STR("shtml"), MG_C_STR("text/html; charset=utf-8"),
- MG_C_STR("tgz"), MG_C_STR("application/tar-gz"),
- MG_C_STR("wav"), MG_C_STR("audio/wav"),
- MG_C_STR("webp"), MG_C_STR("image/webp"),
- MG_C_STR("zip"), MG_C_STR("application/zip"),
- MG_C_STR("3gp"), MG_C_STR("video/3gpp"),
- {0, 0},
- };
- // clang-format on
- static struct mg_str guess_content_type(struct mg_str path, const char *extra) {
- struct mg_str k, v, s = mg_str(extra);
- size_t i = 0;
- // Shrink path to its extension only
- while (i < path.len && path.ptr[path.len - i - 1] != '.') i++;
- path.ptr += path.len - i;
- path.len = i;
- // Process user-provided mime type overrides, if any
- while (mg_commalist(&s, &k, &v)) {
- if (mg_strcmp(path, k) == 0) return v;
- }
- // Process built-in mime types
- for (i = 0; s_known_types[i].ptr != NULL; i += 2) {
- if (mg_strcmp(path, s_known_types[i]) == 0) return s_known_types[i + 1];
- }
- return mg_str("text/plain; charset=utf-8");
- }
- static int getrange(struct mg_str *s, size_t *a, size_t *b) {
- size_t i, numparsed = 0;
- for (i = 0; i + 6 < s->len; i++) {
- struct mg_str k, v = mg_str_n(s->ptr + i + 6, s->len - i - 6);
- if (memcmp(&s->ptr[i], "bytes=", 6) != 0) continue;
- if (mg_split(&v, &k, NULL, '-')) {
- if (mg_to_size_t(k, a)) numparsed++;
- if (v.len > 0 && mg_to_size_t(v, b)) numparsed++;
- } else {
- if (mg_to_size_t(v, a)) numparsed++;
- }
- break;
- }
- return (int) numparsed;
- }
- void mg_http_serve_file(struct mg_connection *c, struct mg_http_message *hm,
- const char *path,
- const struct mg_http_serve_opts *opts) {
- char etag[64], tmp[MG_PATH_MAX];
- struct mg_fs *fs = opts->fs == NULL ? &mg_fs_posix : opts->fs;
- struct mg_fd *fd = NULL;
- size_t size = 0;
- time_t mtime = 0;
- struct mg_str *inm = NULL;
- struct mg_str mime = guess_content_type(mg_str(path), opts->mime_types);
- bool gzip = false;
- if (path != NULL) {
- // If a browser sends us "Accept-Encoding: gzip", try to open .gz first
- struct mg_str *ae = mg_http_get_header(hm, "Accept-Encoding");
- if (ae != NULL && mg_strstr(*ae, mg_str("gzip")) != NULL) {
- mg_snprintf(tmp, sizeof(tmp), "%s.gz", path);
- fd = mg_fs_open(fs, tmp, MG_FS_READ);
- if (fd != NULL) gzip = true, path = tmp;
- }
- // No luck opening .gz? Open what we've told to open
- if (fd == NULL) fd = mg_fs_open(fs, path, MG_FS_READ);
- }
- // Failed to open, and page404 is configured? Open it, then
- if (fd == NULL && opts->page404 != NULL) {
- fd = mg_fs_open(fs, opts->page404, MG_FS_READ);
- mime = guess_content_type(mg_str(path), opts->mime_types);
- path = opts->page404;
- }
- if (fd == NULL || fs->st(path, &size, &mtime) == 0) {
- mg_http_reply(c, 404, opts->extra_headers, "Not found\n");
- mg_fs_close(fd);
- // NOTE: mg_http_etag() call should go first!
- } else if (mg_http_etag(etag, sizeof(etag), size, mtime) != NULL &&
- (inm = mg_http_get_header(hm, "If-None-Match")) != NULL &&
- mg_vcasecmp(inm, etag) == 0) {
- mg_fs_close(fd);
- mg_http_reply(c, 304, opts->extra_headers, "");
- } else {
- int n, status = 200;
- char range[100];
- size_t r1 = 0, r2 = 0, cl = size;
- // Handle Range header
- struct mg_str *rh = mg_http_get_header(hm, "Range");
- range[0] = '\0';
- if (rh != NULL && (n = getrange(rh, &r1, &r2)) > 0) {
- // If range is specified like "400-", set second limit to content len
- if (n == 1) r2 = cl - 1;
- if (r1 > r2 || r2 >= cl) {
- status = 416;
- cl = 0;
- mg_snprintf(range, sizeof(range), "Content-Range: bytes */%lld\r\n",
- (int64_t) size);
- } else {
- status = 206;
- cl = r2 - r1 + 1;
- mg_snprintf(range, sizeof(range),
- "Content-Range: bytes %llu-%llu/%llu\r\n", (uint64_t) r1,
- (uint64_t) (r1 + cl - 1), (uint64_t) size);
- fs->sk(fd->fd, r1);
- }
- }
- mg_printf(c,
- "HTTP/1.1 %d %s\r\n"
- "Content-Type: %.*s\r\n"
- "Etag: %s\r\n"
- "Content-Length: %llu\r\n"
- "%s%s%s\r\n",
- status, mg_http_status_code_str(status), (int) mime.len, mime.ptr,
- etag, (uint64_t) cl, gzip ? "Content-Encoding: gzip\r\n" : "",
- range, opts->extra_headers ? opts->extra_headers : "");
- if (mg_vcasecmp(&hm->method, "HEAD") == 0) {
- c->is_draining = 1;
- c->is_resp = 0;
- mg_fs_close(fd);
- } else {
- // Track to-be-sent content length at the end of c->data, aligned
- size_t *clp = (size_t *) &c->data[(sizeof(c->data) - sizeof(size_t)) /
- sizeof(size_t) * sizeof(size_t)];
- c->pfn = static_cb;
- c->pfn_data = fd;
- *clp = cl;
- }
- }
- }
- struct printdirentrydata {
- struct mg_connection *c;
- struct mg_http_message *hm;
- const struct mg_http_serve_opts *opts;
- const char *dir;
- };
- #if MG_ENABLE_DIRLIST
- static void printdirentry(const char *name, void *userdata) {
- struct printdirentrydata *d = (struct printdirentrydata *) userdata;
- struct mg_fs *fs = d->opts->fs == NULL ? &mg_fs_posix : d->opts->fs;
- size_t size = 0;
- time_t t = 0;
- char path[MG_PATH_MAX], sz[40], mod[40];
- int flags, n = 0;
- // MG_DEBUG(("[%s] [%s]", d->dir, name));
- if (mg_snprintf(path, sizeof(path), "%s%c%s", d->dir, '/', name) >
- sizeof(path)) {
- MG_ERROR(("%s truncated", name));
- } else if ((flags = fs->st(path, &size, &t)) == 0) {
- MG_ERROR(("%lu stat(%s): %d", d->c->id, path, errno));
- } else {
- const char *slash = flags & MG_FS_DIR ? "/" : "";
- if (flags & MG_FS_DIR) {
- mg_snprintf(sz, sizeof(sz), "%s", "[DIR]");
- } else {
- mg_snprintf(sz, sizeof(sz), "%lld", (uint64_t) size);
- }
- #if defined(MG_HTTP_DIRLIST_TIME_FMT)
- {
- char time_str[40];
- struct tm *time_info = localtime(&t);
- strftime(time_str, sizeof time_str, "%Y/%m/%d %H:%M:%S", time_info);
- mg_snprintf(mod, sizeof(mod), "%s", time_str);
- }
- #else
- mg_snprintf(mod, sizeof(mod), "%lu", (unsigned long) t);
- #endif
- n = (int) mg_url_encode(name, strlen(name), path, sizeof(path));
- mg_printf(d->c,
- " <tr><td><a href=\"%.*s%s\">%s%s</a></td>"
- "<td name=%lu>%s</td><td name=%lld>%s</td></tr>\n",
- n, path, slash, name, slash, (unsigned long) t, mod,
- flags & MG_FS_DIR ? (int64_t) -1 : (int64_t) size, sz);
- }
- }
- static void listdir(struct mg_connection *c, struct mg_http_message *hm,
- const struct mg_http_serve_opts *opts, char *dir) {
- const char *sort_js_code =
- "<script>function srt(tb, sc, so, d) {"
- "var tr = Array.prototype.slice.call(tb.rows, 0),"
- "tr = tr.sort(function (a, b) { var c1 = a.cells[sc], c2 = b.cells[sc],"
- "n1 = c1.getAttribute('name'), n2 = c2.getAttribute('name'), "
- "t1 = a.cells[2].getAttribute('name'), "
- "t2 = b.cells[2].getAttribute('name'); "
- "return so * (t1 < 0 && t2 >= 0 ? -1 : t2 < 0 && t1 >= 0 ? 1 : "
- "n1 ? parseInt(n2) - parseInt(n1) : "
- "c1.textContent.trim().localeCompare(c2.textContent.trim())); });";
- const char *sort_js_code2 =
- "for (var i = 0; i < tr.length; i++) tb.appendChild(tr[i]); "
- "if (!d) window.location.hash = ('sc=' + sc + '&so=' + so); "
- "};"
- "window.onload = function() {"
- "var tb = document.getElementById('tb');"
- "var m = /sc=([012]).so=(1|-1)/.exec(window.location.hash) || [0, 2, 1];"
- "var sc = m[1], so = m[2]; document.onclick = function(ev) { "
- "var c = ev.target.rel; if (c) {if (c == sc) so *= -1; srt(tb, c, so); "
- "sc = c; ev.preventDefault();}};"
- "srt(tb, sc, so, true);"
- "}"
- "</script>";
- struct mg_fs *fs = opts->fs == NULL ? &mg_fs_posix : opts->fs;
- struct printdirentrydata d = {c, hm, opts, dir};
- char tmp[10], buf[MG_PATH_MAX];
- size_t off, n;
- int len = mg_url_decode(hm->uri.ptr, hm->uri.len, buf, sizeof(buf), 0);
- struct mg_str uri = len > 0 ? mg_str_n(buf, (size_t) len) : hm->uri;
- mg_printf(c,
- "HTTP/1.1 200 OK\r\n"
- "Content-Type: text/html; charset=utf-8\r\n"
- "%s"
- "Content-Length: \r\n\r\n",
- opts->extra_headers == NULL ? "" : opts->extra_headers);
- off = c->send.len; // Start of body
- mg_printf(c,
- "<!DOCTYPE html><html><head><title>Index of %.*s</title>%s%s"
- "<style>th,td {text-align: left; padding-right: 1em; "
- "font-family: monospace; }</style></head>"
- "<body><h1>Index of %.*s</h1><table cellpadding=\"0\"><thead>"
- "<tr><th><a href=\"#\" rel=\"0\">Name</a></th><th>"
- "<a href=\"#\" rel=\"1\">Modified</a></th>"
- "<th><a href=\"#\" rel=\"2\">Size</a></th></tr>"
- "<tr><td colspan=\"3\"><hr></td></tr>"
- "</thead>"
- "<tbody id=\"tb\">\n",
- (int) uri.len, uri.ptr, sort_js_code, sort_js_code2, (int) uri.len,
- uri.ptr);
- mg_printf(c, "%s",
- " <tr><td><a href=\"..\">..</a></td>"
- "<td name=-1></td><td name=-1>[DIR]</td></tr>\n");
- fs->ls(dir, printdirentry, &d);
- mg_printf(c,
- "</tbody><tfoot><tr><td colspan=\"3\"><hr></td></tr></tfoot>"
- "</table><address>Mongoose v.%s</address></body></html>\n",
- MG_VERSION);
- n = mg_snprintf(tmp, sizeof(tmp), "%lu", (unsigned long) (c->send.len - off));
- if (n > sizeof(tmp)) n = 0;
- memcpy(c->send.buf + off - 12, tmp, n); // Set content length
- c->is_resp = 0; // Mark response end
- }
- #endif
- // Resolve requested file into `path` and return its fs->st() result
- static int uri_to_path2(struct mg_connection *c, struct mg_http_message *hm,
- struct mg_fs *fs, struct mg_str url, struct mg_str dir,
- char *path, size_t path_size) {
- int flags, tmp;
- // Append URI to the root_dir, and sanitize it
- size_t n = mg_snprintf(path, path_size, "%.*s", (int) dir.len, dir.ptr);
- if (n + 2 >= path_size) {
- mg_http_reply(c, 400, "", "Exceeded path size");
- return -1;
- }
- path[path_size - 1] = '\0';
- // Terminate root dir with slash
- if (n > 0 && path[n - 1] != '/') path[n++] = '/', path[n] = '\0';
- if (url.len < hm->uri.len) {
- mg_url_decode(hm->uri.ptr + url.len, hm->uri.len - url.len, path + n,
- path_size - n, 0);
- }
- path[path_size - 1] = '\0'; // Double-check
- if (!mg_path_is_sane(path)) {
- mg_http_reply(c, 400, "", "Invalid path");
- return -1;
- }
- n = strlen(path);
- while (n > 1 && path[n - 1] == '/') path[--n] = 0; // Trim trailing slashes
- flags = mg_vcmp(&hm->uri, "/") == 0 ? MG_FS_DIR : fs->st(path, NULL, NULL);
- MG_VERBOSE(("%lu %.*s -> %s %d", c->id, (int) hm->uri.len, hm->uri.ptr, path,
- flags));
- if (flags == 0) {
- // Do nothing - let's caller decide
- } else if ((flags & MG_FS_DIR) && hm->uri.len > 0 &&
- hm->uri.ptr[hm->uri.len - 1] != '/') {
- mg_printf(c,
- "HTTP/1.1 301 Moved\r\n"
- "Location: %.*s/\r\n"
- "Content-Length: 0\r\n"
- "\r\n",
- (int) hm->uri.len, hm->uri.ptr);
- c->is_resp = 0;
- flags = -1;
- } else if (flags & MG_FS_DIR) {
- if (((mg_snprintf(path + n, path_size - n, "/" MG_HTTP_INDEX) > 0 &&
- (tmp = fs->st(path, NULL, NULL)) != 0) ||
- (mg_snprintf(path + n, path_size - n, "/index.shtml") > 0 &&
- (tmp = fs->st(path, NULL, NULL)) != 0))) {
- flags = tmp;
- } else if ((mg_snprintf(path + n, path_size - n, "/" MG_HTTP_INDEX ".gz") >
- 0 &&
- (tmp = fs->st(path, NULL, NULL)) !=
- 0)) { // check for gzipped index
- flags = tmp;
- path[n + 1 + strlen(MG_HTTP_INDEX)] =
- '\0'; // Remove appended .gz in index file name
- } else {
- path[n] = '\0'; // Remove appended index file name
- }
- }
- return flags;
- }
- static int uri_to_path(struct mg_connection *c, struct mg_http_message *hm,
- const struct mg_http_serve_opts *opts, char *path,
- size_t path_size) {
- struct mg_fs *fs = opts->fs == NULL ? &mg_fs_posix : opts->fs;
- struct mg_str k, v, s = mg_str(opts->root_dir), u = {0, 0}, p = {0, 0};
- while (mg_commalist(&s, &k, &v)) {
- if (v.len == 0) v = k, k = mg_str("/"), u = k, p = v;
- if (hm->uri.len < k.len) continue;
- if (mg_strcmp(k, mg_str_n(hm->uri.ptr, k.len)) != 0) continue;
- u = k, p = v;
- }
- return uri_to_path2(c, hm, fs, u, p, path, path_size);
- }
- void mg_http_serve_dir(struct mg_connection *c, struct mg_http_message *hm,
- const struct mg_http_serve_opts *opts) {
- char path[MG_PATH_MAX];
- const char *sp = opts->ssi_pattern;
- int flags = uri_to_path(c, hm, opts, path, sizeof(path));
- if (flags < 0) {
- // Do nothing: the response has already been sent by uri_to_path()
- } else if (flags & MG_FS_DIR) {
- #if MG_ENABLE_DIRLIST
- listdir(c, hm, opts, path);
- #else
- mg_http_reply(c, 403, "", "Forbidden\n");
- #endif
- } else if (flags && sp != NULL &&
- mg_globmatch(sp, strlen(sp), path, strlen(path))) {
- mg_http_serve_ssi(c, opts->root_dir, path);
- } else {
- mg_http_serve_file(c, hm, path, opts);
- }
- }
- static bool mg_is_url_safe(int c) {
- return (c >= '0' && c <= '9') || (c >= 'a' && c <= 'z') ||
- (c >= 'A' && c <= 'Z') || c == '.' || c == '_' || c == '-' || c == '~';
- }
- size_t mg_url_encode(const char *s, size_t sl, char *buf, size_t len) {
- size_t i, n = 0;
- for (i = 0; i < sl; i++) {
- int c = *(unsigned char *) &s[i];
- if (n + 4 >= len) return 0;
- if (mg_is_url_safe(c)) {
- buf[n++] = s[i];
- } else {
- buf[n++] = '%';
- mg_hex(&s[i], 1, &buf[n]);
- n += 2;
- }
- }
- if (len > 0 && n < len - 1) buf[n] = '\0'; // Null-terminate the destination
- if (len > 0) buf[len - 1] = '\0'; // Always.
- return n;
- }
- void mg_http_creds(struct mg_http_message *hm, char *user, size_t userlen,
- char *pass, size_t passlen) {
- struct mg_str *v = mg_http_get_header(hm, "Authorization");
- user[0] = pass[0] = '\0';
- if (v != NULL && v->len > 6 && memcmp(v->ptr, "Basic ", 6) == 0) {
- char buf[256];
- size_t n = mg_base64_decode(v->ptr + 6, v->len - 6, buf, sizeof(buf));
- const char *p = (const char *) memchr(buf, ':', n > 0 ? n : 0);
- if (p != NULL) {
- mg_snprintf(user, userlen, "%.*s", p - buf, buf);
- mg_snprintf(pass, passlen, "%.*s", n - (size_t) (p - buf) - 1, p + 1);
- }
- } else if (v != NULL && v->len > 7 && memcmp(v->ptr, "Bearer ", 7) == 0) {
- mg_snprintf(pass, passlen, "%.*s", (int) v->len - 7, v->ptr + 7);
- } else if ((v = mg_http_get_header(hm, "Cookie")) != NULL) {
- struct mg_str t = mg_http_get_header_var(*v, mg_str_n("access_token", 12));
- if (t.len > 0) mg_snprintf(pass, passlen, "%.*s", (int) t.len, t.ptr);
- } else {
- mg_http_get_var(&hm->query, "access_token", pass, passlen);
- }
- }
- static struct mg_str stripquotes(struct mg_str s) {
- return s.len > 1 && s.ptr[0] == '"' && s.ptr[s.len - 1] == '"'
- ? mg_str_n(s.ptr + 1, s.len - 2)
- : s;
- }
- struct mg_str mg_http_get_header_var(struct mg_str s, struct mg_str v) {
- size_t i;
- for (i = 0; v.len > 0 && i + v.len + 2 < s.len; i++) {
- if (s.ptr[i + v.len] == '=' && memcmp(&s.ptr[i], v.ptr, v.len) == 0) {
- const char *p = &s.ptr[i + v.len + 1], *b = p, *x = &s.ptr[s.len];
- int q = p < x && *p == '"' ? 1 : 0;
- while (p < x &&
- (q ? p == b || *p != '"' : *p != ';' && *p != ' ' && *p != ','))
- p++;
- // MG_INFO(("[%.*s] [%.*s] [%.*s]", (int) s.len, s.ptr, (int) v.len,
- // v.ptr, (int) (p - b), b));
- return stripquotes(mg_str_n(b, (size_t) (p - b + q)));
- }
- }
- return mg_str_n(NULL, 0);
- }
- bool mg_http_match_uri(const struct mg_http_message *hm, const char *glob) {
- return mg_match(hm->uri, mg_str(glob), NULL);
- }
- long mg_http_upload(struct mg_connection *c, struct mg_http_message *hm,
- struct mg_fs *fs, const char *path, size_t max_size) {
- char buf[20] = "0";
- long res = 0, offset;
- mg_http_get_var(&hm->query, "offset", buf, sizeof(buf));
- offset = strtol(buf, NULL, 0);
- if (hm->body.len == 0) {
- mg_http_reply(c, 200, "", "%ld", res); // Nothing to write
- } else {
- struct mg_fd *fd;
- size_t current_size = 0;
- MG_DEBUG(("%s -> %d bytes @ %ld", path, (int) hm->body.len, offset));
- if (offset == 0) fs->rm(path); // If offset if 0, truncate file
- fs->st(path, ¤t_size, NULL);
- if (offset < 0) {
- mg_http_reply(c, 400, "", "offset required");
- res = -1;
- } else if (offset > 0 && current_size != (size_t) offset) {
- mg_http_reply(c, 400, "", "%s: offset mismatch", path);
- res = -2;
- } else if ((size_t) offset + hm->body.len > max_size) {
- mg_http_reply(c, 400, "", "%s: over max size of %lu", path,
- (unsigned long) max_size);
- res = -3;
- } else if ((fd = mg_fs_open(fs, path, MG_FS_WRITE)) == NULL) {
- mg_http_reply(c, 400, "", "open(%s): %d", path, errno);
- res = -4;
- } else {
- res = offset + (long) fs->wr(fd->fd, hm->body.ptr, hm->body.len);
- mg_fs_close(fd);
- mg_http_reply(c, 200, "", "%ld", res);
- }
- }
- return res;
- }
- int mg_http_status(const struct mg_http_message *hm) {
- return atoi(hm->uri.ptr);
- }
- static bool is_hex_digit(int c) {
- return (c >= '0' && c <= '9') || (c >= 'a' && c <= 'f') ||
- (c >= 'A' && c <= 'F');
- }
- static int skip_chunk(const char *buf, int len, int *pl, int *dl) {
- int i = 0, n = 0;
- if (len < 3) return 0;
- while (i < len && is_hex_digit(buf[i])) i++;
- if (i > (int) sizeof(int) * 2) return -1; // Chunk length is too big
- if (len < i + 1 || buf[i] != '\r' || buf[i + 1] != '\n') return -1; // Error
- n = (int) mg_unhexn(buf, (size_t) i); // Decode chunk length
- if (n < 0) return -1; // Error
- if (n > len - i - 4) return 0; // Chunk not yet fully buffered
- if (buf[i + n + 2] != '\r' || buf[i + n + 3] != '\n') return -1; // Error
- *pl = i + 2, *dl = n;
- return i + 2 + n + 2;
- }
- static void http_cb(struct mg_connection *c, int ev, void *ev_data) {
- if (ev == MG_EV_READ || ev == MG_EV_CLOSE) {
- struct mg_http_message hm;
- size_t ofs = 0; // Parsing offset
- while (c->is_resp == 0 && ofs < c->recv.len) {
- const char *buf = (char *) c->recv.buf + ofs;
- int n = mg_http_parse(buf, c->recv.len - ofs, &hm);
- struct mg_str *te; // Transfer - encoding header
- bool is_chunked = false;
- if (n < 0) {
- mg_error(c, "HTTP parse, %lu bytes", c->recv.len);
- mg_hexdump(c->recv.buf, c->recv.len > 16 ? 16 : c->recv.len);
- return;
- }
- if (n == 0) break; // Request is not buffered yet
- if (ev == MG_EV_CLOSE) { // If client did not set Content-Length
- hm.message.len = c->recv.len - ofs; // and closes now, deliver MSG
- hm.body.len = hm.message.len - (size_t) (hm.body.ptr - hm.message.ptr);
- }
- if ((te = mg_http_get_header(&hm, "Transfer-Encoding")) != NULL) {
- if (mg_vcasecmp(te, "chunked") == 0) {
- is_chunked = true;
- } else {
- mg_error(c, "Invalid Transfer-Encoding"); // See #2460
- return;
- }
- }
- if (is_chunked) {
- // For chunked data, strip off prefixes and suffixes from chunks
- // and relocate them right after the headers, then report a message
- char *s = (char *) c->recv.buf + ofs + n;
- int o = 0, pl, dl, cl, len = (int) (c->recv.len - ofs - (size_t) n);
- // Find zero-length chunk (the end of the body)
- while ((cl = skip_chunk(s + o, len - o, &pl, &dl)) > 0 && dl) o += cl;
- if (cl == 0) break; // No zero-len chunk, buffer more data
- if (cl < 0) {
- mg_error(c, "Invalid chunk");
- break;
- }
- // Zero chunk found. Second pass: strip + relocate
- o = 0, hm.body.len = 0, hm.message.len = (size_t) n;
- while ((cl = skip_chunk(s + o, len - o, &pl, &dl)) > 0) {
- memmove(s + hm.body.len, s + o + pl, (size_t) dl);
- o += cl, hm.body.len += (size_t) dl, hm.message.len += (size_t) dl;
- if (dl == 0) break;
- }
- ofs += (size_t) (n + o);
- } else { // Normal, non-chunked data
- size_t len = c->recv.len - ofs - (size_t) n;
- if (hm.body.len > len) break; // Buffer more data
- ofs += (size_t) n + hm.body.len;
- }
- if (c->is_accepted) c->is_resp = 1; // Start generating response
- mg_call(c, MG_EV_HTTP_MSG, &hm); // User handler can clear is_resp
- }
- if (ofs > 0) mg_iobuf_del(&c->recv, 0, ofs); // Delete processed data
- }
- (void) ev_data;
- }
- static void mg_hfn(struct mg_connection *c, int ev, void *ev_data) {
- if (ev == MG_EV_HTTP_MSG) {
- struct mg_http_message *hm = (struct mg_http_message *) ev_data;
- if (mg_http_match_uri(hm, "/quit")) {
- mg_http_reply(c, 200, "", "ok\n");
- c->is_draining = 1;
- c->data[0] = 'X';
- } else if (mg_http_match_uri(hm, "/debug")) {
- int level = (int) mg_json_get_long(hm->body, "$.level", MG_LL_DEBUG);
- mg_log_set(level);
- mg_http_reply(c, 200, "", "Debug level set to %d\n", level);
- } else {
- mg_http_reply(c, 200, "", "hi\n");
- }
- } else if (ev == MG_EV_CLOSE) {
- if (c->data[0] == 'X') *(bool *) c->fn_data = true;
- }
- }
- void mg_hello(const char *url) {
- struct mg_mgr mgr;
- bool done = false;
- mg_mgr_init(&mgr);
- if (mg_http_listen(&mgr, url, mg_hfn, &done) == NULL) done = true;
- while (done == false) mg_mgr_poll(&mgr, 100);
- mg_mgr_free(&mgr);
- }
- struct mg_connection *mg_http_connect(struct mg_mgr *mgr, const char *url,
- mg_event_handler_t fn, void *fn_data) {
- struct mg_connection *c = mg_connect(mgr, url, fn, fn_data);
- if (c != NULL) c->pfn = http_cb;
- return c;
- }
- struct mg_connection *mg_http_listen(struct mg_mgr *mgr, const char *url,
- mg_event_handler_t fn, void *fn_data) {
- struct mg_connection *c = mg_listen(mgr, url, fn, fn_data);
- if (c != NULL) c->pfn = http_cb;
- return c;
- }
- #ifdef MG_ENABLE_LINES
- #line 1 "src/iobuf.c"
- #endif
- static size_t roundup(size_t size, size_t align) {
- return align == 0 ? size : (size + align - 1) / align * align;
- }
- int mg_iobuf_resize(struct mg_iobuf *io, size_t new_size) {
- int ok = 1;
- new_size = roundup(new_size, io->align);
- if (new_size == 0) {
- mg_bzero(io->buf, io->size);
- free(io->buf);
- io->buf = NULL;
- io->len = io->size = 0;
- } else if (new_size != io->size) {
- // NOTE(lsm): do not use realloc here. Use calloc/free only, to ease the
- // porting to some obscure platforms like FreeRTOS
- void *p = calloc(1, new_size);
- if (p != NULL) {
- size_t len = new_size < io->len ? new_size : io->len;
- if (len > 0 && io->buf != NULL) memmove(p, io->buf, len);
- mg_bzero(io->buf, io->size);
- free(io->buf);
- io->buf = (unsigned char *) p;
- io->size = new_size;
- } else {
- ok = 0;
- MG_ERROR(("%lld->%lld", (uint64_t) io->size, (uint64_t) new_size));
- }
- }
- return ok;
- }
- int mg_iobuf_init(struct mg_iobuf *io, size_t size, size_t align) {
- io->buf = NULL;
- io->align = align;
- io->size = io->len = 0;
- return mg_iobuf_resize(io, size);
- }
- size_t mg_iobuf_add(struct mg_iobuf *io, size_t ofs, const void *buf,
- size_t len) {
- size_t new_size = roundup(io->len + len, io->align);
- mg_iobuf_resize(io, new_size); // Attempt to resize
- if (new_size != io->size) len = 0; // Resize failure, append nothing
- if (ofs < io->len) memmove(io->buf + ofs + len, io->buf + ofs, io->len - ofs);
- if (buf != NULL) memmove(io->buf + ofs, buf, len);
- if (ofs > io->len) io->len += ofs - io->len;
- io->len += len;
- return len;
- }
- size_t mg_iobuf_del(struct mg_iobuf *io, size_t ofs, size_t len) {
- if (ofs > io->len) ofs = io->len;
- if (ofs + len > io->len) len = io->len - ofs;
- if (io->buf) memmove(io->buf + ofs, io->buf + ofs + len, io->len - ofs - len);
- if (io->buf) mg_bzero(io->buf + io->len - len, len);
- io->len -= len;
- return len;
- }
- void mg_iobuf_free(struct mg_iobuf *io) {
- mg_iobuf_resize(io, 0);
- }
- #ifdef MG_ENABLE_LINES
- #line 1 "src/json.c"
- #endif
- static const char *escapeseq(int esc) {
- return esc ? "\b\f\n\r\t\\\"" : "bfnrt\\\"";
- }
- static char json_esc(int c, int esc) {
- const char *p, *esc1 = escapeseq(esc), *esc2 = escapeseq(!esc);
- for (p = esc1; *p != '\0'; p++) {
- if (*p == c) return esc2[p - esc1];
- }
- return 0;
- }
- static int mg_pass_string(const char *s, int len) {
- int i;
- for (i = 0; i < len; i++) {
- if (s[i] == '\\' && i + 1 < len && json_esc(s[i + 1], 1)) {
- i++;
- } else if (s[i] == '\0') {
- return MG_JSON_INVALID;
- } else if (s[i] == '"') {
- return i;
- }
- }
- return MG_JSON_INVALID;
- }
- static double mg_atod(const char *p, int len, int *numlen) {
- double d = 0.0;
- int i = 0, sign = 1;
- // Sign
- if (i < len && *p == '-') {
- sign = -1, i++;
- } else if (i < len && *p == '+') {
- i++;
- }
- // Decimal
- for (; i < len && p[i] >= '0' && p[i] <= '9'; i++) {
- d *= 10.0;
- d += p[i] - '0';
- }
- d *= sign;
- // Fractional
- if (i < len && p[i] == '.') {
- double frac = 0.0, base = 0.1;
- i++;
- for (; i < len && p[i] >= '0' && p[i] <= '9'; i++) {
- frac += base * (p[i] - '0');
- base /= 10.0;
- }
- d += frac * sign;
- }
- // Exponential
- if (i < len && (p[i] == 'e' || p[i] == 'E')) {
- int j, exp = 0, minus = 0;
- i++;
- if (i < len && p[i] == '-') minus = 1, i++;
- if (i < len && p[i] == '+') i++;
- while (i < len && p[i] >= '0' && p[i] <= '9' && exp < 308)
- exp = exp * 10 + (p[i++] - '0');
- if (minus) exp = -exp;
- for (j = 0; j < exp; j++) d *= 10.0;
- for (j = 0; j < -exp; j++) d /= 10.0;
- }
- if (numlen != NULL) *numlen = i;
- return d;
- }
- // Iterate over object or array elements
- size_t mg_json_next(struct mg_str obj, size_t ofs, struct mg_str *key,
- struct mg_str *val) {
- if (ofs >= obj.len) {
- ofs = 0; // Out of boundaries, stop scanning
- } else if (obj.len < 2 || (*obj.ptr != '{' && *obj.ptr != '[')) {
- ofs = 0; // Not an array or object, stop
- } else {
- struct mg_str sub = mg_str_n(obj.ptr + ofs, obj.len - ofs);
- if (ofs == 0) ofs++, sub.ptr++, sub.len--;
- if (*obj.ptr == '[') { // Iterate over an array
- int n = 0, o = mg_json_get(sub, "$", &n);
- if (n < 0 || o < 0 || (size_t) (o + n) > sub.len) {
- ofs = 0; // Error parsing key, stop scanning
- } else {
- if (key) *key = mg_str_n(NULL, 0);
- if (val) *val = mg_str_n(sub.ptr + o, (size_t) n);
- ofs = (size_t) (&sub.ptr[o + n] - obj.ptr);
- }
- } else { // Iterate over an object
- int n = 0, o = mg_json_get(sub, "$", &n);
- if (n < 0 || o < 0 || (size_t) (o + n) > sub.len) {
- ofs = 0; // Error parsing key, stop scanning
- } else {
- if (key) *key = mg_str_n(sub.ptr + o, (size_t) n);
- sub.ptr += o + n, sub.len -= (size_t) (o + n);
- while (sub.len > 0 && *sub.ptr != ':') sub.len--, sub.ptr++;
- if (sub.len > 0 && *sub.ptr == ':') sub.len--, sub.ptr++;
- n = 0, o = mg_json_get(sub, "$", &n);
- if (n < 0 || o < 0 || (size_t) (o + n) > sub.len) {
- ofs = 0; // Error parsing value, stop scanning
- } else {
- if (val) *val = mg_str_n(sub.ptr + o, (size_t) n);
- ofs = (size_t) (&sub.ptr[o + n] - obj.ptr);
- }
- }
- }
- //MG_INFO(("SUB ofs %u %.*s", ofs, sub.len, sub.ptr));
- while (ofs && ofs < obj.len &&
- (obj.ptr[ofs] == ' ' || obj.ptr[ofs] == '\t' ||
- obj.ptr[ofs] == '\n' || obj.ptr[ofs] == '\r')) {
- ofs++;
- }
- if (ofs && ofs < obj.len && obj.ptr[ofs] == ',') ofs++;
- if (ofs > obj.len) ofs = 0;
- }
- return ofs;
- }
- int mg_json_get(struct mg_str json, const char *path, int *toklen) {
- const char *s = json.ptr;
- int len = (int) json.len;
- enum { S_VALUE, S_KEY, S_COLON, S_COMMA_OR_EOO } expecting = S_VALUE;
- unsigned char nesting[MG_JSON_MAX_DEPTH];
- int i = 0; // Current offset in `s`
- int j = 0; // Offset in `s` we're looking for (return value)
- int depth = 0; // Current depth (nesting level)
- int ed = 0; // Expected depth
- int pos = 1; // Current position in `path`
- int ci = -1, ei = -1; // Current and expected index in array
- if (toklen) *toklen = 0;
- if (path[0] != '$') return MG_JSON_INVALID;
- #define MG_CHECKRET(x) \
- do { \
- if (depth == ed && path[pos] == '\0' && ci == ei) { \
- if (toklen) *toklen = i - j + 1; \
- return j; \
- } \
- } while (0)
- // In the ascii table, the distance between `[` and `]` is 2.
- // Ditto for `{` and `}`. Hence +2 in the code below.
- #define MG_EOO(x) \
- do { \
- if (depth == ed && ci != ei) return MG_JSON_NOT_FOUND; \
- if (c != nesting[depth - 1] + 2) return MG_JSON_INVALID; \
- depth--; \
- MG_CHECKRET(x); \
- } while (0)
- for (i = 0; i < len; i++) {
- unsigned char c = ((unsigned char *) s)[i];
- if (c == ' ' || c == '\t' || c == '\n' || c == '\r') continue;
- switch (expecting) {
- case S_VALUE:
- // p("V %s [%.*s] %d %d %d %d\n", path, pos, path, depth, ed, ci, ei);
- if (depth == ed) j = i;
- if (c == '{') {
- if (depth >= (int) sizeof(nesting)) return MG_JSON_TOO_DEEP;
- if (depth == ed && path[pos] == '.' && ci == ei) {
- // If we start the object, reset array indices
- ed++, pos++, ci = ei = -1;
- }
- nesting[depth++] = c;
- expecting = S_KEY;
- break;
- } else if (c == '[') {
- if (depth >= (int) sizeof(nesting)) return MG_JSON_TOO_DEEP;
- if (depth == ed && path[pos] == '[' && ei == ci) {
- ed++, pos++, ci = 0;
- for (ei = 0; path[pos] != ']' && path[pos] != '\0'; pos++) {
- ei *= 10;
- ei += path[pos] - '0';
- }
- if (path[pos] != 0) pos++;
- }
- nesting[depth++] = c;
- break;
- } else if (c == ']' && depth > 0) { // Empty array
- MG_EOO(']');
- } else if (c == 't' && i + 3 < len && memcmp(&s[i], "true", 4) == 0) {
- i += 3;
- } else if (c == 'n' && i + 3 < len && memcmp(&s[i], "null", 4) == 0) {
- i += 3;
- } else if (c == 'f' && i + 4 < len && memcmp(&s[i], "false", 5) == 0) {
- i += 4;
- } else if (c == '-' || ((c >= '0' && c <= '9'))) {
- int numlen = 0;
- mg_atod(&s[i], len - i, &numlen);
- i += numlen - 1;
- } else if (c == '"') {
- int n = mg_pass_string(&s[i + 1], len - i - 1);
- if (n < 0) return n;
- i += n + 1;
- } else {
- return MG_JSON_INVALID;
- }
- MG_CHECKRET('V');
- if (depth == ed && ei >= 0) ci++;
- expecting = S_COMMA_OR_EOO;
- break;
- case S_KEY:
- if (c == '"') {
- int n = mg_pass_string(&s[i + 1], len - i - 1);
- if (n < 0) return n;
- if (i + 1 + n >= len) return MG_JSON_NOT_FOUND;
- if (depth < ed) return MG_JSON_NOT_FOUND;
- if (depth == ed && path[pos - 1] != '.') return MG_JSON_NOT_FOUND;
- // printf("K %s [%.*s] [%.*s] %d %d %d %d %d\n", path, pos, path, n,
- // &s[i + 1], n, depth, ed, ci, ei);
- // NOTE(cpq): in the check sequence below is important.
- // strncmp() must go first: it fails fast if the remaining length
- // of the path is smaller than `n`.
- if (depth == ed && path[pos - 1] == '.' &&
- strncmp(&s[i + 1], &path[pos], (size_t) n) == 0 &&
- (path[pos + n] == '\0' || path[pos + n] == '.' ||
- path[pos + n] == '[')) {
- pos += n;
- }
- i += n + 1;
- expecting = S_COLON;
- } else if (c == '}') { // Empty object
- MG_EOO('}');
- expecting = S_COMMA_OR_EOO;
- if (depth == ed && ei >= 0) ci++;
- } else {
- return MG_JSON_INVALID;
- }
- break;
- case S_COLON:
- if (c == ':') {
- expecting = S_VALUE;
- } else {
- return MG_JSON_INVALID;
- }
- break;
- case S_COMMA_OR_EOO:
- if (depth <= 0) {
- return MG_JSON_INVALID;
- } else if (c == ',') {
- expecting = (nesting[depth - 1] == '{') ? S_KEY : S_VALUE;
- } else if (c == ']' || c == '}') {
- if (depth == ed && c == '}' && path[pos - 1] == '.')
- return MG_JSON_NOT_FOUND;
- if (depth == ed && c == ']' && path[pos - 1] == ',')
- return MG_JSON_NOT_FOUND;
- MG_EOO('O');
- if (depth == ed && ei >= 0) ci++;
- } else {
- return MG_JSON_INVALID;
- }
- break;
- }
- }
- return MG_JSON_NOT_FOUND;
- }
- bool mg_json_get_num(struct mg_str json, const char *path, double *v) {
- int n, toklen, found = 0;
- if ((n = mg_json_get(json, path, &toklen)) >= 0 &&
- (json.ptr[n] == '-' || (json.ptr[n] >= '0' && json.ptr[n] <= '9'))) {
- if (v != NULL) *v = mg_atod(json.ptr + n, toklen, NULL);
- found = 1;
- }
- return found;
- }
- bool mg_json_get_bool(struct mg_str json, const char *path, bool *v) {
- int found = 0, off = mg_json_get(json, path, NULL);
- if (off >= 0 && (json.ptr[off] == 't' || json.ptr[off] == 'f')) {
- if (v != NULL) *v = json.ptr[off] == 't';
- found = 1;
- }
- return found;
- }
- bool mg_json_unescape(struct mg_str s, char *to, size_t n) {
- size_t i, j;
- for (i = 0, j = 0; i < s.len && j < n; i++, j++) {
- if (s.ptr[i] == '\\' && i + 5 < s.len && s.ptr[i + 1] == 'u') {
- // \uXXXX escape. We could process a simple one-byte chars
- // \u00xx from the ASCII range. More complex chars would require
- // dragging in a UTF8 library, which is too much for us
- if (s.ptr[i + 2] != '0' || s.ptr[i + 3] != '0') return false; // Give up
- ((unsigned char *) to)[j] = (unsigned char) mg_unhexn(s.ptr + i + 4, 2);
- i += 5;
- } else if (s.ptr[i] == '\\' && i + 1 < s.len) {
- char c = json_esc(s.ptr[i + 1], 0);
- if (c == 0) return false;
- to[j] = c;
- i++;
- } else {
- to[j] = s.ptr[i];
- }
- }
- if (j >= n) return false;
- if (n > 0) to[j] = '\0';
- return true;
- }
- char *mg_json_get_str(struct mg_str json, const char *path) {
- char *result = NULL;
- int len = 0, off = mg_json_get(json, path, &len);
- if (off >= 0 && len > 1 && json.ptr[off] == '"') {
- if ((result = (char *) calloc(1, (size_t) len)) != NULL &&
- !mg_json_unescape(mg_str_n(json.ptr + off + 1, (size_t) (len - 2)),
- result, (size_t) len)) {
- free(result);
- result = NULL;
- }
- }
- return result;
- }
- char *mg_json_get_b64(struct mg_str json, const char *path, int *slen) {
- char *result = NULL;
- int len = 0, off = mg_json_get(json, path, &len);
- if (off >= 0 && json.ptr[off] == '"' && len > 1 &&
- (result = (char *) calloc(1, (size_t) len)) != NULL) {
- size_t k = mg_base64_decode(json.ptr + off + 1, (size_t) (len - 2), result,
- (size_t) len);
- if (slen != NULL) *slen = (int) k;
- }
- return result;
- }
- char *mg_json_get_hex(struct mg_str json, const char *path, int *slen) {
- char *result = NULL;
- int len = 0, off = mg_json_get(json, path, &len);
- if (off >= 0 && json.ptr[off] == '"' && len > 1 &&
- (result = (char *) calloc(1, (size_t) len / 2)) != NULL) {
- mg_unhex(json.ptr + off + 1, (size_t) (len - 2), (uint8_t *) result);
- result[len / 2 - 1] = '\0';
- if (slen != NULL) *slen = len / 2 - 1;
- }
- return result;
- }
- long mg_json_get_long(struct mg_str json, const char *path, long dflt) {
- double dv;
- long result = dflt;
- if (mg_json_get_num(json, path, &dv)) result = (long) dv;
- return result;
- }
- #ifdef MG_ENABLE_LINES
- #line 1 "src/log.c"
- #endif
- int mg_log_level = MG_LL_INFO;
- static mg_pfn_t s_log_func = mg_pfn_stdout;
- static void *s_log_func_param = NULL;
- void mg_log_set_fn(mg_pfn_t fn, void *param) {
- s_log_func = fn;
- s_log_func_param = param;
- }
- static void logc(unsigned char c) {
- s_log_func((char) c, s_log_func_param);
- }
- static void logs(const char *buf, size_t len) {
- size_t i;
- for (i = 0; i < len; i++) logc(((unsigned char *) buf)[i]);
- }
- #if MG_ENABLE_CUSTOM_LOG
- // Let user define their own mg_log_prefix() and mg_log()
- #else
- void mg_log_prefix(int level, const char *file, int line, const char *fname) {
- const char *p = strrchr(file, '/');
- char buf[41];
- size_t n;
- if (p == NULL) p = strrchr(file, '\\');
- n = mg_snprintf(buf, sizeof(buf), "%-6llx %d %s:%d:%s", mg_millis(), level,
- p == NULL ? file : p + 1, line, fname);
- if (n > sizeof(buf) - 2) n = sizeof(buf) - 2;
- while (n < sizeof(buf)) buf[n++] = ' ';
- logs(buf, n - 1);
- }
- void mg_log(const char *fmt, ...) {
- va_list ap;
- va_start(ap, fmt);
- mg_vxprintf(s_log_func, s_log_func_param, fmt, &ap);
- va_end(ap);
- logs("\r\n", 2);
- }
- #endif
- static unsigned char nibble(unsigned c) {
- return (unsigned char) (c < 10 ? c + '0' : c + 'W');
- }
- #define ISPRINT(x) ((x) >= ' ' && (x) <= '~')
- void mg_hexdump(const void *buf, size_t len) {
- const unsigned char *p = (const unsigned char *) buf;
- unsigned char ascii[16], alen = 0;
- size_t i;
- for (i = 0; i < len; i++) {
- if ((i % 16) == 0) {
- // Print buffered ascii chars
- if (i > 0) logs(" ", 2), logs((char *) ascii, 16), logc('\n'), alen = 0;
- // Print hex address, then \t
- logc(nibble((i >> 12) & 15)), logc(nibble((i >> 8) & 15)),
- logc(nibble((i >> 4) & 15)), logc('0'), logs(" ", 3);
- }
- logc(nibble(p[i] >> 4)), logc(nibble(p[i] & 15)); // Two nibbles, e.g. c5
- logc(' '); // Space after hex number
- ascii[alen++] = ISPRINT(p[i]) ? p[i] : '.'; // Add to the ascii buf
- }
- while (alen < 16) logs(" ", 3), ascii[alen++] = ' ';
- logs(" ", 2), logs((char *) ascii, 16), logc('\n');
- }
- #ifdef MG_ENABLE_LINES
- #line 1 "src/md5.c"
- #endif
- // This code implements the MD5 message-digest algorithm.
- // The algorithm is due to Ron Rivest. This code was
- // written by Colin Plumb in 1993, no copyright is claimed.
- // This code is in the public domain; do with it what you wish.
- //
- // Equivalent code is available from RSA Data Security, Inc.
- // This code has been tested against that, and is equivalent,
- // except that you don't need to include two pages of legalese
- // with every copy.
- //
- // To compute the message digest of a chunk of bytes, declare an
- // MD5Context structure, pass it to MD5Init, call MD5Update as
- // needed on buffers full of bytes, and then call MD5Final, which
- // will fill a supplied 16-byte array with the digest.
- #if defined(MG_ENABLE_MD5) && MG_ENABLE_MD5
- static void mg_byte_reverse(unsigned char *buf, unsigned longs) {
- if (MG_BIG_ENDIAN) {
- do {
- uint32_t t = (uint32_t) ((unsigned) buf[3] << 8 | buf[2]) << 16 |
- ((unsigned) buf[1] << 8 | buf[0]);
- *(uint32_t *) buf = t;
- buf += 4;
- } while (--longs);
- } else {
- (void) buf, (void) longs; // Little endian. Do nothing
- }
- }
- #define F1(x, y, z) (z ^ (x & (y ^ z)))
- #define F2(x, y, z) F1(z, x, y)
- #define F3(x, y, z) (x ^ y ^ z)
- #define F4(x, y, z) (y ^ (x | ~z))
- #define MD5STEP(f, w, x, y, z, data, s) \
- (w += f(x, y, z) + data, w = w << s | w >> (32 - s), w += x)
- /*
- * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
- * initialization constants.
- */
- void mg_md5_init(mg_md5_ctx *ctx) {
- ctx->buf[0] = 0x67452301;
- ctx->buf[1] = 0xefcdab89;
- ctx->buf[2] = 0x98badcfe;
- ctx->buf[3] = 0x10325476;
- ctx->bits[0] = 0;
- ctx->bits[1] = 0;
- }
- static void mg_md5_transform(uint32_t buf[4], uint32_t const in[16]) {
- uint32_t a, b, c, d;
- a = buf[0];
- b = buf[1];
- c = buf[2];
- d = buf[3];
- MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
- MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
- MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
- MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
- MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
- MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
- MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
- MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
- MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
- MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
- MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
- MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
- MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
- MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
- MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
- MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
- MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
- MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
- MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
- MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
- MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
- MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
- MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
- MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
- MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
- MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
- MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
- MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
- MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
- MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
- MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
- MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
- MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
- MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
- MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
- MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
- MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
- MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
- MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
- MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
- MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
- MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
- MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
- MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
- MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
- MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
- MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
- MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
- MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
- MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
- MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
- MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
- MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
- MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
- MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
- MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
- MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
- MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
- MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
- MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
- MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
- MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
- MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
- MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
- buf[0] += a;
- buf[1] += b;
- buf[2] += c;
- buf[3] += d;
- }
- void mg_md5_update(mg_md5_ctx *ctx, const unsigned char *buf, size_t len) {
- uint32_t t;
- t = ctx->bits[0];
- if ((ctx->bits[0] = t + ((uint32_t) len << 3)) < t) ctx->bits[1]++;
- ctx->bits[1] += (uint32_t) len >> 29;
- t = (t >> 3) & 0x3f;
- if (t) {
- unsigned char *p = (unsigned char *) ctx->in + t;
- t = 64 - t;
- if (len < t) {
- memcpy(p, buf, len);
- return;
- }
- memcpy(p, buf, t);
- mg_byte_reverse(ctx->in, 16);
- mg_md5_transform(ctx->buf, (uint32_t *) ctx->in);
- buf += t;
- len -= t;
- }
- while (len >= 64) {
- memcpy(ctx->in, buf, 64);
- mg_byte_reverse(ctx->in, 16);
- mg_md5_transform(ctx->buf, (uint32_t *) ctx->in);
- buf += 64;
- len -= 64;
- }
- memcpy(ctx->in, buf, len);
- }
- void mg_md5_final(mg_md5_ctx *ctx, unsigned char digest[16]) {
- unsigned count;
- unsigned char *p;
- uint32_t *a;
- count = (ctx->bits[0] >> 3) & 0x3F;
- p = ctx->in + count;
- *p++ = 0x80;
- count = 64 - 1 - count;
- if (count < 8) {
- memset(p, 0, count);
- mg_byte_reverse(ctx->in, 16);
- mg_md5_transform(ctx->buf, (uint32_t *) ctx->in);
- memset(ctx->in, 0, 56);
- } else {
- memset(p, 0, count - 8);
- }
- mg_byte_reverse(ctx->in, 14);
- a = (uint32_t *) ctx->in;
- a[14] = ctx->bits[0];
- a[15] = ctx->bits[1];
- mg_md5_transform(ctx->buf, (uint32_t *) ctx->in);
- mg_byte_reverse((unsigned char *) ctx->buf, 4);
- memcpy(digest, ctx->buf, 16);
- memset((char *) ctx, 0, sizeof(*ctx));
- }
- #endif
- #ifdef MG_ENABLE_LINES
- #line 1 "src/mqtt.c"
- #endif
- #define MQTT_CLEAN_SESSION 0x02
- #define MQTT_HAS_WILL 0x04
- #define MQTT_WILL_RETAIN 0x20
- #define MQTT_HAS_PASSWORD 0x40
- #define MQTT_HAS_USER_NAME 0x80
- struct mg_mqtt_pmap {
- uint8_t id;
- uint8_t type;
- };
- static const struct mg_mqtt_pmap s_prop_map[] = {
- {MQTT_PROP_PAYLOAD_FORMAT_INDICATOR, MQTT_PROP_TYPE_BYTE},
- {MQTT_PROP_MESSAGE_EXPIRY_INTERVAL, MQTT_PROP_TYPE_INT},
- {MQTT_PROP_CONTENT_TYPE, MQTT_PROP_TYPE_STRING},
- {MQTT_PROP_RESPONSE_TOPIC, MQTT_PROP_TYPE_STRING},
- {MQTT_PROP_CORRELATION_DATA, MQTT_PROP_TYPE_BINARY_DATA},
- {MQTT_PROP_SUBSCRIPTION_IDENTIFIER, MQTT_PROP_TYPE_VARIABLE_INT},
- {MQTT_PROP_SESSION_EXPIRY_INTERVAL, MQTT_PROP_TYPE_INT},
- {MQTT_PROP_ASSIGNED_CLIENT_IDENTIFIER, MQTT_PROP_TYPE_STRING},
- {MQTT_PROP_SERVER_KEEP_ALIVE, MQTT_PROP_TYPE_SHORT},
- {MQTT_PROP_AUTHENTICATION_METHOD, MQTT_PROP_TYPE_STRING},
- {MQTT_PROP_AUTHENTICATION_DATA, MQTT_PROP_TYPE_BINARY_DATA},
- {MQTT_PROP_REQUEST_PROBLEM_INFORMATION, MQTT_PROP_TYPE_BYTE},
- {MQTT_PROP_WILL_DELAY_INTERVAL, MQTT_PROP_TYPE_INT},
- {MQTT_PROP_REQUEST_RESPONSE_INFORMATION, MQTT_PROP_TYPE_BYTE},
- {MQTT_PROP_RESPONSE_INFORMATION, MQTT_PROP_TYPE_STRING},
- {MQTT_PROP_SERVER_REFERENCE, MQTT_PROP_TYPE_STRING},
- {MQTT_PROP_REASON_STRING, MQTT_PROP_TYPE_STRING},
- {MQTT_PROP_RECEIVE_MAXIMUM, MQTT_PROP_TYPE_SHORT},
- {MQTT_PROP_TOPIC_ALIAS_MAXIMUM, MQTT_PROP_TYPE_SHORT},
- {MQTT_PROP_TOPIC_ALIAS, MQTT_PROP_TYPE_SHORT},
- {MQTT_PROP_MAXIMUM_QOS, MQTT_PROP_TYPE_BYTE},
- {MQTT_PROP_RETAIN_AVAILABLE, MQTT_PROP_TYPE_BYTE},
- {MQTT_PROP_USER_PROPERTY, MQTT_PROP_TYPE_STRING_PAIR},
- {MQTT_PROP_MAXIMUM_PACKET_SIZE, MQTT_PROP_TYPE_INT},
- {MQTT_PROP_WILDCARD_SUBSCRIPTION_AVAILABLE, MQTT_PROP_TYPE_BYTE},
- {MQTT_PROP_SUBSCRIPTION_IDENTIFIER_AVAILABLE, MQTT_PROP_TYPE_BYTE},
- {MQTT_PROP_SHARED_SUBSCRIPTION_AVAILABLE, MQTT_PROP_TYPE_BYTE}};
- void mg_mqtt_send_header(struct mg_connection *c, uint8_t cmd, uint8_t flags,
- uint32_t len) {
- uint8_t buf[1 + sizeof(len)], *vlen = &buf[1];
- buf[0] = (uint8_t) ((cmd << 4) | flags);
- do {
- *vlen = len % 0x80;
- len /= 0x80;
- if (len > 0) *vlen |= 0x80;
- vlen++;
- } while (len > 0 && vlen < &buf[sizeof(buf)]);
- mg_send(c, buf, (size_t) (vlen - buf));
- }
- static void mg_send_u16(struct mg_connection *c, uint16_t value) {
- mg_send(c, &value, sizeof(value));
- }
- static void mg_send_u32(struct mg_connection *c, uint32_t value) {
- mg_send(c, &value, sizeof(value));
- }
- static uint8_t varint_size(size_t length) {
- uint8_t bytes_needed = 0;
- do {
- bytes_needed++;
- length /= 0x80;
- } while (length > 0);
- return bytes_needed;
- }
- static size_t encode_varint(uint8_t *buf, size_t value) {
- size_t len = 0;
- do {
- uint8_t byte = (uint8_t) (value % 128);
- value /= 128;
- if (value > 0) byte |= 0x80;
- buf[len++] = byte;
- } while (value > 0);
- return len;
- }
- static size_t decode_varint(const uint8_t *buf, size_t len, size_t *value) {
- size_t multiplier = 1, offset;
- *value = 0;
- for (offset = 0; offset < 4 && offset < len; offset++) {
- uint8_t encoded_byte = buf[offset];
- *value += (encoded_byte & 0x7f) * multiplier;
- multiplier *= 128;
- if ((encoded_byte & 0x80) == 0) return offset + 1;
- }
- return 0;
- }
- static int mqtt_prop_type_by_id(uint8_t prop_id) {
- size_t i, num_properties = sizeof(s_prop_map) / sizeof(s_prop_map[0]);
- for (i = 0; i < num_properties; ++i) {
- if (s_prop_map[i].id == prop_id) return s_prop_map[i].type;
- }
- return -1; // Property ID not found
- }
- // Returns the size of the properties section, without the
- // size of the content's length
- static size_t get_properties_length(struct mg_mqtt_prop *props, size_t count) {
- size_t i, size = 0;
- for (i = 0; i < count; i++) {
- size++; // identifier
- switch (mqtt_prop_type_by_id(props[i].id)) {
- case MQTT_PROP_TYPE_STRING_PAIR:
- size += (uint32_t) (props[i].val.len + props[i].key.len +
- 2 * sizeof(uint16_t));
- break;
- case MQTT_PROP_TYPE_STRING:
- size += (uint32_t) (props[i].val.len + sizeof(uint16_t));
- break;
- case MQTT_PROP_TYPE_BINARY_DATA:
- size += (uint32_t) (props[i].val.len + sizeof(uint16_t));
- break;
- case MQTT_PROP_TYPE_VARIABLE_INT:
- size += varint_size((uint32_t) props[i].iv);
- break;
- case MQTT_PROP_TYPE_INT:
- size += (uint32_t) sizeof(uint32_t);
- break;
- case MQTT_PROP_TYPE_SHORT:
- size += (uint32_t) sizeof(uint16_t);
- break;
- case MQTT_PROP_TYPE_BYTE:
- size += (uint32_t) sizeof(uint8_t);
- break;
- default:
- return size; // cannot parse further down
- }
- }
- return size;
- }
- // returns the entire size of the properties section, including the
- // size of the variable length of the content
- static size_t get_props_size(struct mg_mqtt_prop *props, size_t count) {
- size_t size = get_properties_length(props, count);
- size += varint_size(size);
- return size;
- }
- static void mg_send_mqtt_properties(struct mg_connection *c,
- struct mg_mqtt_prop *props, size_t nprops) {
- size_t total_size = get_properties_length(props, nprops);
- uint8_t buf_v[4] = {0, 0, 0, 0};
- uint8_t buf[4] = {0, 0, 0, 0};
- size_t i, len = encode_varint(buf, total_size);
- mg_send(c, buf, (size_t) len);
- for (i = 0; i < nprops; i++) {
- mg_send(c, &props[i].id, sizeof(props[i].id));
- switch (mqtt_prop_type_by_id(props[i].id)) {
- case MQTT_PROP_TYPE_STRING_PAIR:
- mg_send_u16(c, mg_htons((uint16_t) props[i].key.len));
- mg_send(c, props[i].key.ptr, props[i].key.len);
- mg_send_u16(c, mg_htons((uint16_t) props[i].val.len));
- mg_send(c, props[i].val.ptr, props[i].val.len);
- break;
- case MQTT_PROP_TYPE_BYTE:
- mg_send(c, &props[i].iv, sizeof(uint8_t));
- break;
- case MQTT_PROP_TYPE_SHORT:
- mg_send_u16(c, mg_htons((uint16_t) props[i].iv));
- break;
- case MQTT_PROP_TYPE_INT:
- mg_send_u32(c, mg_htonl((uint32_t) props[i].iv));
- break;
- case MQTT_PROP_TYPE_STRING:
- mg_send_u16(c, mg_htons((uint16_t) props[i].val.len));
- mg_send(c, props[i].val.ptr, props[i].val.len);
- break;
- case MQTT_PROP_TYPE_BINARY_DATA:
- mg_send_u16(c, mg_htons((uint16_t) props[i].val.len));
- mg_send(c, props[i].val.ptr, props[i].val.len);
- break;
- case MQTT_PROP_TYPE_VARIABLE_INT:
- len = encode_varint(buf_v, props[i].iv);
- mg_send(c, buf_v, (size_t) len);
- break;
- }
- }
- }
- size_t mg_mqtt_next_prop(struct mg_mqtt_message *msg, struct mg_mqtt_prop *prop,
- size_t ofs) {
- uint8_t *i = (uint8_t *) msg->dgram.ptr + msg->props_start + ofs;
- uint8_t *end = (uint8_t *) msg->dgram.ptr + msg->dgram.len;
- size_t new_pos = ofs, len;
- prop->id = i[0];
- if (ofs >= msg->dgram.len || ofs >= msg->props_start + msg->props_size)
- return 0;
- i++, new_pos++;
- switch (mqtt_prop_type_by_id(prop->id)) {
- case MQTT_PROP_TYPE_STRING_PAIR:
- prop->key.len = (uint16_t) ((((uint16_t) i[0]) << 8) | i[1]);
- prop->key.ptr = (char *) i + 2;
- i += 2 + prop->key.len;
- prop->val.len = (uint16_t) ((((uint16_t) i[0]) << 8) | i[1]);
- prop->val.ptr = (char *) i + 2;
- new_pos += 2 * sizeof(uint16_t) + prop->val.len + prop->key.len;
- break;
- case MQTT_PROP_TYPE_BYTE:
- prop->iv = (uint8_t) i[0];
- new_pos++;
- break;
- case MQTT_PROP_TYPE_SHORT:
- prop->iv = (uint16_t) ((((uint16_t) i[0]) << 8) | i[1]);
- new_pos += sizeof(uint16_t);
- break;
- case MQTT_PROP_TYPE_INT:
- prop->iv = ((uint32_t) i[0] << 24) | ((uint32_t) i[1] << 16) |
- ((uint32_t) i[2] << 8) | i[3];
- new_pos += sizeof(uint32_t);
- break;
- case MQTT_PROP_TYPE_STRING:
- prop->val.len = (uint16_t) ((((uint16_t) i[0]) << 8) | i[1]);
- prop->val.ptr = (char *) i + 2;
- new_pos += 2 + prop->val.len;
- break;
- case MQTT_PROP_TYPE_BINARY_DATA:
- prop->val.len = (uint16_t) ((((uint16_t) i[0]) << 8) | i[1]);
- prop->val.ptr = (char *) i + 2;
- new_pos += 2 + prop->val.len;
- break;
- case MQTT_PROP_TYPE_VARIABLE_INT:
- len = decode_varint(i, (size_t) (end - i), (size_t *) &prop->iv);
- new_pos = (!len) ? 0 : new_pos + len;
- break;
- default:
- new_pos = 0;
- }
- return new_pos;
- }
- void mg_mqtt_login(struct mg_connection *c, const struct mg_mqtt_opts *opts) {
- char rnd[10], client_id[21];
- struct mg_str cid = opts->client_id;
- size_t total_len = 7 + 1 + 2 + 2;
- uint8_t hdr[8] = {0, 4, 'M', 'Q', 'T', 'T', opts->version, 0};
- if (cid.len == 0) {
- mg_random(rnd, sizeof(rnd));
- mg_hex(rnd, sizeof(rnd), client_id);
- client_id[sizeof(client_id) - 1] = '\0';
- cid = mg_str(client_id);
- }
- if (hdr[6] == 0) hdr[6] = 4; // If version is not set, use 4 (3.1.1)
- c->is_mqtt5 = hdr[6] == 5; // Set version 5 flag
- hdr[7] = (uint8_t) ((opts->qos & 3) << 3); // Connection flags
- if (opts->user.len > 0) {
- total_len += 2 + (uint32_t) opts->user.len;
- hdr[7] |= MQTT_HAS_USER_NAME;
- }
- if (opts->pass.len > 0) {
- total_len += 2 + (uint32_t) opts->pass.len;
- hdr[7] |= MQTT_HAS_PASSWORD;
- }
- if (opts->topic.len > 0 && opts->message.len > 0) {
- total_len += 4 + (uint32_t) opts->topic.len + (uint32_t) opts->message.len;
- hdr[7] |= MQTT_HAS_WILL;
- }
- if (opts->clean || cid.len == 0) hdr[7] |= MQTT_CLEAN_SESSION;
- if (opts->retain) hdr[7] |= MQTT_WILL_RETAIN;
- total_len += (uint32_t) cid.len;
- if (c->is_mqtt5) {
- total_len += get_props_size(opts->props, opts->num_props);
- if (hdr[7] & MQTT_HAS_WILL)
- total_len += get_props_size(opts->will_props, opts->num_will_props);
- }
- mg_mqtt_send_header(c, MQTT_CMD_CONNECT, 0, (uint32_t) total_len);
- mg_send(c, hdr, sizeof(hdr));
- // keepalive == 0 means "do not disconnect us!"
- mg_send_u16(c, mg_htons((uint16_t) opts->keepalive));
- if (c->is_mqtt5) mg_send_mqtt_properties(c, opts->props, opts->num_props);
- mg_send_u16(c, mg_htons((uint16_t) cid.len));
- mg_send(c, cid.ptr, cid.len);
- if (hdr[7] & MQTT_HAS_WILL) {
- if (c->is_mqtt5)
- mg_send_mqtt_properties(c, opts->will_props, opts->num_will_props);
- mg_send_u16(c, mg_htons((uint16_t) opts->topic.len));
- mg_send(c, opts->topic.ptr, opts->topic.len);
- mg_send_u16(c, mg_htons((uint16_t) opts->message.len));
- mg_send(c, opts->message.ptr, opts->message.len);
- }
- if (opts->user.len > 0) {
- mg_send_u16(c, mg_htons((uint16_t) opts->user.len));
- mg_send(c, opts->user.ptr, opts->user.len);
- }
- if (opts->pass.len > 0) {
- mg_send_u16(c, mg_htons((uint16_t) opts->pass.len));
- mg_send(c, opts->pass.ptr, opts->pass.len);
- }
- }
- void mg_mqtt_pub(struct mg_connection *c, const struct mg_mqtt_opts *opts) {
- uint8_t flags = (uint8_t) (((opts->qos & 3) << 1) | (opts->retain ? 1 : 0));
- size_t len = 2 + opts->topic.len + opts->message.len;
- MG_DEBUG(("%lu [%.*s] -> [%.*s]", c->id, (int) opts->topic.len,
- (char *) opts->topic.ptr, (int) opts->message.len,
- (char *) opts->message.ptr));
- if (opts->qos > 0) len += 2;
- if (c->is_mqtt5) len += get_props_size(opts->props, opts->num_props);
- mg_mqtt_send_header(c, MQTT_CMD_PUBLISH, flags, (uint32_t) len);
- mg_send_u16(c, mg_htons((uint16_t) opts->topic.len));
- mg_send(c, opts->topic.ptr, opts->topic.len);
- if (opts->qos > 0) {
- if (++c->mgr->mqtt_id == 0) ++c->mgr->mqtt_id;
- mg_send_u16(c, mg_htons(c->mgr->mqtt_id));
- }
- if (c->is_mqtt5) mg_send_mqtt_properties(c, opts->props, opts->num_props);
- if (opts->message.len > 0) mg_send(c, opts->message.ptr, opts->message.len);
- }
- void mg_mqtt_sub(struct mg_connection *c, const struct mg_mqtt_opts *opts) {
- uint8_t qos_ = opts->qos & 3;
- size_t plen = c->is_mqtt5 ? get_props_size(opts->props, opts->num_props) : 0;
- size_t len = 2 + opts->topic.len + 2 + 1 + plen;
- mg_mqtt_send_header(c, MQTT_CMD_SUBSCRIBE, 2, (uint32_t) len);
- if (++c->mgr->mqtt_id == 0) ++c->mgr->mqtt_id;
- mg_send_u16(c, mg_htons(c->mgr->mqtt_id));
- if (c->is_mqtt5) mg_send_mqtt_properties(c, opts->props, opts->num_props);
- mg_send_u16(c, mg_htons((uint16_t) opts->topic.len));
- mg_send(c, opts->topic.ptr, opts->topic.len);
- mg_send(c, &qos_, sizeof(qos_));
- }
- int mg_mqtt_parse(const uint8_t *buf, size_t len, uint8_t version,
- struct mg_mqtt_message *m) {
- uint8_t lc = 0, *p, *end;
- uint32_t n = 0, len_len = 0;
- memset(m, 0, sizeof(*m));
- m->dgram.ptr = (char *) buf;
- if (len < 2) return MQTT_INCOMPLETE;
- m->cmd = (uint8_t) (buf[0] >> 4);
- m->qos = (buf[0] >> 1) & 3;
- n = len_len = 0;
- p = (uint8_t *) buf + 1;
- while ((size_t) (p - buf) < len) {
- lc = *((uint8_t *) p++);
- n += (uint32_t) ((lc & 0x7f) << 7 * len_len);
- len_len++;
- if (!(lc & 0x80)) break;
- if (len_len >= 4) return MQTT_MALFORMED;
- }
- end = p + n;
- if ((lc & 0x80) || (end > buf + len)) return MQTT_INCOMPLETE;
- m->dgram.len = (size_t) (end - buf);
- switch (m->cmd) {
- case MQTT_CMD_CONNACK:
- if (end - p < 2) return MQTT_MALFORMED;
- m->ack = p[1];
- break;
- case MQTT_CMD_PUBACK:
- case MQTT_CMD_PUBREC:
- case MQTT_CMD_PUBREL:
- case MQTT_CMD_PUBCOMP:
- case MQTT_CMD_SUBSCRIBE:
- case MQTT_CMD_SUBACK:
- case MQTT_CMD_UNSUBSCRIBE:
- case MQTT_CMD_UNSUBACK:
- if (p + 2 > end) return MQTT_MALFORMED;
- m->id = (uint16_t) ((((uint16_t) p[0]) << 8) | p[1]);
- p += 2;
- break;
- case MQTT_CMD_PUBLISH: {
- if (p + 2 > end) return MQTT_MALFORMED;
- m->topic.len = (uint16_t) ((((uint16_t) p[0]) << 8) | p[1]);
- m->topic.ptr = (char *) p + 2;
- p += 2 + m->topic.len;
- if (p > end) return MQTT_MALFORMED;
- if (m->qos > 0) {
- if (p + 2 > end) return MQTT_MALFORMED;
- m->id = (uint16_t) ((((uint16_t) p[0]) << 8) | p[1]);
- p += 2;
- }
- if (p > end) return MQTT_MALFORMED;
- if (version == 5 && p + 2 < end) {
- len_len =
- (uint32_t) decode_varint(p, (size_t) (end - p), &m->props_size);
- if (!len_len) return MQTT_MALFORMED;
- m->props_start = (size_t) (p + len_len - buf);
- p += len_len + m->props_size;
- }
- if (p > end) return MQTT_MALFORMED;
- m->data.ptr = (char *) p;
- m->data.len = (size_t) (end - p);
- break;
- }
- default:
- break;
- }
- return MQTT_OK;
- }
- static void mqtt_cb(struct mg_connection *c, int ev, void *ev_data) {
- if (ev == MG_EV_READ) {
- for (;;) {
- uint8_t version = c->is_mqtt5 ? 5 : 4;
- struct mg_mqtt_message mm;
- int rc = mg_mqtt_parse(c->recv.buf, c->recv.len, version, &mm);
- if (rc == MQTT_MALFORMED) {
- MG_ERROR(("%lu MQTT malformed message", c->id));
- c->is_closing = 1;
- break;
- } else if (rc == MQTT_OK) {
- MG_VERBOSE(("%lu MQTT CMD %d len %d [%.*s]", c->id, mm.cmd,
- (int) mm.dgram.len, (int) mm.data.len, mm.data.ptr));
- switch (mm.cmd) {
- case MQTT_CMD_CONNACK:
- mg_call(c, MG_EV_MQTT_OPEN, &mm.ack);
- if (mm.ack == 0) {
- MG_DEBUG(("%lu Connected", c->id));
- } else {
- MG_ERROR(("%lu MQTT auth failed, code %d", c->id, mm.ack));
- c->is_closing = 1;
- }
- break;
- case MQTT_CMD_PUBLISH: {
- /*MG_DEBUG(("%lu [%.*s] -> [%.*s]", c->id, (int) mm.topic.len,
- mm.topic.ptr, (int) mm.data.len, mm.data.ptr));*/
- if (mm.qos > 0) {
- uint16_t id = mg_ntohs(mm.id);
- uint32_t remaining_len = sizeof(id);
- if (c->is_mqtt5) remaining_len += 2; // 3.4.2
- mg_mqtt_send_header(
- c,
- (uint8_t) (mm.qos == 2 ? MQTT_CMD_PUBREC : MQTT_CMD_PUBACK),
- 0, remaining_len);
- mg_send(c, &id, sizeof(id));
- if (c->is_mqtt5) {
- uint16_t zero = 0;
- mg_send(c, &zero, sizeof(zero));
- }
- }
- mg_call(c, MG_EV_MQTT_MSG, &mm); // let the app handle qos stuff
- break;
- }
- case MQTT_CMD_PUBREC: { // MQTT5: 3.5.2-1 TODO(): variable header rc
- uint16_t id = mg_ntohs(mm.id);
- uint32_t remaining_len = sizeof(id); // MQTT5 3.6.2-1
- mg_mqtt_send_header(c, MQTT_CMD_PUBREL, 2, remaining_len);
- mg_send(c, &id, sizeof(id)); // MQTT5 3.6.1-1, flags = 2
- break;
- }
- case MQTT_CMD_PUBREL: { // MQTT5: 3.6.2-1 TODO(): variable header rc
- uint16_t id = mg_ntohs(mm.id);
- uint32_t remaining_len = sizeof(id); // MQTT5 3.7.2-1
- mg_mqtt_send_header(c, MQTT_CMD_PUBCOMP, 0, remaining_len);
- mg_send(c, &id, sizeof(id));
- break;
- }
- }
- mg_call(c, MG_EV_MQTT_CMD, &mm);
- mg_iobuf_del(&c->recv, 0, mm.dgram.len);
- } else {
- break;
- }
- }
- }
- (void) ev_data;
- }
- void mg_mqtt_ping(struct mg_connection *nc) {
- mg_mqtt_send_header(nc, MQTT_CMD_PINGREQ, 0, 0);
- }
- void mg_mqtt_pong(struct mg_connection *nc) {
- mg_mqtt_send_header(nc, MQTT_CMD_PINGRESP, 0, 0);
- }
- void mg_mqtt_disconnect(struct mg_connection *c,
- const struct mg_mqtt_opts *opts) {
- size_t len = 0;
- if (c->is_mqtt5) len = 1 + get_props_size(opts->props, opts->num_props);
- mg_mqtt_send_header(c, MQTT_CMD_DISCONNECT, 0, (uint32_t) len);
- if (c->is_mqtt5) {
- uint8_t zero = 0;
- mg_send(c, &zero, sizeof(zero)); // reason code
- mg_send_mqtt_properties(c, opts->props, opts->num_props);
- }
- }
- struct mg_connection *mg_mqtt_connect(struct mg_mgr *mgr, const char *url,
- const struct mg_mqtt_opts *opts,
- mg_event_handler_t fn, void *fn_data) {
- struct mg_connection *c = mg_connect(mgr, url, fn, fn_data);
- if (c != NULL) {
- struct mg_mqtt_opts empty;
- memset(&empty, 0, sizeof(empty));
- mg_mqtt_login(c, opts == NULL ? &empty : opts);
- c->pfn = mqtt_cb;
- }
- return c;
- }
- struct mg_connection *mg_mqtt_listen(struct mg_mgr *mgr, const char *url,
- mg_event_handler_t fn, void *fn_data) {
- struct mg_connection *c = mg_listen(mgr, url, fn, fn_data);
- if (c != NULL) c->pfn = mqtt_cb, c->pfn_data = mgr;
- return c;
- }
- #ifdef MG_ENABLE_LINES
- #line 1 "src/net.c"
- #endif
- size_t mg_vprintf(struct mg_connection *c, const char *fmt, va_list *ap) {
- size_t old = c->send.len;
- mg_vxprintf(mg_pfn_iobuf, &c->send, fmt, ap);
- return c->send.len - old;
- }
- size_t mg_printf(struct mg_connection *c, const char *fmt, ...) {
- size_t len = 0;
- va_list ap;
- va_start(ap, fmt);
- len = mg_vprintf(c, fmt, &ap);
- va_end(ap);
- return len;
- }
- static bool mg_atonl(struct mg_str str, struct mg_addr *addr) {
- uint32_t localhost = mg_htonl(0x7f000001);
- if (mg_vcasecmp(&str, "localhost") != 0) return false;
- memcpy(addr->ip, &localhost, sizeof(uint32_t));
- addr->is_ip6 = false;
- return true;
- }
- static bool mg_atone(struct mg_str str, struct mg_addr *addr) {
- if (str.len > 0) return false;
- memset(addr->ip, 0, sizeof(addr->ip));
- addr->is_ip6 = false;
- return true;
- }
- static bool mg_aton4(struct mg_str str, struct mg_addr *addr) {
- uint8_t data[4] = {0, 0, 0, 0};
- size_t i, num_dots = 0;
- for (i = 0; i < str.len; i++) {
- if (str.ptr[i] >= '0' && str.ptr[i] <= '9') {
- int octet = data[num_dots] * 10 + (str.ptr[i] - '0');
- if (octet > 255) return false;
- data[num_dots] = (uint8_t) octet;
- } else if (str.ptr[i] == '.') {
- if (num_dots >= 3 || i == 0 || str.ptr[i - 1] == '.') return false;
- num_dots++;
- } else {
- return false;
- }
- }
- if (num_dots != 3 || str.ptr[i - 1] == '.') return false;
- memcpy(&addr->ip, data, sizeof(data));
- addr->is_ip6 = false;
- return true;
- }
- static bool mg_v4mapped(struct mg_str str, struct mg_addr *addr) {
- int i;
- uint32_t ipv4;
- if (str.len < 14) return false;
- if (str.ptr[0] != ':' || str.ptr[1] != ':' || str.ptr[6] != ':') return false;
- for (i = 2; i < 6; i++) {
- if (str.ptr[i] != 'f' && str.ptr[i] != 'F') return false;
- }
- // struct mg_str s = mg_str_n(&str.ptr[7], str.len - 7);
- if (!mg_aton4(mg_str_n(&str.ptr[7], str.len - 7), addr)) return false;
- memcpy(&ipv4, addr->ip, sizeof(ipv4));
- memset(addr->ip, 0, sizeof(addr->ip));
- addr->ip[10] = addr->ip[11] = 255;
- memcpy(&addr->ip[12], &ipv4, 4);
- addr->is_ip6 = true;
- return true;
- }
- static bool mg_aton6(struct mg_str str, struct mg_addr *addr) {
- size_t i, j = 0, n = 0, dc = 42;
- addr->scope_id = 0;
- if (str.len > 2 && str.ptr[0] == '[') str.ptr++, str.len -= 2;
- if (mg_v4mapped(str, addr)) return true;
- for (i = 0; i < str.len; i++) {
- if ((str.ptr[i] >= '0' && str.ptr[i] <= '9') ||
- (str.ptr[i] >= 'a' && str.ptr[i] <= 'f') ||
- (str.ptr[i] >= 'A' && str.ptr[i] <= 'F')) {
- unsigned long val;
- if (i > j + 3) return false;
- // MG_DEBUG(("%lu %lu [%.*s]", i, j, (int) (i - j + 1), &str.ptr[j]));
- val = mg_unhexn(&str.ptr[j], i - j + 1);
- addr->ip[n] = (uint8_t) ((val >> 8) & 255);
- addr->ip[n + 1] = (uint8_t) (val & 255);
- } else if (str.ptr[i] == ':') {
- j = i + 1;
- if (i > 0 && str.ptr[i - 1] == ':') {
- dc = n; // Double colon
- if (i > 1 && str.ptr[i - 2] == ':') return false;
- } else if (i > 0) {
- n += 2;
- }
- if (n > 14) return false;
- addr->ip[n] = addr->ip[n + 1] = 0; // For trailing ::
- } else if (str.ptr[i] == '%') { // Scope ID
- for (i = i + 1; i < str.len; i++) {
- if (str.ptr[i] < '0' || str.ptr[i] > '9') return false;
- addr->scope_id = (uint8_t) (addr->scope_id * 10);
- addr->scope_id = (uint8_t) (addr->scope_id + (str.ptr[i] - '0'));
- }
- } else {
- return false;
- }
- }
- if (n < 14 && dc == 42) return false;
- if (n < 14) {
- memmove(&addr->ip[dc + (14 - n)], &addr->ip[dc], n - dc + 2);
- memset(&addr->ip[dc], 0, 14 - n);
- }
- addr->is_ip6 = true;
- return true;
- }
- bool mg_aton(struct mg_str str, struct mg_addr *addr) {
- // MG_INFO(("[%.*s]", (int) str.len, str.ptr));
- return mg_atone(str, addr) || mg_atonl(str, addr) || mg_aton4(str, addr) ||
- mg_aton6(str, addr);
- }
- struct mg_connection *mg_alloc_conn(struct mg_mgr *mgr) {
- struct mg_connection *c =
- (struct mg_connection *) calloc(1, sizeof(*c) + mgr->extraconnsize);
- if (c != NULL) {
- c->mgr = mgr;
- c->send.align = c->recv.align = c->rtls.align = MG_IO_SIZE;
- c->id = ++mgr->nextid;
- MG_PROF_INIT(c);
- }
- return c;
- }
- void mg_close_conn(struct mg_connection *c) {
- mg_resolve_cancel(c); // Close any pending DNS query
- LIST_DELETE(struct mg_connection, &c->mgr->conns, c);
- if (c == c->mgr->dns4.c) c->mgr->dns4.c = NULL;
- if (c == c->mgr->dns6.c) c->mgr->dns6.c = NULL;
- // Order of operations is important. `MG_EV_CLOSE` event must be fired
- // before we deallocate received data, see #1331
- mg_call(c, MG_EV_CLOSE, NULL);
- MG_DEBUG(("%lu %ld closed", c->id, c->fd));
- MG_PROF_DUMP(c);
- MG_PROF_FREE(c);
- mg_tls_free(c);
- mg_iobuf_free(&c->recv);
- mg_iobuf_free(&c->send);
- mg_iobuf_free(&c->rtls);
- mg_bzero((unsigned char *) c, sizeof(*c));
- free(c);
- }
- struct mg_connection *mg_connect(struct mg_mgr *mgr, const char *url,
- mg_event_handler_t fn, void *fn_data) {
- struct mg_connection *c = NULL;
- if (url == NULL || url[0] == '\0') {
- MG_ERROR(("null url"));
- } else if ((c = mg_alloc_conn(mgr)) == NULL) {
- MG_ERROR(("OOM"));
- } else {
- LIST_ADD_HEAD(struct mg_connection, &mgr->conns, c);
- c->is_udp = (strncmp(url, "udp:", 4) == 0);
- c->fd = (void *) (size_t) MG_INVALID_SOCKET;
- c->fn = fn;
- c->is_client = true;
- c->fn_data = fn_data;
- MG_DEBUG(("%lu %ld %s", c->id, c->fd, url));
- mg_call(c, MG_EV_OPEN, (void *) url);
- mg_resolve(c, url);
- }
- return c;
- }
- struct mg_connection *mg_listen(struct mg_mgr *mgr, const char *url,
- mg_event_handler_t fn, void *fn_data) {
- struct mg_connection *c = NULL;
- if ((c = mg_alloc_conn(mgr)) == NULL) {
- MG_ERROR(("OOM %s", url));
- } else if (!mg_open_listener(c, url)) {
- MG_ERROR(("Failed: %s, errno %d", url, errno));
- MG_PROF_FREE(c);
- free(c);
- c = NULL;
- } else {
- c->is_listening = 1;
- c->is_udp = strncmp(url, "udp:", 4) == 0;
- LIST_ADD_HEAD(struct mg_connection, &mgr->conns, c);
- c->fn = fn;
- c->fn_data = fn_data;
- mg_call(c, MG_EV_OPEN, NULL);
- if (mg_url_is_ssl(url)) c->is_tls = 1; // Accepted connection must
- MG_DEBUG(("%lu %ld %s", c->id, c->fd, url));
- }
- return c;
- }
- struct mg_connection *mg_wrapfd(struct mg_mgr *mgr, int fd,
- mg_event_handler_t fn, void *fn_data) {
- struct mg_connection *c = mg_alloc_conn(mgr);
- if (c != NULL) {
- c->fd = (void *) (size_t) fd;
- c->fn = fn;
- c->fn_data = fn_data;
- MG_EPOLL_ADD(c);
- mg_call(c, MG_EV_OPEN, NULL);
- LIST_ADD_HEAD(struct mg_connection, &mgr->conns, c);
- }
- return c;
- }
- struct mg_timer *mg_timer_add(struct mg_mgr *mgr, uint64_t milliseconds,
- unsigned flags, void (*fn)(void *), void *arg) {
- struct mg_timer *t = (struct mg_timer *) calloc(1, sizeof(*t));
- if (t != NULL) {
- mg_timer_init(&mgr->timers, t, milliseconds, flags, fn, arg);
- t->id = mgr->timerid++;
- }
- return t;
- }
- long mg_io_recv(struct mg_connection *c, void *buf, size_t len) {
- if (c->rtls.len == 0) return MG_IO_WAIT;
- if (len > c->rtls.len) len = c->rtls.len;
- memcpy(buf, c->rtls.buf, len);
- mg_iobuf_del(&c->rtls, 0, len);
- return (long) len;
- }
- void mg_mgr_free(struct mg_mgr *mgr) {
- struct mg_connection *c;
- struct mg_timer *tmp, *t = mgr->timers;
- while (t != NULL) tmp = t->next, free(t), t = tmp;
- mgr->timers = NULL; // Important. Next call to poll won't touch timers
- for (c = mgr->conns; c != NULL; c = c->next) c->is_closing = 1;
- mg_mgr_poll(mgr, 0);
- #if MG_ENABLE_FREERTOS_TCP
- FreeRTOS_DeleteSocketSet(mgr->ss);
- #endif
- MG_DEBUG(("All connections closed"));
- #if MG_ENABLE_EPOLL
- if (mgr->epoll_fd >= 0) close(mgr->epoll_fd), mgr->epoll_fd = -1;
- #endif
- mg_tls_ctx_free(mgr);
- }
- void mg_mgr_init(struct mg_mgr *mgr) {
- memset(mgr, 0, sizeof(*mgr));
- #if MG_ENABLE_EPOLL
- if ((mgr->epoll_fd = epoll_create1(EPOLL_CLOEXEC)) < 0)
- MG_ERROR(("epoll_create1 errno %d", errno));
- #else
- mgr->epoll_fd = -1;
- #endif
- #if MG_ARCH == MG_ARCH_WIN32 && MG_ENABLE_WINSOCK
- // clang-format off
- { WSADATA data; WSAStartup(MAKEWORD(2, 2), &data); }
- // clang-format on
- #elif MG_ENABLE_FREERTOS_TCP
- mgr->ss = FreeRTOS_CreateSocketSet();
- #elif defined(__unix) || defined(__unix__) || defined(__APPLE__)
- // Ignore SIGPIPE signal, so if client cancels the request, it
- // won't kill the whole process.
- signal(SIGPIPE, SIG_IGN);
- #endif
- mgr->pipe = MG_INVALID_SOCKET;
- mgr->dnstimeout = 3000;
- mgr->dns4.url = "udp://8.8.8.8:53";
- mgr->dns6.url = "udp://[2001:4860:4860::8888]:53";
- mg_tls_ctx_init(mgr);
- }
- #ifdef MG_ENABLE_LINES
- #line 1 "src/net_builtin.c"
- #endif
- #if defined(MG_ENABLE_TCPIP) && MG_ENABLE_TCPIP
- #define MG_EPHEMERAL_PORT_BASE 32768
- #define PDIFF(a, b) ((size_t) (((char *) (b)) - ((char *) (a))))
- #ifndef MIP_TCP_KEEPALIVE_MS
- #define MIP_TCP_KEEPALIVE_MS 45000 // TCP keep-alive period, ms
- #endif
- #define MIP_TCP_ACK_MS 150 // Timeout for ACKing
- #define MIP_TCP_ARP_MS 100 // Timeout for ARP response
- #define MIP_TCP_SYN_MS 15000 // Timeout for connection establishment
- #define MIP_TCP_FIN_MS 1000 // Timeout for closing connection
- struct connstate {
- uint32_t seq, ack; // TCP seq/ack counters
- uint64_t timer; // TCP keep-alive / ACK timer
- uint8_t mac[6]; // Peer MAC address
- uint8_t ttype; // Timer type. 0: ack, 1: keep-alive
- #define MIP_TTYPE_KEEPALIVE 0 // Connection is idle for long, send keepalive
- #define MIP_TTYPE_ACK 1 // Peer sent us data, we have to ack it soon
- #define MIP_TTYPE_ARP 2 // ARP resolve sent, waiting for response
- #define MIP_TTYPE_SYN 3 // SYN sent, waiting for response
- #define MIP_TTYPE_FIN 4 // FIN sent, waiting until terminating the connection
- uint8_t tmiss; // Number of keep-alive misses
- struct mg_iobuf raw; // For TLS only. Incoming raw data
- };
- #pragma pack(push, 1)
- struct lcp {
- uint8_t addr, ctrl, proto[2], code, id, len[2];
- };
- struct eth {
- uint8_t dst[6]; // Destination MAC address
- uint8_t src[6]; // Source MAC address
- uint16_t type; // Ethernet type
- };
- struct ip {
- uint8_t ver; // Version
- uint8_t tos; // Unused
- uint16_t len; // Length
- uint16_t id; // Unused
- uint16_t frag; // Fragmentation
- #define IP_FRAG_OFFSET_MSK 0xFF1F
- #define IP_MORE_FRAGS_MSK 0x20
- uint8_t ttl; // Time to live
- uint8_t proto; // Upper level protocol
- uint16_t csum; // Checksum
- uint32_t src; // Source IP
- uint32_t dst; // Destination IP
- };
- struct ip6 {
- uint8_t ver; // Version
- uint8_t opts[3]; // Options
- uint16_t len; // Length
- uint8_t proto; // Upper level protocol
- uint8_t ttl; // Time to live
- uint8_t src[16]; // Source IP
- uint8_t dst[16]; // Destination IP
- };
- struct icmp {
- uint8_t type;
- uint8_t code;
- uint16_t csum;
- };
- struct arp {
- uint16_t fmt; // Format of hardware address
- uint16_t pro; // Format of protocol address
- uint8_t hlen; // Length of hardware address
- uint8_t plen; // Length of protocol address
- uint16_t op; // Operation
- uint8_t sha[6]; // Sender hardware address
- uint32_t spa; // Sender protocol address
- uint8_t tha[6]; // Target hardware address
- uint32_t tpa; // Target protocol address
- };
- struct tcp {
- uint16_t sport; // Source port
- uint16_t dport; // Destination port
- uint32_t seq; // Sequence number
- uint32_t ack; // Acknowledgement number
- uint8_t off; // Data offset
- uint8_t flags; // TCP flags
- #define TH_FIN 0x01
- #define TH_SYN 0x02
- #define TH_RST 0x04
- #define TH_PUSH 0x08
- #define TH_ACK 0x10
- #define TH_URG 0x20
- #define TH_ECE 0x40
- #define TH_CWR 0x80
- uint16_t win; // Window
- uint16_t csum; // Checksum
- uint16_t urp; // Urgent pointer
- };
- struct udp {
- uint16_t sport; // Source port
- uint16_t dport; // Destination port
- uint16_t len; // UDP length
- uint16_t csum; // UDP checksum
- };
- struct dhcp {
- uint8_t op, htype, hlen, hops;
- uint32_t xid;
- uint16_t secs, flags;
- uint32_t ciaddr, yiaddr, siaddr, giaddr;
- uint8_t hwaddr[208];
- uint32_t magic;
- uint8_t options[32];
- };
- #pragma pack(pop)
- struct pkt {
- struct mg_str raw; // Raw packet data
- struct mg_str pay; // Payload data
- struct eth *eth;
- struct llc *llc;
- struct arp *arp;
- struct ip *ip;
- struct ip6 *ip6;
- struct icmp *icmp;
- struct tcp *tcp;
- struct udp *udp;
- struct dhcp *dhcp;
- };
- static void send_syn(struct mg_connection *c);
- static void mkpay(struct pkt *pkt, void *p) {
- pkt->pay =
- mg_str_n((char *) p, (size_t) (&pkt->raw.ptr[pkt->raw.len] - (char *) p));
- }
- static uint32_t csumup(uint32_t sum, const void *buf, size_t len) {
- const uint8_t *p = (const uint8_t *) buf;
- for (size_t i = 0; i < len; i++) sum += i & 1 ? p[i] : (uint32_t) (p[i] << 8);
- return sum;
- }
- static uint16_t csumfin(uint32_t sum) {
- while (sum >> 16) sum = (sum & 0xffff) + (sum >> 16);
- return mg_htons(~sum & 0xffff);
- }
- static uint16_t ipcsum(const void *buf, size_t len) {
- uint32_t sum = csumup(0, buf, len);
- return csumfin(sum);
- }
- static void settmout(struct mg_connection *c, uint8_t type) {
- struct mg_tcpip_if *ifp = (struct mg_tcpip_if *) c->mgr->priv;
- struct connstate *s = (struct connstate *) (c + 1);
- unsigned n = type == MIP_TTYPE_ACK ? MIP_TCP_ACK_MS
- : type == MIP_TTYPE_ARP ? MIP_TCP_ARP_MS
- : type == MIP_TTYPE_SYN ? MIP_TCP_SYN_MS
- : type == MIP_TTYPE_FIN ? MIP_TCP_FIN_MS
- : MIP_TCP_KEEPALIVE_MS;
- s->timer = ifp->now + n;
- s->ttype = type;
- MG_VERBOSE(("%lu %d -> %llx", c->id, type, s->timer));
- }
- static size_t ether_output(struct mg_tcpip_if *ifp, size_t len) {
- size_t n = ifp->driver->tx(ifp->tx.ptr, len, ifp);
- if (n == len) ifp->nsent++;
- return n;
- }
- static void arp_ask(struct mg_tcpip_if *ifp, uint32_t ip) {
- struct eth *eth = (struct eth *) ifp->tx.ptr;
- struct arp *arp = (struct arp *) (eth + 1);
- memset(eth->dst, 255, sizeof(eth->dst));
- memcpy(eth->src, ifp->mac, sizeof(eth->src));
- eth->type = mg_htons(0x806);
- memset(arp, 0, sizeof(*arp));
- arp->fmt = mg_htons(1), arp->pro = mg_htons(0x800), arp->hlen = 6,
- arp->plen = 4;
- arp->op = mg_htons(1), arp->tpa = ip, arp->spa = ifp->ip;
- memcpy(arp->sha, ifp->mac, sizeof(arp->sha));
- ether_output(ifp, PDIFF(eth, arp + 1));
- }
- static void onstatechange(struct mg_tcpip_if *ifp) {
- if (ifp->state == MG_TCPIP_STATE_READY) {
- MG_INFO(("READY, IP: %M", mg_print_ip4, &ifp->ip));
- MG_INFO((" GW: %M", mg_print_ip4, &ifp->gw));
- MG_INFO((" MAC: %M", mg_print_mac, &ifp->mac));
- arp_ask(ifp, ifp->gw);
- } else if (ifp->state == MG_TCPIP_STATE_UP) {
- MG_ERROR(("Link up"));
- srand((unsigned int) mg_millis());
- } else if (ifp->state == MG_TCPIP_STATE_DOWN) {
- MG_ERROR(("Link down"));
- }
- }
- static struct ip *tx_ip(struct mg_tcpip_if *ifp, uint8_t *mac_dst,
- uint8_t proto, uint32_t ip_src, uint32_t ip_dst,
- size_t plen) {
- struct eth *eth = (struct eth *) ifp->tx.ptr;
- struct ip *ip = (struct ip *) (eth + 1);
- memcpy(eth->dst, mac_dst, sizeof(eth->dst));
- memcpy(eth->src, ifp->mac, sizeof(eth->src)); // Use our MAC
- eth->type = mg_htons(0x800);
- memset(ip, 0, sizeof(*ip));
- ip->ver = 0x45; // Version 4, header length 5 words
- ip->frag = 0x40; // Don't fragment
- ip->len = mg_htons((uint16_t) (sizeof(*ip) + plen));
- ip->ttl = 64;
- ip->proto = proto;
- ip->src = ip_src;
- ip->dst = ip_dst;
- ip->csum = ipcsum(ip, sizeof(*ip));
- return ip;
- }
- static void tx_udp(struct mg_tcpip_if *ifp, uint8_t *mac_dst, uint32_t ip_src,
- uint16_t sport, uint32_t ip_dst, uint16_t dport,
- const void *buf, size_t len) {
- struct ip *ip =
- tx_ip(ifp, mac_dst, 17, ip_src, ip_dst, len + sizeof(struct udp));
- struct udp *udp = (struct udp *) (ip + 1);
- // MG_DEBUG(("UDP XX LEN %d %d", (int) len, (int) ifp->tx.len));
- udp->sport = sport;
- udp->dport = dport;
- udp->len = mg_htons((uint16_t) (sizeof(*udp) + len));
- udp->csum = 0;
- uint32_t cs = csumup(0, udp, sizeof(*udp));
- cs = csumup(cs, buf, len);
- cs = csumup(cs, &ip->src, sizeof(ip->src));
- cs = csumup(cs, &ip->dst, sizeof(ip->dst));
- cs += (uint32_t) (ip->proto + sizeof(*udp) + len);
- udp->csum = csumfin(cs);
- memmove(udp + 1, buf, len);
- // MG_DEBUG(("UDP LEN %d %d", (int) len, (int) ifp->frame_len));
- ether_output(ifp, sizeof(struct eth) + sizeof(*ip) + sizeof(*udp) + len);
- }
- static void tx_dhcp(struct mg_tcpip_if *ifp, uint8_t *mac_dst, uint32_t ip_src,
- uint32_t ip_dst, uint8_t *opts, size_t optslen,
- bool ciaddr) {
- // https://datatracker.ietf.org/doc/html/rfc2132#section-9.6
- struct dhcp dhcp = {1, 1, 6, 0, 0, 0, 0, 0, 0, 0, 0, {0}, 0, {0}};
- dhcp.magic = mg_htonl(0x63825363);
- memcpy(&dhcp.hwaddr, ifp->mac, sizeof(ifp->mac));
- memcpy(&dhcp.xid, ifp->mac + 2, sizeof(dhcp.xid));
- memcpy(&dhcp.options, opts, optslen);
- if (ciaddr) dhcp.ciaddr = ip_src;
- tx_udp(ifp, mac_dst, ip_src, mg_htons(68), ip_dst, mg_htons(67), &dhcp,
- sizeof(dhcp));
- }
- static const uint8_t broadcast[] = {255, 255, 255, 255, 255, 255};
- // RFC-2131 #4.3.6, #4.4.1
- static void tx_dhcp_request_sel(struct mg_tcpip_if *ifp, uint32_t ip_req,
- uint32_t ip_srv) {
- uint8_t opts[] = {
- 53, 1, 3, // Type: DHCP request
- 55, 2, 1, 3, // GW and mask
- 12, 3, 'm', 'i', 'p', // Host name: "mip"
- 54, 4, 0, 0, 0, 0, // DHCP server ID
- 50, 4, 0, 0, 0, 0, // Requested IP
- 255 // End of options
- };
- memcpy(opts + 14, &ip_srv, sizeof(ip_srv));
- memcpy(opts + 20, &ip_req, sizeof(ip_req));
- tx_dhcp(ifp, (uint8_t *) broadcast, 0, 0xffffffff, opts, sizeof(opts), false);
- MG_DEBUG(("DHCP req sent"));
- }
- // RFC-2131 #4.3.6, #4.4.5 (renewing: unicast, rebinding: bcast)
- static void tx_dhcp_request_re(struct mg_tcpip_if *ifp, uint8_t *mac_dst,
- uint32_t ip_src, uint32_t ip_dst) {
- uint8_t opts[] = {
- 53, 1, 3, // Type: DHCP request
- 255 // End of options
- };
- tx_dhcp(ifp, mac_dst, ip_src, ip_dst, opts, sizeof(opts), true);
- MG_DEBUG(("DHCP req sent"));
- }
- static void tx_dhcp_discover(struct mg_tcpip_if *ifp) {
- uint8_t opts[] = {
- 53, 1, 1, // Type: DHCP discover
- 55, 2, 1, 3, // Parameters: ip, mask
- 255 // End of options
- };
- tx_dhcp(ifp, (uint8_t *) broadcast, 0, 0xffffffff, opts, sizeof(opts), false);
- MG_DEBUG(("DHCP discover sent. Our MAC: %M", mg_print_mac, ifp->mac));
- }
- static struct mg_connection *getpeer(struct mg_mgr *mgr, struct pkt *pkt,
- bool lsn) {
- struct mg_connection *c = NULL;
- for (c = mgr->conns; c != NULL; c = c->next) {
- if (c->is_arplooking && pkt->arp &&
- memcmp(&pkt->arp->spa, c->rem.ip, sizeof(pkt->arp->spa)) == 0)
- break;
- if (c->is_udp && pkt->udp && c->loc.port == pkt->udp->dport) break;
- if (!c->is_udp && pkt->tcp && c->loc.port == pkt->tcp->dport &&
- lsn == c->is_listening && (lsn || c->rem.port == pkt->tcp->sport))
- break;
- }
- return c;
- }
- static void rx_arp(struct mg_tcpip_if *ifp, struct pkt *pkt) {
- if (pkt->arp->op == mg_htons(1) && pkt->arp->tpa == ifp->ip) {
- // ARP request. Make a response, then send
- // MG_DEBUG(("ARP op %d %M: %M", mg_ntohs(pkt->arp->op), mg_print_ip4,
- // &pkt->arp->spa, mg_print_ip4, &pkt->arp->tpa));
- struct eth *eth = (struct eth *) ifp->tx.ptr;
- struct arp *arp = (struct arp *) (eth + 1);
- memcpy(eth->dst, pkt->eth->src, sizeof(eth->dst));
- memcpy(eth->src, ifp->mac, sizeof(eth->src));
- eth->type = mg_htons(0x806);
- *arp = *pkt->arp;
- arp->op = mg_htons(2);
- memcpy(arp->tha, pkt->arp->sha, sizeof(pkt->arp->tha));
- memcpy(arp->sha, ifp->mac, sizeof(pkt->arp->sha));
- arp->tpa = pkt->arp->spa;
- arp->spa = ifp->ip;
- MG_DEBUG(("ARP: tell %M we're %M", mg_print_ip4, &arp->tpa, mg_print_mac,
- &ifp->mac));
- ether_output(ifp, PDIFF(eth, arp + 1));
- } else if (pkt->arp->op == mg_htons(2)) {
- if (memcmp(pkt->arp->tha, ifp->mac, sizeof(pkt->arp->tha)) != 0) return;
- if (pkt->arp->spa == ifp->gw) {
- // Got response for the GW ARP request. Set ifp->gwmac
- memcpy(ifp->gwmac, pkt->arp->sha, sizeof(ifp->gwmac));
- } else {
- struct mg_connection *c = getpeer(ifp->mgr, pkt, false);
- if (c != NULL && c->is_arplooking) {
- struct connstate *s = (struct connstate *) (c + 1);
- memcpy(s->mac, pkt->arp->sha, sizeof(s->mac));
- MG_DEBUG(("%lu ARP resolved %M -> %M", c->id, mg_print_ip4, c->rem.ip,
- mg_print_mac, s->mac));
- c->is_arplooking = 0;
- send_syn(c);
- settmout(c, MIP_TTYPE_SYN);
- }
- }
- }
- }
- static void rx_icmp(struct mg_tcpip_if *ifp, struct pkt *pkt) {
- // MG_DEBUG(("ICMP %d", (int) len));
- if (pkt->icmp->type == 8 && pkt->ip != NULL && pkt->ip->dst == ifp->ip) {
- size_t hlen = sizeof(struct eth) + sizeof(struct ip) + sizeof(struct icmp);
- size_t space = ifp->tx.len - hlen, plen = pkt->pay.len;
- if (plen > space) plen = space;
- struct ip *ip = tx_ip(ifp, pkt->eth->src, 1, ifp->ip, pkt->ip->src,
- sizeof(struct icmp) + plen);
- struct icmp *icmp = (struct icmp *) (ip + 1);
- memset(icmp, 0, sizeof(*icmp)); // Set csum to 0
- memcpy(icmp + 1, pkt->pay.ptr, plen); // Copy RX payload to TX
- icmp->csum = ipcsum(icmp, sizeof(*icmp) + plen);
- ether_output(ifp, hlen + plen);
- }
- }
- static void rx_dhcp_client(struct mg_tcpip_if *ifp, struct pkt *pkt) {
- uint32_t ip = 0, gw = 0, mask = 0, lease = 0;
- uint8_t msgtype = 0, state = ifp->state;
- // perform size check first, then access fields
- uint8_t *p = pkt->dhcp->options,
- *end = (uint8_t *) &pkt->raw.ptr[pkt->raw.len];
- if (end < (uint8_t *) (pkt->dhcp + 1)) return;
- if (memcmp(&pkt->dhcp->xid, ifp->mac + 2, sizeof(pkt->dhcp->xid))) return;
- while (p + 1 < end && p[0] != 255) { // Parse options RFC-1533 #9
- if (p[0] == 1 && p[1] == sizeof(ifp->mask) && p + 6 < end) { // Mask
- memcpy(&mask, p + 2, sizeof(mask));
- } else if (p[0] == 3 && p[1] == sizeof(ifp->gw) && p + 6 < end) { // GW
- memcpy(&gw, p + 2, sizeof(gw));
- ip = pkt->dhcp->yiaddr;
- } else if (p[0] == 51 && p[1] == 4 && p + 6 < end) { // Lease
- memcpy(&lease, p + 2, sizeof(lease));
- lease = mg_ntohl(lease);
- } else if (p[0] == 53 && p[1] == 1 && p + 6 < end) { // Msg Type
- msgtype = p[2];
- }
- p += p[1] + 2;
- }
- // Process message type, RFC-1533 (9.4); RFC-2131 (3.1, 4)
- if (msgtype == 6 && ifp->ip == ip) { // DHCPNACK, release IP
- ifp->state = MG_TCPIP_STATE_UP, ifp->ip = 0;
- } else if (msgtype == 2 && ifp->state == MG_TCPIP_STATE_UP && ip && gw &&
- lease) { // DHCPOFFER
- tx_dhcp_request_sel(ifp, ip, pkt->dhcp->siaddr); // select IP, (4.4.1)
- ifp->state = MG_TCPIP_STATE_REQ; // REQUESTING state
- } else if (msgtype == 5) { // DHCPACK
- if (ifp->state == MG_TCPIP_STATE_REQ && ip && gw && lease) { // got an IP
- ifp->lease_expire = ifp->now + lease * 1000;
- MG_INFO(("Lease: %u sec (%lld)", lease, ifp->lease_expire / 1000));
- // assume DHCP server = router until ARP resolves
- memcpy(ifp->gwmac, pkt->eth->src, sizeof(ifp->gwmac));
- ifp->ip = ip, ifp->gw = gw, ifp->mask = mask;
- ifp->state = MG_TCPIP_STATE_READY; // BOUND state
- uint64_t rand;
- mg_random(&rand, sizeof(rand));
- srand((unsigned int) (rand + mg_millis()));
- } else if (ifp->state == MG_TCPIP_STATE_READY && ifp->ip == ip) { // renew
- ifp->lease_expire = ifp->now + lease * 1000;
- MG_INFO(("Lease: %u sec (%lld)", lease, ifp->lease_expire / 1000));
- } // TODO(): accept provided T1/T2 and store server IP for renewal (4.4)
- }
- if (ifp->state != state) onstatechange(ifp);
- }
- // Simple DHCP server that assigns a next IP address: ifp->ip + 1
- static void rx_dhcp_server(struct mg_tcpip_if *ifp, struct pkt *pkt) {
- uint8_t op = 0, *p = pkt->dhcp->options,
- *end = (uint8_t *) &pkt->raw.ptr[pkt->raw.len];
- if (end < (uint8_t *) (pkt->dhcp + 1)) return;
- // struct dhcp *req = pkt->dhcp;
- struct dhcp res = {2, 1, 6, 0, 0, 0, 0, 0, 0, 0, 0, {0}, 0, {0}};
- res.yiaddr = ifp->ip;
- ((uint8_t *) (&res.yiaddr))[3]++; // Offer our IP + 1
- while (p + 1 < end && p[0] != 255) { // Parse options
- if (p[0] == 53 && p[1] == 1 && p + 2 < end) { // Message type
- op = p[2];
- }
- p += p[1] + 2;
- }
- if (op == 1 || op == 3) { // DHCP Discover or DHCP Request
- uint8_t msg = op == 1 ? 2 : 5; // Message type: DHCP OFFER or DHCP ACK
- uint8_t opts[] = {
- 53, 1, msg, // Message type
- 1, 4, 0, 0, 0, 0, // Subnet mask
- 54, 4, 0, 0, 0, 0, // Server ID
- 12, 3, 'm', 'i', 'p', // Host name: "mip"
- 51, 4, 255, 255, 255, 255, // Lease time
- 255 // End of options
- };
- memcpy(&res.hwaddr, pkt->dhcp->hwaddr, 6);
- memcpy(opts + 5, &ifp->mask, sizeof(ifp->mask));
- memcpy(opts + 11, &ifp->ip, sizeof(ifp->ip));
- memcpy(&res.options, opts, sizeof(opts));
- res.magic = pkt->dhcp->magic;
- res.xid = pkt->dhcp->xid;
- if (ifp->enable_get_gateway) {
- ifp->gw = res.yiaddr;
- memcpy(ifp->gwmac, pkt->eth->src, sizeof(ifp->gwmac));
- }
- tx_udp(ifp, pkt->eth->src, ifp->ip, mg_htons(67),
- op == 1 ? ~0U : res.yiaddr, mg_htons(68), &res, sizeof(res));
- }
- }
- static void rx_udp(struct mg_tcpip_if *ifp, struct pkt *pkt) {
- struct mg_connection *c = getpeer(ifp->mgr, pkt, true);
- if (c == NULL) {
- // No UDP listener on this port. Should send ICMP, but keep silent.
- } else {
- c->rem.port = pkt->udp->sport;
- memcpy(c->rem.ip, &pkt->ip->src, sizeof(uint32_t));
- struct connstate *s = (struct connstate *) (c + 1);
- memcpy(s->mac, pkt->eth->src, sizeof(s->mac));
- if (c->recv.len >= MG_MAX_RECV_SIZE) {
- mg_error(c, "max_recv_buf_size reached");
- } else if (c->recv.size - c->recv.len < pkt->pay.len &&
- !mg_iobuf_resize(&c->recv, c->recv.len + pkt->pay.len)) {
- mg_error(c, "oom");
- } else {
- memcpy(&c->recv.buf[c->recv.len], pkt->pay.ptr, pkt->pay.len);
- c->recv.len += pkt->pay.len;
- mg_call(c, MG_EV_READ, &pkt->pay.len);
- }
- }
- }
- static size_t tx_tcp(struct mg_tcpip_if *ifp, uint8_t *dst_mac, uint32_t dst_ip,
- uint8_t flags, uint16_t sport, uint16_t dport,
- uint32_t seq, uint32_t ack, const void *buf, size_t len) {
- struct ip *ip =
- tx_ip(ifp, dst_mac, 6, ifp->ip, dst_ip, sizeof(struct tcp) + len);
- struct tcp *tcp = (struct tcp *) (ip + 1);
- memset(tcp, 0, sizeof(*tcp));
- if (buf != NULL && len) memmove(tcp + 1, buf, len);
- tcp->sport = sport;
- tcp->dport = dport;
- tcp->seq = seq;
- tcp->ack = ack;
- tcp->flags = flags;
- tcp->win = mg_htons(8192);
- tcp->off = (uint8_t) (sizeof(*tcp) / 4 << 4);
- uint32_t cs = 0;
- uint16_t n = (uint16_t) (sizeof(*tcp) + len);
- uint8_t pseudo[] = {0, ip->proto, (uint8_t) (n >> 8), (uint8_t) (n & 255)};
- cs = csumup(cs, tcp, n);
- cs = csumup(cs, &ip->src, sizeof(ip->src));
- cs = csumup(cs, &ip->dst, sizeof(ip->dst));
- cs = csumup(cs, pseudo, sizeof(pseudo));
- tcp->csum = csumfin(cs);
- MG_VERBOSE(("TCP %M:%hu -> %M:%hu fl %x len %u", mg_print_ip4, &ip->src,
- mg_ntohs(tcp->sport), mg_print_ip4, &ip->dst,
- mg_ntohs(tcp->dport), tcp->flags, (int) len));
- // mg_hexdump(ifp->tx.ptr, PDIFF(ifp->tx.ptr, tcp + 1) + len);
- return ether_output(ifp, PDIFF(ifp->tx.ptr, tcp + 1) + len);
- }
- static size_t tx_tcp_pkt(struct mg_tcpip_if *ifp, struct pkt *pkt,
- uint8_t flags, uint32_t seq, const void *buf,
- size_t len) {
- uint32_t delta = (pkt->tcp->flags & (TH_SYN | TH_FIN)) ? 1 : 0;
- return tx_tcp(ifp, pkt->eth->src, pkt->ip->src, flags, pkt->tcp->dport,
- pkt->tcp->sport, seq, mg_htonl(mg_ntohl(pkt->tcp->seq) + delta),
- buf, len);
- }
- static struct mg_connection *accept_conn(struct mg_connection *lsn,
- struct pkt *pkt) {
- struct mg_connection *c = mg_alloc_conn(lsn->mgr);
- if (c == NULL) {
- MG_ERROR(("OOM"));
- return NULL;
- }
- struct connstate *s = (struct connstate *) (c + 1);
- s->seq = mg_ntohl(pkt->tcp->ack), s->ack = mg_ntohl(pkt->tcp->seq);
- memcpy(s->mac, pkt->eth->src, sizeof(s->mac));
- settmout(c, MIP_TTYPE_KEEPALIVE);
- memcpy(c->rem.ip, &pkt->ip->src, sizeof(uint32_t));
- c->rem.port = pkt->tcp->sport;
- MG_DEBUG(("%lu accepted %M", c->id, mg_print_ip_port, &c->rem));
- LIST_ADD_HEAD(struct mg_connection, &lsn->mgr->conns, c);
- c->is_accepted = 1;
- c->is_hexdumping = lsn->is_hexdumping;
- c->pfn = lsn->pfn;
- c->loc = lsn->loc;
- c->pfn_data = lsn->pfn_data;
- c->fn = lsn->fn;
- c->fn_data = lsn->fn_data;
- mg_call(c, MG_EV_OPEN, NULL);
- mg_call(c, MG_EV_ACCEPT, NULL);
- return c;
- }
- static size_t trim_len(struct mg_connection *c, size_t len) {
- struct mg_tcpip_if *ifp = (struct mg_tcpip_if *) c->mgr->priv;
- size_t eth_h_len = 14, ip_max_h_len = 24, tcp_max_h_len = 60, udp_h_len = 8;
- size_t max_headers_len =
- eth_h_len + ip_max_h_len + (c->is_udp ? udp_h_len : tcp_max_h_len);
- size_t min_mtu = c->is_udp ? 68 /* RFC-791 */ : max_headers_len - eth_h_len;
- // If the frame exceeds the available buffer, trim the length
- if (len + max_headers_len > ifp->tx.len) {
- len = ifp->tx.len - max_headers_len;
- }
- // Ensure the MTU isn't lower than the minimum allowed value
- if (ifp->mtu < min_mtu) {
- MG_ERROR(("MTU is lower than minimum, capping to %lu", min_mtu));
- ifp->mtu = (uint16_t) min_mtu;
- }
- // If the total packet size exceeds the MTU, trim the length
- if (len + max_headers_len - eth_h_len > ifp->mtu) {
- len = ifp->mtu - max_headers_len + eth_h_len;
- if (c->is_udp) {
- MG_ERROR(("UDP datagram exceeds MTU. Truncating it."));
- }
- }
- return len;
- }
- long mg_io_send(struct mg_connection *c, const void *buf, size_t len) {
- struct mg_tcpip_if *ifp = (struct mg_tcpip_if *) c->mgr->priv;
- struct connstate *s = (struct connstate *) (c + 1);
- uint32_t dst_ip = *(uint32_t *) c->rem.ip;
- len = trim_len(c, len);
- if (c->is_udp) {
- tx_udp(ifp, s->mac, ifp->ip, c->loc.port, dst_ip, c->rem.port, buf, len);
- } else {
- size_t sent =
- tx_tcp(ifp, s->mac, dst_ip, TH_PUSH | TH_ACK, c->loc.port, c->rem.port,
- mg_htonl(s->seq), mg_htonl(s->ack), buf, len);
- if (sent == 0) {
- return MG_IO_WAIT;
- } else if (sent == (size_t) -1) {
- return MG_IO_ERR;
- } else {
- s->seq += (uint32_t) len;
- if (s->ttype == MIP_TTYPE_ACK) settmout(c, MIP_TTYPE_KEEPALIVE);
- }
- }
- return (long) len;
- }
- static void read_conn(struct mg_connection *c, struct pkt *pkt) {
- struct connstate *s = (struct connstate *) (c + 1);
- struct mg_iobuf *io = c->is_tls ? &c->rtls : &c->recv;
- uint32_t seq = mg_ntohl(pkt->tcp->seq);
- uint32_t rem_ip;
- memcpy(&rem_ip, c->rem.ip, sizeof(uint32_t));
- if (pkt->tcp->flags & TH_FIN) {
- // If we initiated the closure, we reply with ACK upon receiving FIN
- // If we didn't initiate it, we reply with FIN as part of the normal TCP
- // closure process
- uint8_t flags = TH_ACK;
- s->ack = (uint32_t) (mg_htonl(pkt->tcp->seq) + pkt->pay.len + 1);
- if (c->is_draining && s->ttype == MIP_TTYPE_FIN) {
- if (s->seq == mg_htonl(pkt->tcp->ack)) { // Simultaneous closure ?
- s->seq++; // Yes. Increment our SEQ
- } else { // Otherwise,
- s->seq = mg_htonl(pkt->tcp->ack); // Set to peer's ACK
- }
- } else {
- flags |= TH_FIN;
- c->is_draining = 1;
- settmout(c, MIP_TTYPE_FIN);
- }
- tx_tcp((struct mg_tcpip_if *) c->mgr->priv, s->mac, rem_ip, flags,
- c->loc.port, c->rem.port, mg_htonl(s->seq), mg_htonl(s->ack), "", 0);
- } else if (pkt->pay.len == 0) {
- // TODO(cpq): handle this peer's ACK
- } else if (seq != s->ack) {
- uint32_t ack = (uint32_t) (mg_htonl(pkt->tcp->seq) + pkt->pay.len);
- if (s->ack == ack) {
- MG_VERBOSE(("ignoring duplicate pkt"));
- } else {
- MG_VERBOSE(("SEQ != ACK: %x %x %x", seq, s->ack, ack));
- tx_tcp((struct mg_tcpip_if *) c->mgr->priv, s->mac, rem_ip, TH_ACK,
- c->loc.port, c->rem.port, mg_htonl(s->seq), mg_htonl(s->ack), "",
- 0);
- }
- } else if (io->size - io->len < pkt->pay.len &&
- !mg_iobuf_resize(io, io->len + pkt->pay.len)) {
- mg_error(c, "oom");
- } else {
- // Copy TCP payload into the IO buffer. If the connection is plain text,
- // we copy to c->recv. If the connection is TLS, this data is encrypted,
- // therefore we copy that encrypted data to the c->rtls iobuffer instead,
- // and then call mg_tls_recv() to decrypt it. NOTE: mg_tls_recv() will
- // call back mg_io_recv() which grabs raw data from c->rtls
- memcpy(&io->buf[io->len], pkt->pay.ptr, pkt->pay.len);
- io->len += pkt->pay.len;
- MG_VERBOSE(("%lu SEQ %x -> %x", c->id, mg_htonl(pkt->tcp->seq), s->ack));
- // Advance ACK counter
- s->ack = (uint32_t) (mg_htonl(pkt->tcp->seq) + pkt->pay.len);
- #if 0
- // Send ACK immediately
- uint32_t rem_ip;
- memcpy(&rem_ip, c->rem.ip, sizeof(uint32_t));
- MG_DEBUG((" imm ACK", c->id, mg_htonl(pkt->tcp->seq), s->ack));
- tx_tcp((struct mg_tcpip_if *) c->mgr->priv, s->mac, rem_ip, TH_ACK, c->loc.port,
- c->rem.port, mg_htonl(s->seq), mg_htonl(s->ack), "", 0);
- #else
- // if not already running, setup a timer to send an ACK later
- if (s->ttype != MIP_TTYPE_ACK) settmout(c, MIP_TTYPE_ACK);
- #endif
- if (c->is_tls && c->is_tls_hs) {
- mg_tls_handshake(c);
- } else if (c->is_tls) {
- // TLS connection. Make room for decrypted data in c->recv
- io = &c->recv;
- if (io->size - io->len < pkt->pay.len &&
- !mg_iobuf_resize(io, io->len + pkt->pay.len)) {
- mg_error(c, "oom");
- } else {
- // Decrypt data directly into c->recv
- long n = mg_tls_recv(c, &io->buf[io->len], io->size - io->len);
- if (n == MG_IO_ERR) {
- mg_error(c, "TLS recv error");
- } else if (n > 0) {
- // Decrypted successfully - trigger MG_EV_READ
- io->len += (size_t) n;
- mg_call(c, MG_EV_READ, &n);
- }
- }
- } else {
- // Plain text connection, data is already in c->recv, trigger
- // MG_EV_READ
- mg_call(c, MG_EV_READ, &pkt->pay.len);
- }
- }
- }
- static void rx_tcp(struct mg_tcpip_if *ifp, struct pkt *pkt) {
- struct mg_connection *c = getpeer(ifp->mgr, pkt, false);
- struct connstate *s = c == NULL ? NULL : (struct connstate *) (c + 1);
- #if 0
- MG_INFO(("%lu %hhu %d", c ? c->id : 0, pkt->tcp->flags, (int) pkt->pay.len));
- #endif
- if (c != NULL && c->is_connecting && pkt->tcp->flags == (TH_SYN | TH_ACK)) {
- s->seq = mg_ntohl(pkt->tcp->ack), s->ack = mg_ntohl(pkt->tcp->seq) + 1;
- tx_tcp_pkt(ifp, pkt, TH_ACK, pkt->tcp->ack, NULL, 0);
- c->is_connecting = 0; // Client connected
- settmout(c, MIP_TTYPE_KEEPALIVE);
- mg_call(c, MG_EV_CONNECT, NULL); // Let user know
- } else if (c != NULL && c->is_connecting && pkt->tcp->flags != TH_ACK) {
- // mg_hexdump(pkt->raw.ptr, pkt->raw.len);
- tx_tcp_pkt(ifp, pkt, TH_RST | TH_ACK, pkt->tcp->ack, NULL, 0);
- } else if (c != NULL && pkt->tcp->flags & TH_RST) {
- mg_error(c, "peer RST"); // RFC-1122 4.2.2.13
- } else if (c != NULL) {
- #if 0
- MG_DEBUG(("%lu %d %M:%hu -> %M:%hu", c->id, (int) pkt->raw.len,
- mg_print_ip4, &pkt->ip->src, mg_ntohs(pkt->tcp->sport),
- mg_print_ip4, &pkt->ip->dst, mg_ntohs(pkt->tcp->dport)));
- mg_hexdump(pkt->pay.ptr, pkt->pay.len);
- #endif
- s->tmiss = 0; // Reset missed keep-alive counter
- if (s->ttype == MIP_TTYPE_KEEPALIVE) // Advance keep-alive timer
- settmout(c,
- MIP_TTYPE_KEEPALIVE); // unless a former ACK timeout is pending
- read_conn(c, pkt); // Override timer with ACK timeout if needed
- } else if ((c = getpeer(ifp->mgr, pkt, true)) == NULL) {
- tx_tcp_pkt(ifp, pkt, TH_RST | TH_ACK, pkt->tcp->ack, NULL, 0);
- } else if (pkt->tcp->flags & TH_RST) {
- if (c->is_accepted) mg_error(c, "peer RST"); // RFC-1122 4.2.2.13
- // ignore RST if not connected
- } else if (pkt->tcp->flags & TH_SYN) {
- // Use peer's source port as ISN, in order to recognise the handshake
- uint32_t isn = mg_htonl((uint32_t) mg_ntohs(pkt->tcp->sport));
- tx_tcp_pkt(ifp, pkt, TH_SYN | TH_ACK, isn, NULL, 0);
- } else if (pkt->tcp->flags & TH_FIN) {
- tx_tcp_pkt(ifp, pkt, TH_FIN | TH_ACK, pkt->tcp->ack, NULL, 0);
- } else if (mg_htonl(pkt->tcp->ack) == mg_htons(pkt->tcp->sport) + 1U) {
- accept_conn(c, pkt);
- } else if (!c->is_accepted) { // no peer
- tx_tcp_pkt(ifp, pkt, TH_RST | TH_ACK, pkt->tcp->ack, NULL, 0);
- } else {
- // MG_VERBOSE(("dropped silently.."));
- }
- }
- static void rx_ip(struct mg_tcpip_if *ifp, struct pkt *pkt) {
- if (pkt->ip->frag & IP_MORE_FRAGS_MSK || pkt->ip->frag & IP_FRAG_OFFSET_MSK) {
- if (pkt->ip->proto == 17) pkt->udp = (struct udp *) (pkt->ip + 1);
- if (pkt->ip->proto == 6) pkt->tcp = (struct tcp *) (pkt->ip + 1);
- struct mg_connection *c = getpeer(ifp->mgr, pkt, false);
- if (c) mg_error(c, "Received fragmented packet");
- } else if (pkt->ip->proto == 1) {
- pkt->icmp = (struct icmp *) (pkt->ip + 1);
- if (pkt->pay.len < sizeof(*pkt->icmp)) return;
- mkpay(pkt, pkt->icmp + 1);
- rx_icmp(ifp, pkt);
- } else if (pkt->ip->proto == 17) {
- pkt->udp = (struct udp *) (pkt->ip + 1);
- if (pkt->pay.len < sizeof(*pkt->udp)) return;
- mkpay(pkt, pkt->udp + 1);
- MG_VERBOSE(("UDP %M:%hu -> %M:%hu len %u", mg_print_ip4, &pkt->ip->src,
- mg_ntohs(pkt->udp->sport), mg_print_ip4, &pkt->ip->dst,
- mg_ntohs(pkt->udp->dport), (int) pkt->pay.len));
- if (ifp->enable_dhcp_client && pkt->udp->dport == mg_htons(68)) {
- pkt->dhcp = (struct dhcp *) (pkt->udp + 1);
- mkpay(pkt, pkt->dhcp + 1);
- rx_dhcp_client(ifp, pkt);
- } else if (ifp->enable_dhcp_server && pkt->udp->dport == mg_htons(67)) {
- pkt->dhcp = (struct dhcp *) (pkt->udp + 1);
- mkpay(pkt, pkt->dhcp + 1);
- rx_dhcp_server(ifp, pkt);
- } else {
- rx_udp(ifp, pkt);
- }
- } else if (pkt->ip->proto == 6) {
- pkt->tcp = (struct tcp *) (pkt->ip + 1);
- if (pkt->pay.len < sizeof(*pkt->tcp)) return;
- mkpay(pkt, pkt->tcp + 1);
- uint16_t iplen = mg_ntohs(pkt->ip->len);
- uint16_t off = (uint16_t) (sizeof(*pkt->ip) + ((pkt->tcp->off >> 4) * 4U));
- if (iplen >= off) pkt->pay.len = (size_t) (iplen - off);
- MG_VERBOSE(("TCP %M:%hu -> %M:%hu len %u", mg_print_ip4, &pkt->ip->src,
- mg_ntohs(pkt->tcp->sport), mg_print_ip4, &pkt->ip->dst,
- mg_ntohs(pkt->tcp->dport), (int) pkt->pay.len));
- rx_tcp(ifp, pkt);
- }
- }
- static void rx_ip6(struct mg_tcpip_if *ifp, struct pkt *pkt) {
- // MG_DEBUG(("IP %d", (int) len));
- if (pkt->ip6->proto == 1 || pkt->ip6->proto == 58) {
- pkt->icmp = (struct icmp *) (pkt->ip6 + 1);
- if (pkt->pay.len < sizeof(*pkt->icmp)) return;
- mkpay(pkt, pkt->icmp + 1);
- rx_icmp(ifp, pkt);
- } else if (pkt->ip6->proto == 17) {
- pkt->udp = (struct udp *) (pkt->ip6 + 1);
- if (pkt->pay.len < sizeof(*pkt->udp)) return;
- // MG_DEBUG((" UDP %u %u -> %u", len, mg_htons(udp->sport),
- // mg_htons(udp->dport)));
- mkpay(pkt, pkt->udp + 1);
- }
- }
- static void mg_tcpip_rx(struct mg_tcpip_if *ifp, void *buf, size_t len) {
- struct pkt pkt;
- memset(&pkt, 0, sizeof(pkt));
- pkt.raw.ptr = (char *) buf;
- pkt.raw.len = len;
- pkt.eth = (struct eth *) buf;
- // mg_hexdump(buf, len > 16 ? 16: len);
- if (pkt.raw.len < sizeof(*pkt.eth)) return; // Truncated - runt?
- if (ifp->enable_mac_check &&
- memcmp(pkt.eth->dst, ifp->mac, sizeof(pkt.eth->dst)) != 0 &&
- memcmp(pkt.eth->dst, broadcast, sizeof(pkt.eth->dst)) != 0)
- return;
- if (ifp->enable_crc32_check && len > 4) {
- len -= 4; // TODO(scaprile): check on bigendian
- uint32_t crc = mg_crc32(0, (const char *) buf, len);
- if (memcmp((void *) ((size_t) buf + len), &crc, sizeof(crc))) return;
- }
- if (pkt.eth->type == mg_htons(0x806)) {
- pkt.arp = (struct arp *) (pkt.eth + 1);
- if (sizeof(*pkt.eth) + sizeof(*pkt.arp) > pkt.raw.len) return; // Truncated
- rx_arp(ifp, &pkt);
- } else if (pkt.eth->type == mg_htons(0x86dd)) {
- pkt.ip6 = (struct ip6 *) (pkt.eth + 1);
- if (pkt.raw.len < sizeof(*pkt.eth) + sizeof(*pkt.ip6)) return; // Truncated
- if ((pkt.ip6->ver >> 4) != 0x6) return; // Not IP
- mkpay(&pkt, pkt.ip6 + 1);
- rx_ip6(ifp, &pkt);
- } else if (pkt.eth->type == mg_htons(0x800)) {
- pkt.ip = (struct ip *) (pkt.eth + 1);
- if (pkt.raw.len < sizeof(*pkt.eth) + sizeof(*pkt.ip)) return; // Truncated
- // Truncate frame to what IP header tells us
- if ((size_t) mg_ntohs(pkt.ip->len) + sizeof(struct eth) < pkt.raw.len) {
- pkt.raw.len = (size_t) mg_ntohs(pkt.ip->len) + sizeof(struct eth);
- }
- if (pkt.raw.len < sizeof(*pkt.eth) + sizeof(*pkt.ip)) return; // Truncated
- if ((pkt.ip->ver >> 4) != 4) return; // Not IP
- mkpay(&pkt, pkt.ip + 1);
- rx_ip(ifp, &pkt);
- } else {
- MG_DEBUG(("Unknown eth type %x", mg_htons(pkt.eth->type)));
- if (mg_log_level >= MG_LL_VERBOSE) mg_hexdump(buf, len >= 32 ? 32 : len);
- }
- }
- static void mg_tcpip_poll(struct mg_tcpip_if *ifp, uint64_t uptime_ms) {
- if (ifp == NULL || ifp->driver == NULL) return;
- bool expired_1000ms = mg_timer_expired(&ifp->timer_1000ms, 1000, uptime_ms);
- ifp->now = uptime_ms;
- // Handle physical interface up/down status
- if (expired_1000ms && ifp->driver->up) {
- bool up = ifp->driver->up(ifp);
- bool current = ifp->state != MG_TCPIP_STATE_DOWN;
- if (up != current) {
- ifp->state = up == false ? MG_TCPIP_STATE_DOWN
- : ifp->enable_dhcp_client ? MG_TCPIP_STATE_UP
- : MG_TCPIP_STATE_READY;
- if (!up && ifp->enable_dhcp_client) ifp->ip = 0;
- onstatechange(ifp);
- }
- }
- if (ifp->state == MG_TCPIP_STATE_DOWN) return;
- // DHCP RFC-2131 (4.4)
- if (ifp->state == MG_TCPIP_STATE_UP && expired_1000ms) {
- tx_dhcp_discover(ifp); // INIT (4.4.1)
- } else if (expired_1000ms && ifp->state == MG_TCPIP_STATE_READY &&
- ifp->lease_expire > 0) { // BOUND / RENEWING / REBINDING
- if (ifp->now >= ifp->lease_expire) {
- ifp->state = MG_TCPIP_STATE_UP, ifp->ip = 0; // expired, release IP
- onstatechange(ifp);
- } else if (ifp->now + 30UL * 60UL * 1000UL > ifp->lease_expire &&
- ((ifp->now / 1000) % 60) == 0) {
- // hack: 30 min before deadline, try to rebind (4.3.6) every min
- tx_dhcp_request_re(ifp, (uint8_t *) broadcast, ifp->ip, 0xffffffff);
- } // TODO(): Handle T1 (RENEWING) and T2 (REBINDING) (4.4.5)
- }
- // Read data from the network
- if (ifp->driver->rx != NULL) { // Polling driver. We must call it
- size_t len =
- ifp->driver->rx(ifp->recv_queue.buf, ifp->recv_queue.size, ifp);
- if (len > 0) {
- ifp->nrecv++;
- mg_tcpip_rx(ifp, ifp->recv_queue.buf, len);
- }
- } else { // Interrupt-based driver. Fills recv queue itself
- char *buf;
- size_t len = mg_queue_next(&ifp->recv_queue, &buf);
- if (len > 0) {
- mg_tcpip_rx(ifp, buf, len);
- mg_queue_del(&ifp->recv_queue, len);
- }
- }
- // Process timeouts
- for (struct mg_connection *c = ifp->mgr->conns; c != NULL; c = c->next) {
- if (c->is_udp || c->is_listening || c->is_resolving) continue;
- struct connstate *s = (struct connstate *) (c + 1);
- uint32_t rem_ip;
- memcpy(&rem_ip, c->rem.ip, sizeof(uint32_t));
- if (uptime_ms > s->timer) {
- if (s->ttype == MIP_TTYPE_ACK) {
- MG_VERBOSE(("%lu ack %x %x", c->id, s->seq, s->ack));
- tx_tcp(ifp, s->mac, rem_ip, TH_ACK, c->loc.port, c->rem.port,
- mg_htonl(s->seq), mg_htonl(s->ack), "", 0);
- } else if (s->ttype == MIP_TTYPE_ARP) {
- mg_error(c, "ARP timeout");
- } else if (s->ttype == MIP_TTYPE_SYN) {
- mg_error(c, "Connection timeout");
- } else if (s->ttype == MIP_TTYPE_FIN) {
- c->is_closing = 1;
- continue;
- } else {
- if (s->tmiss++ > 2) {
- mg_error(c, "keepalive");
- } else {
- MG_VERBOSE(("%lu keepalive", c->id));
- tx_tcp(ifp, s->mac, rem_ip, TH_ACK, c->loc.port, c->rem.port,
- mg_htonl(s->seq - 1), mg_htonl(s->ack), "", 0);
- }
- }
- settmout(c, MIP_TTYPE_KEEPALIVE);
- }
- }
- }
- // This function executes in interrupt context, thus it should copy data
- // somewhere fast. Note that newlib's malloc is not thread safe, thus use
- // our lock-free queue with preallocated buffer to copy data and return asap
- void mg_tcpip_qwrite(void *buf, size_t len, struct mg_tcpip_if *ifp) {
- char *p;
- if (mg_queue_book(&ifp->recv_queue, &p, len) >= len) {
- memcpy(p, buf, len);
- mg_queue_add(&ifp->recv_queue, len);
- ifp->nrecv++;
- } else {
- ifp->ndrop++;
- }
- }
- void mg_tcpip_init(struct mg_mgr *mgr, struct mg_tcpip_if *ifp) {
- // If MAC address is not set, make a random one
- if (ifp->mac[0] == 0 && ifp->mac[1] == 0 && ifp->mac[2] == 0 &&
- ifp->mac[3] == 0 && ifp->mac[4] == 0 && ifp->mac[5] == 0) {
- ifp->mac[0] = 0x02; // Locally administered, unicast
- mg_random(&ifp->mac[1], sizeof(ifp->mac) - 1);
- MG_INFO(("MAC not set. Generated random: %M", mg_print_mac, ifp->mac));
- }
- if (ifp->driver->init && !ifp->driver->init(ifp)) {
- MG_ERROR(("driver init failed"));
- } else {
- size_t framesize = 1540;
- ifp->tx.ptr = (char *) calloc(1, framesize), ifp->tx.len = framesize;
- if (ifp->recv_queue.size == 0)
- ifp->recv_queue.size = ifp->driver->rx ? framesize : 8192;
- ifp->recv_queue.buf = (char *) calloc(1, ifp->recv_queue.size);
- ifp->timer_1000ms = mg_millis();
- mgr->priv = ifp;
- ifp->mgr = mgr;
- ifp->mtu = MG_TCPIP_MTU_DEFAULT;
- mgr->extraconnsize = sizeof(struct connstate);
- if (ifp->ip == 0) ifp->enable_dhcp_client = true;
- memset(ifp->gwmac, 255, sizeof(ifp->gwmac)); // Set to broadcast
- mg_random(&ifp->eport, sizeof(ifp->eport)); // Random from 0 to 65535
- ifp->eport |= MG_EPHEMERAL_PORT_BASE; // Random from
- // MG_EPHEMERAL_PORT_BASE to 65535
- if (ifp->tx.ptr == NULL || ifp->recv_queue.buf == NULL) MG_ERROR(("OOM"));
- }
- }
- void mg_tcpip_free(struct mg_tcpip_if *ifp) {
- free(ifp->recv_queue.buf);
- free((char *) ifp->tx.ptr);
- }
- static void send_syn(struct mg_connection *c) {
- struct connstate *s = (struct connstate *) (c + 1);
- uint32_t isn = mg_htonl((uint32_t) mg_ntohs(c->loc.port));
- struct mg_tcpip_if *ifp = (struct mg_tcpip_if *) c->mgr->priv;
- uint32_t rem_ip;
- memcpy(&rem_ip, c->rem.ip, sizeof(uint32_t));
- tx_tcp(ifp, s->mac, rem_ip, TH_SYN, c->loc.port, c->rem.port, isn, 0, NULL,
- 0);
- }
- void mg_connect_resolved(struct mg_connection *c) {
- struct mg_tcpip_if *ifp = (struct mg_tcpip_if *) c->mgr->priv;
- uint32_t rem_ip;
- memcpy(&rem_ip, c->rem.ip, sizeof(uint32_t));
- c->is_resolving = 0;
- if (ifp->eport < MG_EPHEMERAL_PORT_BASE) ifp->eport = MG_EPHEMERAL_PORT_BASE;
- memcpy(c->loc.ip, &ifp->ip, sizeof(uint32_t));
- c->loc.port = mg_htons(ifp->eport++);
- MG_DEBUG(("%lu %M -> %M", c->id, mg_print_ip_port, &c->loc, mg_print_ip_port,
- &c->rem));
- mg_call(c, MG_EV_RESOLVE, NULL);
- if (c->is_udp && (rem_ip == 0xffffffff || rem_ip == (ifp->ip | ~ifp->mask))) {
- struct connstate *s = (struct connstate *) (c + 1);
- memset(s->mac, 0xFF, sizeof(s->mac)); // global or local broadcast
- } else if (((rem_ip & ifp->mask) == (ifp->ip & ifp->mask))) {
- // If we're in the same LAN, fire an ARP lookup.
- MG_DEBUG(("%lu ARP lookup...", c->id));
- arp_ask(ifp, rem_ip);
- settmout(c, MIP_TTYPE_ARP);
- c->is_arplooking = 1;
- c->is_connecting = 1;
- } else if ((*((uint8_t *) &rem_ip) & 0xE0) == 0xE0) {
- struct connstate *s = (struct connstate *) (c + 1); // 224 to 239, E0 to EF
- uint8_t mcastp[3] = {0x01, 0x00, 0x5E}; // multicast group
- memcpy(s->mac, mcastp, 3);
- memcpy(s->mac + 3, ((uint8_t *) &rem_ip) + 1, 3); // 23 LSb
- s->mac[3] &= 0x7F;
- } else {
- struct connstate *s = (struct connstate *) (c + 1);
- memcpy(s->mac, ifp->gwmac, sizeof(ifp->gwmac));
- if (c->is_udp) {
- mg_call(c, MG_EV_CONNECT, NULL);
- } else {
- send_syn(c);
- settmout(c, MIP_TTYPE_SYN);
- c->is_connecting = 1;
- }
- }
- }
- bool mg_open_listener(struct mg_connection *c, const char *url) {
- c->loc.port = mg_htons(mg_url_port(url));
- return true;
- }
- static void write_conn(struct mg_connection *c) {
- long len = c->is_tls ? mg_tls_send(c, c->send.buf, c->send.len)
- : mg_io_send(c, c->send.buf, c->send.len);
- if (len == MG_IO_ERR) {
- mg_error(c, "tx err");
- } else if (len > 0) {
- mg_iobuf_del(&c->send, 0, (size_t) len);
- mg_call(c, MG_EV_WRITE, &len);
- }
- }
- static void init_closure(struct mg_connection *c) {
- struct connstate *s = (struct connstate *) (c + 1);
- if (c->is_udp == false && c->is_listening == false &&
- c->is_connecting == false) { // For TCP conns,
- struct mg_tcpip_if *ifp =
- (struct mg_tcpip_if *) c->mgr->priv; // send TCP FIN
- uint32_t rem_ip;
- memcpy(&rem_ip, c->rem.ip, sizeof(uint32_t));
- tx_tcp(ifp, s->mac, rem_ip, TH_FIN | TH_ACK, c->loc.port, c->rem.port,
- mg_htonl(s->seq), mg_htonl(s->ack), NULL, 0);
- settmout(c, MIP_TTYPE_FIN);
- }
- }
- static void close_conn(struct mg_connection *c) {
- struct connstate *s = (struct connstate *) (c + 1);
- mg_iobuf_free(&s->raw); // For TLS connections, release raw data
- mg_close_conn(c);
- }
- static bool can_write(struct mg_connection *c) {
- return c->is_connecting == 0 && c->is_resolving == 0 && c->send.len > 0 &&
- c->is_tls_hs == 0 && c->is_arplooking == 0;
- }
- void mg_mgr_poll(struct mg_mgr *mgr, int ms) {
- struct mg_connection *c, *tmp;
- uint64_t now = mg_millis();
- mg_tcpip_poll((struct mg_tcpip_if *) mgr->priv, now);
- mg_timer_poll(&mgr->timers, now);
- for (c = mgr->conns; c != NULL; c = tmp) {
- tmp = c->next;
- struct connstate *s = (struct connstate *) (c + 1);
- mg_call(c, MG_EV_POLL, &now);
- MG_VERBOSE(("%lu .. %c%c%c%c%c", c->id, c->is_tls ? 'T' : 't',
- c->is_connecting ? 'C' : 'c', c->is_tls_hs ? 'H' : 'h',
- c->is_resolving ? 'R' : 'r', c->is_closing ? 'C' : 'c'));
- if (can_write(c)) write_conn(c);
- if (c->is_draining && c->send.len == 0 && s->ttype != MIP_TTYPE_FIN)
- init_closure(c);
- if (c->is_closing) close_conn(c);
- }
- (void) ms;
- }
- bool mg_send(struct mg_connection *c, const void *buf, size_t len) {
- struct mg_tcpip_if *ifp = (struct mg_tcpip_if *) c->mgr->priv;
- bool res = false;
- uint32_t rem_ip;
- memcpy(&rem_ip, c->rem.ip, sizeof(uint32_t));
- if (ifp->ip == 0 || ifp->state != MG_TCPIP_STATE_READY) {
- mg_error(c, "net down");
- } else if (c->is_udp) {
- struct connstate *s = (struct connstate *) (c + 1);
- len = trim_len(c, len); // Trimming length if necessary
- tx_udp(ifp, s->mac, ifp->ip, c->loc.port, rem_ip, c->rem.port, buf, len);
- res = true;
- } else {
- res = mg_iobuf_add(&c->send, c->send.len, buf, len);
- }
- return res;
- }
- #endif // MG_ENABLE_TCPIP
- #ifdef MG_ENABLE_LINES
- #line 1 "src/ota_dummy.c"
- #endif
- #if MG_OTA == MG_OTA_NONE
- bool mg_ota_begin(size_t new_firmware_size) {
- (void) new_firmware_size;
- return true;
- }
- bool mg_ota_write(const void *buf, size_t len) {
- (void) buf, (void) len;
- return true;
- }
- bool mg_ota_end(void) {
- return true;
- }
- bool mg_ota_commit(void) {
- return true;
- }
- bool mg_ota_rollback(void) {
- return true;
- }
- int mg_ota_status(int fw) {
- (void) fw;
- return 0;
- }
- uint32_t mg_ota_crc32(int fw) {
- (void) fw;
- return 0;
- }
- uint32_t mg_ota_timestamp(int fw) {
- (void) fw;
- return 0;
- }
- size_t mg_ota_size(int fw) {
- (void) fw;
- return 0;
- }
- MG_IRAM void mg_ota_boot(void) {
- }
- #endif
- #ifdef MG_ENABLE_LINES
- #line 1 "src/ota_flash.c"
- #endif
- // This OTA implementation uses the internal flash API outlined in device.h
- // It splits flash into 2 equal partitions, and stores OTA status in the
- // last sector of the partition.
- #if MG_OTA == MG_OTA_FLASH
- #define MG_OTADATA_KEY 0xb07afed0
- static char *s_addr; // Current address to write to
- static size_t s_size; // Firmware size to flash. In-progress indicator
- static uint32_t s_crc32; // Firmware checksum
- struct mg_otadata {
- uint32_t crc32, size, timestamp, status;
- };
- bool mg_ota_begin(size_t new_firmware_size) {
- bool ok = false;
- if (s_size) {
- MG_ERROR(("OTA already in progress. Call mg_ota_end()"));
- } else {
- size_t half = mg_flash_size() / 2, max = half - mg_flash_sector_size();
- s_crc32 = 0;
- s_addr = (char *) mg_flash_start() + half;
- MG_DEBUG(("Firmware %lu bytes, max %lu", new_firmware_size, max));
- if (new_firmware_size < max) {
- ok = true;
- s_size = new_firmware_size;
- MG_INFO(("Starting OTA, firmware size %lu", s_size));
- } else {
- MG_ERROR(("Firmware %lu is too big to fit %lu", new_firmware_size, max));
- }
- }
- return ok;
- }
- bool mg_ota_write(const void *buf, size_t len) {
- bool ok = false;
- if (s_size == 0) {
- MG_ERROR(("OTA is not started, call mg_ota_begin()"));
- } else {
- size_t align = mg_flash_write_align();
- size_t len_aligned_down = MG_ROUND_DOWN(len, align);
- if (len_aligned_down) ok = mg_flash_write(s_addr, buf, len_aligned_down);
- if (len_aligned_down < len) {
- size_t left = len - len_aligned_down;
- char tmp[align];
- memset(tmp, 0xff, sizeof(tmp));
- memcpy(tmp, (char *) buf + len_aligned_down, left);
- ok = mg_flash_write(s_addr + len_aligned_down, tmp, sizeof(tmp));
- }
- s_crc32 = mg_crc32(s_crc32, (char *) buf, len); // Update CRC
- MG_DEBUG(("%#x %p %lu -> %d", s_addr - len, buf, len, ok));
- s_addr += len;
- }
- return ok;
- }
- MG_IRAM static uint32_t mg_fwkey(int fw) {
- uint32_t key = MG_OTADATA_KEY + fw;
- int bank = mg_flash_bank();
- if (bank == 2 && fw == MG_FIRMWARE_PREVIOUS) key--;
- if (bank == 2 && fw == MG_FIRMWARE_CURRENT) key++;
- return key;
- }
- bool mg_ota_end(void) {
- char *base = (char *) mg_flash_start() + mg_flash_size() / 2;
- bool ok = false;
- if (s_size) {
- size_t size = s_addr - base;
- uint32_t crc32 = mg_crc32(0, base, s_size);
- if (size == s_size && crc32 == s_crc32) {
- uint32_t now = (uint32_t) (mg_now() / 1000);
- struct mg_otadata od = {crc32, size, now, MG_OTA_FIRST_BOOT};
- uint32_t key = mg_fwkey(MG_FIRMWARE_PREVIOUS);
- ok = mg_flash_save(NULL, key, &od, sizeof(od));
- }
- MG_DEBUG(("CRC: %x/%x, size: %lu/%lu, status: %s", s_crc32, crc32, s_size,
- size, ok ? "ok" : "fail"));
- s_size = 0;
- if (ok) ok = mg_flash_swap_bank();
- }
- MG_INFO(("Finishing OTA: %s", ok ? "ok" : "fail"));
- return ok;
- }
- MG_IRAM static struct mg_otadata mg_otadata(int fw) {
- uint32_t key = mg_fwkey(fw);
- struct mg_otadata od = {};
- MG_INFO(("Loading %s OTA data", fw == MG_FIRMWARE_CURRENT ? "curr" : "prev"));
- mg_flash_load(NULL, key, &od, sizeof(od));
- // MG_DEBUG(("Loaded OTA data. fw %d, bank %d, key %p", fw, bank, key));
- // mg_hexdump(&od, sizeof(od));
- return od;
- }
- int mg_ota_status(int fw) {
- struct mg_otadata od = mg_otadata(fw);
- return od.status;
- }
- uint32_t mg_ota_crc32(int fw) {
- struct mg_otadata od = mg_otadata(fw);
- return od.crc32;
- }
- uint32_t mg_ota_timestamp(int fw) {
- struct mg_otadata od = mg_otadata(fw);
- return od.timestamp;
- }
- size_t mg_ota_size(int fw) {
- struct mg_otadata od = mg_otadata(fw);
- return od.size;
- }
- MG_IRAM bool mg_ota_commit(void) {
- bool ok = true;
- struct mg_otadata od = mg_otadata(MG_FIRMWARE_CURRENT);
- if (od.status != MG_OTA_COMMITTED) {
- od.status = MG_OTA_COMMITTED;
- MG_INFO(("Committing current firmware, OD size %lu", sizeof(od)));
- ok = mg_flash_save(NULL, mg_fwkey(MG_FIRMWARE_CURRENT), &od, sizeof(od));
- }
- return ok;
- }
- bool mg_ota_rollback(void) {
- MG_DEBUG(("Rolling firmware back"));
- if (mg_flash_bank() == 0) {
- // No dual bank support. Mark previous firmware as FIRST_BOOT
- struct mg_otadata prev = mg_otadata(MG_FIRMWARE_PREVIOUS);
- prev.status = MG_OTA_FIRST_BOOT;
- return mg_flash_save(NULL, MG_OTADATA_KEY + MG_FIRMWARE_PREVIOUS, &prev,
- sizeof(prev));
- } else {
- return mg_flash_swap_bank();
- }
- }
- MG_IRAM void mg_ota_boot(void) {
- MG_INFO(("Booting. Flash bank: %d", mg_flash_bank()));
- struct mg_otadata curr = mg_otadata(MG_FIRMWARE_CURRENT);
- struct mg_otadata prev = mg_otadata(MG_FIRMWARE_PREVIOUS);
- if (curr.status == MG_OTA_FIRST_BOOT) {
- if (prev.status == MG_OTA_UNAVAILABLE) {
- MG_INFO(("Setting previous firmware state to committed"));
- prev.status = MG_OTA_COMMITTED;
- mg_flash_save(NULL, mg_fwkey(MG_FIRMWARE_PREVIOUS), &prev, sizeof(prev));
- }
- curr.status = MG_OTA_UNCOMMITTED;
- MG_INFO(("First boot, setting status to UNCOMMITTED"));
- mg_flash_save(NULL, mg_fwkey(MG_FIRMWARE_CURRENT), &curr, sizeof(curr));
- } else if (prev.status == MG_OTA_FIRST_BOOT && mg_flash_bank() == 0) {
- // Swap paritions. Pray power does not disappear
- size_t fs = mg_flash_size(), ss = mg_flash_sector_size();
- char *partition1 = mg_flash_start();
- char *partition2 = mg_flash_start() + fs / 2;
- size_t ofs, max = fs / 2 - ss; // Set swap size to the whole partition
- if (curr.status != MG_OTA_UNAVAILABLE &&
- prev.status != MG_OTA_UNAVAILABLE) {
- // We know exact sizes of both firmwares.
- // Shrink swap size to the MAX(firmware1, firmware2)
- size_t sz = curr.size > prev.size ? curr.size : prev.size;
- if (sz > 0 && sz < max) max = sz;
- }
- // MG_OTA_FIRST_BOOT -> MG_OTA_UNCOMMITTED
- prev.status = MG_OTA_UNCOMMITTED;
- mg_flash_save(NULL, MG_OTADATA_KEY + MG_FIRMWARE_CURRENT, &prev,
- sizeof(prev));
- mg_flash_save(NULL, MG_OTADATA_KEY + MG_FIRMWARE_PREVIOUS, &curr,
- sizeof(curr));
- MG_INFO(("Swapping partitions, size %u (%u sectors)", max, max / ss));
- MG_INFO(("Do NOT power off..."));
- mg_log_level = MG_LL_NONE;
- // We use the last sector of partition2 for OTA data/config storage
- // Therefore we can use last sector of partition1 for swapping
- char *tmpsector = partition1 + fs / 2 - ss; // Last sector of partition1
- (void) tmpsector;
- for (ofs = 0; ofs < max; ofs += ss) {
- // mg_flash_erase(tmpsector);
- mg_flash_write(tmpsector, partition1 + ofs, ss);
- // mg_flash_erase(partition1 + ofs);
- mg_flash_write(partition1 + ofs, partition2 + ofs, ss);
- // mg_flash_erase(partition2 + ofs);
- mg_flash_write(partition2 + ofs, tmpsector, ss);
- }
- mg_device_reset();
- }
- }
- #endif
- #ifdef MG_ENABLE_LINES
- #line 1 "src/printf.c"
- #endif
- size_t mg_queue_vprintf(struct mg_queue *q, const char *fmt, va_list *ap) {
- size_t len = mg_snprintf(NULL, 0, fmt, ap);
- char *buf;
- if (len == 0 || mg_queue_book(q, &buf, len + 1) < len + 1) {
- len = 0; // Nah. Not enough space
- } else {
- len = mg_vsnprintf((char *) buf, len + 1, fmt, ap);
- mg_queue_add(q, len);
- }
- return len;
- }
- size_t mg_queue_printf(struct mg_queue *q, const char *fmt, ...) {
- va_list ap;
- size_t len;
- va_start(ap, fmt);
- len = mg_queue_vprintf(q, fmt, &ap);
- va_end(ap);
- return len;
- }
- static void mg_pfn_iobuf_private(char ch, void *param, bool expand) {
- struct mg_iobuf *io = (struct mg_iobuf *) param;
- if (expand && io->len + 2 > io->size) mg_iobuf_resize(io, io->len + 2);
- if (io->len + 2 <= io->size) {
- io->buf[io->len++] = (uint8_t) ch;
- io->buf[io->len] = 0;
- } else if (io->len < io->size) {
- io->buf[io->len++] = 0; // Guarantee to 0-terminate
- }
- }
- static void mg_putchar_iobuf_static(char ch, void *param) {
- mg_pfn_iobuf_private(ch, param, false);
- }
- void mg_pfn_iobuf(char ch, void *param) {
- mg_pfn_iobuf_private(ch, param, true);
- }
- size_t mg_vsnprintf(char *buf, size_t len, const char *fmt, va_list *ap) {
- struct mg_iobuf io = {(uint8_t *) buf, len, 0, 0};
- size_t n = mg_vxprintf(mg_putchar_iobuf_static, &io, fmt, ap);
- if (n < len) buf[n] = '\0';
- return n;
- }
- size_t mg_snprintf(char *buf, size_t len, const char *fmt, ...) {
- va_list ap;
- size_t n;
- va_start(ap, fmt);
- n = mg_vsnprintf(buf, len, fmt, &ap);
- va_end(ap);
- return n;
- }
- char *mg_vmprintf(const char *fmt, va_list *ap) {
- struct mg_iobuf io = {0, 0, 0, 256};
- mg_vxprintf(mg_pfn_iobuf, &io, fmt, ap);
- return (char *) io.buf;
- }
- char *mg_mprintf(const char *fmt, ...) {
- char *s;
- va_list ap;
- va_start(ap, fmt);
- s = mg_vmprintf(fmt, &ap);
- va_end(ap);
- return s;
- }
- void mg_pfn_stdout(char c, void *param) {
- putchar(c);
- (void) param;
- }
- static size_t print_ip4(void (*out)(char, void *), void *arg, uint8_t *p) {
- return mg_xprintf(out, arg, "%d.%d.%d.%d", p[0], p[1], p[2], p[3]);
- }
- static size_t print_ip6(void (*out)(char, void *), void *arg, uint16_t *p) {
- return mg_xprintf(out, arg, "[%x:%x:%x:%x:%x:%x:%x:%x]", mg_ntohs(p[0]),
- mg_ntohs(p[1]), mg_ntohs(p[2]), mg_ntohs(p[3]),
- mg_ntohs(p[4]), mg_ntohs(p[5]), mg_ntohs(p[6]),
- mg_ntohs(p[7]));
- }
- size_t mg_print_ip4(void (*out)(char, void *), void *arg, va_list *ap) {
- uint8_t *p = va_arg(*ap, uint8_t *);
- return print_ip4(out, arg, p);
- }
- size_t mg_print_ip6(void (*out)(char, void *), void *arg, va_list *ap) {
- uint16_t *p = va_arg(*ap, uint16_t *);
- return print_ip6(out, arg, p);
- }
- size_t mg_print_ip(void (*out)(char, void *), void *arg, va_list *ap) {
- struct mg_addr *addr = va_arg(*ap, struct mg_addr *);
- if (addr->is_ip6) return print_ip6(out, arg, (uint16_t *) addr->ip);
- return print_ip4(out, arg, (uint8_t *) &addr->ip);
- }
- size_t mg_print_ip_port(void (*out)(char, void *), void *arg, va_list *ap) {
- struct mg_addr *a = va_arg(*ap, struct mg_addr *);
- return mg_xprintf(out, arg, "%M:%hu", mg_print_ip, a, mg_ntohs(a->port));
- }
- size_t mg_print_mac(void (*out)(char, void *), void *arg, va_list *ap) {
- uint8_t *p = va_arg(*ap, uint8_t *);
- return mg_xprintf(out, arg, "%02x:%02x:%02x:%02x:%02x:%02x", p[0], p[1], p[2],
- p[3], p[4], p[5]);
- }
- static char mg_esc(int c, bool esc) {
- const char *p, *esc1 = "\b\f\n\r\t\\\"", *esc2 = "bfnrt\\\"";
- for (p = esc ? esc1 : esc2; *p != '\0'; p++) {
- if (*p == c) return esc ? esc2[p - esc1] : esc1[p - esc2];
- }
- return 0;
- }
- static char mg_escape(int c) {
- return mg_esc(c, true);
- }
- static size_t qcpy(void (*out)(char, void *), void *ptr, char *buf,
- size_t len) {
- size_t i = 0, extra = 0;
- for (i = 0; i < len && buf[i] != '\0'; i++) {
- char c = mg_escape(buf[i]);
- if (c) {
- out('\\', ptr), out(c, ptr), extra++;
- } else {
- out(buf[i], ptr);
- }
- }
- return i + extra;
- }
- static size_t bcpy(void (*out)(char, void *), void *arg, uint8_t *buf,
- size_t len) {
- size_t i, j, n = 0;
- const char *t =
- "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
- for (i = 0; i < len; i += 3) {
- uint8_t c1 = buf[i], c2 = i + 1 < len ? buf[i + 1] : 0,
- c3 = i + 2 < len ? buf[i + 2] : 0;
- char tmp[4] = {t[c1 >> 2], t[(c1 & 3) << 4 | (c2 >> 4)], '=', '='};
- if (i + 1 < len) tmp[2] = t[(c2 & 15) << 2 | (c3 >> 6)];
- if (i + 2 < len) tmp[3] = t[c3 & 63];
- for (j = 0; j < sizeof(tmp) && tmp[j] != '\0'; j++) out(tmp[j], arg);
- n += j;
- }
- return n;
- }
- size_t mg_print_hex(void (*out)(char, void *), void *arg, va_list *ap) {
- size_t bl = (size_t) va_arg(*ap, int);
- uint8_t *p = va_arg(*ap, uint8_t *);
- const char *hex = "0123456789abcdef";
- size_t j;
- for (j = 0; j < bl; j++) {
- out(hex[(p[j] >> 4) & 0x0F], arg);
- out(hex[p[j] & 0x0F], arg);
- }
- return 2 * bl;
- }
- size_t mg_print_base64(void (*out)(char, void *), void *arg, va_list *ap) {
- size_t len = (size_t) va_arg(*ap, int);
- uint8_t *buf = va_arg(*ap, uint8_t *);
- return bcpy(out, arg, buf, len);
- }
- size_t mg_print_esc(void (*out)(char, void *), void *arg, va_list *ap) {
- size_t len = (size_t) va_arg(*ap, int);
- char *p = va_arg(*ap, char *);
- if (len == 0) len = p == NULL ? 0 : strlen(p);
- return qcpy(out, arg, p, len);
- }
- #ifdef MG_ENABLE_LINES
- #line 1 "src/queue.c"
- #endif
- #if (defined(__GNUC__) && (__GNUC__ > 4) || \
- (defined(__GNUC_MINOR__) && __GNUC__ == 4 && __GNUC_MINOR__ >= 1)) || \
- defined(__clang__)
- #define MG_MEMORY_BARRIER() __sync_synchronize()
- #elif defined(_MSC_VER) && _MSC_VER >= 1700
- #define MG_MEMORY_BARRIER() MemoryBarrier()
- #elif !defined(MG_MEMORY_BARRIER)
- #define MG_MEMORY_BARRIER()
- #endif
- // Every message in a queue is prepended by a 32-bit message length (ML).
- // If ML is 0, then it is the end, and reader must wrap to the beginning.
- //
- // Queue when q->tail <= q->head:
- // |----- free -----| ML | message1 | ML | message2 | ----- free ------|
- // ^ ^ ^ ^
- // buf tail head len
- //
- // Queue when q->tail > q->head:
- // | ML | message2 |----- free ------| ML | message1 | 0 |---- free ----|
- // ^ ^ ^ ^
- // buf head tail len
- void mg_queue_init(struct mg_queue *q, char *buf, size_t size) {
- q->size = size;
- q->buf = buf;
- q->head = q->tail = 0;
- }
- static size_t mg_queue_read_len(struct mg_queue *q) {
- uint32_t n = 0;
- MG_MEMORY_BARRIER();
- memcpy(&n, q->buf + q->tail, sizeof(n));
- assert(q->tail + n + sizeof(n) <= q->size);
- return n;
- }
- static void mg_queue_write_len(struct mg_queue *q, size_t len) {
- uint32_t n = (uint32_t) len;
- memcpy(q->buf + q->head, &n, sizeof(n));
- MG_MEMORY_BARRIER();
- }
- size_t mg_queue_book(struct mg_queue *q, char **buf, size_t len) {
- size_t space = 0, hs = sizeof(uint32_t) * 2; // *2 is for the 0 marker
- if (q->head >= q->tail && q->head + len + hs <= q->size) {
- space = q->size - q->head - hs; // There is enough space
- } else if (q->head >= q->tail && q->tail > hs) {
- mg_queue_write_len(q, 0); // Not enough space ahead
- q->head = 0; // Wrap head to the beginning
- }
- if (q->head + hs + len < q->tail) space = q->tail - q->head - hs;
- if (buf != NULL) *buf = q->buf + q->head + sizeof(uint32_t);
- return space;
- }
- size_t mg_queue_next(struct mg_queue *q, char **buf) {
- size_t len = 0;
- if (q->tail != q->head) {
- len = mg_queue_read_len(q);
- if (len == 0) { // Zero (head wrapped) ?
- q->tail = 0; // Reset tail to the start
- if (q->head > q->tail) len = mg_queue_read_len(q); // Read again
- }
- }
- if (buf != NULL) *buf = q->buf + q->tail + sizeof(uint32_t);
- assert(q->tail + len <= q->size);
- return len;
- }
- void mg_queue_add(struct mg_queue *q, size_t len) {
- assert(len > 0);
- mg_queue_write_len(q, len);
- assert(q->head + sizeof(uint32_t) * 2 + len <= q->size);
- q->head += len + sizeof(uint32_t);
- }
- void mg_queue_del(struct mg_queue *q, size_t len) {
- q->tail += len + sizeof(uint32_t);
- assert(q->tail + sizeof(uint32_t) <= q->size);
- }
- #ifdef MG_ENABLE_LINES
- #line 1 "src/rpc.c"
- #endif
- void mg_rpc_add(struct mg_rpc **head, struct mg_str method,
- void (*fn)(struct mg_rpc_req *), void *fn_data) {
- struct mg_rpc *rpc = (struct mg_rpc *) calloc(1, sizeof(*rpc));
- if (rpc != NULL) {
- rpc->method = mg_strdup(method), rpc->fn = fn, rpc->fn_data = fn_data;
- rpc->next = *head, *head = rpc;
- }
- }
- void mg_rpc_del(struct mg_rpc **head, void (*fn)(struct mg_rpc_req *)) {
- struct mg_rpc *r;
- while ((r = *head) != NULL) {
- if (r->fn == fn || fn == NULL) {
- *head = r->next;
- free((void *) r->method.ptr);
- free(r);
- } else {
- head = &(*head)->next;
- }
- }
- }
- static void mg_rpc_call(struct mg_rpc_req *r, struct mg_str method) {
- struct mg_rpc *h = r->head == NULL ? NULL : *r->head;
- while (h != NULL && !mg_match(method, h->method, NULL)) h = h->next;
- if (h != NULL) {
- r->rpc = h;
- h->fn(r);
- } else {
- mg_rpc_err(r, -32601, "\"%.*s not found\"", (int) method.len, method.ptr);
- }
- }
- void mg_rpc_process(struct mg_rpc_req *r) {
- int len, off = mg_json_get(r->frame, "$.method", &len);
- if (off > 0 && r->frame.ptr[off] == '"') {
- struct mg_str method = mg_str_n(&r->frame.ptr[off + 1], (size_t) len - 2);
- mg_rpc_call(r, method);
- } else if ((off = mg_json_get(r->frame, "$.result", &len)) > 0 ||
- (off = mg_json_get(r->frame, "$.error", &len)) > 0) {
- mg_rpc_call(r, mg_str("")); // JSON response! call "" method handler
- } else {
- mg_rpc_err(r, -32700, "%m", mg_print_esc, (int) r->frame.len,
- r->frame.ptr); // Invalid
- }
- }
- void mg_rpc_vok(struct mg_rpc_req *r, const char *fmt, va_list *ap) {
- int len, off = mg_json_get(r->frame, "$.id", &len);
- if (off > 0) {
- mg_xprintf(r->pfn, r->pfn_data, "{%m:%.*s,%m:", mg_print_esc, 0, "id", len,
- &r->frame.ptr[off], mg_print_esc, 0, "result");
- mg_vxprintf(r->pfn, r->pfn_data, fmt == NULL ? "null" : fmt, ap);
- mg_xprintf(r->pfn, r->pfn_data, "}");
- }
- }
- void mg_rpc_ok(struct mg_rpc_req *r, const char *fmt, ...) {
- va_list ap;
- va_start(ap, fmt);
- mg_rpc_vok(r, fmt, &ap);
- va_end(ap);
- }
- void mg_rpc_verr(struct mg_rpc_req *r, int code, const char *fmt, va_list *ap) {
- int len, off = mg_json_get(r->frame, "$.id", &len);
- mg_xprintf(r->pfn, r->pfn_data, "{");
- if (off > 0) {
- mg_xprintf(r->pfn, r->pfn_data, "%m:%.*s,", mg_print_esc, 0, "id", len,
- &r->frame.ptr[off]);
- }
- mg_xprintf(r->pfn, r->pfn_data, "%m:{%m:%d,%m:", mg_print_esc, 0, "error",
- mg_print_esc, 0, "code", code, mg_print_esc, 0, "message");
- mg_vxprintf(r->pfn, r->pfn_data, fmt == NULL ? "null" : fmt, ap);
- mg_xprintf(r->pfn, r->pfn_data, "}}");
- }
- void mg_rpc_err(struct mg_rpc_req *r, int code, const char *fmt, ...) {
- va_list ap;
- va_start(ap, fmt);
- mg_rpc_verr(r, code, fmt, &ap);
- va_end(ap);
- }
- static size_t print_methods(mg_pfn_t pfn, void *pfn_data, va_list *ap) {
- struct mg_rpc *h, **head = (struct mg_rpc **) va_arg(*ap, void **);
- size_t len = 0;
- for (h = *head; h != NULL; h = h->next) {
- if (h->method.len == 0) continue; // Ignore response handler
- len += mg_xprintf(pfn, pfn_data, "%s%m", h == *head ? "" : ",",
- mg_print_esc, (int) h->method.len, h->method.ptr);
- }
- return len;
- }
- void mg_rpc_list(struct mg_rpc_req *r) {
- mg_rpc_ok(r, "[%M]", print_methods, r->head);
- }
- #ifdef MG_ENABLE_LINES
- #line 1 "src/sha1.c"
- #endif
- /* Copyright(c) By Steve Reid <steve@edmweb.com> */
- /* 100% Public Domain */
- union char64long16 {
- unsigned char c[64];
- uint32_t l[16];
- };
- #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
- static uint32_t blk0(union char64long16 *block, int i) {
- if (MG_BIG_ENDIAN) {
- } else {
- block->l[i] = (rol(block->l[i], 24) & 0xFF00FF00) |
- (rol(block->l[i], 8) & 0x00FF00FF);
- }
- return block->l[i];
- }
- /* Avoid redefine warning (ARM /usr/include/sys/ucontext.h define R0~R4) */
- #undef blk
- #undef R0
- #undef R1
- #undef R2
- #undef R3
- #undef R4
- #define blk(i) \
- (block->l[i & 15] = rol(block->l[(i + 13) & 15] ^ block->l[(i + 8) & 15] ^ \
- block->l[(i + 2) & 15] ^ block->l[i & 15], \
- 1))
- #define R0(v, w, x, y, z, i) \
- z += ((w & (x ^ y)) ^ y) + blk0(block, i) + 0x5A827999 + rol(v, 5); \
- w = rol(w, 30);
- #define R1(v, w, x, y, z, i) \
- z += ((w & (x ^ y)) ^ y) + blk(i) + 0x5A827999 + rol(v, 5); \
- w = rol(w, 30);
- #define R2(v, w, x, y, z, i) \
- z += (w ^ x ^ y) + blk(i) + 0x6ED9EBA1 + rol(v, 5); \
- w = rol(w, 30);
- #define R3(v, w, x, y, z, i) \
- z += (((w | x) & y) | (w & x)) + blk(i) + 0x8F1BBCDC + rol(v, 5); \
- w = rol(w, 30);
- #define R4(v, w, x, y, z, i) \
- z += (w ^ x ^ y) + blk(i) + 0xCA62C1D6 + rol(v, 5); \
- w = rol(w, 30);
- static void mg_sha1_transform(uint32_t state[5],
- const unsigned char *buffer) {
- uint32_t a, b, c, d, e;
- union char64long16 block[1];
- memcpy(block, buffer, 64);
- a = state[0];
- b = state[1];
- c = state[2];
- d = state[3];
- e = state[4];
- R0(a, b, c, d, e, 0);
- R0(e, a, b, c, d, 1);
- R0(d, e, a, b, c, 2);
- R0(c, d, e, a, b, 3);
- R0(b, c, d, e, a, 4);
- R0(a, b, c, d, e, 5);
- R0(e, a, b, c, d, 6);
- R0(d, e, a, b, c, 7);
- R0(c, d, e, a, b, 8);
- R0(b, c, d, e, a, 9);
- R0(a, b, c, d, e, 10);
- R0(e, a, b, c, d, 11);
- R0(d, e, a, b, c, 12);
- R0(c, d, e, a, b, 13);
- R0(b, c, d, e, a, 14);
- R0(a, b, c, d, e, 15);
- R1(e, a, b, c, d, 16);
- R1(d, e, a, b, c, 17);
- R1(c, d, e, a, b, 18);
- R1(b, c, d, e, a, 19);
- R2(a, b, c, d, e, 20);
- R2(e, a, b, c, d, 21);
- R2(d, e, a, b, c, 22);
- R2(c, d, e, a, b, 23);
- R2(b, c, d, e, a, 24);
- R2(a, b, c, d, e, 25);
- R2(e, a, b, c, d, 26);
- R2(d, e, a, b, c, 27);
- R2(c, d, e, a, b, 28);
- R2(b, c, d, e, a, 29);
- R2(a, b, c, d, e, 30);
- R2(e, a, b, c, d, 31);
- R2(d, e, a, b, c, 32);
- R2(c, d, e, a, b, 33);
- R2(b, c, d, e, a, 34);
- R2(a, b, c, d, e, 35);
- R2(e, a, b, c, d, 36);
- R2(d, e, a, b, c, 37);
- R2(c, d, e, a, b, 38);
- R2(b, c, d, e, a, 39);
- R3(a, b, c, d, e, 40);
- R3(e, a, b, c, d, 41);
- R3(d, e, a, b, c, 42);
- R3(c, d, e, a, b, 43);
- R3(b, c, d, e, a, 44);
- R3(a, b, c, d, e, 45);
- R3(e, a, b, c, d, 46);
- R3(d, e, a, b, c, 47);
- R3(c, d, e, a, b, 48);
- R3(b, c, d, e, a, 49);
- R3(a, b, c, d, e, 50);
- R3(e, a, b, c, d, 51);
- R3(d, e, a, b, c, 52);
- R3(c, d, e, a, b, 53);
- R3(b, c, d, e, a, 54);
- R3(a, b, c, d, e, 55);
- R3(e, a, b, c, d, 56);
- R3(d, e, a, b, c, 57);
- R3(c, d, e, a, b, 58);
- R3(b, c, d, e, a, 59);
- R4(a, b, c, d, e, 60);
- R4(e, a, b, c, d, 61);
- R4(d, e, a, b, c, 62);
- R4(c, d, e, a, b, 63);
- R4(b, c, d, e, a, 64);
- R4(a, b, c, d, e, 65);
- R4(e, a, b, c, d, 66);
- R4(d, e, a, b, c, 67);
- R4(c, d, e, a, b, 68);
- R4(b, c, d, e, a, 69);
- R4(a, b, c, d, e, 70);
- R4(e, a, b, c, d, 71);
- R4(d, e, a, b, c, 72);
- R4(c, d, e, a, b, 73);
- R4(b, c, d, e, a, 74);
- R4(a, b, c, d, e, 75);
- R4(e, a, b, c, d, 76);
- R4(d, e, a, b, c, 77);
- R4(c, d, e, a, b, 78);
- R4(b, c, d, e, a, 79);
- state[0] += a;
- state[1] += b;
- state[2] += c;
- state[3] += d;
- state[4] += e;
- /* Erase working structures. The order of operations is important,
- * used to ensure that compiler doesn't optimize those out. */
- memset(block, 0, sizeof(block));
- a = b = c = d = e = 0;
- (void) a;
- (void) b;
- (void) c;
- (void) d;
- (void) e;
- }
- void mg_sha1_init(mg_sha1_ctx *context) {
- context->state[0] = 0x67452301;
- context->state[1] = 0xEFCDAB89;
- context->state[2] = 0x98BADCFE;
- context->state[3] = 0x10325476;
- context->state[4] = 0xC3D2E1F0;
- context->count[0] = context->count[1] = 0;
- }
- void mg_sha1_update(mg_sha1_ctx *context, const unsigned char *data,
- size_t len) {
- size_t i, j;
- j = context->count[0];
- if ((context->count[0] += (uint32_t) len << 3) < j) context->count[1]++;
- context->count[1] += (uint32_t) (len >> 29);
- j = (j >> 3) & 63;
- if ((j + len) > 63) {
- memcpy(&context->buffer[j], data, (i = 64 - j));
- mg_sha1_transform(context->state, context->buffer);
- for (; i + 63 < len; i += 64) {
- mg_sha1_transform(context->state, &data[i]);
- }
- j = 0;
- } else
- i = 0;
- memcpy(&context->buffer[j], &data[i], len - i);
- }
- void mg_sha1_final(unsigned char digest[20], mg_sha1_ctx *context) {
- unsigned i;
- unsigned char finalcount[8], c;
- for (i = 0; i < 8; i++) {
- finalcount[i] = (unsigned char) ((context->count[(i >= 4 ? 0 : 1)] >>
- ((3 - (i & 3)) * 8)) &
- 255);
- }
- c = 0200;
- mg_sha1_update(context, &c, 1);
- while ((context->count[0] & 504) != 448) {
- c = 0000;
- mg_sha1_update(context, &c, 1);
- }
- mg_sha1_update(context, finalcount, 8);
- for (i = 0; i < 20; i++) {
- digest[i] =
- (unsigned char) ((context->state[i >> 2] >> ((3 - (i & 3)) * 8)) & 255);
- }
- memset(context, '\0', sizeof(*context));
- memset(&finalcount, '\0', sizeof(finalcount));
- }
- #ifdef MG_ENABLE_LINES
- #line 1 "src/sha256.c"
- #endif
- #define ror(x, n) (((x) >> (n)) | ((x) << (32 - (n))))
- #define ch(x, y, z) (((x) & (y)) ^ (~(x) & (z)))
- #define maj(x, y, z) (((x) & (y)) ^ ((x) & (z)) ^ ((y) & (z)))
- #define ep0(x) (ror(x, 2) ^ ror(x, 13) ^ ror(x, 22))
- #define ep1(x) (ror(x, 6) ^ ror(x, 11) ^ ror(x, 25))
- #define sig0(x) (ror(x, 7) ^ ror(x, 18) ^ ((x) >> 3))
- #define sig1(x) (ror(x, 17) ^ ror(x, 19) ^ ((x) >> 10))
- static const uint32_t mg_sha256_k[64] = {
- 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1,
- 0x923f82a4, 0xab1c5ed5, 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3,
- 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174, 0xe49b69c1, 0xefbe4786,
- 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
- 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147,
- 0x06ca6351, 0x14292967, 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13,
- 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85, 0xa2bfe8a1, 0xa81a664b,
- 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
- 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a,
- 0x5b9cca4f, 0x682e6ff3, 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,
- 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2};
- void mg_sha256_init(mg_sha256_ctx *ctx) {
- ctx->len = 0;
- ctx->bits = 0;
- ctx->state[0] = 0x6a09e667;
- ctx->state[1] = 0xbb67ae85;
- ctx->state[2] = 0x3c6ef372;
- ctx->state[3] = 0xa54ff53a;
- ctx->state[4] = 0x510e527f;
- ctx->state[5] = 0x9b05688c;
- ctx->state[6] = 0x1f83d9ab;
- ctx->state[7] = 0x5be0cd19;
- }
- static void mg_sha256_chunk(mg_sha256_ctx *ctx) {
- int i, j;
- uint32_t a, b, c, d, e, f, g, h;
- uint32_t m[64];
- for (i = 0, j = 0; i < 16; ++i, j += 4)
- m[i] = (uint32_t) ((ctx->buffer[j] << 24) | (ctx->buffer[j + 1] << 16) |
- (ctx->buffer[j + 2] << 8) | (ctx->buffer[j + 3]));
- for (; i < 64; ++i)
- m[i] = sig1(m[i - 2]) + m[i - 7] + sig0(m[i - 15]) + m[i - 16];
- a = ctx->state[0];
- b = ctx->state[1];
- c = ctx->state[2];
- d = ctx->state[3];
- e = ctx->state[4];
- f = ctx->state[5];
- g = ctx->state[6];
- h = ctx->state[7];
- for (i = 0; i < 64; ++i) {
- uint32_t t1 = h + ep1(e) + ch(e, f, g) + mg_sha256_k[i] + m[i];
- uint32_t t2 = ep0(a) + maj(a, b, c);
- h = g;
- g = f;
- f = e;
- e = d + t1;
- d = c;
- c = b;
- b = a;
- a = t1 + t2;
- }
- ctx->state[0] += a;
- ctx->state[1] += b;
- ctx->state[2] += c;
- ctx->state[3] += d;
- ctx->state[4] += e;
- ctx->state[5] += f;
- ctx->state[6] += g;
- ctx->state[7] += h;
- }
- void mg_sha256_update(mg_sha256_ctx *ctx, const unsigned char *data,
- size_t len) {
- size_t i;
- for (i = 0; i < len; i++) {
- ctx->buffer[ctx->len] = data[i];
- if ((++ctx->len) == 64) {
- mg_sha256_chunk(ctx);
- ctx->bits += 512;
- ctx->len = 0;
- }
- }
- }
- // TODO: make final reusable (remove side effects)
- void mg_sha256_final(unsigned char digest[32], mg_sha256_ctx *ctx) {
- uint32_t i = ctx->len;
- if (i < 56) {
- ctx->buffer[i++] = 0x80;
- while (i < 56) {
- ctx->buffer[i++] = 0x00;
- }
- } else {
- ctx->buffer[i++] = 0x80;
- while (i < 64) {
- ctx->buffer[i++] = 0x00;
- }
- mg_sha256_chunk(ctx);
- memset(ctx->buffer, 0, 56);
- }
- ctx->bits += ctx->len * 8;
- ctx->buffer[63] = (uint8_t) ((ctx->bits) & 0xff);
- ctx->buffer[62] = (uint8_t) ((ctx->bits >> 8) & 0xff);
- ctx->buffer[61] = (uint8_t) ((ctx->bits >> 16) & 0xff);
- ctx->buffer[60] = (uint8_t) ((ctx->bits >> 24) & 0xff);
- ctx->buffer[59] = (uint8_t) ((ctx->bits >> 32) & 0xff);
- ctx->buffer[58] = (uint8_t) ((ctx->bits >> 40) & 0xff);
- ctx->buffer[57] = (uint8_t) ((ctx->bits >> 48) & 0xff);
- ctx->buffer[56] = (uint8_t) ((ctx->bits >> 56) & 0xff);
- mg_sha256_chunk(ctx);
- for (i = 0; i < 4; ++i) {
- digest[i] = (ctx->state[0] >> (24 - i * 8)) & 0xff;
- digest[i + 4] = (ctx->state[1] >> (24 - i * 8)) & 0xff;
- digest[i + 8] = (ctx->state[2] >> (24 - i * 8)) & 0xff;
- digest[i + 12] = (ctx->state[3] >> (24 - i * 8)) & 0xff;
- digest[i + 16] = (ctx->state[4] >> (24 - i * 8)) & 0xff;
- digest[i + 20] = (ctx->state[5] >> (24 - i * 8)) & 0xff;
- digest[i + 24] = (ctx->state[6] >> (24 - i * 8)) & 0xff;
- digest[i + 28] = (ctx->state[7] >> (24 - i * 8)) & 0xff;
- }
- }
- void mg_hmac_sha256(uint8_t dst[32], uint8_t *key, size_t keysz, uint8_t *data,
- size_t datasz) {
- mg_sha256_ctx ctx;
- uint8_t k[64] = {0};
- uint8_t o_pad[64], i_pad[64];
- unsigned int i;
- memset(i_pad, 0x36, sizeof(i_pad));
- memset(o_pad, 0x5c, sizeof(o_pad));
- if (keysz < 64) {
- memmove(k, key, keysz);
- } else {
- mg_sha256_init(&ctx);
- mg_sha256_update(&ctx, key, keysz);
- mg_sha256_final(k, &ctx);
- }
- for (i = 0; i < sizeof(k); i++) {
- i_pad[i] ^= k[i];
- o_pad[i] ^= k[i];
- }
- mg_sha256_init(&ctx);
- mg_sha256_update(&ctx, i_pad, sizeof(i_pad));
- mg_sha256_update(&ctx, data, datasz);
- mg_sha256_final(dst, &ctx);
- mg_sha256_init(&ctx);
- mg_sha256_update(&ctx, o_pad, sizeof(o_pad));
- mg_sha256_update(&ctx, dst, 32);
- mg_sha256_final(dst, &ctx);
- }
- #ifdef MG_ENABLE_LINES
- #line 1 "src/sntp.c"
- #endif
- #define SNTP_TIME_OFFSET 2208988800U // (1970 - 1900) in seconds
- #define SNTP_MAX_FRAC 4294967295.0 // 2 ** 32 - 1
- static int64_t gettimestamp(const uint32_t *data) {
- uint32_t sec = mg_ntohl(data[0]), frac = mg_ntohl(data[1]);
- if (sec) sec -= SNTP_TIME_OFFSET;
- return ((int64_t) sec) * 1000 + (int64_t) (frac / SNTP_MAX_FRAC * 1000.0);
- }
- int64_t mg_sntp_parse(const unsigned char *buf, size_t len) {
- int64_t res = -1;
- int mode = len > 0 ? buf[0] & 7 : 0;
- int version = len > 0 ? (buf[0] >> 3) & 7 : 0;
- if (len < 48) {
- MG_ERROR(("%s", "corrupt packet"));
- } else if (mode != 4 && mode != 5) {
- MG_ERROR(("%s", "not a server reply"));
- } else if (buf[1] == 0) {
- MG_ERROR(("%s", "server sent a kiss of death"));
- } else if (version == 4 || version == 3) {
- // int64_t ref = gettimestamp((uint32_t *) &buf[16]);
- int64_t t0 = gettimestamp((uint32_t *) &buf[24]);
- int64_t t1 = gettimestamp((uint32_t *) &buf[32]);
- int64_t t2 = gettimestamp((uint32_t *) &buf[40]);
- int64_t t3 = (int64_t) mg_millis();
- int64_t delta = (t3 - t0) - (t2 - t1);
- MG_VERBOSE(("%lld %lld %lld %lld delta:%lld", t0, t1, t2, t3, delta));
- res = t2 + delta / 2;
- } else {
- MG_ERROR(("unexpected version: %d", version));
- }
- return res;
- }
- static void sntp_cb(struct mg_connection *c, int ev, void *ev_data) {
- if (ev == MG_EV_READ) {
- int64_t milliseconds = mg_sntp_parse(c->recv.buf, c->recv.len);
- if (milliseconds > 0) {
- MG_INFO(("%lu got time: %lld ms from epoch", c->id, milliseconds));
- mg_call(c, MG_EV_SNTP_TIME, (uint64_t *) &milliseconds);
- MG_VERBOSE(("%u.%u", (unsigned) (milliseconds / 1000),
- (unsigned) (milliseconds % 1000)));
- }
- mg_iobuf_del(&c->recv, 0, c->recv.len); // Free receive buffer
- } else if (ev == MG_EV_CONNECT) {
- mg_sntp_request(c);
- } else if (ev == MG_EV_CLOSE) {
- }
- (void) ev_data;
- }
- void mg_sntp_request(struct mg_connection *c) {
- if (c->is_resolving) {
- MG_ERROR(("%lu wait until resolved", c->id));
- } else {
- int64_t now = (int64_t) mg_millis(); // Use int64_t, for vc98
- uint8_t buf[48] = {0};
- uint32_t *t = (uint32_t *) &buf[40];
- double frac = ((double) (now % 1000)) / 1000.0 * SNTP_MAX_FRAC;
- buf[0] = (0 << 6) | (4 << 3) | 3;
- t[0] = mg_htonl((uint32_t) (now / 1000) + SNTP_TIME_OFFSET);
- t[1] = mg_htonl((uint32_t) frac);
- mg_send(c, buf, sizeof(buf));
- }
- }
- struct mg_connection *mg_sntp_connect(struct mg_mgr *mgr, const char *url,
- mg_event_handler_t fn, void *fnd) {
- struct mg_connection *c = NULL;
- if (url == NULL) url = "udp://time.google.com:123";
- if ((c = mg_connect(mgr, url, fn, fnd)) != NULL) c->pfn = sntp_cb;
- return c;
- }
- #ifdef MG_ENABLE_LINES
- #line 1 "src/sock.c"
- #endif
- #if MG_ENABLE_SOCKET
- #ifndef closesocket
- #define closesocket(x) close(x)
- #endif
- #define FD(c_) ((MG_SOCKET_TYPE) (size_t) (c_)->fd)
- #define S2PTR(s_) ((void *) (size_t) (s_))
- #ifndef MSG_NONBLOCKING
- #define MSG_NONBLOCKING 0
- #endif
- #ifndef AF_INET6
- #define AF_INET6 10
- #endif
- #ifndef MG_SOCK_ERR
- #define MG_SOCK_ERR(errcode) ((errcode) < 0 ? errno : 0)
- #endif
- #ifndef MG_SOCK_INTR
- #define MG_SOCK_INTR(fd) (fd == MG_INVALID_SOCKET && MG_SOCK_ERR(-1) == EINTR)
- #endif
- #ifndef MG_SOCK_PENDING
- #define MG_SOCK_PENDING(errcode) \
- (((errcode) < 0) && (errno == EINPROGRESS || errno == EWOULDBLOCK))
- #endif
- #ifndef MG_SOCK_RESET
- #define MG_SOCK_RESET(errcode) \
- (((errcode) < 0) && (errno == EPIPE || errno == ECONNRESET))
- #endif
- union usa {
- struct sockaddr sa;
- struct sockaddr_in sin;
- #if MG_ENABLE_IPV6
- struct sockaddr_in6 sin6;
- #endif
- };
- static socklen_t tousa(struct mg_addr *a, union usa *usa) {
- socklen_t len = sizeof(usa->sin);
- memset(usa, 0, sizeof(*usa));
- usa->sin.sin_family = AF_INET;
- usa->sin.sin_port = a->port;
- memcpy(&usa->sin.sin_addr, a->ip, sizeof(uint32_t));
- #if MG_ENABLE_IPV6
- if (a->is_ip6) {
- usa->sin.sin_family = AF_INET6;
- usa->sin6.sin6_port = a->port;
- usa->sin6.sin6_scope_id = a->scope_id;
- memcpy(&usa->sin6.sin6_addr, a->ip, sizeof(a->ip));
- len = sizeof(usa->sin6);
- }
- #endif
- return len;
- }
- static void tomgaddr(union usa *usa, struct mg_addr *a, bool is_ip6) {
- a->is_ip6 = is_ip6;
- a->port = usa->sin.sin_port;
- memcpy(&a->ip, &usa->sin.sin_addr, sizeof(uint32_t));
- #if MG_ENABLE_IPV6
- if (is_ip6) {
- memcpy(a->ip, &usa->sin6.sin6_addr, sizeof(a->ip));
- a->port = usa->sin6.sin6_port;
- a->scope_id = (uint8_t) usa->sin6.sin6_scope_id;
- }
- #endif
- }
- static void setlocaddr(MG_SOCKET_TYPE fd, struct mg_addr *addr) {
- union usa usa;
- socklen_t n = sizeof(usa);
- if (getsockname(fd, &usa.sa, &n) == 0) {
- tomgaddr(&usa, addr, n != sizeof(usa.sin));
- }
- }
- static void iolog(struct mg_connection *c, char *buf, long n, bool r) {
- if (n == MG_IO_WAIT) {
- // Do nothing
- } else if (n <= 0) {
- c->is_closing = 1; // Termination. Don't call mg_error(): #1529
- } else if (n > 0) {
- if (c->is_hexdumping) {
- union usa usa;
- socklen_t slen = sizeof(usa.sin);
- if (getsockname(FD(c), &usa.sa, &slen) < 0) (void) 0; // Ignore result
- MG_INFO(("\n-- %lu %M %s %M %ld", c->id, mg_print_ip_port, &c->loc,
- r ? "<-" : "->", mg_print_ip_port, &c->rem, n));
- mg_hexdump(buf, (size_t) n);
- }
- if (r) {
- c->recv.len += (size_t) n;
- mg_call(c, MG_EV_READ, &n);
- } else {
- mg_iobuf_del(&c->send, 0, (size_t) n);
- // if (c->send.len == 0) mg_iobuf_resize(&c->send, 0);
- if (c->send.len == 0) {
- MG_EPOLL_MOD(c, 0);
- }
- mg_call(c, MG_EV_WRITE, &n);
- }
- }
- }
- long mg_io_send(struct mg_connection *c, const void *buf, size_t len) {
- long n;
- if (c->is_udp) {
- union usa usa;
- socklen_t slen = tousa(&c->rem, &usa);
- n = sendto(FD(c), (char *) buf, len, 0, &usa.sa, slen);
- if (n > 0) setlocaddr(FD(c), &c->loc);
- } else {
- n = send(FD(c), (char *) buf, len, MSG_NONBLOCKING);
- }
- if (MG_SOCK_PENDING(n)) return MG_IO_WAIT;
- if (MG_SOCK_RESET(n)) return MG_IO_RESET;
- if (n <= 0) return MG_IO_ERR;
- return n;
- }
- bool mg_send(struct mg_connection *c, const void *buf, size_t len) {
- if (c->is_udp) {
- long n = mg_io_send(c, buf, len);
- MG_DEBUG(("%lu %ld %d:%d %ld err %d", c->id, c->fd, (int) c->send.len,
- (int) c->recv.len, n, MG_SOCK_ERR(n)));
- iolog(c, (char *) buf, n, false);
- return n > 0;
- } else {
- return mg_iobuf_add(&c->send, c->send.len, buf, len);
- }
- }
- static void mg_set_non_blocking_mode(MG_SOCKET_TYPE fd) {
- #if defined(MG_CUSTOM_NONBLOCK)
- MG_CUSTOM_NONBLOCK(fd);
- #elif MG_ARCH == MG_ARCH_WIN32 && MG_ENABLE_WINSOCK
- unsigned long on = 1;
- ioctlsocket(fd, FIONBIO, &on);
- #elif MG_ENABLE_RL
- unsigned long on = 1;
- ioctlsocket(fd, FIONBIO, &on);
- #elif MG_ENABLE_FREERTOS_TCP
- const BaseType_t off = 0;
- if (setsockopt(fd, 0, FREERTOS_SO_RCVTIMEO, &off, sizeof(off)) != 0) (void) 0;
- if (setsockopt(fd, 0, FREERTOS_SO_SNDTIMEO, &off, sizeof(off)) != 0) (void) 0;
- #elif MG_ENABLE_LWIP
- lwip_fcntl(fd, F_SETFL, O_NONBLOCK);
- #elif MG_ARCH == MG_ARCH_AZURERTOS
- fcntl(fd, F_SETFL, O_NONBLOCK);
- #elif MG_ARCH == MG_ARCH_TIRTOS
- int val = 0;
- setsockopt(fd, SOL_SOCKET, SO_BLOCKING, &val, sizeof(val));
- // SPRU524J section 3.3.3 page 63, SO_SNDLOWAT
- int sz = sizeof(val);
- getsockopt(fd, SOL_SOCKET, SO_SNDBUF, &val, &sz);
- val /= 2; // set send low-water mark at half send buffer size
- setsockopt(fd, SOL_SOCKET, SO_SNDLOWAT, &val, sizeof(val));
- #else
- fcntl(fd, F_SETFL, fcntl(fd, F_GETFL, 0) | O_NONBLOCK); // Non-blocking mode
- fcntl(fd, F_SETFD, FD_CLOEXEC); // Set close-on-exec
- #endif
- }
- bool mg_open_listener(struct mg_connection *c, const char *url) {
- MG_SOCKET_TYPE fd = MG_INVALID_SOCKET;
- bool success = false;
- c->loc.port = mg_htons(mg_url_port(url));
- if (!mg_aton(mg_url_host(url), &c->loc)) {
- MG_ERROR(("invalid listening URL: %s", url));
- } else {
- union usa usa;
- socklen_t slen = tousa(&c->loc, &usa);
- int rc, on = 1, af = c->loc.is_ip6 ? AF_INET6 : AF_INET;
- int type = strncmp(url, "udp:", 4) == 0 ? SOCK_DGRAM : SOCK_STREAM;
- int proto = type == SOCK_DGRAM ? IPPROTO_UDP : IPPROTO_TCP;
- (void) on;
- if ((fd = socket(af, type, proto)) == MG_INVALID_SOCKET) {
- MG_ERROR(("socket: %d", MG_SOCK_ERR(-1)));
- #if defined(SO_EXCLUSIVEADDRUSE)
- } else if ((rc = setsockopt(fd, SOL_SOCKET, SO_EXCLUSIVEADDRUSE,
- (char *) &on, sizeof(on))) != 0) {
- // "Using SO_REUSEADDR and SO_EXCLUSIVEADDRUSE"
- MG_ERROR(("setsockopt(SO_EXCLUSIVEADDRUSE): %d %d", on, MG_SOCK_ERR(rc)));
- #elif defined(SO_REUSEADDR) && (!defined(LWIP_SOCKET) || SO_REUSE)
- } else if ((rc = setsockopt(fd, SOL_SOCKET, SO_REUSEADDR, (char *) &on,
- sizeof(on))) != 0) {
- // 1. SO_REUSEADDR semantics on UNIX and Windows is different. On
- // Windows, SO_REUSEADDR allows to bind a socket to a port without error
- // even if the port is already open by another program. This is not the
- // behavior SO_REUSEADDR was designed for, and leads to hard-to-track
- // failure scenarios.
- //
- // 2. For LWIP, SO_REUSEADDR should be explicitly enabled by defining
- // SO_REUSE = 1 in lwipopts.h, otherwise the code below will compile but
- // won't work! (setsockopt will return EINVAL)
- MG_ERROR(("setsockopt(SO_REUSEADDR): %d", MG_SOCK_ERR(rc)));
- #endif
- #if MG_IPV6_V6ONLY
- // Bind only to the V6 address, not V4 address on this port
- } else if (c->loc.is_ip6 &&
- (rc = setsockopt(fd, IPPROTO_IPV6, IPV6_V6ONLY, (char *) &on,
- sizeof(on))) != 0) {
- // See #2089. Allow to bind v4 and v6 sockets on the same port
- MG_ERROR(("setsockopt(IPV6_V6ONLY): %d", MG_SOCK_ERR(rc)));
- #endif
- } else if ((rc = bind(fd, &usa.sa, slen)) != 0) {
- MG_ERROR(("bind: %d", MG_SOCK_ERR(rc)));
- } else if ((type == SOCK_STREAM &&
- (rc = listen(fd, MG_SOCK_LISTEN_BACKLOG_SIZE)) != 0)) {
- // NOTE(lsm): FreeRTOS uses backlog value as a connection limit
- // In case port was set to 0, get the real port number
- MG_ERROR(("listen: %d", MG_SOCK_ERR(rc)));
- } else {
- setlocaddr(fd, &c->loc);
- mg_set_non_blocking_mode(fd);
- c->fd = S2PTR(fd);
- MG_EPOLL_ADD(c);
- success = true;
- }
- }
- if (success == false && fd != MG_INVALID_SOCKET) closesocket(fd);
- return success;
- }
- static long recv_raw(struct mg_connection *c, void *buf, size_t len) {
- long n = 0;
- if (c->is_udp) {
- union usa usa;
- socklen_t slen = tousa(&c->rem, &usa);
- n = recvfrom(FD(c), (char *) buf, len, 0, &usa.sa, &slen);
- if (n > 0) tomgaddr(&usa, &c->rem, slen != sizeof(usa.sin));
- } else {
- n = recv(FD(c), (char *) buf, len, MSG_NONBLOCKING);
- }
- if (MG_SOCK_PENDING(n)) return MG_IO_WAIT;
- if (MG_SOCK_RESET(n)) return MG_IO_RESET;
- if (n <= 0) return MG_IO_ERR;
- return n;
- }
- static bool ioalloc(struct mg_connection *c, struct mg_iobuf *io) {
- bool res = false;
- if (io->len >= MG_MAX_RECV_SIZE) {
- mg_error(c, "MG_MAX_RECV_SIZE");
- } else if (io->size <= io->len &&
- !mg_iobuf_resize(io, io->size + MG_IO_SIZE)) {
- mg_error(c, "OOM");
- } else {
- res = true;
- }
- return res;
- }
- // NOTE(lsm): do only one iteration of reads, cause some systems
- // (e.g. FreeRTOS stack) return 0 instead of -1/EWOULDBLOCK when no data
- static void read_conn(struct mg_connection *c) {
- if (ioalloc(c, &c->recv)) {
- char *buf = (char *) &c->recv.buf[c->recv.len];
- size_t len = c->recv.size - c->recv.len;
- long n = -1;
- if (c->is_tls) {
- if (!ioalloc(c, &c->rtls)) return;
- n = recv_raw(c, (char *) &c->rtls.buf[c->rtls.len],
- c->rtls.size - c->rtls.len);
- // MG_DEBUG(("%lu %ld", c->id, n));
- if (n == MG_IO_ERR) {
- c->is_closing = 1;
- } else if (n > 0) {
- c->rtls.len += (size_t) n;
- if (c->is_tls_hs) mg_tls_handshake(c);
- if (c->is_tls_hs) return;
- n = mg_tls_recv(c, buf, len);
- } else if (n == MG_IO_WAIT) {
- n = mg_tls_recv(c, buf, len);
- }
- } else {
- n = recv_raw(c, buf, len);
- }
- MG_DEBUG(("%lu %p snd %ld/%ld rcv %ld/%ld n=%ld err=%d", c->id, c->fd,
- (long) c->send.len, (long) c->send.size, (long) c->recv.len,
- (long) c->recv.size, n, MG_SOCK_ERR(n)));
- iolog(c, buf, n, true);
- }
- }
- static void write_conn(struct mg_connection *c) {
- char *buf = (char *) c->send.buf;
- size_t len = c->send.len;
- long n = c->is_tls ? mg_tls_send(c, buf, len) : mg_io_send(c, buf, len);
- MG_DEBUG(("%lu %ld snd %ld/%ld rcv %ld/%ld n=%ld err=%d", c->id, c->fd,
- (long) c->send.len, (long) c->send.size, (long) c->recv.len,
- (long) c->recv.size, n, MG_SOCK_ERR(n)));
- iolog(c, buf, n, false);
- }
- static void close_conn(struct mg_connection *c) {
- if (FD(c) != MG_INVALID_SOCKET) {
- #if MG_ENABLE_EPOLL
- epoll_ctl(c->mgr->epoll_fd, EPOLL_CTL_DEL, FD(c), NULL);
- #endif
- closesocket(FD(c));
- #if MG_ENABLE_FREERTOS_TCP
- FreeRTOS_FD_CLR(c->fd, c->mgr->ss, eSELECT_ALL);
- #endif
- }
- mg_close_conn(c);
- }
- static void connect_conn(struct mg_connection *c) {
- union usa usa;
- socklen_t n = sizeof(usa);
- // Use getpeername() to test whether we have connected
- if (getpeername(FD(c), &usa.sa, &n) == 0) {
- c->is_connecting = 0;
- mg_call(c, MG_EV_CONNECT, NULL);
- MG_EPOLL_MOD(c, 0);
- if (c->is_tls_hs) mg_tls_handshake(c);
- } else {
- mg_error(c, "socket error");
- }
- }
- static void setsockopts(struct mg_connection *c) {
- #if MG_ENABLE_FREERTOS_TCP || MG_ARCH == MG_ARCH_AZURERTOS || \
- MG_ARCH == MG_ARCH_TIRTOS
- (void) c;
- #else
- int on = 1;
- #if !defined(SOL_TCP)
- #define SOL_TCP IPPROTO_TCP
- #endif
- if (setsockopt(FD(c), SOL_TCP, TCP_NODELAY, (char *) &on, sizeof(on)) != 0)
- (void) 0;
- if (setsockopt(FD(c), SOL_SOCKET, SO_KEEPALIVE, (char *) &on, sizeof(on)) !=
- 0)
- (void) 0;
- #endif
- }
- void mg_connect_resolved(struct mg_connection *c) {
- int type = c->is_udp ? SOCK_DGRAM : SOCK_STREAM;
- int rc, af = c->rem.is_ip6 ? AF_INET6 : AF_INET; // c->rem has resolved IP
- c->fd = S2PTR(socket(af, type, 0)); // Create outbound socket
- c->is_resolving = 0; // Clear resolving flag
- if (FD(c) == MG_INVALID_SOCKET) {
- mg_error(c, "socket(): %d", MG_SOCK_ERR(-1));
- } else if (c->is_udp) {
- MG_EPOLL_ADD(c);
- #if MG_ARCH == MG_ARCH_TIRTOS
- union usa usa; // TI-RTOS NDK requires binding to receive on UDP sockets
- socklen_t slen = tousa(&c->loc, &usa);
- if ((rc = bind(c->fd, &usa.sa, slen)) != 0)
- MG_ERROR(("bind: %d", MG_SOCK_ERR(rc)));
- #endif
- mg_call(c, MG_EV_RESOLVE, NULL);
- mg_call(c, MG_EV_CONNECT, NULL);
- } else {
- union usa usa;
- socklen_t slen = tousa(&c->rem, &usa);
- mg_set_non_blocking_mode(FD(c));
- setsockopts(c);
- MG_EPOLL_ADD(c);
- mg_call(c, MG_EV_RESOLVE, NULL);
- rc = connect(FD(c), &usa.sa, slen); // Attempt to connect
- if (rc == 0) { // Success
- mg_call(c, MG_EV_CONNECT, NULL); // Send MG_EV_CONNECT to the user
- } else if (MG_SOCK_PENDING(rc)) { // Need to wait for TCP handshake
- MG_DEBUG(("%lu %ld -> %M pend", c->id, c->fd, mg_print_ip_port, &c->rem));
- c->is_connecting = 1;
- } else {
- mg_error(c, "connect: %d", MG_SOCK_ERR(rc));
- }
- }
- }
- static MG_SOCKET_TYPE raccept(MG_SOCKET_TYPE sock, union usa *usa,
- socklen_t *len) {
- MG_SOCKET_TYPE fd = MG_INVALID_SOCKET;
- do {
- memset(usa, 0, sizeof(*usa));
- fd = accept(sock, &usa->sa, len);
- } while (MG_SOCK_INTR(fd));
- return fd;
- }
- static void accept_conn(struct mg_mgr *mgr, struct mg_connection *lsn) {
- struct mg_connection *c = NULL;
- union usa usa;
- socklen_t sa_len = sizeof(usa);
- MG_SOCKET_TYPE fd = raccept(FD(lsn), &usa, &sa_len);
- if (fd == MG_INVALID_SOCKET) {
- #if MG_ARCH == MG_ARCH_AZURERTOS || defined(__ECOS)
- // AzureRTOS, in non-block socket mode can mark listening socket readable
- // even it is not. See comment for 'select' func implementation in
- // nx_bsd.c That's not an error, just should try later
- if (errno != EAGAIN)
- #endif
- MG_ERROR(("%lu accept failed, errno %d", lsn->id, MG_SOCK_ERR(-1)));
- #if (MG_ARCH != MG_ARCH_WIN32) && !MG_ENABLE_FREERTOS_TCP && \
- (MG_ARCH != MG_ARCH_TIRTOS) && !MG_ENABLE_POLL && !MG_ENABLE_EPOLL
- } else if ((long) fd >= FD_SETSIZE) {
- MG_ERROR(("%ld > %ld", (long) fd, (long) FD_SETSIZE));
- closesocket(fd);
- #endif
- } else if ((c = mg_alloc_conn(mgr)) == NULL) {
- MG_ERROR(("%lu OOM", lsn->id));
- closesocket(fd);
- } else {
- tomgaddr(&usa, &c->rem, sa_len != sizeof(usa.sin));
- LIST_ADD_HEAD(struct mg_connection, &mgr->conns, c);
- c->fd = S2PTR(fd);
- MG_EPOLL_ADD(c);
- mg_set_non_blocking_mode(FD(c));
- setsockopts(c);
- c->is_accepted = 1;
- c->is_hexdumping = lsn->is_hexdumping;
- c->loc = lsn->loc;
- c->pfn = lsn->pfn;
- c->pfn_data = lsn->pfn_data;
- c->fn = lsn->fn;
- c->fn_data = lsn->fn_data;
- MG_DEBUG(("%lu %ld accepted %M -> %M", c->id, c->fd, mg_print_ip_port,
- &c->rem, mg_print_ip_port, &c->loc));
- mg_call(c, MG_EV_OPEN, NULL);
- mg_call(c, MG_EV_ACCEPT, NULL);
- }
- }
- static bool can_read(const struct mg_connection *c) {
- return c->is_full == false;
- }
- static bool can_write(const struct mg_connection *c) {
- return c->is_connecting || (c->send.len > 0 && c->is_tls_hs == 0);
- }
- static bool skip_iotest(const struct mg_connection *c) {
- return (c->is_closing || c->is_resolving || FD(c) == MG_INVALID_SOCKET) ||
- (can_read(c) == false && can_write(c) == false);
- }
- static void mg_iotest(struct mg_mgr *mgr, int ms) {
- #if MG_ENABLE_FREERTOS_TCP
- struct mg_connection *c;
- for (c = mgr->conns; c != NULL; c = c->next) {
- c->is_readable = c->is_writable = 0;
- if (skip_iotest(c)) continue;
- if (can_read(c))
- FreeRTOS_FD_SET(c->fd, mgr->ss, eSELECT_READ | eSELECT_EXCEPT);
- if (can_write(c)) FreeRTOS_FD_SET(c->fd, mgr->ss, eSELECT_WRITE);
- if (c->is_closing) ms = 1;
- }
- FreeRTOS_select(mgr->ss, pdMS_TO_TICKS(ms));
- for (c = mgr->conns; c != NULL; c = c->next) {
- EventBits_t bits = FreeRTOS_FD_ISSET(c->fd, mgr->ss);
- c->is_readable = bits & (eSELECT_READ | eSELECT_EXCEPT) ? 1U : 0;
- c->is_writable = bits & eSELECT_WRITE ? 1U : 0;
- if (c->fd != MG_INVALID_SOCKET)
- FreeRTOS_FD_CLR(c->fd, mgr->ss,
- eSELECT_READ | eSELECT_EXCEPT | eSELECT_WRITE);
- }
- #elif MG_ENABLE_EPOLL
- size_t max = 1;
- for (struct mg_connection *c = mgr->conns; c != NULL; c = c->next) {
- c->is_readable = c->is_writable = 0;
- if (mg_tls_pending(c) > 0) ms = 1, c->is_readable = 1;
- if (can_write(c)) MG_EPOLL_MOD(c, 1);
- if (c->is_closing) ms = 1;
- max++;
- }
- struct epoll_event *evs = (struct epoll_event *) alloca(max * sizeof(evs[0]));
- int n = epoll_wait(mgr->epoll_fd, evs, (int) max, ms);
- for (int i = 0; i < n; i++) {
- struct mg_connection *c = (struct mg_connection *) evs[i].data.ptr;
- if (evs[i].events & EPOLLERR) {
- mg_error(c, "socket error");
- } else if (c->is_readable == 0) {
- bool rd = evs[i].events & (EPOLLIN | EPOLLHUP);
- bool wr = evs[i].events & EPOLLOUT;
- c->is_readable = can_read(c) && rd ? 1U : 0;
- c->is_writable = can_write(c) && wr ? 1U : 0;
- }
- }
- (void) skip_iotest;
- #elif MG_ENABLE_POLL
- nfds_t n = 0;
- for (struct mg_connection *c = mgr->conns; c != NULL; c = c->next) n++;
- struct pollfd *fds = (struct pollfd *) alloca(n * sizeof(fds[0]));
- memset(fds, 0, n * sizeof(fds[0]));
- n = 0;
- for (struct mg_connection *c = mgr->conns; c != NULL; c = c->next) {
- c->is_readable = c->is_writable = 0;
- if (skip_iotest(c)) {
- // Socket not valid, ignore
- } else if (mg_tls_pending(c) > 0) {
- ms = 1; // Don't wait if TLS is ready
- } else {
- fds[n].fd = FD(c);
- if (can_read(c)) fds[n].events |= POLLIN;
- if (can_write(c)) fds[n].events |= POLLOUT;
- if (c->is_closing) ms = 1;
- n++;
- }
- }
- // MG_INFO(("poll n=%d ms=%d", (int) n, ms));
- if (poll(fds, n, ms) < 0) {
- #if MG_ARCH == MG_ARCH_WIN32
- if (n == 0) Sleep(ms); // On Windows, poll fails if no sockets
- #endif
- memset(fds, 0, n * sizeof(fds[0]));
- }
- n = 0;
- for (struct mg_connection *c = mgr->conns; c != NULL; c = c->next) {
- if (skip_iotest(c)) {
- // Socket not valid, ignore
- } else if (mg_tls_pending(c) > 0) {
- c->is_readable = 1;
- } else {
- if (fds[n].revents & POLLERR) {
- mg_error(c, "socket error");
- } else {
- c->is_readable =
- (unsigned) (fds[n].revents & (POLLIN | POLLHUP) ? 1 : 0);
- c->is_writable = (unsigned) (fds[n].revents & POLLOUT ? 1 : 0);
- }
- n++;
- }
- }
- #else
- struct timeval tv = {ms / 1000, (ms % 1000) * 1000}, tv_zero = {0, 0}, *tvp;
- struct mg_connection *c;
- fd_set rset, wset, eset;
- MG_SOCKET_TYPE maxfd = 0;
- int rc;
- FD_ZERO(&rset);
- FD_ZERO(&wset);
- FD_ZERO(&eset);
- tvp = ms < 0 ? NULL : &tv;
- for (c = mgr->conns; c != NULL; c = c->next) {
- c->is_readable = c->is_writable = 0;
- if (skip_iotest(c)) continue;
- FD_SET(FD(c), &eset);
- if (can_read(c)) FD_SET(FD(c), &rset);
- if (can_write(c)) FD_SET(FD(c), &wset);
- if (mg_tls_pending(c) > 0) tvp = &tv_zero;
- if (FD(c) > maxfd) maxfd = FD(c);
- if (c->is_closing) ms = 1;
- }
- if ((rc = select((int) maxfd + 1, &rset, &wset, &eset, tvp)) < 0) {
- #if MG_ARCH == MG_ARCH_WIN32
- if (maxfd == 0) Sleep(ms); // On Windows, select fails if no sockets
- #else
- MG_ERROR(("select: %d %d", rc, MG_SOCK_ERR(rc)));
- #endif
- FD_ZERO(&rset);
- FD_ZERO(&wset);
- FD_ZERO(&eset);
- }
- for (c = mgr->conns; c != NULL; c = c->next) {
- if (FD(c) != MG_INVALID_SOCKET && FD_ISSET(FD(c), &eset)) {
- mg_error(c, "socket error");
- } else {
- c->is_readable = FD(c) != MG_INVALID_SOCKET && FD_ISSET(FD(c), &rset);
- c->is_writable = FD(c) != MG_INVALID_SOCKET && FD_ISSET(FD(c), &wset);
- if (mg_tls_pending(c) > 0) c->is_readable = 1;
- }
- }
- #endif
- }
- static bool mg_socketpair(MG_SOCKET_TYPE sp[2], union usa usa[2]) {
- socklen_t n = sizeof(usa[0].sin);
- bool success = false;
- sp[0] = sp[1] = MG_INVALID_SOCKET;
- (void) memset(&usa[0], 0, sizeof(usa[0]));
- usa[0].sin.sin_family = AF_INET;
- *(uint32_t *) &usa->sin.sin_addr = mg_htonl(0x7f000001U); // 127.0.0.1
- usa[1] = usa[0];
- if ((sp[0] = socket(AF_INET, SOCK_DGRAM, 0)) != MG_INVALID_SOCKET &&
- (sp[1] = socket(AF_INET, SOCK_DGRAM, 0)) != MG_INVALID_SOCKET &&
- bind(sp[0], &usa[0].sa, n) == 0 && //
- bind(sp[1], &usa[1].sa, n) == 0 && //
- getsockname(sp[0], &usa[0].sa, &n) == 0 && //
- getsockname(sp[1], &usa[1].sa, &n) == 0 && //
- connect(sp[0], &usa[1].sa, n) == 0 && //
- connect(sp[1], &usa[0].sa, n) == 0) { //
- success = true;
- }
- if (!success) {
- if (sp[0] != MG_INVALID_SOCKET) closesocket(sp[0]);
- if (sp[1] != MG_INVALID_SOCKET) closesocket(sp[1]);
- sp[0] = sp[1] = MG_INVALID_SOCKET;
- }
- return success;
- }
- // mg_wakeup() event handler
- static void wufn(struct mg_connection *c, int ev, void *ev_data) {
- if (ev == MG_EV_READ) {
- unsigned long *id = (unsigned long *) c->recv.buf;
- // MG_INFO(("Got data"));
- // mg_hexdump(c->recv.buf, c->recv.len);
- if (c->recv.len >= sizeof(*id)) {
- struct mg_connection *t;
- for (t = c->mgr->conns; t != NULL; t = t->next) {
- if (t->id == *id) {
- struct mg_str data = mg_str_n((char *) c->recv.buf + sizeof(*id),
- c->recv.len - sizeof(*id));
- mg_call(t, MG_EV_WAKEUP, &data);
- }
- }
- }
- c->recv.len = 0; // Consume received data
- } else if (ev == MG_EV_CLOSE) {
- closesocket(c->mgr->pipe); // When we're closing, close the other
- c->mgr->pipe = MG_INVALID_SOCKET; // side of the socketpair, too
- }
- (void) ev_data;
- }
- bool mg_wakeup_init(struct mg_mgr *mgr) {
- bool ok = false;
- if (mgr->pipe == MG_INVALID_SOCKET) {
- union usa usa[2];
- MG_SOCKET_TYPE sp[2] = {MG_INVALID_SOCKET, MG_INVALID_SOCKET};
- struct mg_connection *c = NULL;
- if (!mg_socketpair(sp, usa)) {
- MG_ERROR(("Cannot create socket pair"));
- } else if ((c = mg_wrapfd(mgr, (int) sp[1], wufn, NULL)) == NULL) {
- closesocket(sp[0]);
- closesocket(sp[1]);
- sp[0] = sp[1] = MG_INVALID_SOCKET;
- } else {
- tomgaddr(&usa[0], &c->rem, false);
- MG_DEBUG(("%lu %p pipe %lu", c->id, c->fd, (unsigned long) sp[0]));
- mgr->pipe = sp[0];
- ok = true;
- }
- }
- return ok;
- }
- bool mg_wakeup(struct mg_mgr *mgr, unsigned long conn_id, const void *buf,
- size_t len) {
- if (mgr->pipe != MG_INVALID_SOCKET && conn_id > 0) {
- char *extended_buf = (char *) alloca(len + sizeof(conn_id));
- memcpy(extended_buf, &conn_id, sizeof(conn_id));
- memcpy(extended_buf + sizeof(conn_id), buf, len);
- send(mgr->pipe, extended_buf, len + sizeof(conn_id), MSG_NONBLOCKING);
- return true;
- }
- return false;
- }
- void mg_mgr_poll(struct mg_mgr *mgr, int ms) {
- struct mg_connection *c, *tmp;
- uint64_t now;
- mg_iotest(mgr, ms);
- now = mg_millis();
- mg_timer_poll(&mgr->timers, now);
- for (c = mgr->conns; c != NULL; c = tmp) {
- bool is_resp = c->is_resp;
- tmp = c->next;
- mg_call(c, MG_EV_POLL, &now);
- if (is_resp && !c->is_resp) {
- long n = 0;
- mg_call(c, MG_EV_READ, &n);
- }
- MG_VERBOSE(("%lu %c%c %c%c%c%c%c", c->id, c->is_readable ? 'r' : '-',
- c->is_writable ? 'w' : '-', c->is_tls ? 'T' : 't',
- c->is_connecting ? 'C' : 'c', c->is_tls_hs ? 'H' : 'h',
- c->is_resolving ? 'R' : 'r', c->is_closing ? 'C' : 'c'));
- if (c->is_resolving || c->is_closing) {
- // Do nothing
- } else if (c->is_listening && c->is_udp == 0) {
- if (c->is_readable) accept_conn(mgr, c);
- } else if (c->is_connecting) {
- if (c->is_readable || c->is_writable) connect_conn(c);
- //} else if (c->is_tls_hs) {
- // if ((c->is_readable || c->is_writable)) mg_tls_handshake(c);
- } else {
- if (c->is_readable) read_conn(c);
- if (c->is_writable) write_conn(c);
- }
- if (c->is_draining && c->send.len == 0) c->is_closing = 1;
- if (c->is_closing) close_conn(c);
- }
- }
- #endif
- #ifdef MG_ENABLE_LINES
- #line 1 "src/ssi.c"
- #endif
- #ifndef MG_MAX_SSI_DEPTH
- #define MG_MAX_SSI_DEPTH 5
- #endif
- #ifndef MG_SSI_BUFSIZ
- #define MG_SSI_BUFSIZ 1024
- #endif
- #if MG_ENABLE_SSI
- static char *mg_ssi(const char *path, const char *root, int depth) {
- struct mg_iobuf b = {NULL, 0, 0, MG_IO_SIZE};
- FILE *fp = fopen(path, "rb");
- if (fp != NULL) {
- char buf[MG_SSI_BUFSIZ], arg[sizeof(buf)];
- int ch, intag = 0;
- size_t len = 0;
- buf[0] = arg[0] = '\0';
- while ((ch = fgetc(fp)) != EOF) {
- if (intag && ch == '>' && buf[len - 1] == '-' && buf[len - 2] == '-') {
- buf[len++] = (char) (ch & 0xff);
- buf[len] = '\0';
- if (sscanf(buf, "<!--#include file=\"%[^\"]", arg)) {
- char tmp[MG_PATH_MAX + MG_SSI_BUFSIZ + 10],
- *p = (char *) path + strlen(path), *data;
- while (p > path && p[-1] != MG_DIRSEP && p[-1] != '/') p--;
- mg_snprintf(tmp, sizeof(tmp), "%.*s%s", (int) (p - path), path, arg);
- if (depth < MG_MAX_SSI_DEPTH &&
- (data = mg_ssi(tmp, root, depth + 1)) != NULL) {
- mg_iobuf_add(&b, b.len, data, strlen(data));
- free(data);
- } else {
- MG_ERROR(("%s: file=%s error or too deep", path, arg));
- }
- } else if (sscanf(buf, "<!--#include virtual=\"%[^\"]", arg)) {
- char tmp[MG_PATH_MAX + MG_SSI_BUFSIZ + 10], *data;
- mg_snprintf(tmp, sizeof(tmp), "%s%s", root, arg);
- if (depth < MG_MAX_SSI_DEPTH &&
- (data = mg_ssi(tmp, root, depth + 1)) != NULL) {
- mg_iobuf_add(&b, b.len, data, strlen(data));
- free(data);
- } else {
- MG_ERROR(("%s: virtual=%s error or too deep", path, arg));
- }
- } else {
- // Unknown SSI tag
- MG_ERROR(("Unknown SSI tag: %.*s", (int) len, buf));
- mg_iobuf_add(&b, b.len, buf, len);
- }
- intag = 0;
- len = 0;
- } else if (ch == '<') {
- intag = 1;
- if (len > 0) mg_iobuf_add(&b, b.len, buf, len);
- len = 0;
- buf[len++] = (char) (ch & 0xff);
- } else if (intag) {
- if (len == 5 && strncmp(buf, "<!--#", 5) != 0) {
- intag = 0;
- } else if (len >= sizeof(buf) - 2) {
- MG_ERROR(("%s: SSI tag is too large", path));
- len = 0;
- }
- buf[len++] = (char) (ch & 0xff);
- } else {
- buf[len++] = (char) (ch & 0xff);
- if (len >= sizeof(buf)) {
- mg_iobuf_add(&b, b.len, buf, len);
- len = 0;
- }
- }
- }
- if (len > 0) mg_iobuf_add(&b, b.len, buf, len);
- if (b.len > 0) mg_iobuf_add(&b, b.len, "", 1); // nul-terminate
- fclose(fp);
- }
- (void) depth;
- (void) root;
- return (char *) b.buf;
- }
- void mg_http_serve_ssi(struct mg_connection *c, const char *root,
- const char *fullpath) {
- const char *headers = "Content-Type: text/html; charset=utf-8\r\n";
- char *data = mg_ssi(fullpath, root, 0);
- mg_http_reply(c, 200, headers, "%s", data == NULL ? "" : data);
- free(data);
- }
- #else
- void mg_http_serve_ssi(struct mg_connection *c, const char *root,
- const char *fullpath) {
- mg_http_reply(c, 501, NULL, "SSI not enabled");
- (void) root, (void) fullpath;
- }
- #endif
- #ifdef MG_ENABLE_LINES
- #line 1 "src/str.c"
- #endif
- struct mg_str mg_str_s(const char *s) {
- struct mg_str str = {s, s == NULL ? 0 : strlen(s)};
- return str;
- }
- struct mg_str mg_str_n(const char *s, size_t n) {
- struct mg_str str = {s, n};
- return str;
- }
- int mg_lower(const char *s) {
- int c = *s;
- if (c >= 'A' && c <= 'Z') c += 'a' - 'A';
- return c;
- }
- int mg_ncasecmp(const char *s1, const char *s2, size_t len) {
- int diff = 0;
- if (len > 0) do {
- diff = mg_lower(s1++) - mg_lower(s2++);
- } while (diff == 0 && s1[-1] != '\0' && --len > 0);
- return diff;
- }
- int mg_casecmp(const char *s1, const char *s2) {
- return mg_ncasecmp(s1, s2, (size_t) ~0);
- }
- int mg_vcmp(const struct mg_str *s1, const char *s2) {
- size_t n2 = strlen(s2), n1 = s1->len;
- int r = strncmp(s1->ptr, s2, (n1 < n2) ? n1 : n2);
- if (r == 0) return (int) (n1 - n2);
- return r;
- }
- int mg_vcasecmp(const struct mg_str *str1, const char *str2) {
- size_t n2 = strlen(str2), n1 = str1->len;
- int r = mg_ncasecmp(str1->ptr, str2, (n1 < n2) ? n1 : n2);
- if (r == 0) return (int) (n1 - n2);
- return r;
- }
- struct mg_str mg_strdup(const struct mg_str s) {
- struct mg_str r = {NULL, 0};
- if (s.len > 0 && s.ptr != NULL) {
- char *sc = (char *) calloc(1, s.len + 1);
- if (sc != NULL) {
- memcpy(sc, s.ptr, s.len);
- sc[s.len] = '\0';
- r.ptr = sc;
- r.len = s.len;
- }
- }
- return r;
- }
- int mg_strcmp(const struct mg_str str1, const struct mg_str str2) {
- size_t i = 0;
- while (i < str1.len && i < str2.len) {
- int c1 = str1.ptr[i];
- int c2 = str2.ptr[i];
- if (c1 < c2) return -1;
- if (c1 > c2) return 1;
- i++;
- }
- if (i < str1.len) return 1;
- if (i < str2.len) return -1;
- return 0;
- }
- const char *mg_strstr(const struct mg_str haystack,
- const struct mg_str needle) {
- size_t i;
- if (needle.len > haystack.len) return NULL;
- if (needle.len == 0) return haystack.ptr;
- for (i = 0; i <= haystack.len - needle.len; i++) {
- if (memcmp(haystack.ptr + i, needle.ptr, needle.len) == 0) {
- return haystack.ptr + i;
- }
- }
- return NULL;
- }
- static bool is_space(int c) {
- return c == ' ' || c == '\r' || c == '\n' || c == '\t';
- }
- struct mg_str mg_strstrip(struct mg_str s) {
- while (s.len > 0 && is_space((int) *s.ptr)) s.ptr++, s.len--;
- while (s.len > 0 && is_space((int) *(s.ptr + s.len - 1))) s.len--;
- return s;
- }
- bool mg_match(struct mg_str s, struct mg_str p, struct mg_str *caps) {
- size_t i = 0, j = 0, ni = 0, nj = 0;
- if (caps) caps->ptr = NULL, caps->len = 0;
- while (i < p.len || j < s.len) {
- if (i < p.len && j < s.len && (p.ptr[i] == '?' || s.ptr[j] == p.ptr[i])) {
- if (caps == NULL) {
- } else if (p.ptr[i] == '?') {
- caps->ptr = &s.ptr[j], caps->len = 1; // Finalize `?` cap
- caps++, caps->ptr = NULL, caps->len = 0; // Init next cap
- } else if (caps->ptr != NULL && caps->len == 0) {
- caps->len = (size_t) (&s.ptr[j] - caps->ptr); // Finalize current cap
- caps++, caps->len = 0, caps->ptr = NULL; // Init next cap
- }
- i++, j++;
- } else if (i < p.len && (p.ptr[i] == '*' || p.ptr[i] == '#')) {
- if (caps && !caps->ptr) caps->len = 0, caps->ptr = &s.ptr[j]; // Init cap
- ni = i++, nj = j + 1;
- } else if (nj > 0 && nj <= s.len && (p.ptr[ni] == '#' || s.ptr[j] != '/')) {
- i = ni, j = nj;
- if (caps && caps->ptr == NULL && caps->len == 0) {
- caps--, caps->len = 0; // Restart previous cap
- }
- } else {
- return false;
- }
- }
- if (caps && caps->ptr && caps->len == 0) {
- caps->len = (size_t) (&s.ptr[j] - caps->ptr);
- }
- return true;
- }
- bool mg_globmatch(const char *s1, size_t n1, const char *s2, size_t n2) {
- return mg_match(mg_str_n(s2, n2), mg_str_n(s1, n1), NULL);
- }
- static size_t mg_nce(const char *s, size_t n, size_t ofs, size_t *koff,
- size_t *klen, size_t *voff, size_t *vlen, char delim) {
- size_t kvlen, kl;
- for (kvlen = 0; ofs + kvlen < n && s[ofs + kvlen] != delim;) kvlen++;
- for (kl = 0; kl < kvlen && s[ofs + kl] != '=';) kl++;
- if (koff != NULL) *koff = ofs;
- if (klen != NULL) *klen = kl;
- if (voff != NULL) *voff = kl < kvlen ? ofs + kl + 1 : 0;
- if (vlen != NULL) *vlen = kl < kvlen ? kvlen - kl - 1 : 0;
- ofs += kvlen + 1;
- return ofs > n ? n : ofs;
- }
- bool mg_split(struct mg_str *s, struct mg_str *k, struct mg_str *v, char sep) {
- size_t koff = 0, klen = 0, voff = 0, vlen = 0, off = 0;
- if (s->ptr == NULL || s->len == 0) return 0;
- off = mg_nce(s->ptr, s->len, 0, &koff, &klen, &voff, &vlen, sep);
- if (k != NULL) *k = mg_str_n(s->ptr + koff, klen);
- if (v != NULL) *v = mg_str_n(s->ptr + voff, vlen);
- *s = mg_str_n(s->ptr + off, s->len - off);
- return off > 0;
- }
- bool mg_commalist(struct mg_str *s, struct mg_str *k, struct mg_str *v) {
- return mg_split(s, k, v, ',');
- }
- char *mg_hex(const void *buf, size_t len, char *to) {
- const unsigned char *p = (const unsigned char *) buf;
- const char *hex = "0123456789abcdef";
- size_t i = 0;
- for (; len--; p++) {
- to[i++] = hex[p[0] >> 4];
- to[i++] = hex[p[0] & 0x0f];
- }
- to[i] = '\0';
- return to;
- }
- static unsigned char mg_unhex_nimble(unsigned char c) {
- return (c >= '0' && c <= '9') ? (unsigned char) (c - '0')
- : (c >= 'A' && c <= 'F') ? (unsigned char) (c - '7')
- : (unsigned char) (c - 'W');
- }
- unsigned long mg_unhexn(const char *s, size_t len) {
- unsigned long i = 0, v = 0;
- for (i = 0; i < len; i++) v <<= 4, v |= mg_unhex_nimble(((uint8_t *) s)[i]);
- return v;
- }
- void mg_unhex(const char *buf, size_t len, unsigned char *to) {
- size_t i;
- for (i = 0; i < len; i += 2) {
- to[i >> 1] = (unsigned char) mg_unhexn(&buf[i], 2);
- }
- }
- bool mg_path_is_sane(const char *path) {
- const char *s = path;
- for (; s[0] != '\0'; s++) {
- if (s == path || s[0] == '/' || s[0] == '\\') { // Subdir?
- if (s[1] == '.' && s[2] == '.') return false; // Starts with ..
- }
- }
- return true;
- }
- #ifdef MG_ENABLE_LINES
- #line 1 "src/timer.c"
- #endif
- #define MG_TIMER_CALLED 4
- void mg_timer_init(struct mg_timer **head, struct mg_timer *t, uint64_t ms,
- unsigned flags, void (*fn)(void *), void *arg) {
- t->id = 0, t->period_ms = ms, t->expire = 0;
- t->flags = flags, t->fn = fn, t->arg = arg, t->next = *head;
- *head = t;
- }
- void mg_timer_free(struct mg_timer **head, struct mg_timer *t) {
- while (*head && *head != t) head = &(*head)->next;
- if (*head) *head = t->next;
- }
- // t: expiration time, prd: period, now: current time. Return true if expired
- bool mg_timer_expired(uint64_t *t, uint64_t prd, uint64_t now) {
- if (now + prd < *t) *t = 0; // Time wrapped? Reset timer
- if (*t == 0) *t = now + prd; // Firt poll? Set expiration
- if (*t > now) return false; // Not expired yet, return
- *t = (now - *t) > prd ? now + prd : *t + prd; // Next expiration time
- return true; // Expired, return true
- }
- void mg_timer_poll(struct mg_timer **head, uint64_t now_ms) {
- struct mg_timer *t, *tmp;
- for (t = *head; t != NULL; t = tmp) {
- bool once = t->expire == 0 && (t->flags & MG_TIMER_RUN_NOW) &&
- !(t->flags & MG_TIMER_CALLED); // Handle MG_TIMER_NOW only once
- bool expired = mg_timer_expired(&t->expire, t->period_ms, now_ms);
- tmp = t->next;
- if (!once && !expired) continue;
- if ((t->flags & MG_TIMER_REPEAT) || !(t->flags & MG_TIMER_CALLED)) {
- t->fn(t->arg);
- }
- t->flags |= MG_TIMER_CALLED;
- }
- }
- #ifdef MG_ENABLE_LINES
- #line 1 "src/tls_aes128.c"
- #endif
- /******************************************************************************
- *
- * THIS SOURCE CODE IS HEREBY PLACED INTO THE PUBLIC DOMAIN FOR THE GOOD OF ALL
- *
- * This is a simple and straightforward implementation of the AES Rijndael
- * 128-bit block cipher designed by Vincent Rijmen and Joan Daemen. The focus
- * of this work was correctness & accuracy. It is written in 'C' without any
- * particular focus upon optimization or speed. It should be endian (memory
- * byte order) neutral since the few places that care are handled explicitly.
- *
- * This implementation of Rijndael was created by Steven M. Gibson of GRC.com.
- *
- * It is intended for general purpose use, but was written in support of GRC's
- * reference implementation of the SQRL (Secure Quick Reliable Login) client.
- *
- * See: http://csrc.nist.gov/archive/aes/rijndael/wsdindex.html
- *
- * NO COPYRIGHT IS CLAIMED IN THIS WORK, HOWEVER, NEITHER IS ANY WARRANTY MADE
- * REGARDING ITS FITNESS FOR ANY PARTICULAR PURPOSE. USE IT AT YOUR OWN RISK.
- *
- *******************************************************************************/
- #if MG_TLS == MG_TLS_BUILTIN
- static int aes_tables_inited = 0; // run-once flag for performing key
- // expasion table generation (see below)
- /*
- * The following static local tables must be filled-in before the first use of
- * the GCM or AES ciphers. They are used for the AES key expansion/scheduling
- * and once built are read-only and thread safe. The "gcm_initialize" function
- * must be called once during system initialization to populate these arrays
- * for subsequent use by the AES key scheduler. If they have not been built
- * before attempted use, an error will be returned to the caller.
- *
- * NOTE: GCM Encryption/Decryption does NOT REQUIRE AES decryption. Since
- * GCM uses AES in counter-mode, where the AES cipher output is XORed with
- * the GCM input, we ONLY NEED AES encryption. Thus, to save space AES
- * decryption is typically disabled by setting AES_DECRYPTION to 0 in aes.h.
- */
- // We always need our forward tables
- static uchar FSb[256]; // Forward substitution box (FSb)
- static uint32_t FT0[256]; // Forward key schedule assembly tables
- static uint32_t FT1[256];
- static uint32_t FT2[256];
- static uint32_t FT3[256];
- #if AES_DECRYPTION // We ONLY need reverse for decryption
- static uchar RSb[256]; // Reverse substitution box (RSb)
- static uint32_t RT0[256]; // Reverse key schedule assembly tables
- static uint32_t RT1[256];
- static uint32_t RT2[256];
- static uint32_t RT3[256];
- #endif /* AES_DECRYPTION */
- static uint32_t RCON[10]; // AES round constants
- /*
- * Platform Endianness Neutralizing Load and Store Macro definitions
- * AES wants platform-neutral Little Endian (LE) byte ordering
- */
- #define GET_UINT32_LE(n, b, i) \
- { \
- (n) = ((uint32_t) (b)[(i)]) | ((uint32_t) (b)[(i) + 1] << 8) | \
- ((uint32_t) (b)[(i) + 2] << 16) | ((uint32_t) (b)[(i) + 3] << 24); \
- }
- #define PUT_UINT32_LE(n, b, i) \
- { \
- (b)[(i)] = (uchar) ((n)); \
- (b)[(i) + 1] = (uchar) ((n) >> 8); \
- (b)[(i) + 2] = (uchar) ((n) >> 16); \
- (b)[(i) + 3] = (uchar) ((n) >> 24); \
- }
- /*
- * AES forward and reverse encryption round processing macros
- */
- #define AES_FROUND(X0, X1, X2, X3, Y0, Y1, Y2, Y3) \
- { \
- X0 = *RK++ ^ FT0[(Y0) &0xFF] ^ FT1[(Y1 >> 8) & 0xFF] ^ \
- FT2[(Y2 >> 16) & 0xFF] ^ FT3[(Y3 >> 24) & 0xFF]; \
- \
- X1 = *RK++ ^ FT0[(Y1) &0xFF] ^ FT1[(Y2 >> 8) & 0xFF] ^ \
- FT2[(Y3 >> 16) & 0xFF] ^ FT3[(Y0 >> 24) & 0xFF]; \
- \
- X2 = *RK++ ^ FT0[(Y2) &0xFF] ^ FT1[(Y3 >> 8) & 0xFF] ^ \
- FT2[(Y0 >> 16) & 0xFF] ^ FT3[(Y1 >> 24) & 0xFF]; \
- \
- X3 = *RK++ ^ FT0[(Y3) &0xFF] ^ FT1[(Y0 >> 8) & 0xFF] ^ \
- FT2[(Y1 >> 16) & 0xFF] ^ FT3[(Y2 >> 24) & 0xFF]; \
- }
- #define AES_RROUND(X0, X1, X2, X3, Y0, Y1, Y2, Y3) \
- { \
- X0 = *RK++ ^ RT0[(Y0) &0xFF] ^ RT1[(Y3 >> 8) & 0xFF] ^ \
- RT2[(Y2 >> 16) & 0xFF] ^ RT3[(Y1 >> 24) & 0xFF]; \
- \
- X1 = *RK++ ^ RT0[(Y1) &0xFF] ^ RT1[(Y0 >> 8) & 0xFF] ^ \
- RT2[(Y3 >> 16) & 0xFF] ^ RT3[(Y2 >> 24) & 0xFF]; \
- \
- X2 = *RK++ ^ RT0[(Y2) &0xFF] ^ RT1[(Y1 >> 8) & 0xFF] ^ \
- RT2[(Y0 >> 16) & 0xFF] ^ RT3[(Y3 >> 24) & 0xFF]; \
- \
- X3 = *RK++ ^ RT0[(Y3) &0xFF] ^ RT1[(Y2 >> 8) & 0xFF] ^ \
- RT2[(Y1 >> 16) & 0xFF] ^ RT3[(Y0 >> 24) & 0xFF]; \
- }
- /*
- * These macros improve the readability of the key
- * generation initialization code by collapsing
- * repetitive common operations into logical pieces.
- */
- #define ROTL8(x) ((x << 8) & 0xFFFFFFFF) | (x >> 24)
- #define XTIME(x) ((x << 1) ^ ((x & 0x80) ? 0x1B : 0x00))
- #define MUL(x, y) ((x && y) ? pow[(log[x] + log[y]) % 255] : 0)
- #define MIX(x, y) \
- { \
- y = ((y << 1) | (y >> 7)) & 0xFF; \
- x ^= y; \
- }
- #define CPY128 \
- { \
- *RK++ = *SK++; \
- *RK++ = *SK++; \
- *RK++ = *SK++; \
- *RK++ = *SK++; \
- }
- /******************************************************************************
- *
- * AES_INIT_KEYGEN_TABLES
- *
- * Fills the AES key expansion tables allocated above with their static
- * data. This is not "per key" data, but static system-wide read-only
- * table data. THIS FUNCTION IS NOT THREAD SAFE. It must be called once
- * at system initialization to setup the tables for all subsequent use.
- *
- ******************************************************************************/
- void aes_init_keygen_tables(void) {
- int i, x, y, z; // general purpose iteration and computation locals
- int pow[256];
- int log[256];
- if (aes_tables_inited) return;
- // fill the 'pow' and 'log' tables over GF(2^8)
- for (i = 0, x = 1; i < 256; i++) {
- pow[i] = x;
- log[x] = i;
- x = (x ^ XTIME(x)) & 0xFF;
- }
- // compute the round constants
- for (i = 0, x = 1; i < 10; i++) {
- RCON[i] = (uint32_t) x;
- x = XTIME(x) & 0xFF;
- }
- // fill the forward and reverse substitution boxes
- FSb[0x00] = 0x63;
- #if AES_DECRYPTION // whether AES decryption is supported
- RSb[0x63] = 0x00;
- #endif /* AES_DECRYPTION */
- for (i = 1; i < 256; i++) {
- x = y = pow[255 - log[i]];
- MIX(x, y);
- MIX(x, y);
- MIX(x, y);
- MIX(x, y);
- FSb[i] = (uchar) (x ^= 0x63);
- #if AES_DECRYPTION // whether AES decryption is supported
- RSb[x] = (uchar) i;
- #endif /* AES_DECRYPTION */
- }
- // generate the forward and reverse key expansion tables
- for (i = 0; i < 256; i++) {
- x = FSb[i];
- y = XTIME(x) & 0xFF;
- z = (y ^ x) & 0xFF;
- FT0[i] = ((uint32_t) y) ^ ((uint32_t) x << 8) ^ ((uint32_t) x << 16) ^
- ((uint32_t) z << 24);
- FT1[i] = ROTL8(FT0[i]);
- FT2[i] = ROTL8(FT1[i]);
- FT3[i] = ROTL8(FT2[i]);
- #if AES_DECRYPTION // whether AES decryption is supported
- x = RSb[i];
- RT0[i] = ((uint32_t) MUL(0x0E, x)) ^ ((uint32_t) MUL(0x09, x) << 8) ^
- ((uint32_t) MUL(0x0D, x) << 16) ^ ((uint32_t) MUL(0x0B, x) << 24);
- RT1[i] = ROTL8(RT0[i]);
- RT2[i] = ROTL8(RT1[i]);
- RT3[i] = ROTL8(RT2[i]);
- #endif /* AES_DECRYPTION */
- }
- aes_tables_inited = 1; // flag that the tables have been generated
- } // to permit subsequent use of the AES cipher
- /******************************************************************************
- *
- * AES_SET_ENCRYPTION_KEY
- *
- * This is called by 'aes_setkey' when we're establishing a key for
- * subsequent encryption. We give it a pointer to the encryption
- * context, a pointer to the key, and the key's length in bytes.
- * Valid lengths are: 16, 24 or 32 bytes (128, 192, 256 bits).
- *
- ******************************************************************************/
- static int aes_set_encryption_key(aes_context *ctx, const uchar *key, uint keysize) {
- uint i; // general purpose iteration local
- uint32_t *RK = ctx->rk; // initialize our RoundKey buffer pointer
- for (i = 0; i < (keysize >> 2); i++) {
- GET_UINT32_LE(RK[i], key, i << 2);
- }
- switch (ctx->rounds) {
- case 10:
- for (i = 0; i < 10; i++, RK += 4) {
- RK[4] = RK[0] ^ RCON[i] ^ ((uint32_t) FSb[(RK[3] >> 8) & 0xFF]) ^
- ((uint32_t) FSb[(RK[3] >> 16) & 0xFF] << 8) ^
- ((uint32_t) FSb[(RK[3] >> 24) & 0xFF] << 16) ^
- ((uint32_t) FSb[(RK[3]) & 0xFF] << 24);
- RK[5] = RK[1] ^ RK[4];
- RK[6] = RK[2] ^ RK[5];
- RK[7] = RK[3] ^ RK[6];
- }
- break;
- case 12:
- for (i = 0; i < 8; i++, RK += 6) {
- RK[6] = RK[0] ^ RCON[i] ^ ((uint32_t) FSb[(RK[5] >> 8) & 0xFF]) ^
- ((uint32_t) FSb[(RK[5] >> 16) & 0xFF] << 8) ^
- ((uint32_t) FSb[(RK[5] >> 24) & 0xFF] << 16) ^
- ((uint32_t) FSb[(RK[5]) & 0xFF] << 24);
- RK[7] = RK[1] ^ RK[6];
- RK[8] = RK[2] ^ RK[7];
- RK[9] = RK[3] ^ RK[8];
- RK[10] = RK[4] ^ RK[9];
- RK[11] = RK[5] ^ RK[10];
- }
- break;
- case 14:
- for (i = 0; i < 7; i++, RK += 8) {
- RK[8] = RK[0] ^ RCON[i] ^ ((uint32_t) FSb[(RK[7] >> 8) & 0xFF]) ^
- ((uint32_t) FSb[(RK[7] >> 16) & 0xFF] << 8) ^
- ((uint32_t) FSb[(RK[7] >> 24) & 0xFF] << 16) ^
- ((uint32_t) FSb[(RK[7]) & 0xFF] << 24);
- RK[9] = RK[1] ^ RK[8];
- RK[10] = RK[2] ^ RK[9];
- RK[11] = RK[3] ^ RK[10];
- RK[12] = RK[4] ^ ((uint32_t) FSb[(RK[11]) & 0xFF]) ^
- ((uint32_t) FSb[(RK[11] >> 8) & 0xFF] << 8) ^
- ((uint32_t) FSb[(RK[11] >> 16) & 0xFF] << 16) ^
- ((uint32_t) FSb[(RK[11] >> 24) & 0xFF] << 24);
- RK[13] = RK[5] ^ RK[12];
- RK[14] = RK[6] ^ RK[13];
- RK[15] = RK[7] ^ RK[14];
- }
- break;
- default:
- return -1;
- }
- return (0);
- }
- #if AES_DECRYPTION // whether AES decryption is supported
- /******************************************************************************
- *
- * AES_SET_DECRYPTION_KEY
- *
- * This is called by 'aes_setkey' when we're establishing a
- * key for subsequent decryption. We give it a pointer to
- * the encryption context, a pointer to the key, and the key's
- * length in bits. Valid lengths are: 128, 192, or 256 bits.
- *
- ******************************************************************************/
- static int aes_set_decryption_key(aes_context *ctx, const uchar *key, uint keysize) {
- int i, j;
- aes_context cty; // a calling aes context for set_encryption_key
- uint32_t *RK = ctx->rk; // initialize our RoundKey buffer pointer
- uint32_t *SK;
- int ret;
- cty.rounds = ctx->rounds; // initialize our local aes context
- cty.rk = cty.buf; // round count and key buf pointer
- if ((ret = aes_set_encryption_key(&cty, key, keysize)) != 0) return (ret);
- SK = cty.rk + cty.rounds * 4;
- CPY128 // copy a 128-bit block from *SK to *RK
- for (i = ctx->rounds - 1, SK -= 8; i > 0; i--, SK -= 8) {
- for (j = 0; j < 4; j++, SK++) {
- *RK++ = RT0[FSb[(*SK) & 0xFF]] ^ RT1[FSb[(*SK >> 8) & 0xFF]] ^
- RT2[FSb[(*SK >> 16) & 0xFF]] ^ RT3[FSb[(*SK >> 24) & 0xFF]];
- }
- }
- CPY128 // copy a 128-bit block from *SK to *RK
- memset(&cty, 0, sizeof(aes_context)); // clear local aes context
- return (0);
- }
- #endif /* AES_DECRYPTION */
- /******************************************************************************
- *
- * AES_SETKEY
- *
- * Invoked to establish the key schedule for subsequent encryption/decryption
- *
- ******************************************************************************/
- int aes_setkey(aes_context *ctx, // AES context provided by our caller
- int mode, // ENCRYPT or DECRYPT flag
- const uchar *key, // pointer to the key
- uint keysize) // key length in bytes
- {
- // since table initialization is not thread safe, we could either add
- // system-specific mutexes and init the AES key generation tables on
- // demand, or ask the developer to simply call "gcm_initialize" once during
- // application startup before threading begins. That's what we choose.
- if (!aes_tables_inited) return (-1); // fail the call when not inited.
- ctx->mode = mode; // capture the key type we're creating
- ctx->rk = ctx->buf; // initialize our round key pointer
- switch (keysize) // set the rounds count based upon the keysize
- {
- case 16:
- ctx->rounds = 10;
- break; // 16-byte, 128-bit key
- case 24:
- ctx->rounds = 12;
- break; // 24-byte, 192-bit key
- case 32:
- ctx->rounds = 14;
- break; // 32-byte, 256-bit key
- default:
- return (-1);
- }
- #if AES_DECRYPTION
- if (mode == DECRYPT) // expand our key for encryption or decryption
- return (aes_set_decryption_key(ctx, key, keysize));
- else /* ENCRYPT */
- #endif /* AES_DECRYPTION */
- return (aes_set_encryption_key(ctx, key, keysize));
- }
- /******************************************************************************
- *
- * AES_CIPHER
- *
- * Perform AES encryption and decryption.
- * The AES context will have been setup with the encryption mode
- * and all keying information appropriate for the task.
- *
- ******************************************************************************/
- int aes_cipher(aes_context *ctx, const uchar input[16], uchar output[16]) {
- int i;
- uint32_t *RK, X0, X1, X2, X3, Y0, Y1, Y2, Y3; // general purpose locals
- RK = ctx->rk;
- GET_UINT32_LE(X0, input, 0);
- X0 ^= *RK++; // load our 128-bit
- GET_UINT32_LE(X1, input, 4);
- X1 ^= *RK++; // input buffer in a storage
- GET_UINT32_LE(X2, input, 8);
- X2 ^= *RK++; // memory endian-neutral way
- GET_UINT32_LE(X3, input, 12);
- X3 ^= *RK++;
- #if AES_DECRYPTION // whether AES decryption is supported
- if (ctx->mode == DECRYPT) {
- for (i = (ctx->rounds >> 1) - 1; i > 0; i--) {
- AES_RROUND(Y0, Y1, Y2, Y3, X0, X1, X2, X3);
- AES_RROUND(X0, X1, X2, X3, Y0, Y1, Y2, Y3);
- }
- AES_RROUND(Y0, Y1, Y2, Y3, X0, X1, X2, X3);
- X0 = *RK++ ^ ((uint32_t) RSb[(Y0) &0xFF]) ^
- ((uint32_t) RSb[(Y3 >> 8) & 0xFF] << 8) ^
- ((uint32_t) RSb[(Y2 >> 16) & 0xFF] << 16) ^
- ((uint32_t) RSb[(Y1 >> 24) & 0xFF] << 24);
- X1 = *RK++ ^ ((uint32_t) RSb[(Y1) &0xFF]) ^
- ((uint32_t) RSb[(Y0 >> 8) & 0xFF] << 8) ^
- ((uint32_t) RSb[(Y3 >> 16) & 0xFF] << 16) ^
- ((uint32_t) RSb[(Y2 >> 24) & 0xFF] << 24);
- X2 = *RK++ ^ ((uint32_t) RSb[(Y2) &0xFF]) ^
- ((uint32_t) RSb[(Y1 >> 8) & 0xFF] << 8) ^
- ((uint32_t) RSb[(Y0 >> 16) & 0xFF] << 16) ^
- ((uint32_t) RSb[(Y3 >> 24) & 0xFF] << 24);
- X3 = *RK++ ^ ((uint32_t) RSb[(Y3) &0xFF]) ^
- ((uint32_t) RSb[(Y2 >> 8) & 0xFF] << 8) ^
- ((uint32_t) RSb[(Y1 >> 16) & 0xFF] << 16) ^
- ((uint32_t) RSb[(Y0 >> 24) & 0xFF] << 24);
- } else /* ENCRYPT */
- {
- #endif /* AES_DECRYPTION */
- for (i = (ctx->rounds >> 1) - 1; i > 0; i--) {
- AES_FROUND(Y0, Y1, Y2, Y3, X0, X1, X2, X3);
- AES_FROUND(X0, X1, X2, X3, Y0, Y1, Y2, Y3);
- }
- AES_FROUND(Y0, Y1, Y2, Y3, X0, X1, X2, X3);
- X0 = *RK++ ^ ((uint32_t) FSb[(Y0) &0xFF]) ^
- ((uint32_t) FSb[(Y1 >> 8) & 0xFF] << 8) ^
- ((uint32_t) FSb[(Y2 >> 16) & 0xFF] << 16) ^
- ((uint32_t) FSb[(Y3 >> 24) & 0xFF] << 24);
- X1 = *RK++ ^ ((uint32_t) FSb[(Y1) &0xFF]) ^
- ((uint32_t) FSb[(Y2 >> 8) & 0xFF] << 8) ^
- ((uint32_t) FSb[(Y3 >> 16) & 0xFF] << 16) ^
- ((uint32_t) FSb[(Y0 >> 24) & 0xFF] << 24);
- X2 = *RK++ ^ ((uint32_t) FSb[(Y2) &0xFF]) ^
- ((uint32_t) FSb[(Y3 >> 8) & 0xFF] << 8) ^
- ((uint32_t) FSb[(Y0 >> 16) & 0xFF] << 16) ^
- ((uint32_t) FSb[(Y1 >> 24) & 0xFF] << 24);
- X3 = *RK++ ^ ((uint32_t) FSb[(Y3) &0xFF]) ^
- ((uint32_t) FSb[(Y0 >> 8) & 0xFF] << 8) ^
- ((uint32_t) FSb[(Y1 >> 16) & 0xFF] << 16) ^
- ((uint32_t) FSb[(Y2 >> 24) & 0xFF] << 24);
- #if AES_DECRYPTION // whether AES decryption is supported
- }
- #endif /* AES_DECRYPTION */
- PUT_UINT32_LE(X0, output, 0);
- PUT_UINT32_LE(X1, output, 4);
- PUT_UINT32_LE(X2, output, 8);
- PUT_UINT32_LE(X3, output, 12);
- return (0);
- }
- /* end of aes.c */
- /******************************************************************************
- *
- * THIS SOURCE CODE IS HEREBY PLACED INTO THE PUBLIC DOMAIN FOR THE GOOD OF ALL
- *
- * This is a simple and straightforward implementation of AES-GCM authenticated
- * encryption. The focus of this work was correctness & accuracy. It is written
- * in straight 'C' without any particular focus upon optimization or speed. It
- * should be endian (memory byte order) neutral since the few places that care
- * are handled explicitly.
- *
- * This implementation of AES-GCM was created by Steven M. Gibson of GRC.com.
- *
- * It is intended for general purpose use, but was written in support of GRC's
- * reference implementation of the SQRL (Secure Quick Reliable Login) client.
- *
- * See: http://csrc.nist.gov/publications/nistpubs/800-38D/SP-800-38D.pdf
- * http://csrc.nist.gov/groups/ST/toolkit/BCM/documents/proposedmodes/
- * gcm/gcm-revised-spec.pdf
- *
- * NO COPYRIGHT IS CLAIMED IN THIS WORK, HOWEVER, NEITHER IS ANY WARRANTY MADE
- * REGARDING ITS FITNESS FOR ANY PARTICULAR PURPOSE. USE IT AT YOUR OWN RISK.
- *
- *******************************************************************************/
- /******************************************************************************
- * ==== IMPLEMENTATION WARNING ====
- *
- * This code was developed for use within SQRL's fixed environmnent. Thus, it
- * is somewhat less "general purpose" than it would be if it were designed as
- * a general purpose AES-GCM library. Specifically, it bothers with almost NO
- * error checking on parameter limits, buffer bounds, etc. It assumes that it
- * is being invoked by its author or by someone who understands the values it
- * expects to receive. Its behavior will be undefined otherwise.
- *
- * All functions that might fail are defined to return 'ints' to indicate a
- * problem. Most do not do so now. But this allows for error propagation out
- * of internal functions if robust error checking should ever be desired.
- *
- ******************************************************************************/
- /* Calculating the "GHASH"
- *
- * There are many ways of calculating the so-called GHASH in software, each with
- * a traditional size vs performance tradeoff. The GHASH (Galois field hash) is
- * an intriguing construction which takes two 128-bit strings (also the cipher's
- * block size and the fundamental operation size for the system) and hashes them
- * into a third 128-bit result.
- *
- * Many implementation solutions have been worked out that use large precomputed
- * table lookups in place of more time consuming bit fiddling, and this approach
- * can be scaled easily upward or downward as needed to change the time/space
- * tradeoff. It's been studied extensively and there's a solid body of theory
- * and practice. For example, without using any lookup tables an implementation
- * might obtain 119 cycles per byte throughput, whereas using a simple, though
- * large, key-specific 64 kbyte 8-bit lookup table the performance jumps to 13
- * cycles per byte.
- *
- * And Intel's processors have, since 2010, included an instruction which does
- * the entire 128x128->128 bit job in just several 64x64->128 bit pieces.
- *
- * Since SQRL is interactive, and only processing a few 128-bit blocks, I've
- * settled upon a relatively slower but appealing small-table compromise which
- * folds a bunch of not only time consuming but also bit twiddling into a simple
- * 16-entry table which is attributed to Victor Shoup's 1996 work while at
- * Bellcore: "On Fast and Provably Secure MessageAuthentication Based on
- * Universal Hashing." See: http://www.shoup.net/papers/macs.pdf
- * See, also section 4.1 of the "gcm-revised-spec" cited above.
- */
- /*
- * This 16-entry table of pre-computed constants is used by the
- * GHASH multiplier to improve over a strictly table-free but
- * significantly slower 128x128 bit multiple within GF(2^128).
- */
- static const uint64_t last4[16] = {
- 0x0000, 0x1c20, 0x3840, 0x2460, 0x7080, 0x6ca0, 0x48c0, 0x54e0,
- 0xe100, 0xfd20, 0xd940, 0xc560, 0x9180, 0x8da0, 0xa9c0, 0xb5e0};
- /*
- * Platform Endianness Neutralizing Load and Store Macro definitions
- * GCM wants platform-neutral Big Endian (BE) byte ordering
- */
- #define GET_UINT32_BE(n, b, i) \
- { \
- (n) = ((uint32_t) (b)[(i)] << 24) | ((uint32_t) (b)[(i) + 1] << 16) | \
- ((uint32_t) (b)[(i) + 2] << 8) | ((uint32_t) (b)[(i) + 3]); \
- }
- #define PUT_UINT32_BE(n, b, i) \
- { \
- (b)[(i)] = (uchar) ((n) >> 24); \
- (b)[(i) + 1] = (uchar) ((n) >> 16); \
- (b)[(i) + 2] = (uchar) ((n) >> 8); \
- (b)[(i) + 3] = (uchar) ((n)); \
- }
- /******************************************************************************
- *
- * GCM_INITIALIZE
- *
- * Must be called once to initialize the GCM library.
- *
- * At present, this only calls the AES keygen table generator, which expands
- * the AES keying tables for use. This is NOT A THREAD-SAFE function, so it
- * MUST be called during system initialization before a multi-threading
- * environment is running.
- *
- ******************************************************************************/
- int gcm_initialize(void) {
- aes_init_keygen_tables();
- return (0);
- }
- /******************************************************************************
- *
- * GCM_MULT
- *
- * Performs a GHASH operation on the 128-bit input vector 'x', setting
- * the 128-bit output vector to 'x' times H using our precomputed tables.
- * 'x' and 'output' are seen as elements of GCM's GF(2^128) Galois field.
- *
- ******************************************************************************/
- static void gcm_mult(gcm_context *ctx, // pointer to established context
- const uchar x[16], // pointer to 128-bit input vector
- uchar output[16]) // pointer to 128-bit output vector
- {
- int i;
- uchar lo, hi, rem;
- uint64_t zh, zl;
- lo = (uchar) (x[15] & 0x0f);
- hi = (uchar) (x[15] >> 4);
- zh = ctx->HH[lo];
- zl = ctx->HL[lo];
- for (i = 15; i >= 0; i--) {
- lo = (uchar) (x[i] & 0x0f);
- hi = (uchar) (x[i] >> 4);
- if (i != 15) {
- rem = (uchar) (zl & 0x0f);
- zl = (zh << 60) | (zl >> 4);
- zh = (zh >> 4);
- zh ^= (uint64_t) last4[rem] << 48;
- zh ^= ctx->HH[lo];
- zl ^= ctx->HL[lo];
- }
- rem = (uchar) (zl & 0x0f);
- zl = (zh << 60) | (zl >> 4);
- zh = (zh >> 4);
- zh ^= (uint64_t) last4[rem] << 48;
- zh ^= ctx->HH[hi];
- zl ^= ctx->HL[hi];
- }
- PUT_UINT32_BE(zh >> 32, output, 0);
- PUT_UINT32_BE(zh, output, 4);
- PUT_UINT32_BE(zl >> 32, output, 8);
- PUT_UINT32_BE(zl, output, 12);
- }
- /******************************************************************************
- *
- * GCM_SETKEY
- *
- * This is called to set the AES-GCM key. It initializes the AES key
- * and populates the gcm context's pre-calculated HTables.
- *
- ******************************************************************************/
- int gcm_setkey(gcm_context *ctx, // pointer to caller-provided gcm context
- const uchar *key, // pointer to the AES encryption key
- const uint keysize) // size in bytes (must be 16, 24, 32 for
- // 128, 192 or 256-bit keys respectively)
- {
- int ret, i, j;
- uint64_t hi, lo;
- uint64_t vl, vh;
- unsigned char h[16];
- memset(ctx, 0, sizeof(gcm_context)); // zero caller-provided GCM context
- memset(h, 0, 16); // initialize the block to encrypt
- // encrypt the null 128-bit block to generate a key-based value
- // which is then used to initialize our GHASH lookup tables
- if ((ret = aes_setkey(&ctx->aes_ctx, ENCRYPT, key, keysize)) != 0)
- return (ret);
- if ((ret = aes_cipher(&ctx->aes_ctx, h, h)) != 0) return (ret);
- GET_UINT32_BE(hi, h, 0); // pack h as two 64-bit ints, big-endian
- GET_UINT32_BE(lo, h, 4);
- vh = (uint64_t) hi << 32 | lo;
- GET_UINT32_BE(hi, h, 8);
- GET_UINT32_BE(lo, h, 12);
- vl = (uint64_t) hi << 32 | lo;
- ctx->HL[8] = vl; // 8 = 1000 corresponds to 1 in GF(2^128)
- ctx->HH[8] = vh;
- ctx->HH[0] = 0; // 0 corresponds to 0 in GF(2^128)
- ctx->HL[0] = 0;
- for (i = 4; i > 0; i >>= 1) {
- uint32_t T = (uint32_t) (vl & 1) * 0xe1000000U;
- vl = (vh << 63) | (vl >> 1);
- vh = (vh >> 1) ^ ((uint64_t) T << 32);
- ctx->HL[i] = vl;
- ctx->HH[i] = vh;
- }
- for (i = 2; i < 16; i <<= 1) {
- uint64_t *HiL = ctx->HL + i, *HiH = ctx->HH + i;
- vh = *HiH;
- vl = *HiL;
- for (j = 1; j < i; j++) {
- HiH[j] = vh ^ ctx->HH[j];
- HiL[j] = vl ^ ctx->HL[j];
- }
- }
- return (0);
- }
- /******************************************************************************
- *
- * GCM processing occurs four phases: SETKEY, START, UPDATE and FINISH.
- *
- * SETKEY:
- *
- * START: Sets the Encryption/Decryption mode.
- * Accepts the initialization vector and additional data.
- *
- * UPDATE: Encrypts or decrypts the plaintext or ciphertext.
- *
- * FINISH: Performs a final GHASH to generate the authentication tag.
- *
- ******************************************************************************
- *
- * GCM_START
- *
- * Given a user-provided GCM context, this initializes it, sets the encryption
- * mode, and preprocesses the initialization vector and additional AEAD data.
- *
- ******************************************************************************/
- int gcm_start(gcm_context *ctx, // pointer to user-provided GCM context
- int mode, // GCM_ENCRYPT or GCM_DECRYPT
- const uchar *iv, // pointer to initialization vector
- size_t iv_len, // IV length in bytes (should == 12)
- const uchar *add, // ptr to additional AEAD data (NULL if none)
- size_t add_len) // length of additional AEAD data (bytes)
- {
- int ret; // our error return if the AES encrypt fails
- uchar work_buf[16]; // XOR source built from provided IV if len != 16
- const uchar *p; // general purpose array pointer
- size_t use_len; // byte count to process, up to 16 bytes
- size_t i; // local loop iterator
- // since the context might be reused under the same key
- // we zero the working buffers for this next new process
- memset(ctx->y, 0x00, sizeof(ctx->y));
- memset(ctx->buf, 0x00, sizeof(ctx->buf));
- ctx->len = 0;
- ctx->add_len = 0;
- ctx->mode = mode; // set the GCM encryption/decryption mode
- ctx->aes_ctx.mode = ENCRYPT; // GCM *always* runs AES in ENCRYPTION mode
- if (iv_len == 12) { // GCM natively uses a 12-byte, 96-bit IV
- memcpy(ctx->y, iv, iv_len); // copy the IV to the top of the 'y' buff
- ctx->y[15] = 1; // start "counting" from 1 (not 0)
- } else // if we don't have a 12-byte IV, we GHASH whatever we've been given
- {
- memset(work_buf, 0x00, 16); // clear the working buffer
- PUT_UINT32_BE(iv_len * 8, work_buf, 12); // place the IV into buffer
- p = iv;
- while (iv_len > 0) {
- use_len = (iv_len < 16) ? iv_len : 16;
- for (i = 0; i < use_len; i++) ctx->y[i] ^= p[i];
- gcm_mult(ctx, ctx->y, ctx->y);
- iv_len -= use_len;
- p += use_len;
- }
- for (i = 0; i < 16; i++) ctx->y[i] ^= work_buf[i];
- gcm_mult(ctx, ctx->y, ctx->y);
- }
- if ((ret = aes_cipher(&ctx->aes_ctx, ctx->y, ctx->base_ectr)) != 0)
- return (ret);
- ctx->add_len = add_len;
- p = add;
- while (add_len > 0) {
- use_len = (add_len < 16) ? add_len : 16;
- for (i = 0; i < use_len; i++) ctx->buf[i] ^= p[i];
- gcm_mult(ctx, ctx->buf, ctx->buf);
- add_len -= use_len;
- p += use_len;
- }
- return (0);
- }
- /******************************************************************************
- *
- * GCM_UPDATE
- *
- * This is called once or more to process bulk plaintext or ciphertext data.
- * We give this some number of bytes of input and it returns the same number
- * of output bytes. If called multiple times (which is fine) all but the final
- * invocation MUST be called with length mod 16 == 0. (Only the final call can
- * have a partial block length of < 128 bits.)
- *
- ******************************************************************************/
- int gcm_update(gcm_context *ctx, // pointer to user-provided GCM context
- size_t length, // length, in bytes, of data to process
- const uchar *input, // pointer to source data
- uchar *output) // pointer to destination data
- {
- int ret; // our error return if the AES encrypt fails
- uchar ectr[16]; // counter-mode cipher output for XORing
- size_t use_len; // byte count to process, up to 16 bytes
- size_t i; // local loop iterator
- ctx->len += length; // bump the GCM context's running length count
- while (length > 0) {
- // clamp the length to process at 16 bytes
- use_len = (length < 16) ? length : 16;
- // increment the context's 128-bit IV||Counter 'y' vector
- for (i = 16; i > 12; i--)
- if (++ctx->y[i - 1] != 0) break;
- // encrypt the context's 'y' vector under the established key
- if ((ret = aes_cipher(&ctx->aes_ctx, ctx->y, ectr)) != 0) return (ret);
- // encrypt or decrypt the input to the output
- if (ctx->mode == ENCRYPT) {
- for (i = 0; i < use_len; i++) {
- // XOR the cipher's ouptut vector (ectr) with our input
- output[i] = (uchar) (ectr[i] ^ input[i]);
- // now we mix in our data into the authentication hash.
- // if we're ENcrypting we XOR in the post-XOR (output)
- // results, but if we're DEcrypting we XOR in the input
- // data
- ctx->buf[i] ^= output[i];
- }
- } else {
- for (i = 0; i < use_len; i++) {
- // but if we're DEcrypting we XOR in the input data first,
- // i.e. before saving to ouput data, otherwise if the input
- // and output buffer are the same (inplace decryption) we
- // would not get the correct auth tag
- ctx->buf[i] ^= input[i];
- // XOR the cipher's ouptut vector (ectr) with our input
- output[i] = (uchar) (ectr[i] ^ input[i]);
- }
- }
- gcm_mult(ctx, ctx->buf, ctx->buf); // perform a GHASH operation
- length -= use_len; // drop the remaining byte count to process
- input += use_len; // bump our input pointer forward
- output += use_len; // bump our output pointer forward
- }
- return (0);
- }
- /******************************************************************************
- *
- * GCM_FINISH
- *
- * This is called once after all calls to GCM_UPDATE to finalize the GCM.
- * It performs the final GHASH to produce the resulting authentication TAG.
- *
- ******************************************************************************/
- int gcm_finish(gcm_context *ctx, // pointer to user-provided GCM context
- uchar *tag, // pointer to buffer which receives the tag
- size_t tag_len) // length, in bytes, of the tag-receiving buf
- {
- uchar work_buf[16];
- uint64_t orig_len = ctx->len * 8;
- uint64_t orig_add_len = ctx->add_len * 8;
- size_t i;
- if (tag_len != 0) memcpy(tag, ctx->base_ectr, tag_len);
- if (orig_len || orig_add_len) {
- memset(work_buf, 0x00, 16);
- PUT_UINT32_BE((orig_add_len >> 32), work_buf, 0);
- PUT_UINT32_BE((orig_add_len), work_buf, 4);
- PUT_UINT32_BE((orig_len >> 32), work_buf, 8);
- PUT_UINT32_BE((orig_len), work_buf, 12);
- for (i = 0; i < 16; i++) ctx->buf[i] ^= work_buf[i];
- gcm_mult(ctx, ctx->buf, ctx->buf);
- for (i = 0; i < tag_len; i++) tag[i] ^= ctx->buf[i];
- }
- return (0);
- }
- /******************************************************************************
- *
- * GCM_CRYPT_AND_TAG
- *
- * This either encrypts or decrypts the user-provided data and, either
- * way, generates an authentication tag of the requested length. It must be
- * called with a GCM context whose key has already been set with GCM_SETKEY.
- *
- * The user would typically call this explicitly to ENCRYPT a buffer of data
- * and optional associated data, and produce its an authentication tag.
- *
- * To reverse the process the user would typically call the companion
- * GCM_AUTH_DECRYPT function to decrypt data and verify a user-provided
- * authentication tag. The GCM_AUTH_DECRYPT function calls this function
- * to perform its decryption and tag generation, which it then compares.
- *
- ******************************************************************************/
- int gcm_crypt_and_tag(
- gcm_context *ctx, // gcm context with key already setup
- int mode, // cipher direction: GCM_ENCRYPT or GCM_DECRYPT
- const uchar *iv, // pointer to the 12-byte initialization vector
- size_t iv_len, // byte length if the IV. should always be 12
- const uchar *add, // pointer to the non-ciphered additional data
- size_t add_len, // byte length of the additional AEAD data
- const uchar *input, // pointer to the cipher data source
- uchar *output, // pointer to the cipher data destination
- size_t length, // byte length of the cipher data
- uchar *tag, // pointer to the tag to be generated
- size_t tag_len) // byte length of the tag to be generated
- { /*
- assuming that the caller has already invoked gcm_setkey to
- prepare the gcm context with the keying material, we simply
- invoke each of the three GCM sub-functions in turn...
- */
- gcm_start(ctx, mode, iv, iv_len, add, add_len);
- gcm_update(ctx, length, input, output);
- gcm_finish(ctx, tag, tag_len);
- return (0);
- }
- /******************************************************************************
- *
- * GCM_AUTH_DECRYPT
- *
- * This DECRYPTS a user-provided data buffer with optional associated data.
- * It then verifies a user-supplied authentication tag against the tag just
- * re-created during decryption to verify that the data has not been altered.
- *
- * This function calls GCM_CRYPT_AND_TAG (above) to perform the decryption
- * and authentication tag generation.
- *
- ******************************************************************************/
- int gcm_auth_decrypt(
- gcm_context *ctx, // gcm context with key already setup
- const uchar *iv, // pointer to the 12-byte initialization vector
- size_t iv_len, // byte length if the IV. should always be 12
- const uchar *add, // pointer to the non-ciphered additional data
- size_t add_len, // byte length of the additional AEAD data
- const uchar *input, // pointer to the cipher data source
- uchar *output, // pointer to the cipher data destination
- size_t length, // byte length of the cipher data
- const uchar *tag, // pointer to the tag to be authenticated
- size_t tag_len) // byte length of the tag <= 16
- {
- uchar check_tag[16]; // the tag generated and returned by decryption
- int diff; // an ORed flag to detect authentication errors
- size_t i; // our local iterator
- /*
- we use GCM_DECRYPT_AND_TAG (above) to perform our decryption
- (which is an identical XORing to reverse the previous one)
- and also to re-generate the matching authentication tag
- */
- gcm_crypt_and_tag(ctx, DECRYPT, iv, iv_len, add, add_len, input, output,
- length, check_tag, tag_len);
- // now we verify the authentication tag in 'constant time'
- for (diff = 0, i = 0; i < tag_len; i++) diff |= tag[i] ^ check_tag[i];
- if (diff != 0) { // see whether any bits differed?
- memset(output, 0, length); // if so... wipe the output data
- return (GCM_AUTH_FAILURE); // return GCM_AUTH_FAILURE
- }
- return (0);
- }
- /******************************************************************************
- *
- * GCM_ZERO_CTX
- *
- * The GCM context contains both the GCM context and the AES context.
- * This includes keying and key-related material which is security-
- * sensitive, so it MUST be zeroed after use. This function does that.
- *
- ******************************************************************************/
- void gcm_zero_ctx(gcm_context *ctx) {
- // zero the context originally provided to us
- memset(ctx, 0, sizeof(gcm_context));
- }
- //
- // aes-gcm.c
- // Pods
- //
- // Created by Markus Kosmal on 20/11/14.
- //
- //
- int aes_gcm_encrypt(unsigned char *output, //
- const unsigned char *input, size_t input_length,
- const unsigned char *key, const size_t key_len,
- const unsigned char *iv, const size_t iv_len,
- unsigned char *aead, size_t aead_len, unsigned char *tag,
- const size_t tag_len) {
- int ret = 0; // our return value
- gcm_context ctx; // includes the AES context structure
- gcm_setkey(&ctx, key, (const uint) key_len);
- ret = gcm_crypt_and_tag(&ctx, ENCRYPT, iv, iv_len, aead, aead_len, input, output,
- input_length, tag, tag_len);
- gcm_zero_ctx(&ctx);
- return (ret);
- }
- int aes_gcm_decrypt(unsigned char *output, const unsigned char *input,
- size_t input_length, const unsigned char *key,
- const size_t key_len, const unsigned char *iv,
- const size_t iv_len) {
- int ret = 0; // our return value
- gcm_context ctx; // includes the AES context structure
- size_t tag_len = 0;
- unsigned char *tag_buf = NULL;
- gcm_setkey(&ctx, key, (const uint) key_len);
- ret = gcm_crypt_and_tag(&ctx, DECRYPT, iv, iv_len, NULL, 0, input, output,
- input_length, tag_buf, tag_len);
- gcm_zero_ctx(&ctx);
- return (ret);
- }
- #endif
- // End of aes128 PD
- #ifdef MG_ENABLE_LINES
- #line 1 "src/tls_builtin.c"
- #endif
- #if MG_TLS == MG_TLS_BUILTIN
- // handshake is re-entrant, so we need to keep track of its state
- enum mg_tls_hs_state {
- MG_TLS_HS_CLIENT_HELLO, // first, wait for ClientHello
- MG_TLS_HS_SERVER_HELLO, // then, send all server handshake data at once
- MG_TLS_HS_CLIENT_CHANGE_CIPHER, // finally wait for ClientChangeCipher
- MG_TLS_HS_CLIENT_FINISH, // and ClientFinish (encrypted)
- MG_TLS_HS_DONE, // finish handshake, start application data flow
- };
- // per-connection TLS data
- struct tls_data {
- enum mg_tls_hs_state state; // keep track of connection handshake progress
- struct mg_iobuf send; // For the receive path, we're reusing c->rtls
- mg_sha256_ctx sha256; // incremental SHA-256 hash for TLS handshake
- uint32_t sseq; // server sequence number, used in encryption
- uint32_t cseq; // client sequence number, used in decryption
- uint8_t session_id[32]; // client session ID between the handshake states
- uint8_t x25519_cli[32]; // client X25519 key between the handshake states
- uint8_t x25519_sec[32]; // x25519 secret between the handshake states
- struct mg_str server_cert_der; // server certificate in DER format
- uint8_t server_key[32]; // server EC private key
- // keys for AES encryption
- uint8_t handshake_secret[32];
- uint8_t server_write_key[16];
- uint8_t server_write_iv[12];
- uint8_t server_finished_key[32];
- uint8_t client_write_key[16];
- uint8_t client_write_iv[12];
- uint8_t client_finished_key[32];
- };
- #define MG_LOAD_BE16(p) ((uint16_t) ((MG_U8P(p)[0] << 8U) | MG_U8P(p)[1]))
- #define TLS_HDR_SIZE 5 // 1 byte type, 2 bytes version, 2 bytes len
- // for derived tls keys we need SHA256([0]*32)
- static uint8_t zeros[32] = {0};
- static uint8_t zeros_sha256_digest[32] =
- "\xe3\xb0\xc4\x42\x98\xfc\x1c\x14\x9a\xfb\xf4\xc8\x99\x6f\xb9\x24"
- "\x27\xae\x41\xe4\x64\x9b\x93\x4c\xa4\x95\x99\x1b\x78\x52\xb8\x55";
- #define X25519_BYTES 32
- const uint8_t X25519_BASE_POINT[X25519_BYTES] = {9};
- #define X25519_WBITS 32
- typedef uint32_t limb_t;
- typedef uint64_t dlimb_t;
- typedef int64_t sdlimb_t;
- #define LIMB(x) (uint32_t)(x##ull), (uint32_t) ((x##ull) >> 32)
- #define NLIMBS (256 / X25519_WBITS)
- typedef limb_t fe[NLIMBS];
- static limb_t umaal(limb_t *carry, limb_t acc, limb_t mand, limb_t mier) {
- dlimb_t tmp = (dlimb_t) mand * mier + acc + *carry;
- *carry = (limb_t) (tmp >> X25519_WBITS);
- return (limb_t) tmp;
- }
- // These functions are implemented in terms of umaal on ARM
- static limb_t adc(limb_t *carry, limb_t acc, limb_t mand) {
- dlimb_t total = (dlimb_t) *carry + acc + mand;
- *carry = (limb_t) (total >> X25519_WBITS);
- return (limb_t) total;
- }
- static limb_t adc0(limb_t *carry, limb_t acc) {
- dlimb_t total = (dlimb_t) *carry + acc;
- *carry = (limb_t) (total >> X25519_WBITS);
- return (limb_t) total;
- }
- // - Precondition: carry is small.
- // - Invariant: result of propagate is < 2^255 + 1 word
- // - In particular, always less than 2p.
- // - Also, output x >= min(x,19)
- static void propagate(fe x, limb_t over) {
- unsigned i;
- limb_t carry;
- over = x[NLIMBS - 1] >> (X25519_WBITS - 1) | over << 1;
- x[NLIMBS - 1] &= ~((limb_t) 1 << (X25519_WBITS - 1));
- carry = over * 19;
- for (i = 0; i < NLIMBS; i++) {
- x[i] = adc0(&carry, x[i]);
- }
- }
- static void add(fe out, const fe a, const fe b) {
- unsigned i;
- limb_t carry = 0;
- for (i = 0; i < NLIMBS; i++) {
- out[i] = adc(&carry, a[i], b[i]);
- }
- propagate(out, carry);
- }
- static void sub(fe out, const fe a, const fe b) {
- unsigned i;
- sdlimb_t carry = -38;
- for (i = 0; i < NLIMBS; i++) {
- carry = carry + a[i] - b[i];
- out[i] = (limb_t) carry;
- carry >>= X25519_WBITS;
- }
- propagate(out, (limb_t) (1 + carry));
- }
- static void mul(fe out, const fe a, const fe b, unsigned nb) {
- limb_t accum[2 * NLIMBS] = {0};
- unsigned i, j;
- limb_t carry2;
- for (i = 0; i < nb; i++) {
- limb_t mand = b[i];
- carry2 = 0;
- for (j = 0; j < NLIMBS; j++) {
- accum[i + j] = umaal(&carry2, accum[i + j], mand, a[j]);
- }
- accum[i + j] = carry2;
- }
- carry2 = 0;
- for (j = 0; j < NLIMBS; j++) {
- out[j] = umaal(&carry2, accum[j], 38, accum[j + NLIMBS]);
- }
- propagate(out, carry2);
- }
- static void sqr(fe out, const fe a) {
- mul(out, a, a, NLIMBS);
- }
- static void mul1(fe out, const fe a) {
- mul(out, a, out, NLIMBS);
- }
- static void sqr1(fe a) {
- mul1(a, a);
- }
- static void condswap(limb_t a[2 * NLIMBS], limb_t b[2 * NLIMBS],
- limb_t doswap) {
- unsigned i;
- for (i = 0; i < 2 * NLIMBS; i++) {
- limb_t xor = (a[i] ^ b[i]) & doswap;
- a[i] ^= xor;
- b[i] ^= xor;
- }
- }
- // Canonicalize a field element x, reducing it to the least residue which is
- // congruent to it mod 2^255-19
- // - Precondition: x < 2^255 + 1 word
- static limb_t canon(fe x) {
- // First, add 19.
- unsigned i;
- limb_t carry0 = 19;
- limb_t res;
- sdlimb_t carry;
- for (i = 0; i < NLIMBS; i++) {
- x[i] = adc0(&carry0, x[i]);
- }
- propagate(x, carry0);
- // Here, 19 <= x2 < 2^255
- // - This is because we added 19, so before propagate it can't be less
- // than 19. After propagate, it still can't be less than 19, because if
- // propagate does anything it adds 19.
- // - We know that the high bit must be clear, because either the input was ~
- // 2^255 + one word + 19 (in which case it propagates to at most 2 words) or
- // it was < 2^255. So now, if we subtract 19, we will get back to something in
- // [0,2^255-19).
- carry = -19;
- res = 0;
- for (i = 0; i < NLIMBS; i++) {
- carry += x[i];
- res |= x[i] = (limb_t) carry;
- carry >>= X25519_WBITS;
- }
- return (limb_t) (((dlimb_t) res - 1) >> X25519_WBITS);
- }
- static const limb_t a24[1] = {121665};
- static void ladder_part1(fe xs[5]) {
- limb_t *x2 = xs[0], *z2 = xs[1], *x3 = xs[2], *z3 = xs[3], *t1 = xs[4];
- add(t1, x2, z2); // t1 = A
- sub(z2, x2, z2); // z2 = B
- add(x2, x3, z3); // x2 = C
- sub(z3, x3, z3); // z3 = D
- mul1(z3, t1); // z3 = DA
- mul1(x2, z2); // x3 = BC
- add(x3, z3, x2); // x3 = DA+CB
- sub(z3, z3, x2); // z3 = DA-CB
- sqr1(t1); // t1 = AA
- sqr1(z2); // z2 = BB
- sub(x2, t1, z2); // x2 = E = AA-BB
- mul(z2, x2, a24, sizeof(a24) / sizeof(a24[0])); // z2 = E*a24
- add(z2, z2, t1); // z2 = E*a24 + AA
- }
- static void ladder_part2(fe xs[5], const fe x1) {
- limb_t *x2 = xs[0], *z2 = xs[1], *x3 = xs[2], *z3 = xs[3], *t1 = xs[4];
- sqr1(z3); // z3 = (DA-CB)^2
- mul1(z3, x1); // z3 = x1 * (DA-CB)^2
- sqr1(x3); // x3 = (DA+CB)^2
- mul1(z2, x2); // z2 = AA*(E*a24+AA)
- sub(x2, t1, x2); // x2 = BB again
- mul1(x2, t1); // x2 = AA*BB
- }
- static void x25519_core(fe xs[5], const uint8_t scalar[X25519_BYTES],
- const uint8_t *x1, int clamp) {
- int i;
- limb_t swap = 0;
- limb_t *x2 = xs[0], *x3 = xs[2], *z3 = xs[3];
- memset(xs, 0, 4 * sizeof(fe));
- x2[0] = z3[0] = 1;
- memcpy(x3, x1, sizeof(fe));
- for (i = 255; i >= 0; i--) {
- uint8_t bytei = scalar[i / 8];
- limb_t doswap;
- if (clamp) {
- if (i / 8 == 0) {
- bytei &= (uint8_t) ~7U;
- } else if (i / 8 == X25519_BYTES - 1) {
- bytei &= 0x7F;
- bytei |= 0x40;
- }
- }
- doswap = 0 - (limb_t) ((bytei >> (i % 8)) & 1);
- condswap(x2, x3, swap ^ doswap);
- swap = doswap;
- ladder_part1(xs);
- ladder_part2(xs, (const limb_t *) x1);
- }
- condswap(x2, x3, swap);
- }
- static int x25519(uint8_t out[X25519_BYTES], const uint8_t scalar[X25519_BYTES],
- const uint8_t x1[X25519_BYTES], int clamp) {
- int i, ret;
- fe xs[5];
- limb_t *x2, *z2, *z3, *prev;
- static const struct {
- uint8_t a, c, n;
- } steps[13] = {{2, 1, 1}, {2, 1, 1}, {4, 2, 3}, {2, 4, 6}, {3, 1, 1},
- {3, 2, 12}, {4, 3, 25}, {2, 3, 25}, {2, 4, 50}, {3, 2, 125},
- {3, 1, 2}, {3, 1, 2}, {3, 1, 1}};
- x25519_core(xs, scalar, x1, clamp);
- // Precomputed inversion chain
- x2 = xs[0];
- z2 = xs[1];
- z3 = xs[3];
- prev = z2;
- for (i = 0; i < 13; i++) {
- int j;
- limb_t *a = xs[steps[i].a];
- for (j = steps[i].n; j > 0; j--) {
- sqr(a, prev);
- prev = a;
- }
- mul1(a, xs[steps[i].c]);
- }
- // Here prev = z3
- // x2 /= z2
- mul((limb_t *) out, x2, z3, NLIMBS);
- ret = (int) canon((limb_t *) out);
- if (!clamp) ret = 0;
- return ret;
- }
- // helper to hexdump buffers inline
- static void mg_tls_hexdump(const char *msg, uint8_t *buf, size_t bufsz) {
- char p[2048];
- MG_INFO(("%s: %s", msg, mg_hex(buf, bufsz, p)));
- }
- // TLS1.3 secret derivation based on the key label
- static void mg_tls_derive_secret(const char *label, uint8_t *key, size_t keysz,
- uint8_t *data, size_t datasz, uint8_t *hash,
- size_t hashsz) {
- size_t labelsz = strlen(label);
- uint8_t secret[32];
- uint8_t packed[256] = {0, (uint8_t) hashsz, (uint8_t) labelsz};
- // TODO: assert lengths of label, key, data and hash
- memmove(packed + 3, label, labelsz);
- packed[3 + labelsz] = (uint8_t) datasz;
- memmove(packed + labelsz + 4, data, datasz);
- packed[4 + labelsz + datasz] = 1;
- mg_hmac_sha256(secret, key, keysz, packed, 5 + labelsz + datasz);
- memmove(hash, secret, hashsz);
- }
- // Did we receive a full TLS message in the c->rtls buffer?
- static bool mg_tls_got_msg(struct mg_connection *c) {
- return c->rtls.len >= TLS_HDR_SIZE &&
- c->rtls.len >= (TLS_HDR_SIZE + MG_LOAD_BE16(c->rtls.buf + 3));
- }
- // Remove a single TLS record from the recv buffer
- static void mg_tls_drop_packet(struct mg_iobuf *rio) {
- uint16_t n = MG_LOAD_BE16(rio->buf + 3) + TLS_HDR_SIZE;
- mg_iobuf_del(rio, 0, n);
- }
- // read and parse ClientHello record
- static int mg_tls_client_hello(struct mg_connection *c) {
- struct tls_data *tls = c->tls;
- struct mg_iobuf *rio = &c->rtls;
- uint8_t session_id_len;
- uint16_t j;
- uint16_t cipher_suites_len;
- uint16_t ext_len;
- uint8_t *ext;
- if (!mg_tls_got_msg(c)) {
- return MG_IO_WAIT;
- }
- if (rio->buf[0] != 0x16 || rio->buf[5] != 0x01) {
- mg_error(c, "not a hello packet");
- return -1;
- }
- mg_sha256_update(&tls->sha256, rio->buf + 5, rio->len - 5);
- session_id_len = rio->buf[43];
- if (session_id_len == sizeof(tls->session_id)) {
- memmove(tls->session_id, rio->buf + 44, session_id_len);
- } else if (session_id_len != 0) {
- MG_INFO(("bad session id len"));
- }
- cipher_suites_len = MG_LOAD_BE16(rio->buf + 44 + session_id_len);
- ext_len = MG_LOAD_BE16(rio->buf + 48 + session_id_len + cipher_suites_len);
- ext = rio->buf + 50 + session_id_len + cipher_suites_len;
- for (j = 0; j < ext_len;) {
- uint16_t k;
- uint16_t key_exchange_len;
- uint8_t *key_exchange;
- uint16_t n = MG_LOAD_BE16(ext + j + 2);
- if (ext[j] != 0x00 ||
- ext[j + 1] != 0x33) { // not a key share extension, ignore
- j += (uint16_t) (n + 4);
- continue;
- }
- key_exchange_len = MG_LOAD_BE16(ext + j + 5);
- key_exchange = ext + j + 6;
- for (k = 0; k < key_exchange_len;) {
- uint16_t m = MG_LOAD_BE16(key_exchange + k + 2);
- if (m == 32 && key_exchange[k] == 0x00 && key_exchange[k + 1] == 0x1d) {
- memmove(tls->x25519_cli, key_exchange + k + 4, m);
- mg_tls_drop_packet(rio);
- return 0;
- }
- k += (uint16_t) (m + 4);
- }
- j += (uint16_t) (n + 4);
- }
- mg_error(c, "bad client hello");
- return -1;
- }
- // put ServerHello record into wio buffer
- static void mg_tls_server_hello(struct mg_connection *c) {
- struct tls_data *tls = c->tls;
- struct mg_iobuf *wio = &tls->send;
- uint8_t msg_server_hello[122] =
- // server hello, tls 1.2
- "\x02\x00\x00\x76\x03\x03"
- // random (32 bytes)
- "\xfe\xfe\xfe\xfe\xfe\xfe\xfe\xfe\xfe\xfe\xfe\xfe\xfe\xfe\xfe\xfe"
- "\xfe\xfe\xfe\xfe\xfe\xfe\xfe\xfe\xfe\xfe\xfe\xfe\xfe\xfe\xfe\xfe"
- // session ID length + session ID (32 bytes)
- "\x20"
- "\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"
- "\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"
- #if defined(CHACHA20) && CHACHA20
- // TLS_CHACHA20_POLY1305_SHA256 + no compression
- "\x13\x03\x00"
- #else
- // TLS_AES_128_GCM_SHA256 + no compression
- "\x13\x01\x00"
- #endif
- // extensions + keyshare
- "\x00\x2e\x00\x33\x00\x24\x00\x1d\x00\x20"
- // x25519 keyshare
- "\xab\xab\xab\xab\xab\xab\xab\xab\xab\xab\xab\xab\xab\xab\xab\xab"
- "\xab\xab\xab\xab\xab\xab\xab\xab\xab\xab\xab\xab\xab\xab\xab\xab"
- // supported versions (tls1.3 == 0x304)
- "\x00\x2b\x00\x02\x03\x04";
- // calculate keyshare
- uint8_t x25519_pub[X25519_BYTES];
- uint8_t x25519_prv[X25519_BYTES];
- mg_random(x25519_prv, sizeof(x25519_prv));
- x25519(x25519_pub, x25519_prv, X25519_BASE_POINT, 1);
- x25519(tls->x25519_sec, x25519_prv, tls->x25519_cli, 1);
- mg_tls_hexdump("x25519 sec", tls->x25519_sec, sizeof(tls->x25519_sec));
- // fill in the gaps: session ID + keyshare
- memmove(msg_server_hello + 39, tls->session_id, sizeof(tls->session_id));
- memmove(msg_server_hello + 84, x25519_pub, sizeof(x25519_pub));
- // server hello message
- mg_iobuf_add(wio, wio->len, "\x16\x03\x03\x00\x7a", 5);
- mg_iobuf_add(wio, wio->len, msg_server_hello, sizeof(msg_server_hello));
- mg_sha256_update(&tls->sha256, msg_server_hello, sizeof(msg_server_hello));
- // change cipher message
- mg_iobuf_add(wio, wio->len, "\x14\x03\x03\x00\x01\x01", 6);
- }
- // at this point we have x25519 shared secret, we can generate a set of derived
- // handshake encryption keys
- static void mg_tls_generate_handshake_keys(struct mg_connection *c) {
- struct tls_data *tls = c->tls;
- mg_sha256_ctx sha256;
- uint8_t early_secret[32];
- uint8_t pre_extract_secret[32];
- uint8_t hello_hash[32];
- uint8_t server_hs_secret[32];
- uint8_t client_hs_secret[32];
- mg_hmac_sha256(early_secret, NULL, 0, zeros, sizeof(zeros));
- mg_tls_derive_secret("tls13 derived", early_secret, 32, zeros_sha256_digest,
- 32, pre_extract_secret, 32);
- mg_hmac_sha256(tls->handshake_secret, pre_extract_secret,
- sizeof(pre_extract_secret), tls->x25519_sec,
- sizeof(tls->x25519_sec));
- mg_tls_hexdump("hs secret", tls->handshake_secret, 32);
- // mg_sha256_final is not idempotent, need to copy sha256 context to calculate
- // the digest
- memmove(&sha256, &tls->sha256, sizeof(mg_sha256_ctx));
- mg_sha256_final(hello_hash, &sha256);
- // derive keys needed for the rest of the handshake
- mg_tls_derive_secret("tls13 s hs traffic", tls->handshake_secret, 32,
- hello_hash, 32, server_hs_secret, 32);
- mg_tls_derive_secret("tls13 key", server_hs_secret, 32, NULL, 0,
- tls->server_write_key, 16);
- mg_tls_derive_secret("tls13 iv", server_hs_secret, 32, NULL, 0,
- tls->server_write_iv, 12);
- mg_tls_derive_secret("tls13 finished", server_hs_secret, 32, NULL, 0,
- tls->server_finished_key, 32);
- mg_tls_hexdump("s hs traffic", server_hs_secret, 32);
- mg_tls_derive_secret("tls13 c hs traffic", tls->handshake_secret, 32,
- hello_hash, 32, client_hs_secret, 32);
- mg_tls_derive_secret("tls13 key", client_hs_secret, 32, NULL, 0,
- tls->client_write_key, 16);
- mg_tls_derive_secret("tls13 iv", client_hs_secret, 32, NULL, 0,
- tls->client_write_iv, 12);
- mg_tls_derive_secret("tls13 finished", client_hs_secret, 32, NULL, 0,
- tls->client_finished_key, 32);
- }
- // AES GCM encryption of the message + put encoded data into the write buffer
- static void mg_tls_encrypt(struct mg_connection *c, const uint8_t *msg,
- size_t msgsz, uint8_t msgtype) {
- struct tls_data *tls = c->tls;
- struct mg_iobuf *wio = &tls->send;
- uint8_t *outmsg;
- uint8_t *tag;
- size_t encsz = msgsz + 16 + 1;
- uint8_t hdr[5] = {0x17, 0x03, 0x03, (encsz >> 8) & 0xff, encsz & 0xff};
- uint8_t associated_data[5] = {0x17, 0x03, 0x03, (encsz >> 8) & 0xff,
- encsz & 0xff};
- uint8_t nonce[12];
- memmove(nonce, tls->server_write_iv, sizeof(tls->server_write_iv));
- nonce[8] ^= (uint8_t) ((tls->sseq >> 24) & 255U);
- nonce[9] ^= (uint8_t) ((tls->sseq >> 16) & 255U);
- nonce[10] ^= (uint8_t) ((tls->sseq >> 8) & 255U);
- nonce[11] ^= (uint8_t) ((tls->sseq) & 255U);
- gcm_initialize();
- mg_iobuf_add(wio, wio->len, hdr, sizeof(hdr));
- mg_iobuf_resize(wio, wio->len + encsz);
- outmsg = wio->buf + wio->len;
- tag = wio->buf + wio->len + msgsz + 1;
- memmove(outmsg, msg, msgsz);
- outmsg[msgsz] = msgtype;
- aes_gcm_encrypt(outmsg, outmsg, msgsz + 1, tls->server_write_key,
- sizeof(tls->server_write_key), nonce, sizeof(nonce),
- associated_data, sizeof(associated_data), tag, 16);
- wio->len += encsz;
- tls->sseq++;
- }
- // read an encrypted message, decrypt it into read buffer (AES GCM)
- static int mg_tls_recv_decrypt(struct mg_connection *c, void *buf,
- size_t bufsz) {
- struct tls_data *tls = c->tls;
- struct mg_iobuf *rio = &c->rtls;
- // struct mg_iobuf *rio = &tls->recv;
- uint16_t msgsz;
- uint8_t *msg;
- uint8_t nonce[12];
- int r;
- for (;;) {
- if (!mg_tls_got_msg(c)) {
- return MG_IO_WAIT;
- }
- if (rio->buf[0] == 0x17) {
- break;
- } else if (rio->buf[0] == 0x15) {
- MG_INFO(("TLS ALERT packet received")); // TODO: drop packet?
- } else {
- mg_error(c, "unexpected packet");
- return -1;
- }
- }
- msgsz = MG_LOAD_BE16(rio->buf + 3);
- msg = rio->buf + 5;
- memmove(nonce, tls->client_write_iv, sizeof(tls->client_write_iv));
- nonce[8] ^= (uint8_t) ((tls->cseq >> 24) & 255U);
- nonce[9] ^= (uint8_t) ((tls->cseq >> 16) & 255U);
- nonce[10] ^= (uint8_t) ((tls->cseq >> 8) & 255U);
- nonce[11] ^= (uint8_t) ((tls->cseq) & 255U);
- aes_gcm_decrypt(msg, msg, msgsz - 16, tls->client_write_key,
- sizeof(tls->client_write_key), nonce, sizeof(nonce));
- r = msgsz - 16 - 1;
- if (msg[r] == 0x17) {
- if (bufsz > 0) {
- memmove(buf, msg, msgsz - 16);
- }
- } else {
- r = 0;
- }
- tls->cseq++;
- mg_tls_drop_packet(rio);
- return r;
- }
- static void mg_tls_server_extensions(struct mg_connection *c) {
- struct tls_data *tls = c->tls;
- // server extensions
- uint8_t ext[6] = {0x08, 0, 0, 2, 0, 0};
- mg_sha256_update(&tls->sha256, ext, sizeof(ext));
- mg_tls_encrypt(c, ext, sizeof(ext), 0x16);
- }
- static void mg_tls_server_cert(struct mg_connection *c) {
- struct tls_data *tls = c->tls;
- // server DER certificate (empty)
- size_t n = tls->server_cert_der.len;
- uint8_t *cert = calloc(1, 13 + n); // FIXME: free
- cert[0] = 0x0b; // handshake header
- cert[1] = (uint8_t) (((n + 9) >> 16) & 255U); // 3 bytes: payload length
- cert[2] = (uint8_t) (((n + 9) >> 8) & 255U);
- cert[3] = (uint8_t) ((n + 9) & 255U);
- cert[4] = 0; // request context
- cert[5] = (uint8_t) (((n + 5) >> 16) & 255U); // 3 bytes: cert (s) length
- cert[6] = (uint8_t) (((n + 5) >> 8) & 255U);
- cert[7] = (uint8_t) ((n + 5) & 255U);
- cert[8] =
- (uint8_t) (((n) >> 16) & 255U); // 3 bytes: first (and only) cert len
- cert[9] = (uint8_t) (((n) >> 8) & 255U);
- cert[10] = (uint8_t) (n & 255U);
- // bytes 11+ are certificate in DER format
- memmove(cert + 11, tls->server_cert_der.ptr, n);
- cert[11 + n] = cert[12 + n] = 0; // certificate extensions (none)
- mg_sha256_update(&tls->sha256, cert, 13 + n);
- mg_tls_encrypt(c, cert, 13 + n, 0x16);
- }
- // type adapter between uECC hash context and our sha256 implementation
- typedef struct SHA256_HashContext {
- uECC_HashContext uECC;
- mg_sha256_ctx ctx;
- } SHA256_HashContext;
- static void init_SHA256(const uECC_HashContext *base) {
- SHA256_HashContext *c = (SHA256_HashContext *) base;
- mg_sha256_init(&c->ctx);
- }
- static void update_SHA256(const uECC_HashContext *base, const uint8_t *message,
- unsigned message_size) {
- SHA256_HashContext *c = (SHA256_HashContext *) base;
- mg_sha256_update(&c->ctx, message, message_size);
- }
- static void finish_SHA256(const uECC_HashContext *base, uint8_t *hash_result) {
- SHA256_HashContext *c = (SHA256_HashContext *) base;
- mg_sha256_final(hash_result, &c->ctx);
- }
- static void mg_tls_server_verify_ecdsa(struct mg_connection *c) {
- struct tls_data *tls = c->tls;
- // server certificate verify packet
- uint8_t verify[82] = {0x0f, 0x00, 0x00, 0x00, 0x04, 0x03, 0x00, 0x00};
- size_t sigsz, verifysz = 0;
- uint8_t hash[32] = {0}, tmp[2 * 32 + 64] = {0};
- struct SHA256_HashContext ctx = {
- {&init_SHA256, &update_SHA256, &finish_SHA256, 64, 32, tmp},
- {{0}, 0, 0, {0}}};
- int neg1, neg2;
- uint8_t sig[64], sig_content[130] = {
- " "
- " "
- "TLS 1.3, server CertificateVerify\0"};
- mg_sha256_ctx sha256;
- memmove(&sha256, &tls->sha256, sizeof(mg_sha256_ctx));
- mg_sha256_final(sig_content + 98, &sha256);
- mg_sha256_init(&sha256);
- mg_sha256_update(&sha256, sig_content, sizeof(sig_content));
- mg_sha256_final(hash, &sha256);
- uECC_sign_deterministic(tls->server_key, hash, sizeof(hash), &ctx.uECC, sig,
- uECC_secp256r1());
- neg1 = !!(sig[0] & 0x80);
- neg2 = !!(sig[32] & 0x80);
- verify[8] = 0x30; // ASN.1 SEQUENCE
- verify[9] = (uint8_t) (68 + neg1 + neg2);
- verify[10] = 0x02; // ASN.1 INTEGER
- verify[11] = (uint8_t) (32 + neg1);
- memmove(verify + 12 + neg1, sig, 32);
- verify[12 + 32 + neg1] = 0x02; // ASN.1 INTEGER
- verify[13 + 32 + neg1] = (uint8_t) (32 + neg2);
- memmove(verify + 14 + 32 + neg1 + neg2, sig + 32, 32);
- sigsz = (size_t) (70 + neg1 + neg2);
- verifysz = 8U + sigsz;
- verify[3] = (uint8_t) (sigsz + 4);
- verify[7] = (uint8_t) sigsz;
- mg_tls_hexdump("verify", verify, verifysz);
- mg_sha256_update(&tls->sha256, verify, verifysz);
- mg_tls_encrypt(c, verify, verifysz, 0x16);
- }
- static void mg_tls_server_finish(struct mg_connection *c) {
- struct tls_data *tls = c->tls;
- struct mg_iobuf *wio = &tls->send;
- mg_sha256_ctx sha256;
- uint8_t hash[32];
- uint8_t finish[36] = {0x14, 0, 0, 32};
- memmove(&sha256, &tls->sha256, sizeof(mg_sha256_ctx));
- mg_sha256_final(hash, &sha256);
- mg_hmac_sha256(finish + 4, tls->server_finished_key, 32, hash, 32);
- mg_tls_hexdump("hash", hash, sizeof(hash));
- mg_tls_hexdump("key", tls->server_finished_key,
- sizeof(tls->server_finished_key));
- mg_tls_encrypt(c, finish, sizeof(finish), 0x16);
- mg_io_send(c, wio->buf, wio->len);
- wio->len = 0;
- mg_sha256_update(&tls->sha256, finish, sizeof(finish));
- }
- static int mg_tls_client_change_cipher(struct mg_connection *c) {
- // struct tls_data *tls = c->tls;
- struct mg_iobuf *rio = &c->rtls;
- for (;;) {
- if (!mg_tls_got_msg(c)) {
- return MG_IO_WAIT;
- }
- if (rio->buf[0] == 0x14) { // got a ChangeCipher record
- break;
- } else if (rio->buf[0] == 0x15) { // skip Alert records
- MG_DEBUG(("TLS ALERT packet received"));
- mg_tls_drop_packet(rio);
- } else {
- mg_error(c, "unexpected packet");
- return MG_IO_ERR;
- }
- }
- // consume ChangeCipher packet
- mg_tls_drop_packet(rio);
- return 0;
- }
- static int mg_tls_client_finish(struct mg_connection *c) {
- uint8_t tmp[2048];
- int n = mg_tls_recv_decrypt(c, tmp, sizeof(tmp));
- if (n < 0) {
- return -1;
- }
- // TODO: make sure it's a ClientFinish record
- return 0;
- }
- static void mg_tls_generate_application_keys(struct mg_connection *c) {
- struct tls_data *tls = c->tls;
- uint8_t hash[32];
- uint8_t premaster_secret[32];
- uint8_t master_secret[32];
- uint8_t server_secret[32];
- uint8_t client_secret[32];
- mg_sha256_ctx sha256;
- memmove(&sha256, &tls->sha256, sizeof(mg_sha256_ctx));
- mg_sha256_final(hash, &sha256);
- mg_tls_derive_secret("tls13 derived", tls->handshake_secret, 32,
- zeros_sha256_digest, 32, premaster_secret, 32);
- mg_hmac_sha256(master_secret, premaster_secret, 32, zeros, 32);
- mg_tls_derive_secret("tls13 s ap traffic", master_secret, 32, hash, 32,
- server_secret, 32);
- mg_tls_derive_secret("tls13 key", server_secret, 32, NULL, 0,
- tls->server_write_key, 16);
- mg_tls_derive_secret("tls13 iv", server_secret, 32, NULL, 0,
- tls->server_write_iv, 12);
- mg_tls_derive_secret("tls13 c ap traffic", master_secret, 32, hash, 32,
- client_secret, 32);
- mg_tls_derive_secret("tls13 key", client_secret, 32, NULL, 0,
- tls->client_write_key, 16);
- mg_tls_derive_secret("tls13 iv", client_secret, 32, NULL, 0,
- tls->client_write_iv, 12);
- tls->sseq = tls->cseq = 0;
- }
- void mg_tls_handshake(struct mg_connection *c) {
- struct tls_data *tls = c->tls;
- switch (tls->state) {
- case MG_TLS_HS_CLIENT_HELLO:
- if (mg_tls_client_hello(c) < 0) {
- return;
- }
- tls->state = MG_TLS_HS_SERVER_HELLO;
- // fallthrough
- case MG_TLS_HS_SERVER_HELLO:
- mg_tls_server_hello(c);
- mg_tls_generate_handshake_keys(c);
- mg_tls_server_extensions(c);
- mg_tls_server_cert(c);
- mg_tls_server_verify_ecdsa(c);
- mg_tls_server_finish(c);
- tls->state = MG_TLS_HS_CLIENT_CHANGE_CIPHER;
- // fallthrough
- case MG_TLS_HS_CLIENT_CHANGE_CIPHER:
- if (mg_tls_client_change_cipher(c) < 0) {
- return;
- }
- tls->state = MG_TLS_HS_CLIENT_FINISH;
- // fallthrough
- case MG_TLS_HS_CLIENT_FINISH:
- if (mg_tls_client_finish(c) < 0) {
- return;
- }
- mg_tls_generate_application_keys(c);
- tls->state = MG_TLS_HS_DONE;
- // fallthrough
- case MG_TLS_HS_DONE: c->is_tls_hs = 0; return;
- }
- }
- static int mg_parse_pem(const struct mg_str pem, const struct mg_str label,
- struct mg_str *der) {
- size_t n = 0, m = 0;
- char *s;
- const char *c;
- struct mg_str caps[5];
- if (!mg_match(pem, mg_str("#-----BEGIN #-----#-----END #-----#"), caps)) {
- *der = mg_strdup(pem);
- return 0;
- }
- if (mg_strcmp(caps[1], label) != 0 || mg_strcmp(caps[3], label) != 0) {
- return -1; // bad label
- }
- if ((s = calloc(1, caps[2].len)) == NULL) {
- return -1;
- }
- for (c = caps[2].ptr; c < caps[2].ptr + caps[2].len; c++) {
- if (*c == ' ' || *c == '\n' || *c == '\r' || *c == '\t') {
- continue;
- }
- s[n++] = *c;
- }
- m = mg_base64_decode(s, n, s, n);
- if (m == 0) {
- free(s);
- return -1;
- }
- der->ptr = s;
- der->len = m;
- return 0;
- }
- void mg_tls_init(struct mg_connection *c, const struct mg_tls_opts *opts) {
- struct mg_str key;
- struct tls_data *tls = (struct tls_data *) calloc(1, sizeof(struct tls_data));
- if (tls == NULL) {
- mg_error(c, "tls oom");
- return;
- }
- // parse PEM or DER EC key
- if (opts->key.ptr == NULL ||
- mg_parse_pem(opts->key, mg_str_s("EC PRIVATE KEY"), &key) < 0) {
- MG_ERROR(("Failed to load EC private key"));
- return;
- }
- if (key.len < 39) {
- MG_ERROR(("EC private key too short"));
- return;
- }
- // expect ASN.1 SEQUENCE=[INTEGER=1, BITSTRING of 32 bytes, ...]
- // 30 nn 02 01 01 04 20 [key] ...
- if (key.ptr[0] != 0x30 || (key.ptr[1] & 0x80) != 0) {
- MG_ERROR(("EC private key: ASN.1 bad sequence"));
- return;
- }
- if (memcmp(key.ptr + 2, "\x02\x01\x01\x04\x20", 5) != 0) {
- MG_ERROR(("EC private key: ASN.1 bad data"));
- }
- memmove(tls->server_key, key.ptr + 7, 32);
- free((void *) key.ptr);
- // parse PEM or DER certificate
- if (mg_parse_pem(opts->cert, mg_str_s("CERTIFICATE"), &tls->server_cert_der) <
- 0) {
- MG_ERROR(("Failed to load certificate"));
- return;
- }
- // tls->send.align = tls->recv.align = MG_IO_SIZE;
- tls->send.align = MG_IO_SIZE;
- c->tls = tls;
- c->is_tls = c->is_tls_hs = 1;
- mg_sha256_init(&tls->sha256);
- }
- void mg_tls_free(struct mg_connection *c) {
- struct tls_data *tls = c->tls;
- if (tls != NULL) {
- mg_iobuf_free(&tls->send);
- free((void *) tls->server_cert_der.ptr);
- }
- free(c->tls);
- c->tls = NULL;
- }
- long mg_tls_send(struct mg_connection *c, const void *buf, size_t len) {
- struct tls_data *tls = c->tls;
- long n = MG_IO_WAIT;
- if (len > MG_IO_SIZE) len = MG_IO_SIZE;
- mg_tls_encrypt(c, buf, len, 0x17);
- while (tls->send.len > 0 &&
- (n = mg_io_send(c, tls->send.buf, tls->send.len)) > 0) {
- mg_iobuf_del(&tls->send, 0, (size_t) n);
- }
- if (n == MG_IO_ERR || n == MG_IO_WAIT) return n;
- return (long) len;
- }
- long mg_tls_recv(struct mg_connection *c, void *buf, size_t len) {
- return mg_tls_recv_decrypt(c, buf, len);
- }
- size_t mg_tls_pending(struct mg_connection *c) {
- return mg_tls_got_msg(c) ? 1 : 0;
- }
- void mg_tls_ctx_init(struct mg_mgr *mgr) {
- (void) mgr;
- }
- void mg_tls_ctx_free(struct mg_mgr *mgr) {
- (void) mgr;
- }
- #endif
- #ifdef MG_ENABLE_LINES
- #line 1 "src/tls_dummy.c"
- #endif
- #if MG_TLS == MG_TLS_NONE
- void mg_tls_init(struct mg_connection *c, const struct mg_tls_opts *opts) {
- (void) opts;
- mg_error(c, "TLS is not enabled");
- }
- void mg_tls_handshake(struct mg_connection *c) {
- (void) c;
- }
- void mg_tls_free(struct mg_connection *c) {
- (void) c;
- }
- long mg_tls_recv(struct mg_connection *c, void *buf, size_t len) {
- return c == NULL || buf == NULL || len == 0 ? 0 : -1;
- }
- long mg_tls_send(struct mg_connection *c, const void *buf, size_t len) {
- return c == NULL || buf == NULL || len == 0 ? 0 : -1;
- }
- size_t mg_tls_pending(struct mg_connection *c) {
- (void) c;
- return 0;
- }
- void mg_tls_ctx_init(struct mg_mgr *mgr) {
- (void) mgr;
- }
- void mg_tls_ctx_free(struct mg_mgr *mgr) {
- (void) mgr;
- }
- #endif
- #ifdef MG_ENABLE_LINES
- #line 1 "src/tls_mbed.c"
- #endif
- #if MG_TLS == MG_TLS_MBED
- #if defined(MBEDTLS_VERSION_NUMBER) && MBEDTLS_VERSION_NUMBER >= 0x03000000
- #define MG_MBEDTLS_RNG_GET , mg_mbed_rng, NULL
- #else
- #define MG_MBEDTLS_RNG_GET
- #endif
- static int mg_mbed_rng(void *ctx, unsigned char *buf, size_t len) {
- mg_random(buf, len);
- (void) ctx;
- return 0;
- }
- static bool mg_load_cert(struct mg_str str, mbedtls_x509_crt *p) {
- int rc;
- if (str.ptr == NULL || str.ptr[0] == '\0' || str.ptr[0] == '*') return true;
- if (str.ptr[0] == '-') str.len++; // PEM, include trailing NUL
- if ((rc = mbedtls_x509_crt_parse(p, (uint8_t *) str.ptr, str.len)) != 0) {
- MG_ERROR(("cert err %#x", -rc));
- return false;
- }
- return true;
- }
- static bool mg_load_key(struct mg_str str, mbedtls_pk_context *p) {
- int rc;
- if (str.ptr == NULL || str.ptr[0] == '\0' || str.ptr[0] == '*') return true;
- if (str.ptr[0] == '-') str.len++; // PEM, include trailing NUL
- if ((rc = mbedtls_pk_parse_key(p, (uint8_t *) str.ptr, str.len, NULL,
- 0 MG_MBEDTLS_RNG_GET)) != 0) {
- MG_ERROR(("key err %#x", -rc));
- return false;
- }
- return true;
- }
- void mg_tls_free(struct mg_connection *c) {
- struct mg_tls *tls = (struct mg_tls *) c->tls;
- if (tls != NULL) {
- mbedtls_ssl_free(&tls->ssl);
- mbedtls_pk_free(&tls->pk);
- mbedtls_x509_crt_free(&tls->ca);
- mbedtls_x509_crt_free(&tls->cert);
- mbedtls_ssl_config_free(&tls->conf);
- #ifdef MBEDTLS_SSL_SESSION_TICKETS
- mbedtls_ssl_ticket_free(&tls->ticket);
- #endif
- free(tls);
- c->tls = NULL;
- }
- }
- static int mg_net_send(void *ctx, const unsigned char *buf, size_t len) {
- long n = mg_io_send((struct mg_connection *) ctx, buf, len);
- MG_VERBOSE(("%lu n=%ld e=%d", ((struct mg_connection *) ctx)->id, n, errno));
- if (n == MG_IO_WAIT) return MBEDTLS_ERR_SSL_WANT_WRITE;
- if (n == MG_IO_RESET) return MBEDTLS_ERR_NET_CONN_RESET;
- if (n == MG_IO_ERR) return MBEDTLS_ERR_NET_SEND_FAILED;
- return (int) n;
- }
- static int mg_net_recv(void *ctx, unsigned char *buf, size_t len) {
- long n = mg_io_recv((struct mg_connection *) ctx, buf, len);
- MG_VERBOSE(("%lu n=%ld", ((struct mg_connection *) ctx)->id, n));
- if (n == MG_IO_WAIT) return MBEDTLS_ERR_SSL_WANT_WRITE;
- if (n == MG_IO_RESET) return MBEDTLS_ERR_NET_CONN_RESET;
- if (n == MG_IO_ERR) return MBEDTLS_ERR_NET_RECV_FAILED;
- return (int) n;
- }
- void mg_tls_handshake(struct mg_connection *c) {
- struct mg_tls *tls = (struct mg_tls *) c->tls;
- int rc = mbedtls_ssl_handshake(&tls->ssl);
- if (rc == 0) { // Success
- MG_DEBUG(("%lu success", c->id));
- c->is_tls_hs = 0;
- mg_call(c, MG_EV_TLS_HS, NULL);
- } else if (rc == MBEDTLS_ERR_SSL_WANT_READ ||
- rc == MBEDTLS_ERR_SSL_WANT_WRITE) { // Still pending
- MG_VERBOSE(("%lu pending, %d%d %d (-%#x)", c->id, c->is_connecting,
- c->is_tls_hs, rc, -rc));
- } else {
- mg_error(c, "TLS handshake: -%#x", -rc); // Error
- }
- }
- static void debug_cb(void *c, int lev, const char *s, int n, const char *s2) {
- n = (int) strlen(s2) - 1;
- MG_INFO(("%lu %d %.*s", ((struct mg_connection *) c)->id, lev, n, s2));
- (void) s;
- }
- void mg_tls_init(struct mg_connection *c, const struct mg_tls_opts *opts) {
- struct mg_tls *tls = (struct mg_tls *) calloc(1, sizeof(*tls));
- int rc = 0;
- c->tls = tls;
- if (c->tls == NULL) {
- mg_error(c, "TLS OOM");
- goto fail;
- }
- if (c->is_listening) goto fail;
- MG_DEBUG(("%lu Setting TLS", c->id));
- MG_PROF_ADD(c, "mbedtls_init_start");
- mbedtls_ssl_init(&tls->ssl);
- mbedtls_ssl_config_init(&tls->conf);
- mbedtls_x509_crt_init(&tls->ca);
- mbedtls_x509_crt_init(&tls->cert);
- mbedtls_pk_init(&tls->pk);
- mbedtls_ssl_conf_dbg(&tls->conf, debug_cb, c);
- #if defined(MG_MBEDTLS_DEBUG_LEVEL)
- mbedtls_debug_set_threshold(MG_MBEDTLS_DEBUG_LEVEL);
- #endif
- if ((rc = mbedtls_ssl_config_defaults(
- &tls->conf,
- c->is_client ? MBEDTLS_SSL_IS_CLIENT : MBEDTLS_SSL_IS_SERVER,
- MBEDTLS_SSL_TRANSPORT_STREAM, MBEDTLS_SSL_PRESET_DEFAULT)) != 0) {
- mg_error(c, "tls defaults %#x", -rc);
- goto fail;
- }
- mbedtls_ssl_conf_rng(&tls->conf, mg_mbed_rng, c);
- if (opts->ca.len == 0 || mg_vcmp(&opts->ca, "*") == 0) {
- mbedtls_ssl_conf_authmode(&tls->conf, MBEDTLS_SSL_VERIFY_NONE);
- } else {
- if (mg_load_cert(opts->ca, &tls->ca) == false) goto fail;
- mbedtls_ssl_conf_ca_chain(&tls->conf, &tls->ca, NULL);
- if (c->is_client && opts->name.ptr != NULL && opts->name.ptr[0] != '\0') {
- char *host = mg_mprintf("%.*s", opts->name.len, opts->name.ptr);
- mbedtls_ssl_set_hostname(&tls->ssl, host);
- MG_DEBUG(("%lu hostname verification: %s", c->id, host));
- free(host);
- }
- mbedtls_ssl_conf_authmode(&tls->conf, MBEDTLS_SSL_VERIFY_REQUIRED);
- }
- if (!mg_load_cert(opts->cert, &tls->cert)) goto fail;
- if (!mg_load_key(opts->key, &tls->pk)) goto fail;
- if (tls->cert.version &&
- (rc = mbedtls_ssl_conf_own_cert(&tls->conf, &tls->cert, &tls->pk)) != 0) {
- mg_error(c, "own cert %#x", -rc);
- goto fail;
- }
- #ifdef MBEDTLS_SSL_SESSION_TICKETS
- mbedtls_ssl_conf_session_tickets_cb(
- &tls->conf, mbedtls_ssl_ticket_write, mbedtls_ssl_ticket_parse,
- &((struct mg_tls_ctx *) c->mgr->tls_ctx)->tickets);
- #endif
- if ((rc = mbedtls_ssl_setup(&tls->ssl, &tls->conf)) != 0) {
- mg_error(c, "setup err %#x", -rc);
- goto fail;
- }
- c->is_tls = 1;
- c->is_tls_hs = 1;
- mbedtls_ssl_set_bio(&tls->ssl, c, mg_net_send, mg_net_recv, 0);
- MG_PROF_ADD(c, "mbedtls_init_end");
- if (c->is_client && c->is_resolving == 0 && c->is_connecting == 0) {
- mg_tls_handshake(c);
- }
- return;
- fail:
- mg_tls_free(c);
- }
- size_t mg_tls_pending(struct mg_connection *c) {
- struct mg_tls *tls = (struct mg_tls *) c->tls;
- return tls == NULL ? 0 : mbedtls_ssl_get_bytes_avail(&tls->ssl);
- }
- long mg_tls_recv(struct mg_connection *c, void *buf, size_t len) {
- struct mg_tls *tls = (struct mg_tls *) c->tls;
- long n = mbedtls_ssl_read(&tls->ssl, (unsigned char *) buf, len);
- if (n == MBEDTLS_ERR_SSL_WANT_READ || n == MBEDTLS_ERR_SSL_WANT_WRITE)
- return MG_IO_WAIT;
- if (n <= 0) return MG_IO_ERR;
- return n;
- }
- long mg_tls_send(struct mg_connection *c, const void *buf, size_t len) {
- struct mg_tls *tls = (struct mg_tls *) c->tls;
- long n = mbedtls_ssl_write(&tls->ssl, (unsigned char *) buf, len);
- if (n == MBEDTLS_ERR_SSL_WANT_READ || n == MBEDTLS_ERR_SSL_WANT_WRITE)
- return MG_IO_WAIT;
- if (n <= 0) return MG_IO_ERR;
- return n;
- }
- void mg_tls_ctx_init(struct mg_mgr *mgr) {
- struct mg_tls_ctx *ctx = (struct mg_tls_ctx *) calloc(1, sizeof(*ctx));
- if (ctx == NULL) {
- MG_ERROR(("TLS context init OOM"));
- } else {
- #ifdef MBEDTLS_SSL_SESSION_TICKETS
- int rc;
- mbedtls_ssl_ticket_init(&ctx->tickets);
- if ((rc = mbedtls_ssl_ticket_setup(&ctx->tickets, mg_mbed_rng, NULL,
- MBEDTLS_CIPHER_AES_128_GCM, 86400)) !=
- 0) {
- MG_ERROR((" mbedtls_ssl_ticket_setup %#x", -rc));
- }
- #endif
- mgr->tls_ctx = ctx;
- }
- }
- void mg_tls_ctx_free(struct mg_mgr *mgr) {
- struct mg_tls_ctx *ctx = (struct mg_tls_ctx *) mgr->tls_ctx;
- if (ctx != NULL) {
- #ifdef MBEDTLS_SSL_SESSION_TICKETS
- mbedtls_ssl_ticket_free(&ctx->tickets);
- #endif
- free(ctx);
- mgr->tls_ctx = NULL;
- }
- }
- #endif
- #ifdef MG_ENABLE_LINES
- #line 1 "src/tls_openssl.c"
- #endif
- #if MG_TLS == MG_TLS_OPENSSL
- static int tls_err_cb(const char *s, size_t len, void *c) {
- int n = (int) len - 1;
- MG_ERROR(("%lu %.*s", ((struct mg_connection *) c)->id, n, s));
- return 0; // undocumented
- }
- static int mg_tls_err(struct mg_connection *c, struct mg_tls *tls, int res) {
- int err = SSL_get_error(tls->ssl, res);
- // We've just fetched the last error from the queue.
- // Now we need to clear the error queue. If we do not, then the following
- // can happen (actually reported):
- // - A new connection is accept()-ed with cert error (e.g. self-signed cert)
- // - Since all accept()-ed connections share listener's context,
- // - *ALL* SSL accepted connection report read error on the next poll cycle.
- // Thus a single errored connection can close all the rest, unrelated ones.
- // Clearing the error keeps the shared SSL_CTX in an OK state.
- if (err != 0) ERR_print_errors_cb(tls_err_cb, c);
- ERR_clear_error();
- if (err == SSL_ERROR_WANT_READ) return 0;
- if (err == SSL_ERROR_WANT_WRITE) return 0;
- return err;
- }
- static STACK_OF(X509_INFO) * load_ca_certs(struct mg_str ca) {
- BIO *bio = BIO_new_mem_buf(ca.ptr, (int) ca.len);
- STACK_OF(X509_INFO) *certs =
- bio ? PEM_X509_INFO_read_bio(bio, NULL, NULL, NULL) : NULL;
- if (bio) BIO_free(bio);
- return certs;
- }
- static bool add_ca_certs(SSL_CTX *ctx, STACK_OF(X509_INFO) * certs) {
- X509_STORE *cert_store = SSL_CTX_get_cert_store(ctx);
- for (int i = 0; i < sk_X509_INFO_num(certs); i++) {
- X509_INFO *cert_info = sk_X509_INFO_value(certs, i);
- if (cert_info->x509 && !X509_STORE_add_cert(cert_store, cert_info->x509))
- return false;
- }
- return true;
- }
- static EVP_PKEY *load_key(struct mg_str s) {
- BIO *bio = BIO_new_mem_buf(s.ptr, (int) (long) s.len);
- EVP_PKEY *key = bio ? PEM_read_bio_PrivateKey(bio, NULL, 0, NULL) : NULL;
- if (bio) BIO_free(bio);
- return key;
- }
- static X509 *load_cert(struct mg_str s) {
- BIO *bio = BIO_new_mem_buf(s.ptr, (int) (long) s.len);
- X509 *cert = bio == NULL ? NULL
- : s.ptr[0] == '-'
- ? PEM_read_bio_X509(bio, NULL, NULL, NULL) // PEM
- : d2i_X509_bio(bio, NULL); // DER
- if (bio) BIO_free(bio);
- return cert;
- }
- static long mg_bio_ctrl(BIO *b, int cmd, long larg, void *pargs) {
- long ret = 0;
- if (cmd == BIO_CTRL_PUSH) ret = 1;
- if (cmd == BIO_CTRL_POP) ret = 1;
- if (cmd == BIO_CTRL_FLUSH) ret = 1;
- if (cmd == BIO_C_SET_NBIO) ret = 1;
- // MG_DEBUG(("%d -> %ld", cmd, ret));
- (void) b, (void) cmd, (void) larg, (void) pargs;
- return ret;
- }
- static int mg_bio_read(BIO *bio, char *buf, int len) {
- struct mg_connection *c = (struct mg_connection *) BIO_get_data(bio);
- long res = mg_io_recv(c, buf, (size_t) len);
- // MG_DEBUG(("%p %d %ld", buf, len, res));
- len = res > 0 ? (int) res : -1;
- if (res == MG_IO_WAIT) BIO_set_retry_read(bio);
- return len;
- }
- static int mg_bio_write(BIO *bio, const char *buf, int len) {
- struct mg_connection *c = (struct mg_connection *) BIO_get_data(bio);
- long res = mg_io_send(c, buf, (size_t) len);
- // MG_DEBUG(("%p %d %ld", buf, len, res));
- len = res > 0 ? (int) res : -1;
- if (res == MG_IO_WAIT) BIO_set_retry_write(bio);
- return len;
- }
- void mg_tls_init(struct mg_connection *c, const struct mg_tls_opts *opts) {
- struct mg_tls *tls = (struct mg_tls *) calloc(1, sizeof(*tls));
- const char *id = "mongoose";
- static unsigned char s_initialised = 0;
- BIO *bio = NULL;
- int rc;
- if (tls == NULL) {
- mg_error(c, "TLS OOM");
- goto fail;
- }
- if (!s_initialised) {
- SSL_library_init();
- s_initialised++;
- }
- MG_DEBUG(("%lu Setting TLS", c->id));
- tls->ctx = c->is_client ? SSL_CTX_new(SSLv23_client_method())
- : SSL_CTX_new(SSLv23_server_method());
- if ((tls->ssl = SSL_new(tls->ctx)) == NULL) {
- mg_error(c, "SSL_new");
- goto fail;
- }
- SSL_set_session_id_context(tls->ssl, (const uint8_t *) id,
- (unsigned) strlen(id));
- // Disable deprecated protocols
- SSL_set_options(tls->ssl, SSL_OP_NO_SSLv2);
- SSL_set_options(tls->ssl, SSL_OP_NO_SSLv3);
- SSL_set_options(tls->ssl, SSL_OP_NO_TLSv1);
- SSL_set_options(tls->ssl, SSL_OP_NO_TLSv1_1);
- #ifdef MG_ENABLE_OPENSSL_NO_COMPRESSION
- SSL_set_options(tls->ssl, SSL_OP_NO_COMPRESSION);
- #endif
- #ifdef MG_ENABLE_OPENSSL_CIPHER_SERVER_PREFERENCE
- SSL_set_options(tls->ssl, SSL_OP_CIPHER_SERVER_PREFERENCE);
- #endif
- if (opts->ca.ptr != NULL && opts->ca.ptr[0] != '\0') {
- SSL_set_verify(tls->ssl, SSL_VERIFY_PEER | SSL_VERIFY_FAIL_IF_NO_PEER_CERT,
- NULL);
- STACK_OF(X509_INFO) *certs = load_ca_certs(opts->ca);
- rc = add_ca_certs(tls->ctx, certs);
- sk_X509_INFO_pop_free(certs, X509_INFO_free);
- if (!rc) {
- mg_error(c, "CA err");
- goto fail;
- }
- }
- if (opts->cert.ptr != NULL && opts->cert.ptr[0] != '\0') {
- X509 *cert = load_cert(opts->cert);
- rc = cert == NULL ? 0 : SSL_use_certificate(tls->ssl, cert);
- X509_free(cert);
- if (cert == NULL || rc != 1) {
- mg_error(c, "CERT err %d", mg_tls_err(c, tls, rc));
- goto fail;
- }
- }
- if (opts->key.ptr != NULL && opts->key.ptr[0] != '\0') {
- EVP_PKEY *key = load_key(opts->key);
- rc = key == NULL ? 0 : SSL_use_PrivateKey(tls->ssl, key);
- EVP_PKEY_free(key);
- if (key == NULL || rc != 1) {
- mg_error(c, "KEY err %d", mg_tls_err(c, tls, rc));
- goto fail;
- }
- }
- SSL_set_mode(tls->ssl, SSL_MODE_ACCEPT_MOVING_WRITE_BUFFER);
- #if OPENSSL_VERSION_NUMBER > 0x10002000L
- (void) SSL_set_ecdh_auto(tls->ssl, 1);
- #endif
- #if OPENSSL_VERSION_NUMBER >= 0x10100000L
- if (opts->name.len > 0) {
- char *s = mg_mprintf("%.*s", (int) opts->name.len, opts->name.ptr);
- SSL_set1_host(tls->ssl, s);
- SSL_set_tlsext_host_name(tls->ssl, s);
- free(s);
- }
- #endif
- tls->bm = BIO_meth_new(BIO_get_new_index() | BIO_TYPE_SOURCE_SINK, "bio_mg");
- BIO_meth_set_write(tls->bm, mg_bio_write);
- BIO_meth_set_read(tls->bm, mg_bio_read);
- BIO_meth_set_ctrl(tls->bm, mg_bio_ctrl);
- bio = BIO_new(tls->bm);
- BIO_set_data(bio, c);
- SSL_set_bio(tls->ssl, bio, bio);
- c->tls = tls;
- c->is_tls = 1;
- c->is_tls_hs = 1;
- if (c->is_client && c->is_resolving == 0 && c->is_connecting == 0) {
- mg_tls_handshake(c);
- }
- MG_DEBUG(("%lu SSL %s OK", c->id, c->is_accepted ? "accept" : "client"));
- return;
- fail:
- free(tls);
- }
- void mg_tls_handshake(struct mg_connection *c) {
- struct mg_tls *tls = (struct mg_tls *) c->tls;
- int rc = c->is_client ? SSL_connect(tls->ssl) : SSL_accept(tls->ssl);
- if (rc == 1) {
- MG_DEBUG(("%lu success", c->id));
- c->is_tls_hs = 0;
- mg_call(c, MG_EV_TLS_HS, NULL);
- } else {
- int code = mg_tls_err(c, tls, rc);
- if (code != 0) mg_error(c, "tls hs: rc %d, err %d", rc, code);
- }
- }
- void mg_tls_free(struct mg_connection *c) {
- struct mg_tls *tls = (struct mg_tls *) c->tls;
- if (tls == NULL) return;
- SSL_free(tls->ssl);
- SSL_CTX_free(tls->ctx);
- BIO_meth_free(tls->bm);
- free(tls);
- c->tls = NULL;
- }
- size_t mg_tls_pending(struct mg_connection *c) {
- struct mg_tls *tls = (struct mg_tls *) c->tls;
- return tls == NULL ? 0 : (size_t) SSL_pending(tls->ssl);
- }
- long mg_tls_recv(struct mg_connection *c, void *buf, size_t len) {
- struct mg_tls *tls = (struct mg_tls *) c->tls;
- int n = SSL_read(tls->ssl, buf, (int) len);
- if (n < 0 && mg_tls_err(c, tls, n) == 0) return MG_IO_WAIT;
- if (n <= 0) return MG_IO_ERR;
- return n;
- }
- long mg_tls_send(struct mg_connection *c, const void *buf, size_t len) {
- struct mg_tls *tls = (struct mg_tls *) c->tls;
- int n = SSL_write(tls->ssl, buf, (int) len);
- if (n < 0 && mg_tls_err(c, tls, n) == 0) return MG_IO_WAIT;
- if (n <= 0) return MG_IO_ERR;
- return n;
- }
- void mg_tls_ctx_init(struct mg_mgr *mgr) {
- (void) mgr;
- }
- void mg_tls_ctx_free(struct mg_mgr *mgr) {
- (void) mgr;
- }
- #endif
- #ifdef MG_ENABLE_LINES
- #line 1 "src/tls_uecc.c"
- #endif
- /* Copyright 2014, Kenneth MacKay. Licensed under the BSD 2-clause license. */
- #if MG_TLS == MG_TLS_BUILTIN
- #ifndef uECC_RNG_MAX_TRIES
- #define uECC_RNG_MAX_TRIES 64
- #endif
- #if uECC_ENABLE_VLI_API
- #define uECC_VLI_API
- #else
- #define uECC_VLI_API static
- #endif
- #if (uECC_PLATFORM == uECC_avr) || (uECC_PLATFORM == uECC_arm) || \
- (uECC_PLATFORM == uECC_arm_thumb) || (uECC_PLATFORM == uECC_arm_thumb2)
- #define CONCATX(a, ...) a##__VA_ARGS__
- #define CONCAT(a, ...) CONCATX(a, __VA_ARGS__)
- #define STRX(a) #a
- #define STR(a) STRX(a)
- #define EVAL(...) EVAL1(EVAL1(EVAL1(EVAL1(__VA_ARGS__))))
- #define EVAL1(...) EVAL2(EVAL2(EVAL2(EVAL2(__VA_ARGS__))))
- #define EVAL2(...) EVAL3(EVAL3(EVAL3(EVAL3(__VA_ARGS__))))
- #define EVAL3(...) EVAL4(EVAL4(EVAL4(EVAL4(__VA_ARGS__))))
- #define EVAL4(...) __VA_ARGS__
- #define DEC_1 0
- #define DEC_2 1
- #define DEC_3 2
- #define DEC_4 3
- #define DEC_5 4
- #define DEC_6 5
- #define DEC_7 6
- #define DEC_8 7
- #define DEC_9 8
- #define DEC_10 9
- #define DEC_11 10
- #define DEC_12 11
- #define DEC_13 12
- #define DEC_14 13
- #define DEC_15 14
- #define DEC_16 15
- #define DEC_17 16
- #define DEC_18 17
- #define DEC_19 18
- #define DEC_20 19
- #define DEC_21 20
- #define DEC_22 21
- #define DEC_23 22
- #define DEC_24 23
- #define DEC_25 24
- #define DEC_26 25
- #define DEC_27 26
- #define DEC_28 27
- #define DEC_29 28
- #define DEC_30 29
- #define DEC_31 30
- #define DEC_32 31
- #define DEC(N) CONCAT(DEC_, N)
- #define SECOND_ARG(_, val, ...) val
- #define SOME_CHECK_0 ~, 0
- #define GET_SECOND_ARG(...) SECOND_ARG(__VA_ARGS__, SOME, )
- #define SOME_OR_0(N) GET_SECOND_ARG(CONCAT(SOME_CHECK_, N))
- #define EMPTY(...)
- #define DEFER(...) __VA_ARGS__ EMPTY()
- #define REPEAT_NAME_0() REPEAT_0
- #define REPEAT_NAME_SOME() REPEAT_SOME
- #define REPEAT_0(...)
- #define REPEAT_SOME(N, stuff) \
- DEFER(CONCAT(REPEAT_NAME_, SOME_OR_0(DEC(N))))()(DEC(N), stuff) stuff
- #define REPEAT(N, stuff) EVAL(REPEAT_SOME(N, stuff))
- #define REPEATM_NAME_0() REPEATM_0
- #define REPEATM_NAME_SOME() REPEATM_SOME
- #define REPEATM_0(...)
- #define REPEATM_SOME(N, macro) \
- macro(N) DEFER(CONCAT(REPEATM_NAME_, SOME_OR_0(DEC(N))))()(DEC(N), macro)
- #define REPEATM(N, macro) EVAL(REPEATM_SOME(N, macro))
- #endif
- //
- #if (uECC_WORD_SIZE == 1)
- #if uECC_SUPPORTS_secp160r1
- #define uECC_MAX_WORDS 21 /* Due to the size of curve_n. */
- #endif
- #if uECC_SUPPORTS_secp192r1
- #undef uECC_MAX_WORDS
- #define uECC_MAX_WORDS 24
- #endif
- #if uECC_SUPPORTS_secp224r1
- #undef uECC_MAX_WORDS
- #define uECC_MAX_WORDS 28
- #endif
- #if (uECC_SUPPORTS_secp256r1 || uECC_SUPPORTS_secp256k1)
- #undef uECC_MAX_WORDS
- #define uECC_MAX_WORDS 32
- #endif
- #elif (uECC_WORD_SIZE == 4)
- #if uECC_SUPPORTS_secp160r1
- #define uECC_MAX_WORDS 6 /* Due to the size of curve_n. */
- #endif
- #if uECC_SUPPORTS_secp192r1
- #undef uECC_MAX_WORDS
- #define uECC_MAX_WORDS 6
- #endif
- #if uECC_SUPPORTS_secp224r1
- #undef uECC_MAX_WORDS
- #define uECC_MAX_WORDS 7
- #endif
- #if (uECC_SUPPORTS_secp256r1 || uECC_SUPPORTS_secp256k1)
- #undef uECC_MAX_WORDS
- #define uECC_MAX_WORDS 8
- #endif
- #elif (uECC_WORD_SIZE == 8)
- #if uECC_SUPPORTS_secp160r1
- #define uECC_MAX_WORDS 3
- #endif
- #if uECC_SUPPORTS_secp192r1
- #undef uECC_MAX_WORDS
- #define uECC_MAX_WORDS 3
- #endif
- #if uECC_SUPPORTS_secp224r1
- #undef uECC_MAX_WORDS
- #define uECC_MAX_WORDS 4
- #endif
- #if (uECC_SUPPORTS_secp256r1 || uECC_SUPPORTS_secp256k1)
- #undef uECC_MAX_WORDS
- #define uECC_MAX_WORDS 4
- #endif
- #endif /* uECC_WORD_SIZE */
- #define BITS_TO_WORDS(num_bits) \
- ((wordcount_t) ((num_bits + ((uECC_WORD_SIZE * 8) - 1)) / \
- (uECC_WORD_SIZE * 8)))
- #define BITS_TO_BYTES(num_bits) ((num_bits + 7) / 8)
- struct uECC_Curve_t {
- wordcount_t num_words;
- wordcount_t num_bytes;
- bitcount_t num_n_bits;
- uECC_word_t p[uECC_MAX_WORDS];
- uECC_word_t n[uECC_MAX_WORDS];
- uECC_word_t G[uECC_MAX_WORDS * 2];
- uECC_word_t b[uECC_MAX_WORDS];
- void (*double_jacobian)(uECC_word_t *X1, uECC_word_t *Y1, uECC_word_t *Z1,
- uECC_Curve curve);
- #if uECC_SUPPORT_COMPRESSED_POINT
- void (*mod_sqrt)(uECC_word_t *a, uECC_Curve curve);
- #endif
- void (*x_side)(uECC_word_t *result, const uECC_word_t *x, uECC_Curve curve);
- #if (uECC_OPTIMIZATION_LEVEL > 0)
- void (*mmod_fast)(uECC_word_t *result, uECC_word_t *product);
- #endif
- };
- #if uECC_VLI_NATIVE_LITTLE_ENDIAN
- static void bcopy(uint8_t *dst, const uint8_t *src, unsigned num_bytes) {
- while (0 != num_bytes) {
- num_bytes--;
- dst[num_bytes] = src[num_bytes];
- }
- }
- #endif
- static cmpresult_t uECC_vli_cmp_unsafe(const uECC_word_t *left,
- const uECC_word_t *right,
- wordcount_t num_words);
- #if (uECC_PLATFORM == uECC_arm || uECC_PLATFORM == uECC_arm_thumb || \
- uECC_PLATFORM == uECC_arm_thumb2)
- #endif
- #if (uECC_PLATFORM == uECC_avr)
- #endif
- #ifndef asm_clear
- #define asm_clear 0
- #endif
- #ifndef asm_set
- #define asm_set 0
- #endif
- #ifndef asm_add
- #define asm_add 0
- #endif
- #ifndef asm_sub
- #define asm_sub 0
- #endif
- #ifndef asm_mult
- #define asm_mult 0
- #endif
- #ifndef asm_rshift1
- #define asm_rshift1 0
- #endif
- #ifndef asm_mmod_fast_secp256r1
- #define asm_mmod_fast_secp256r1 0
- #endif
- #if defined(default_RNG_defined) && default_RNG_defined
- static uECC_RNG_Function g_rng_function = &default_RNG;
- #else
- static uECC_RNG_Function g_rng_function = 0;
- #endif
- void uECC_set_rng(uECC_RNG_Function rng_function) {
- g_rng_function = rng_function;
- }
- uECC_RNG_Function uECC_get_rng(void) {
- return g_rng_function;
- }
- int uECC_curve_private_key_size(uECC_Curve curve) {
- return BITS_TO_BYTES(curve->num_n_bits);
- }
- int uECC_curve_public_key_size(uECC_Curve curve) {
- return 2 * curve->num_bytes;
- }
- #if !asm_clear
- uECC_VLI_API void uECC_vli_clear(uECC_word_t *vli, wordcount_t num_words) {
- wordcount_t i;
- for (i = 0; i < num_words; ++i) {
- vli[i] = 0;
- }
- }
- #endif /* !asm_clear */
- /* Constant-time comparison to zero - secure way to compare long integers */
- /* Returns 1 if vli == 0, 0 otherwise. */
- uECC_VLI_API uECC_word_t uECC_vli_isZero(const uECC_word_t *vli,
- wordcount_t num_words) {
- uECC_word_t bits = 0;
- wordcount_t i;
- for (i = 0; i < num_words; ++i) {
- bits |= vli[i];
- }
- return (bits == 0);
- }
- /* Returns nonzero if bit 'bit' of vli is set. */
- uECC_VLI_API uECC_word_t uECC_vli_testBit(const uECC_word_t *vli,
- bitcount_t bit) {
- return (vli[bit >> uECC_WORD_BITS_SHIFT] &
- ((uECC_word_t) 1 << (bit & uECC_WORD_BITS_MASK)));
- }
- /* Counts the number of words in vli. */
- static wordcount_t vli_numDigits(const uECC_word_t *vli,
- const wordcount_t max_words) {
- wordcount_t i;
- /* Search from the end until we find a non-zero digit.
- We do it in reverse because we expect that most digits will be nonzero. */
- for (i = max_words - 1; i >= 0 && vli[i] == 0; --i) {
- }
- return (i + 1);
- }
- /* Counts the number of bits required to represent vli. */
- uECC_VLI_API bitcount_t uECC_vli_numBits(const uECC_word_t *vli,
- const wordcount_t max_words) {
- uECC_word_t i;
- uECC_word_t digit;
- wordcount_t num_digits = vli_numDigits(vli, max_words);
- if (num_digits == 0) {
- return 0;
- }
- digit = vli[num_digits - 1];
- for (i = 0; digit; ++i) {
- digit >>= 1;
- }
- return (((bitcount_t) ((num_digits - 1) << uECC_WORD_BITS_SHIFT)) +
- (bitcount_t) i);
- }
- /* Sets dest = src. */
- #if !asm_set
- uECC_VLI_API void uECC_vli_set(uECC_word_t *dest, const uECC_word_t *src,
- wordcount_t num_words) {
- wordcount_t i;
- for (i = 0; i < num_words; ++i) {
- dest[i] = src[i];
- }
- }
- #endif /* !asm_set */
- /* Returns sign of left - right. */
- static cmpresult_t uECC_vli_cmp_unsafe(const uECC_word_t *left,
- const uECC_word_t *right,
- wordcount_t num_words) {
- wordcount_t i;
- for (i = num_words - 1; i >= 0; --i) {
- if (left[i] > right[i]) {
- return 1;
- } else if (left[i] < right[i]) {
- return -1;
- }
- }
- return 0;
- }
- /* Constant-time comparison function - secure way to compare long integers */
- /* Returns one if left == right, zero otherwise. */
- uECC_VLI_API uECC_word_t uECC_vli_equal(const uECC_word_t *left,
- const uECC_word_t *right,
- wordcount_t num_words) {
- uECC_word_t diff = 0;
- wordcount_t i;
- for (i = num_words - 1; i >= 0; --i) {
- diff |= (left[i] ^ right[i]);
- }
- return (diff == 0);
- }
- uECC_VLI_API uECC_word_t uECC_vli_sub(uECC_word_t *result,
- const uECC_word_t *left,
- const uECC_word_t *right,
- wordcount_t num_words);
- /* Returns sign of left - right, in constant time. */
- uECC_VLI_API cmpresult_t uECC_vli_cmp(const uECC_word_t *left,
- const uECC_word_t *right,
- wordcount_t num_words) {
- uECC_word_t tmp[uECC_MAX_WORDS];
- uECC_word_t neg = !!uECC_vli_sub(tmp, left, right, num_words);
- uECC_word_t equal = uECC_vli_isZero(tmp, num_words);
- return (cmpresult_t) (!equal - 2 * neg);
- }
- /* Computes vli = vli >> 1. */
- #if !asm_rshift1
- uECC_VLI_API void uECC_vli_rshift1(uECC_word_t *vli, wordcount_t num_words) {
- uECC_word_t *end = vli;
- uECC_word_t carry = 0;
- vli += num_words;
- while (vli-- > end) {
- uECC_word_t temp = *vli;
- *vli = (temp >> 1) | carry;
- carry = temp << (uECC_WORD_BITS - 1);
- }
- }
- #endif /* !asm_rshift1 */
- /* Computes result = left + right, returning carry. Can modify in place. */
- #if !asm_add
- uECC_VLI_API uECC_word_t uECC_vli_add(uECC_word_t *result,
- const uECC_word_t *left,
- const uECC_word_t *right,
- wordcount_t num_words) {
- uECC_word_t carry = 0;
- wordcount_t i;
- for (i = 0; i < num_words; ++i) {
- uECC_word_t sum = left[i] + right[i] + carry;
- if (sum != left[i]) {
- carry = (sum < left[i]);
- }
- result[i] = sum;
- }
- return carry;
- }
- #endif /* !asm_add */
- /* Computes result = left - right, returning borrow. Can modify in place. */
- #if !asm_sub
- uECC_VLI_API uECC_word_t uECC_vli_sub(uECC_word_t *result,
- const uECC_word_t *left,
- const uECC_word_t *right,
- wordcount_t num_words) {
- uECC_word_t borrow = 0;
- wordcount_t i;
- for (i = 0; i < num_words; ++i) {
- uECC_word_t diff = left[i] - right[i] - borrow;
- if (diff != left[i]) {
- borrow = (diff > left[i]);
- }
- result[i] = diff;
- }
- return borrow;
- }
- #endif /* !asm_sub */
- #if !asm_mult || (uECC_SQUARE_FUNC && !asm_square) || \
- (uECC_SUPPORTS_secp256k1 && (uECC_OPTIMIZATION_LEVEL > 0) && \
- ((uECC_WORD_SIZE == 1) || (uECC_WORD_SIZE == 8)))
- static void muladd(uECC_word_t a, uECC_word_t b, uECC_word_t *r0,
- uECC_word_t *r1, uECC_word_t *r2) {
- #if uECC_WORD_SIZE == 8
- uint64_t a0 = a & 0xffffffff;
- uint64_t a1 = a >> 32;
- uint64_t b0 = b & 0xffffffff;
- uint64_t b1 = b >> 32;
- uint64_t i0 = a0 * b0;
- uint64_t i1 = a0 * b1;
- uint64_t i2 = a1 * b0;
- uint64_t i3 = a1 * b1;
- uint64_t p0, p1;
- i2 += (i0 >> 32);
- i2 += i1;
- if (i2 < i1) { /* overflow */
- i3 += 0x100000000;
- }
- p0 = (i0 & 0xffffffff) | (i2 << 32);
- p1 = i3 + (i2 >> 32);
- *r0 += p0;
- *r1 += (p1 + (*r0 < p0));
- *r2 += ((*r1 < p1) || (*r1 == p1 && *r0 < p0));
- #else
- uECC_dword_t p = (uECC_dword_t) a * b;
- uECC_dword_t r01 = ((uECC_dword_t) (*r1) << uECC_WORD_BITS) | *r0;
- r01 += p;
- *r2 += (r01 < p);
- *r1 = (uECC_word_t) (r01 >> uECC_WORD_BITS);
- *r0 = (uECC_word_t) r01;
- #endif
- }
- #endif /* muladd needed */
- #if !asm_mult
- uECC_VLI_API void uECC_vli_mult(uECC_word_t *result, const uECC_word_t *left,
- const uECC_word_t *right,
- wordcount_t num_words) {
- uECC_word_t r0 = 0;
- uECC_word_t r1 = 0;
- uECC_word_t r2 = 0;
- wordcount_t i, k;
- /* Compute each digit of result in sequence, maintaining the carries. */
- for (k = 0; k < num_words; ++k) {
- for (i = 0; i <= k; ++i) {
- muladd(left[i], right[k - i], &r0, &r1, &r2);
- }
- result[k] = r0;
- r0 = r1;
- r1 = r2;
- r2 = 0;
- }
- for (k = num_words; k < num_words * 2 - 1; ++k) {
- for (i = (wordcount_t) ((k + 1) - num_words); i < num_words; ++i) {
- muladd(left[i], right[k - i], &r0, &r1, &r2);
- }
- result[k] = r0;
- r0 = r1;
- r1 = r2;
- r2 = 0;
- }
- result[num_words * 2 - 1] = r0;
- }
- #endif /* !asm_mult */
- #if uECC_SQUARE_FUNC
- #if !asm_square
- static void mul2add(uECC_word_t a, uECC_word_t b, uECC_word_t *r0,
- uECC_word_t *r1, uECC_word_t *r2) {
- #if uECC_WORD_SIZE == 8
- uint64_t a0 = a & 0xffffffffull;
- uint64_t a1 = a >> 32;
- uint64_t b0 = b & 0xffffffffull;
- uint64_t b1 = b >> 32;
- uint64_t i0 = a0 * b0;
- uint64_t i1 = a0 * b1;
- uint64_t i2 = a1 * b0;
- uint64_t i3 = a1 * b1;
- uint64_t p0, p1;
- i2 += (i0 >> 32);
- i2 += i1;
- if (i2 < i1) { /* overflow */
- i3 += 0x100000000ull;
- }
- p0 = (i0 & 0xffffffffull) | (i2 << 32);
- p1 = i3 + (i2 >> 32);
- *r2 += (p1 >> 63);
- p1 = (p1 << 1) | (p0 >> 63);
- p0 <<= 1;
- *r0 += p0;
- *r1 += (p1 + (*r0 < p0));
- *r2 += ((*r1 < p1) || (*r1 == p1 && *r0 < p0));
- #else
- uECC_dword_t p = (uECC_dword_t) a * b;
- uECC_dword_t r01 = ((uECC_dword_t) (*r1) << uECC_WORD_BITS) | *r0;
- *r2 += (p >> (uECC_WORD_BITS * 2 - 1));
- p *= 2;
- r01 += p;
- *r2 += (r01 < p);
- *r1 = r01 >> uECC_WORD_BITS;
- *r0 = (uECC_word_t) r01;
- #endif
- }
- uECC_VLI_API void uECC_vli_square(uECC_word_t *result, const uECC_word_t *left,
- wordcount_t num_words) {
- uECC_word_t r0 = 0;
- uECC_word_t r1 = 0;
- uECC_word_t r2 = 0;
- wordcount_t i, k;
- for (k = 0; k < num_words * 2 - 1; ++k) {
- uECC_word_t min = (k < num_words ? 0 : (k + 1) - num_words);
- for (i = min; i <= k && i <= k - i; ++i) {
- if (i < k - i) {
- mul2add(left[i], left[k - i], &r0, &r1, &r2);
- } else {
- muladd(left[i], left[k - i], &r0, &r1, &r2);
- }
- }
- result[k] = r0;
- r0 = r1;
- r1 = r2;
- r2 = 0;
- }
- result[num_words * 2 - 1] = r0;
- }
- #endif /* !asm_square */
- #else /* uECC_SQUARE_FUNC */
- #if uECC_ENABLE_VLI_API
- uECC_VLI_API void uECC_vli_square(uECC_word_t *result, const uECC_word_t *left,
- wordcount_t num_words) {
- uECC_vli_mult(result, left, left, num_words);
- }
- #endif /* uECC_ENABLE_VLI_API */
- #endif /* uECC_SQUARE_FUNC */
- /* Computes result = (left + right) % mod.
- Assumes that left < mod and right < mod, and that result does not overlap
- mod. */
- uECC_VLI_API void uECC_vli_modAdd(uECC_word_t *result, const uECC_word_t *left,
- const uECC_word_t *right,
- const uECC_word_t *mod,
- wordcount_t num_words) {
- uECC_word_t carry = uECC_vli_add(result, left, right, num_words);
- if (carry || uECC_vli_cmp_unsafe(mod, result, num_words) != 1) {
- /* result > mod (result = mod + remainder), so subtract mod to get
- * remainder. */
- uECC_vli_sub(result, result, mod, num_words);
- }
- }
- /* Computes result = (left - right) % mod.
- Assumes that left < mod and right < mod, and that result does not overlap
- mod. */
- uECC_VLI_API void uECC_vli_modSub(uECC_word_t *result, const uECC_word_t *left,
- const uECC_word_t *right,
- const uECC_word_t *mod,
- wordcount_t num_words) {
- uECC_word_t l_borrow = uECC_vli_sub(result, left, right, num_words);
- if (l_borrow) {
- /* In this case, result == -diff == (max int) - diff. Since -x % d == d - x,
- we can get the correct result from result + mod (with overflow). */
- uECC_vli_add(result, result, mod, num_words);
- }
- }
- /* Computes result = product % mod, where product is 2N words long. */
- /* Currently only designed to work for curve_p or curve_n. */
- uECC_VLI_API void uECC_vli_mmod(uECC_word_t *result, uECC_word_t *product,
- const uECC_word_t *mod, wordcount_t num_words) {
- uECC_word_t mod_multiple[2 * uECC_MAX_WORDS];
- uECC_word_t tmp[2 * uECC_MAX_WORDS];
- uECC_word_t *v[2] = {tmp, product};
- uECC_word_t index;
- /* Shift mod so its highest set bit is at the maximum position. */
- bitcount_t shift = (bitcount_t) (
- (num_words * 2 * uECC_WORD_BITS) - uECC_vli_numBits(mod, num_words));
- wordcount_t word_shift = (wordcount_t) (shift / uECC_WORD_BITS);
- wordcount_t bit_shift = (wordcount_t) (shift % uECC_WORD_BITS);
- uECC_word_t carry = 0;
- uECC_vli_clear(mod_multiple, word_shift);
- if (bit_shift > 0) {
- for (index = 0; index < (uECC_word_t) num_words; ++index) {
- mod_multiple[(uECC_word_t) word_shift + index] =
- (uECC_word_t) (mod[index] << bit_shift) | carry;
- carry = mod[index] >> (uECC_WORD_BITS - bit_shift);
- }
- } else {
- uECC_vli_set(mod_multiple + word_shift, mod, num_words);
- }
- for (index = 1; shift >= 0; --shift) {
- uECC_word_t borrow = 0;
- wordcount_t i;
- for (i = 0; i < num_words * 2; ++i) {
- uECC_word_t diff = v[index][i] - mod_multiple[i] - borrow;
- if (diff != v[index][i]) {
- borrow = (diff > v[index][i]);
- }
- v[1 - index][i] = diff;
- }
- index = !(index ^ borrow); /* Swap the index if there was no borrow */
- uECC_vli_rshift1(mod_multiple, num_words);
- mod_multiple[num_words - 1] |= mod_multiple[num_words]
- << (uECC_WORD_BITS - 1);
- uECC_vli_rshift1(mod_multiple + num_words, num_words);
- }
- uECC_vli_set(result, v[index], num_words);
- }
- /* Computes result = (left * right) % mod. */
- uECC_VLI_API void uECC_vli_modMult(uECC_word_t *result, const uECC_word_t *left,
- const uECC_word_t *right,
- const uECC_word_t *mod,
- wordcount_t num_words) {
- uECC_word_t product[2 * uECC_MAX_WORDS];
- uECC_vli_mult(product, left, right, num_words);
- uECC_vli_mmod(result, product, mod, num_words);
- }
- uECC_VLI_API void uECC_vli_modMult_fast(uECC_word_t *result,
- const uECC_word_t *left,
- const uECC_word_t *right,
- uECC_Curve curve) {
- uECC_word_t product[2 * uECC_MAX_WORDS];
- uECC_vli_mult(product, left, right, curve->num_words);
- #if (uECC_OPTIMIZATION_LEVEL > 0)
- curve->mmod_fast(result, product);
- #else
- uECC_vli_mmod(result, product, curve->p, curve->num_words);
- #endif
- }
- #if uECC_SQUARE_FUNC
- #if uECC_ENABLE_VLI_API
- /* Computes result = left^2 % mod. */
- uECC_VLI_API void uECC_vli_modSquare(uECC_word_t *result,
- const uECC_word_t *left,
- const uECC_word_t *mod,
- wordcount_t num_words) {
- uECC_word_t product[2 * uECC_MAX_WORDS];
- uECC_vli_square(product, left, num_words);
- uECC_vli_mmod(result, product, mod, num_words);
- }
- #endif /* uECC_ENABLE_VLI_API */
- uECC_VLI_API void uECC_vli_modSquare_fast(uECC_word_t *result,
- const uECC_word_t *left,
- uECC_Curve curve) {
- uECC_word_t product[2 * uECC_MAX_WORDS];
- uECC_vli_square(product, left, curve->num_words);
- #if (uECC_OPTIMIZATION_LEVEL > 0)
- curve->mmod_fast(result, product);
- #else
- uECC_vli_mmod(result, product, curve->p, curve->num_words);
- #endif
- }
- #else /* uECC_SQUARE_FUNC */
- #if uECC_ENABLE_VLI_API
- uECC_VLI_API void uECC_vli_modSquare(uECC_word_t *result,
- const uECC_word_t *left,
- const uECC_word_t *mod,
- wordcount_t num_words) {
- uECC_vli_modMult(result, left, left, mod, num_words);
- }
- #endif /* uECC_ENABLE_VLI_API */
- uECC_VLI_API void uECC_vli_modSquare_fast(uECC_word_t *result,
- const uECC_word_t *left,
- uECC_Curve curve) {
- uECC_vli_modMult_fast(result, left, left, curve);
- }
- #endif /* uECC_SQUARE_FUNC */
- #define EVEN(vli) (!(vli[0] & 1))
- static void vli_modInv_update(uECC_word_t *uv, const uECC_word_t *mod,
- wordcount_t num_words) {
- uECC_word_t carry = 0;
- if (!EVEN(uv)) {
- carry = uECC_vli_add(uv, uv, mod, num_words);
- }
- uECC_vli_rshift1(uv, num_words);
- if (carry) {
- uv[num_words - 1] |= HIGH_BIT_SET;
- }
- }
- /* Computes result = (1 / input) % mod. All VLIs are the same size.
- See "From Euclid's GCD to Montgomery Multiplication to the Great Divide" */
- uECC_VLI_API void uECC_vli_modInv(uECC_word_t *result, const uECC_word_t *input,
- const uECC_word_t *mod,
- wordcount_t num_words) {
- uECC_word_t a[uECC_MAX_WORDS], b[uECC_MAX_WORDS], u[uECC_MAX_WORDS],
- v[uECC_MAX_WORDS];
- cmpresult_t cmpResult;
- if (uECC_vli_isZero(input, num_words)) {
- uECC_vli_clear(result, num_words);
- return;
- }
- uECC_vli_set(a, input, num_words);
- uECC_vli_set(b, mod, num_words);
- uECC_vli_clear(u, num_words);
- u[0] = 1;
- uECC_vli_clear(v, num_words);
- while ((cmpResult = uECC_vli_cmp_unsafe(a, b, num_words)) != 0) {
- if (EVEN(a)) {
- uECC_vli_rshift1(a, num_words);
- vli_modInv_update(u, mod, num_words);
- } else if (EVEN(b)) {
- uECC_vli_rshift1(b, num_words);
- vli_modInv_update(v, mod, num_words);
- } else if (cmpResult > 0) {
- uECC_vli_sub(a, a, b, num_words);
- uECC_vli_rshift1(a, num_words);
- if (uECC_vli_cmp_unsafe(u, v, num_words) < 0) {
- uECC_vli_add(u, u, mod, num_words);
- }
- uECC_vli_sub(u, u, v, num_words);
- vli_modInv_update(u, mod, num_words);
- } else {
- uECC_vli_sub(b, b, a, num_words);
- uECC_vli_rshift1(b, num_words);
- if (uECC_vli_cmp_unsafe(v, u, num_words) < 0) {
- uECC_vli_add(v, v, mod, num_words);
- }
- uECC_vli_sub(v, v, u, num_words);
- vli_modInv_update(v, mod, num_words);
- }
- }
- uECC_vli_set(result, u, num_words);
- }
- /* ------ Point operations ------ */
- /* Copyright 2015, Kenneth MacKay. Licensed under the BSD 2-clause license. */
- #ifndef _UECC_CURVE_SPECIFIC_H_
- #define _UECC_CURVE_SPECIFIC_H_
- #define num_bytes_secp160r1 20
- #define num_bytes_secp192r1 24
- #define num_bytes_secp224r1 28
- #define num_bytes_secp256r1 32
- #define num_bytes_secp256k1 32
- #if (uECC_WORD_SIZE == 1)
- #define num_words_secp160r1 20
- #define num_words_secp192r1 24
- #define num_words_secp224r1 28
- #define num_words_secp256r1 32
- #define num_words_secp256k1 32
- #define BYTES_TO_WORDS_8(a, b, c, d, e, f, g, h) \
- 0x##a, 0x##b, 0x##c, 0x##d, 0x##e, 0x##f, 0x##g, 0x##h
- #define BYTES_TO_WORDS_4(a, b, c, d) 0x##a, 0x##b, 0x##c, 0x##d
- #elif (uECC_WORD_SIZE == 4)
- #define num_words_secp160r1 5
- #define num_words_secp192r1 6
- #define num_words_secp224r1 7
- #define num_words_secp256r1 8
- #define num_words_secp256k1 8
- #define BYTES_TO_WORDS_8(a, b, c, d, e, f, g, h) 0x##d##c##b##a, 0x##h##g##f##e
- #define BYTES_TO_WORDS_4(a, b, c, d) 0x##d##c##b##a
- #elif (uECC_WORD_SIZE == 8)
- #define num_words_secp160r1 3
- #define num_words_secp192r1 3
- #define num_words_secp224r1 4
- #define num_words_secp256r1 4
- #define num_words_secp256k1 4
- #define BYTES_TO_WORDS_8(a, b, c, d, e, f, g, h) 0x##h##g##f##e##d##c##b##a##U
- #define BYTES_TO_WORDS_4(a, b, c, d) 0x##d##c##b##a##U
- #endif /* uECC_WORD_SIZE */
- #if uECC_SUPPORTS_secp160r1 || uECC_SUPPORTS_secp192r1 || \
- uECC_SUPPORTS_secp224r1 || uECC_SUPPORTS_secp256r1
- static void double_jacobian_default(uECC_word_t *X1, uECC_word_t *Y1,
- uECC_word_t *Z1, uECC_Curve curve) {
- /* t1 = X, t2 = Y, t3 = Z */
- uECC_word_t t4[uECC_MAX_WORDS];
- uECC_word_t t5[uECC_MAX_WORDS];
- wordcount_t num_words = curve->num_words;
- if (uECC_vli_isZero(Z1, num_words)) {
- return;
- }
- uECC_vli_modSquare_fast(t4, Y1, curve); /* t4 = y1^2 */
- uECC_vli_modMult_fast(t5, X1, t4, curve); /* t5 = x1*y1^2 = A */
- uECC_vli_modSquare_fast(t4, t4, curve); /* t4 = y1^4 */
- uECC_vli_modMult_fast(Y1, Y1, Z1, curve); /* t2 = y1*z1 = z3 */
- uECC_vli_modSquare_fast(Z1, Z1, curve); /* t3 = z1^2 */
- uECC_vli_modAdd(X1, X1, Z1, curve->p, num_words); /* t1 = x1 + z1^2 */
- uECC_vli_modAdd(Z1, Z1, Z1, curve->p, num_words); /* t3 = 2*z1^2 */
- uECC_vli_modSub(Z1, X1, Z1, curve->p, num_words); /* t3 = x1 - z1^2 */
- uECC_vli_modMult_fast(X1, X1, Z1, curve); /* t1 = x1^2 - z1^4 */
- uECC_vli_modAdd(Z1, X1, X1, curve->p, num_words); /* t3 = 2*(x1^2 - z1^4) */
- uECC_vli_modAdd(X1, X1, Z1, curve->p, num_words); /* t1 = 3*(x1^2 - z1^4) */
- if (uECC_vli_testBit(X1, 0)) {
- uECC_word_t l_carry = uECC_vli_add(X1, X1, curve->p, num_words);
- uECC_vli_rshift1(X1, num_words);
- X1[num_words - 1] |= l_carry << (uECC_WORD_BITS - 1);
- } else {
- uECC_vli_rshift1(X1, num_words);
- }
- /* t1 = 3/2*(x1^2 - z1^4) = B */
- uECC_vli_modSquare_fast(Z1, X1, curve); /* t3 = B^2 */
- uECC_vli_modSub(Z1, Z1, t5, curve->p, num_words); /* t3 = B^2 - A */
- uECC_vli_modSub(Z1, Z1, t5, curve->p, num_words); /* t3 = B^2 - 2A = x3 */
- uECC_vli_modSub(t5, t5, Z1, curve->p, num_words); /* t5 = A - x3 */
- uECC_vli_modMult_fast(X1, X1, t5, curve); /* t1 = B * (A - x3) */
- uECC_vli_modSub(t4, X1, t4, curve->p,
- num_words); /* t4 = B * (A - x3) - y1^4 = y3 */
- uECC_vli_set(X1, Z1, num_words);
- uECC_vli_set(Z1, Y1, num_words);
- uECC_vli_set(Y1, t4, num_words);
- }
- /* Computes result = x^3 + ax + b. result must not overlap x. */
- static void x_side_default(uECC_word_t *result, const uECC_word_t *x,
- uECC_Curve curve) {
- uECC_word_t _3[uECC_MAX_WORDS] = {3}; /* -a = 3 */
- wordcount_t num_words = curve->num_words;
- uECC_vli_modSquare_fast(result, x, curve); /* r = x^2 */
- uECC_vli_modSub(result, result, _3, curve->p, num_words); /* r = x^2 - 3 */
- uECC_vli_modMult_fast(result, result, x, curve); /* r = x^3 - 3x */
- uECC_vli_modAdd(result, result, curve->b, curve->p,
- num_words); /* r = x^3 - 3x + b */
- }
- #endif /* uECC_SUPPORTS_secp... */
- #if uECC_SUPPORT_COMPRESSED_POINT
- #if uECC_SUPPORTS_secp160r1 || uECC_SUPPORTS_secp192r1 || \
- uECC_SUPPORTS_secp256r1 || uECC_SUPPORTS_secp256k1
- /* Compute a = sqrt(a) (mod curve_p). */
- static void mod_sqrt_default(uECC_word_t *a, uECC_Curve curve) {
- bitcount_t i;
- uECC_word_t p1[uECC_MAX_WORDS] = {1};
- uECC_word_t l_result[uECC_MAX_WORDS] = {1};
- wordcount_t num_words = curve->num_words;
- /* When curve->p == 3 (mod 4), we can compute
- sqrt(a) = a^((curve->p + 1) / 4) (mod curve->p). */
- uECC_vli_add(p1, curve->p, p1, num_words); /* p1 = curve_p + 1 */
- for (i = uECC_vli_numBits(p1, num_words) - 1; i > 1; --i) {
- uECC_vli_modSquare_fast(l_result, l_result, curve);
- if (uECC_vli_testBit(p1, i)) {
- uECC_vli_modMult_fast(l_result, l_result, a, curve);
- }
- }
- uECC_vli_set(a, l_result, num_words);
- }
- #endif /* uECC_SUPPORTS_secp... */
- #endif /* uECC_SUPPORT_COMPRESSED_POINT */
- #if uECC_SUPPORTS_secp160r1
- #if (uECC_OPTIMIZATION_LEVEL > 0)
- static void vli_mmod_fast_secp160r1(uECC_word_t *result, uECC_word_t *product);
- #endif
- static const struct uECC_Curve_t curve_secp160r1 = {
- num_words_secp160r1,
- num_bytes_secp160r1,
- 161, /* num_n_bits */
- {BYTES_TO_WORDS_8(FF, FF, FF, 7F, FF, FF, FF, FF),
- BYTES_TO_WORDS_8(FF, FF, FF, FF, FF, FF, FF, FF),
- BYTES_TO_WORDS_4(FF, FF, FF, FF)},
- {BYTES_TO_WORDS_8(57, 22, 75, CA, D3, AE, 27, F9),
- BYTES_TO_WORDS_8(C8, F4, 01, 00, 00, 00, 00, 00),
- BYTES_TO_WORDS_8(00, 00, 00, 00, 01, 00, 00, 00)},
- {BYTES_TO_WORDS_8(82, FC, CB, 13, B9, 8B, C3, 68),
- BYTES_TO_WORDS_8(89, 69, 64, 46, 28, 73, F5, 8E),
- BYTES_TO_WORDS_4(68, B5, 96, 4A),
- BYTES_TO_WORDS_8(32, FB, C5, 7A, 37, 51, 23, 04),
- BYTES_TO_WORDS_8(12, C9, DC, 59, 7D, 94, 68, 31),
- BYTES_TO_WORDS_4(55, 28, A6, 23)},
- {BYTES_TO_WORDS_8(45, FA, 65, C5, AD, D4, D4, 81),
- BYTES_TO_WORDS_8(9F, F8, AC, 65, 8B, 7A, BD, 54),
- BYTES_TO_WORDS_4(FC, BE, 97, 1C)},
- &double_jacobian_default,
- #if uECC_SUPPORT_COMPRESSED_POINT
- &mod_sqrt_default,
- #endif
- &x_side_default,
- #if (uECC_OPTIMIZATION_LEVEL > 0)
- &vli_mmod_fast_secp160r1
- #endif
- };
- uECC_Curve uECC_secp160r1(void) {
- return &curve_secp160r1;
- }
- #if (uECC_OPTIMIZATION_LEVEL > 0 && !asm_mmod_fast_secp160r1)
- /* Computes result = product % curve_p
- see http://www.isys.uni-klu.ac.at/PDF/2001-0126-MT.pdf page 354
- Note that this only works if log2(omega) < log2(p) / 2 */
- static void omega_mult_secp160r1(uECC_word_t *result, const uECC_word_t *right);
- #if uECC_WORD_SIZE == 8
- static void vli_mmod_fast_secp160r1(uECC_word_t *result, uECC_word_t *product) {
- uECC_word_t tmp[2 * num_words_secp160r1];
- uECC_word_t copy;
- uECC_vli_clear(tmp, num_words_secp160r1);
- uECC_vli_clear(tmp + num_words_secp160r1, num_words_secp160r1);
- omega_mult_secp160r1(tmp,
- product + num_words_secp160r1 - 1); /* (Rq, q) = q * c */
- product[num_words_secp160r1 - 1] &= 0xffffffff;
- copy = tmp[num_words_secp160r1 - 1];
- tmp[num_words_secp160r1 - 1] &= 0xffffffff;
- uECC_vli_add(result, product, tmp, num_words_secp160r1); /* (C, r) = r + q */
- uECC_vli_clear(product, num_words_secp160r1);
- tmp[num_words_secp160r1 - 1] = copy;
- omega_mult_secp160r1(product, tmp + num_words_secp160r1 - 1); /* Rq*c */
- uECC_vli_add(result, result, product,
- num_words_secp160r1); /* (C1, r) = r + Rq*c */
- while (uECC_vli_cmp_unsafe(result, curve_secp160r1.p, num_words_secp160r1) >
- 0) {
- uECC_vli_sub(result, result, curve_secp160r1.p, num_words_secp160r1);
- }
- }
- static void omega_mult_secp160r1(uint64_t *result, const uint64_t *right) {
- uint32_t carry;
- unsigned i;
- /* Multiply by (2^31 + 1). */
- carry = 0;
- for (i = 0; i < num_words_secp160r1; ++i) {
- uint64_t tmp = (right[i] >> 32) | (right[i + 1] << 32);
- result[i] = (tmp << 31) + tmp + carry;
- carry = (tmp >> 33) + (result[i] < tmp || (carry && result[i] == tmp));
- }
- result[i] = carry;
- }
- #else
- static void vli_mmod_fast_secp160r1(uECC_word_t *result, uECC_word_t *product) {
- uECC_word_t tmp[2 * num_words_secp160r1];
- uECC_word_t carry;
- uECC_vli_clear(tmp, num_words_secp160r1);
- uECC_vli_clear(tmp + num_words_secp160r1, num_words_secp160r1);
- omega_mult_secp160r1(tmp,
- product + num_words_secp160r1); /* (Rq, q) = q * c */
- carry = uECC_vli_add(result, product, tmp,
- num_words_secp160r1); /* (C, r) = r + q */
- uECC_vli_clear(product, num_words_secp160r1);
- omega_mult_secp160r1(product, tmp + num_words_secp160r1); /* Rq*c */
- carry += uECC_vli_add(result, result, product,
- num_words_secp160r1); /* (C1, r) = r + Rq*c */
- while (carry > 0) {
- --carry;
- uECC_vli_sub(result, result, curve_secp160r1.p, num_words_secp160r1);
- }
- if (uECC_vli_cmp_unsafe(result, curve_secp160r1.p, num_words_secp160r1) > 0) {
- uECC_vli_sub(result, result, curve_secp160r1.p, num_words_secp160r1);
- }
- }
- #endif
- #if uECC_WORD_SIZE == 1
- static void omega_mult_secp160r1(uint8_t *result, const uint8_t *right) {
- uint8_t carry;
- uint8_t i;
- /* Multiply by (2^31 + 1). */
- uECC_vli_set(result + 4, right, num_words_secp160r1); /* 2^32 */
- uECC_vli_rshift1(result + 4, num_words_secp160r1); /* 2^31 */
- result[3] = right[0] << 7; /* get last bit from shift */
- carry =
- uECC_vli_add(result, result, right, num_words_secp160r1); /* 2^31 + 1 */
- for (i = num_words_secp160r1; carry; ++i) {
- uint16_t sum = (uint16_t) result[i] + carry;
- result[i] = (uint8_t) sum;
- carry = sum >> 8;
- }
- }
- #elif uECC_WORD_SIZE == 4
- static void omega_mult_secp160r1(uint32_t *result, const uint32_t *right) {
- uint32_t carry;
- unsigned i;
- /* Multiply by (2^31 + 1). */
- uECC_vli_set(result + 1, right, num_words_secp160r1); /* 2^32 */
- uECC_vli_rshift1(result + 1, num_words_secp160r1); /* 2^31 */
- result[0] = right[0] << 31; /* get last bit from shift */
- carry =
- uECC_vli_add(result, result, right, num_words_secp160r1); /* 2^31 + 1 */
- for (i = num_words_secp160r1; carry; ++i) {
- uint64_t sum = (uint64_t) result[i] + carry;
- result[i] = (uint32_t) sum;
- carry = sum >> 32;
- }
- }
- #endif /* uECC_WORD_SIZE */
- #endif /* (uECC_OPTIMIZATION_LEVEL > 0 && !asm_mmod_fast_secp160r1) */
- #endif /* uECC_SUPPORTS_secp160r1 */
- #if uECC_SUPPORTS_secp192r1
- #if (uECC_OPTIMIZATION_LEVEL > 0)
- static void vli_mmod_fast_secp192r1(uECC_word_t *result, uECC_word_t *product);
- #endif
- static const struct uECC_Curve_t curve_secp192r1 = {
- num_words_secp192r1,
- num_bytes_secp192r1,
- 192, /* num_n_bits */
- {BYTES_TO_WORDS_8(FF, FF, FF, FF, FF, FF, FF, FF),
- BYTES_TO_WORDS_8(FE, FF, FF, FF, FF, FF, FF, FF),
- BYTES_TO_WORDS_8(FF, FF, FF, FF, FF, FF, FF, FF)},
- {BYTES_TO_WORDS_8(31, 28, D2, B4, B1, C9, 6B, 14),
- BYTES_TO_WORDS_8(36, F8, DE, 99, FF, FF, FF, FF),
- BYTES_TO_WORDS_8(FF, FF, FF, FF, FF, FF, FF, FF)},
- {BYTES_TO_WORDS_8(12, 10, FF, 82, FD, 0A, FF, F4),
- BYTES_TO_WORDS_8(00, 88, A1, 43, EB, 20, BF, 7C),
- BYTES_TO_WORDS_8(F6, 90, 30, B0, 0E, A8, 8D, 18),
- BYTES_TO_WORDS_8(11, 48, 79, 1E, A1, 77, F9, 73),
- BYTES_TO_WORDS_8(D5, CD, 24, 6B, ED, 11, 10, 63),
- BYTES_TO_WORDS_8(78, DA, C8, FF, 95, 2B, 19, 07)},
- {BYTES_TO_WORDS_8(B1, B9, 46, C1, EC, DE, B8, FE),
- BYTES_TO_WORDS_8(49, 30, 24, 72, AB, E9, A7, 0F),
- BYTES_TO_WORDS_8(E7, 80, 9C, E5, 19, 05, 21, 64)},
- &double_jacobian_default,
- #if uECC_SUPPORT_COMPRESSED_POINT
- &mod_sqrt_default,
- #endif
- &x_side_default,
- #if (uECC_OPTIMIZATION_LEVEL > 0)
- &vli_mmod_fast_secp192r1
- #endif
- };
- uECC_Curve uECC_secp192r1(void) {
- return &curve_secp192r1;
- }
- #if (uECC_OPTIMIZATION_LEVEL > 0)
- /* Computes result = product % curve_p.
- See algorithm 5 and 6 from http://www.isys.uni-klu.ac.at/PDF/2001-0126-MT.pdf
- */
- #if uECC_WORD_SIZE == 1
- static void vli_mmod_fast_secp192r1(uint8_t *result, uint8_t *product) {
- uint8_t tmp[num_words_secp192r1];
- uint8_t carry;
- uECC_vli_set(result, product, num_words_secp192r1);
- uECC_vli_set(tmp, &product[24], num_words_secp192r1);
- carry = uECC_vli_add(result, result, tmp, num_words_secp192r1);
- tmp[0] = tmp[1] = tmp[2] = tmp[3] = tmp[4] = tmp[5] = tmp[6] = tmp[7] = 0;
- tmp[8] = product[24];
- tmp[9] = product[25];
- tmp[10] = product[26];
- tmp[11] = product[27];
- tmp[12] = product[28];
- tmp[13] = product[29];
- tmp[14] = product[30];
- tmp[15] = product[31];
- tmp[16] = product[32];
- tmp[17] = product[33];
- tmp[18] = product[34];
- tmp[19] = product[35];
- tmp[20] = product[36];
- tmp[21] = product[37];
- tmp[22] = product[38];
- tmp[23] = product[39];
- carry += uECC_vli_add(result, result, tmp, num_words_secp192r1);
- tmp[0] = tmp[8] = product[40];
- tmp[1] = tmp[9] = product[41];
- tmp[2] = tmp[10] = product[42];
- tmp[3] = tmp[11] = product[43];
- tmp[4] = tmp[12] = product[44];
- tmp[5] = tmp[13] = product[45];
- tmp[6] = tmp[14] = product[46];
- tmp[7] = tmp[15] = product[47];
- tmp[16] = tmp[17] = tmp[18] = tmp[19] = tmp[20] = tmp[21] = tmp[22] =
- tmp[23] = 0;
- carry += uECC_vli_add(result, result, tmp, num_words_secp192r1);
- while (carry || uECC_vli_cmp_unsafe(curve_secp192r1.p, result,
- num_words_secp192r1) != 1) {
- carry -=
- uECC_vli_sub(result, result, curve_secp192r1.p, num_words_secp192r1);
- }
- }
- #elif uECC_WORD_SIZE == 4
- static void vli_mmod_fast_secp192r1(uint32_t *result, uint32_t *product) {
- uint32_t tmp[num_words_secp192r1];
- int carry;
- uECC_vli_set(result, product, num_words_secp192r1);
- uECC_vli_set(tmp, &product[6], num_words_secp192r1);
- carry = uECC_vli_add(result, result, tmp, num_words_secp192r1);
- tmp[0] = tmp[1] = 0;
- tmp[2] = product[6];
- tmp[3] = product[7];
- tmp[4] = product[8];
- tmp[5] = product[9];
- carry += uECC_vli_add(result, result, tmp, num_words_secp192r1);
- tmp[0] = tmp[2] = product[10];
- tmp[1] = tmp[3] = product[11];
- tmp[4] = tmp[5] = 0;
- carry += uECC_vli_add(result, result, tmp, num_words_secp192r1);
- while (carry || uECC_vli_cmp_unsafe(curve_secp192r1.p, result,
- num_words_secp192r1) != 1) {
- carry -=
- uECC_vli_sub(result, result, curve_secp192r1.p, num_words_secp192r1);
- }
- }
- #else
- static void vli_mmod_fast_secp192r1(uint64_t *result, uint64_t *product) {
- uint64_t tmp[num_words_secp192r1];
- int carry;
- uECC_vli_set(result, product, num_words_secp192r1);
- uECC_vli_set(tmp, &product[3], num_words_secp192r1);
- carry = (int) uECC_vli_add(result, result, tmp, num_words_secp192r1);
- tmp[0] = 0;
- tmp[1] = product[3];
- tmp[2] = product[4];
- carry += uECC_vli_add(result, result, tmp, num_words_secp192r1);
- tmp[0] = tmp[1] = product[5];
- tmp[2] = 0;
- carry += uECC_vli_add(result, result, tmp, num_words_secp192r1);
- while (carry || uECC_vli_cmp_unsafe(curve_secp192r1.p, result,
- num_words_secp192r1) != 1) {
- carry -=
- uECC_vli_sub(result, result, curve_secp192r1.p, num_words_secp192r1);
- }
- }
- #endif /* uECC_WORD_SIZE */
- #endif /* (uECC_OPTIMIZATION_LEVEL > 0) */
- #endif /* uECC_SUPPORTS_secp192r1 */
- #if uECC_SUPPORTS_secp224r1
- #if uECC_SUPPORT_COMPRESSED_POINT
- static void mod_sqrt_secp224r1(uECC_word_t *a, uECC_Curve curve);
- #endif
- #if (uECC_OPTIMIZATION_LEVEL > 0)
- static void vli_mmod_fast_secp224r1(uECC_word_t *result, uECC_word_t *product);
- #endif
- static const struct uECC_Curve_t curve_secp224r1 = {
- num_words_secp224r1,
- num_bytes_secp224r1,
- 224, /* num_n_bits */
- {BYTES_TO_WORDS_8(01, 00, 00, 00, 00, 00, 00, 00),
- BYTES_TO_WORDS_8(00, 00, 00, 00, FF, FF, FF, FF),
- BYTES_TO_WORDS_8(FF, FF, FF, FF, FF, FF, FF, FF),
- BYTES_TO_WORDS_4(FF, FF, FF, FF)},
- {BYTES_TO_WORDS_8(3D, 2A, 5C, 5C, 45, 29, DD, 13),
- BYTES_TO_WORDS_8(3E, F0, B8, E0, A2, 16, FF, FF),
- BYTES_TO_WORDS_8(FF, FF, FF, FF, FF, FF, FF, FF),
- BYTES_TO_WORDS_4(FF, FF, FF, FF)},
- {BYTES_TO_WORDS_8(21, 1D, 5C, 11, D6, 80, 32, 34),
- BYTES_TO_WORDS_8(22, 11, C2, 56, D3, C1, 03, 4A),
- BYTES_TO_WORDS_8(B9, 90, 13, 32, 7F, BF, B4, 6B),
- BYTES_TO_WORDS_4(BD, 0C, 0E, B7),
- BYTES_TO_WORDS_8(34, 7E, 00, 85, 99, 81, D5, 44),
- BYTES_TO_WORDS_8(64, 47, 07, 5A, A0, 75, 43, CD),
- BYTES_TO_WORDS_8(E6, DF, 22, 4C, FB, 23, F7, B5),
- BYTES_TO_WORDS_4(88, 63, 37, BD)},
- {BYTES_TO_WORDS_8(B4, FF, 55, 23, 43, 39, 0B, 27),
- BYTES_TO_WORDS_8(BA, D8, BF, D7, B7, B0, 44, 50),
- BYTES_TO_WORDS_8(56, 32, 41, F5, AB, B3, 04, 0C),
- BYTES_TO_WORDS_4(85, 0A, 05, B4)},
- &double_jacobian_default,
- #if uECC_SUPPORT_COMPRESSED_POINT
- &mod_sqrt_secp224r1,
- #endif
- &x_side_default,
- #if (uECC_OPTIMIZATION_LEVEL > 0)
- &vli_mmod_fast_secp224r1
- #endif
- };
- uECC_Curve uECC_secp224r1(void) {
- return &curve_secp224r1;
- }
- #if uECC_SUPPORT_COMPRESSED_POINT
- /* Routine 3.2.4 RS; from http://www.nsa.gov/ia/_files/nist-routines.pdf */
- static void mod_sqrt_secp224r1_rs(uECC_word_t *d1, uECC_word_t *e1,
- uECC_word_t *f1, const uECC_word_t *d0,
- const uECC_word_t *e0,
- const uECC_word_t *f0) {
- uECC_word_t t[num_words_secp224r1];
- uECC_vli_modSquare_fast(t, d0, &curve_secp224r1); /* t <-- d0 ^ 2 */
- uECC_vli_modMult_fast(e1, d0, e0, &curve_secp224r1); /* e1 <-- d0 * e0 */
- uECC_vli_modAdd(d1, t, f0, curve_secp224r1.p,
- num_words_secp224r1); /* d1 <-- t + f0 */
- uECC_vli_modAdd(e1, e1, e1, curve_secp224r1.p,
- num_words_secp224r1); /* e1 <-- e1 + e1 */
- uECC_vli_modMult_fast(f1, t, f0, &curve_secp224r1); /* f1 <-- t * f0 */
- uECC_vli_modAdd(f1, f1, f1, curve_secp224r1.p,
- num_words_secp224r1); /* f1 <-- f1 + f1 */
- uECC_vli_modAdd(f1, f1, f1, curve_secp224r1.p,
- num_words_secp224r1); /* f1 <-- f1 + f1 */
- }
- /* Routine 3.2.5 RSS; from http://www.nsa.gov/ia/_files/nist-routines.pdf */
- static void mod_sqrt_secp224r1_rss(uECC_word_t *d1, uECC_word_t *e1,
- uECC_word_t *f1, const uECC_word_t *d0,
- const uECC_word_t *e0, const uECC_word_t *f0,
- const bitcount_t j) {
- bitcount_t i;
- uECC_vli_set(d1, d0, num_words_secp224r1); /* d1 <-- d0 */
- uECC_vli_set(e1, e0, num_words_secp224r1); /* e1 <-- e0 */
- uECC_vli_set(f1, f0, num_words_secp224r1); /* f1 <-- f0 */
- for (i = 1; i <= j; i++) {
- mod_sqrt_secp224r1_rs(d1, e1, f1, d1, e1, f1); /* RS (d1,e1,f1,d1,e1,f1) */
- }
- }
- /* Routine 3.2.6 RM; from http://www.nsa.gov/ia/_files/nist-routines.pdf */
- static void mod_sqrt_secp224r1_rm(uECC_word_t *d2, uECC_word_t *e2,
- uECC_word_t *f2, const uECC_word_t *c,
- const uECC_word_t *d0, const uECC_word_t *e0,
- const uECC_word_t *d1,
- const uECC_word_t *e1) {
- uECC_word_t t1[num_words_secp224r1];
- uECC_word_t t2[num_words_secp224r1];
- uECC_vli_modMult_fast(t1, e0, e1, &curve_secp224r1); /* t1 <-- e0 * e1 */
- uECC_vli_modMult_fast(t1, t1, c, &curve_secp224r1); /* t1 <-- t1 * c */
- /* t1 <-- p - t1 */
- uECC_vli_modSub(t1, curve_secp224r1.p, t1, curve_secp224r1.p,
- num_words_secp224r1);
- uECC_vli_modMult_fast(t2, d0, d1, &curve_secp224r1); /* t2 <-- d0 * d1 */
- uECC_vli_modAdd(t2, t2, t1, curve_secp224r1.p,
- num_words_secp224r1); /* t2 <-- t2 + t1 */
- uECC_vli_modMult_fast(t1, d0, e1, &curve_secp224r1); /* t1 <-- d0 * e1 */
- uECC_vli_modMult_fast(e2, d1, e0, &curve_secp224r1); /* e2 <-- d1 * e0 */
- uECC_vli_modAdd(e2, e2, t1, curve_secp224r1.p,
- num_words_secp224r1); /* e2 <-- e2 + t1 */
- uECC_vli_modSquare_fast(f2, e2, &curve_secp224r1); /* f2 <-- e2^2 */
- uECC_vli_modMult_fast(f2, f2, c, &curve_secp224r1); /* f2 <-- f2 * c */
- /* f2 <-- p - f2 */
- uECC_vli_modSub(f2, curve_secp224r1.p, f2, curve_secp224r1.p,
- num_words_secp224r1);
- uECC_vli_set(d2, t2, num_words_secp224r1); /* d2 <-- t2 */
- }
- /* Routine 3.2.7 RP; from http://www.nsa.gov/ia/_files/nist-routines.pdf */
- static void mod_sqrt_secp224r1_rp(uECC_word_t *d1, uECC_word_t *e1,
- uECC_word_t *f1, const uECC_word_t *c,
- const uECC_word_t *r) {
- wordcount_t i;
- wordcount_t pow2i = 1;
- uECC_word_t d0[num_words_secp224r1];
- uECC_word_t e0[num_words_secp224r1] = {1}; /* e0 <-- 1 */
- uECC_word_t f0[num_words_secp224r1];
- uECC_vli_set(d0, r, num_words_secp224r1); /* d0 <-- r */
- /* f0 <-- p - c */
- uECC_vli_modSub(f0, curve_secp224r1.p, c, curve_secp224r1.p,
- num_words_secp224r1);
- for (i = 0; i <= 6; i++) {
- mod_sqrt_secp224r1_rss(d1, e1, f1, d0, e0, f0,
- pow2i); /* RSS (d1,e1,f1,d0,e0,f0,2^i) */
- mod_sqrt_secp224r1_rm(d1, e1, f1, c, d1, e1, d0,
- e0); /* RM (d1,e1,f1,c,d1,e1,d0,e0) */
- uECC_vli_set(d0, d1, num_words_secp224r1); /* d0 <-- d1 */
- uECC_vli_set(e0, e1, num_words_secp224r1); /* e0 <-- e1 */
- uECC_vli_set(f0, f1, num_words_secp224r1); /* f0 <-- f1 */
- pow2i *= 2;
- }
- }
- /* Compute a = sqrt(a) (mod curve_p). */
- /* Routine 3.2.8 mp_mod_sqrt_224; from
- * http://www.nsa.gov/ia/_files/nist-routines.pdf */
- static void mod_sqrt_secp224r1(uECC_word_t *a, uECC_Curve curve) {
- (void) curve;
- bitcount_t i;
- uECC_word_t e1[num_words_secp224r1];
- uECC_word_t f1[num_words_secp224r1];
- uECC_word_t d0[num_words_secp224r1];
- uECC_word_t e0[num_words_secp224r1];
- uECC_word_t f0[num_words_secp224r1];
- uECC_word_t d1[num_words_secp224r1];
- /* s = a; using constant instead of random value */
- mod_sqrt_secp224r1_rp(d0, e0, f0, a, a); /* RP (d0, e0, f0, c, s) */
- mod_sqrt_secp224r1_rs(d1, e1, f1, d0, e0,
- f0); /* RS (d1, e1, f1, d0, e0, f0) */
- for (i = 1; i <= 95; i++) {
- uECC_vli_set(d0, d1, num_words_secp224r1); /* d0 <-- d1 */
- uECC_vli_set(e0, e1, num_words_secp224r1); /* e0 <-- e1 */
- uECC_vli_set(f0, f1, num_words_secp224r1); /* f0 <-- f1 */
- mod_sqrt_secp224r1_rs(d1, e1, f1, d0, e0,
- f0); /* RS (d1, e1, f1, d0, e0, f0) */
- if (uECC_vli_isZero(d1, num_words_secp224r1)) { /* if d1 == 0 */
- break;
- }
- }
- uECC_vli_modInv(f1, e0, curve_secp224r1.p,
- num_words_secp224r1); /* f1 <-- 1 / e0 */
- uECC_vli_modMult_fast(a, d0, f1, &curve_secp224r1); /* a <-- d0 / e0 */
- }
- #endif /* uECC_SUPPORT_COMPRESSED_POINT */
- #if (uECC_OPTIMIZATION_LEVEL > 0)
- /* Computes result = product % curve_p
- from http://www.nsa.gov/ia/_files/nist-routines.pdf */
- #if uECC_WORD_SIZE == 1
- static void vli_mmod_fast_secp224r1(uint8_t *result, uint8_t *product) {
- uint8_t tmp[num_words_secp224r1];
- int8_t carry;
- /* t */
- uECC_vli_set(result, product, num_words_secp224r1);
- /* s1 */
- tmp[0] = tmp[1] = tmp[2] = tmp[3] = 0;
- tmp[4] = tmp[5] = tmp[6] = tmp[7] = 0;
- tmp[8] = tmp[9] = tmp[10] = tmp[11] = 0;
- tmp[12] = product[28];
- tmp[13] = product[29];
- tmp[14] = product[30];
- tmp[15] = product[31];
- tmp[16] = product[32];
- tmp[17] = product[33];
- tmp[18] = product[34];
- tmp[19] = product[35];
- tmp[20] = product[36];
- tmp[21] = product[37];
- tmp[22] = product[38];
- tmp[23] = product[39];
- tmp[24] = product[40];
- tmp[25] = product[41];
- tmp[26] = product[42];
- tmp[27] = product[43];
- carry = uECC_vli_add(result, result, tmp, num_words_secp224r1);
- /* s2 */
- tmp[12] = product[44];
- tmp[13] = product[45];
- tmp[14] = product[46];
- tmp[15] = product[47];
- tmp[16] = product[48];
- tmp[17] = product[49];
- tmp[18] = product[50];
- tmp[19] = product[51];
- tmp[20] = product[52];
- tmp[21] = product[53];
- tmp[22] = product[54];
- tmp[23] = product[55];
- tmp[24] = tmp[25] = tmp[26] = tmp[27] = 0;
- carry += uECC_vli_add(result, result, tmp, num_words_secp224r1);
- /* d1 */
- tmp[0] = product[28];
- tmp[1] = product[29];
- tmp[2] = product[30];
- tmp[3] = product[31];
- tmp[4] = product[32];
- tmp[5] = product[33];
- tmp[6] = product[34];
- tmp[7] = product[35];
- tmp[8] = product[36];
- tmp[9] = product[37];
- tmp[10] = product[38];
- tmp[11] = product[39];
- tmp[12] = product[40];
- tmp[13] = product[41];
- tmp[14] = product[42];
- tmp[15] = product[43];
- tmp[16] = product[44];
- tmp[17] = product[45];
- tmp[18] = product[46];
- tmp[19] = product[47];
- tmp[20] = product[48];
- tmp[21] = product[49];
- tmp[22] = product[50];
- tmp[23] = product[51];
- tmp[24] = product[52];
- tmp[25] = product[53];
- tmp[26] = product[54];
- tmp[27] = product[55];
- carry -= uECC_vli_sub(result, result, tmp, num_words_secp224r1);
- /* d2 */
- tmp[0] = product[44];
- tmp[1] = product[45];
- tmp[2] = product[46];
- tmp[3] = product[47];
- tmp[4] = product[48];
- tmp[5] = product[49];
- tmp[6] = product[50];
- tmp[7] = product[51];
- tmp[8] = product[52];
- tmp[9] = product[53];
- tmp[10] = product[54];
- tmp[11] = product[55];
- tmp[12] = tmp[13] = tmp[14] = tmp[15] = 0;
- tmp[16] = tmp[17] = tmp[18] = tmp[19] = 0;
- tmp[20] = tmp[21] = tmp[22] = tmp[23] = 0;
- tmp[24] = tmp[25] = tmp[26] = tmp[27] = 0;
- carry -= uECC_vli_sub(result, result, tmp, num_words_secp224r1);
- if (carry < 0) {
- do {
- carry +=
- uECC_vli_add(result, result, curve_secp224r1.p, num_words_secp224r1);
- } while (carry < 0);
- } else {
- while (carry || uECC_vli_cmp_unsafe(curve_secp224r1.p, result,
- num_words_secp224r1) != 1) {
- carry -=
- uECC_vli_sub(result, result, curve_secp224r1.p, num_words_secp224r1);
- }
- }
- }
- #elif uECC_WORD_SIZE == 4
- static void vli_mmod_fast_secp224r1(uint32_t *result, uint32_t *product) {
- uint32_t tmp[num_words_secp224r1];
- int carry;
- /* t */
- uECC_vli_set(result, product, num_words_secp224r1);
- /* s1 */
- tmp[0] = tmp[1] = tmp[2] = 0;
- tmp[3] = product[7];
- tmp[4] = product[8];
- tmp[5] = product[9];
- tmp[6] = product[10];
- carry = uECC_vli_add(result, result, tmp, num_words_secp224r1);
- /* s2 */
- tmp[3] = product[11];
- tmp[4] = product[12];
- tmp[5] = product[13];
- tmp[6] = 0;
- carry += uECC_vli_add(result, result, tmp, num_words_secp224r1);
- /* d1 */
- tmp[0] = product[7];
- tmp[1] = product[8];
- tmp[2] = product[9];
- tmp[3] = product[10];
- tmp[4] = product[11];
- tmp[5] = product[12];
- tmp[6] = product[13];
- carry -= uECC_vli_sub(result, result, tmp, num_words_secp224r1);
- /* d2 */
- tmp[0] = product[11];
- tmp[1] = product[12];
- tmp[2] = product[13];
- tmp[3] = tmp[4] = tmp[5] = tmp[6] = 0;
- carry -= uECC_vli_sub(result, result, tmp, num_words_secp224r1);
- if (carry < 0) {
- do {
- carry +=
- uECC_vli_add(result, result, curve_secp224r1.p, num_words_secp224r1);
- } while (carry < 0);
- } else {
- while (carry || uECC_vli_cmp_unsafe(curve_secp224r1.p, result,
- num_words_secp224r1) != 1) {
- carry -=
- uECC_vli_sub(result, result, curve_secp224r1.p, num_words_secp224r1);
- }
- }
- }
- #else
- static void vli_mmod_fast_secp224r1(uint64_t *result, uint64_t *product) {
- uint64_t tmp[num_words_secp224r1];
- int carry = 0;
- /* t */
- uECC_vli_set(result, product, num_words_secp224r1);
- result[num_words_secp224r1 - 1] &= 0xffffffff;
- /* s1 */
- tmp[0] = 0;
- tmp[1] = product[3] & 0xffffffff00000000ull;
- tmp[2] = product[4];
- tmp[3] = product[5] & 0xffffffff;
- uECC_vli_add(result, result, tmp, num_words_secp224r1);
- /* s2 */
- tmp[1] = product[5] & 0xffffffff00000000ull;
- tmp[2] = product[6];
- tmp[3] = 0;
- uECC_vli_add(result, result, tmp, num_words_secp224r1);
- /* d1 */
- tmp[0] = (product[3] >> 32) | (product[4] << 32);
- tmp[1] = (product[4] >> 32) | (product[5] << 32);
- tmp[2] = (product[5] >> 32) | (product[6] << 32);
- tmp[3] = product[6] >> 32;
- carry -= uECC_vli_sub(result, result, tmp, num_words_secp224r1);
- /* d2 */
- tmp[0] = (product[5] >> 32) | (product[6] << 32);
- tmp[1] = product[6] >> 32;
- tmp[2] = tmp[3] = 0;
- carry -= uECC_vli_sub(result, result, tmp, num_words_secp224r1);
- if (carry < 0) {
- do {
- carry +=
- uECC_vli_add(result, result, curve_secp224r1.p, num_words_secp224r1);
- } while (carry < 0);
- } else {
- while (uECC_vli_cmp_unsafe(curve_secp224r1.p, result,
- num_words_secp224r1) != 1) {
- uECC_vli_sub(result, result, curve_secp224r1.p, num_words_secp224r1);
- }
- }
- }
- #endif /* uECC_WORD_SIZE */
- #endif /* (uECC_OPTIMIZATION_LEVEL > 0) */
- #endif /* uECC_SUPPORTS_secp224r1 */
- #if uECC_SUPPORTS_secp256r1
- #if (uECC_OPTIMIZATION_LEVEL > 0)
- static void vli_mmod_fast_secp256r1(uECC_word_t *result, uECC_word_t *product);
- #endif
- static const struct uECC_Curve_t curve_secp256r1 = {
- num_words_secp256r1,
- num_bytes_secp256r1,
- 256, /* num_n_bits */
- {BYTES_TO_WORDS_8(FF, FF, FF, FF, FF, FF, FF, FF),
- BYTES_TO_WORDS_8(FF, FF, FF, FF, 00, 00, 00, 00),
- BYTES_TO_WORDS_8(00, 00, 00, 00, 00, 00, 00, 00),
- BYTES_TO_WORDS_8(01, 00, 00, 00, FF, FF, FF, FF)},
- {BYTES_TO_WORDS_8(51, 25, 63, FC, C2, CA, B9, F3),
- BYTES_TO_WORDS_8(84, 9E, 17, A7, AD, FA, E6, BC),
- BYTES_TO_WORDS_8(FF, FF, FF, FF, FF, FF, FF, FF),
- BYTES_TO_WORDS_8(00, 00, 00, 00, FF, FF, FF, FF)},
- {BYTES_TO_WORDS_8(96, C2, 98, D8, 45, 39, A1, F4),
- BYTES_TO_WORDS_8(A0, 33, EB, 2D, 81, 7D, 03, 77),
- BYTES_TO_WORDS_8(F2, 40, A4, 63, E5, E6, BC, F8),
- BYTES_TO_WORDS_8(47, 42, 2C, E1, F2, D1, 17, 6B),
- BYTES_TO_WORDS_8(F5, 51, BF, 37, 68, 40, B6, CB),
- BYTES_TO_WORDS_8(CE, 5E, 31, 6B, 57, 33, CE, 2B),
- BYTES_TO_WORDS_8(16, 9E, 0F, 7C, 4A, EB, E7, 8E),
- BYTES_TO_WORDS_8(9B, 7F, 1A, FE, E2, 42, E3, 4F)},
- {BYTES_TO_WORDS_8(4B, 60, D2, 27, 3E, 3C, CE, 3B),
- BYTES_TO_WORDS_8(F6, B0, 53, CC, B0, 06, 1D, 65),
- BYTES_TO_WORDS_8(BC, 86, 98, 76, 55, BD, EB, B3),
- BYTES_TO_WORDS_8(E7, 93, 3A, AA, D8, 35, C6, 5A)},
- &double_jacobian_default,
- #if uECC_SUPPORT_COMPRESSED_POINT
- &mod_sqrt_default,
- #endif
- &x_side_default,
- #if (uECC_OPTIMIZATION_LEVEL > 0)
- &vli_mmod_fast_secp256r1
- #endif
- };
- uECC_Curve uECC_secp256r1(void) {
- return &curve_secp256r1;
- }
- #if (uECC_OPTIMIZATION_LEVEL > 0 && !asm_mmod_fast_secp256r1)
- /* Computes result = product % curve_p
- from http://www.nsa.gov/ia/_files/nist-routines.pdf */
- #if uECC_WORD_SIZE == 1
- static void vli_mmod_fast_secp256r1(uint8_t *result, uint8_t *product) {
- uint8_t tmp[num_words_secp256r1];
- int8_t carry;
- /* t */
- uECC_vli_set(result, product, num_words_secp256r1);
- /* s1 */
- tmp[0] = tmp[1] = tmp[2] = tmp[3] = 0;
- tmp[4] = tmp[5] = tmp[6] = tmp[7] = 0;
- tmp[8] = tmp[9] = tmp[10] = tmp[11] = 0;
- tmp[12] = product[44];
- tmp[13] = product[45];
- tmp[14] = product[46];
- tmp[15] = product[47];
- tmp[16] = product[48];
- tmp[17] = product[49];
- tmp[18] = product[50];
- tmp[19] = product[51];
- tmp[20] = product[52];
- tmp[21] = product[53];
- tmp[22] = product[54];
- tmp[23] = product[55];
- tmp[24] = product[56];
- tmp[25] = product[57];
- tmp[26] = product[58];
- tmp[27] = product[59];
- tmp[28] = product[60];
- tmp[29] = product[61];
- tmp[30] = product[62];
- tmp[31] = product[63];
- carry = uECC_vli_add(tmp, tmp, tmp, num_words_secp256r1);
- carry += uECC_vli_add(result, result, tmp, num_words_secp256r1);
- /* s2 */
- tmp[12] = product[48];
- tmp[13] = product[49];
- tmp[14] = product[50];
- tmp[15] = product[51];
- tmp[16] = product[52];
- tmp[17] = product[53];
- tmp[18] = product[54];
- tmp[19] = product[55];
- tmp[20] = product[56];
- tmp[21] = product[57];
- tmp[22] = product[58];
- tmp[23] = product[59];
- tmp[24] = product[60];
- tmp[25] = product[61];
- tmp[26] = product[62];
- tmp[27] = product[63];
- tmp[28] = tmp[29] = tmp[30] = tmp[31] = 0;
- carry += uECC_vli_add(tmp, tmp, tmp, num_words_secp256r1);
- carry += uECC_vli_add(result, result, tmp, num_words_secp256r1);
- /* s3 */
- tmp[0] = product[32];
- tmp[1] = product[33];
- tmp[2] = product[34];
- tmp[3] = product[35];
- tmp[4] = product[36];
- tmp[5] = product[37];
- tmp[6] = product[38];
- tmp[7] = product[39];
- tmp[8] = product[40];
- tmp[9] = product[41];
- tmp[10] = product[42];
- tmp[11] = product[43];
- tmp[12] = tmp[13] = tmp[14] = tmp[15] = 0;
- tmp[16] = tmp[17] = tmp[18] = tmp[19] = 0;
- tmp[20] = tmp[21] = tmp[22] = tmp[23] = 0;
- tmp[24] = product[56];
- tmp[25] = product[57];
- tmp[26] = product[58];
- tmp[27] = product[59];
- tmp[28] = product[60];
- tmp[29] = product[61];
- tmp[30] = product[62];
- tmp[31] = product[63];
- carry += uECC_vli_add(result, result, tmp, num_words_secp256r1);
- /* s4 */
- tmp[0] = product[36];
- tmp[1] = product[37];
- tmp[2] = product[38];
- tmp[3] = product[39];
- tmp[4] = product[40];
- tmp[5] = product[41];
- tmp[6] = product[42];
- tmp[7] = product[43];
- tmp[8] = product[44];
- tmp[9] = product[45];
- tmp[10] = product[46];
- tmp[11] = product[47];
- tmp[12] = product[52];
- tmp[13] = product[53];
- tmp[14] = product[54];
- tmp[15] = product[55];
- tmp[16] = product[56];
- tmp[17] = product[57];
- tmp[18] = product[58];
- tmp[19] = product[59];
- tmp[20] = product[60];
- tmp[21] = product[61];
- tmp[22] = product[62];
- tmp[23] = product[63];
- tmp[24] = product[52];
- tmp[25] = product[53];
- tmp[26] = product[54];
- tmp[27] = product[55];
- tmp[28] = product[32];
- tmp[29] = product[33];
- tmp[30] = product[34];
- tmp[31] = product[35];
- carry += uECC_vli_add(result, result, tmp, num_words_secp256r1);
- /* d1 */
- tmp[0] = product[44];
- tmp[1] = product[45];
- tmp[2] = product[46];
- tmp[3] = product[47];
- tmp[4] = product[48];
- tmp[5] = product[49];
- tmp[6] = product[50];
- tmp[7] = product[51];
- tmp[8] = product[52];
- tmp[9] = product[53];
- tmp[10] = product[54];
- tmp[11] = product[55];
- tmp[12] = tmp[13] = tmp[14] = tmp[15] = 0;
- tmp[16] = tmp[17] = tmp[18] = tmp[19] = 0;
- tmp[20] = tmp[21] = tmp[22] = tmp[23] = 0;
- tmp[24] = product[32];
- tmp[25] = product[33];
- tmp[26] = product[34];
- tmp[27] = product[35];
- tmp[28] = product[40];
- tmp[29] = product[41];
- tmp[30] = product[42];
- tmp[31] = product[43];
- carry -= uECC_vli_sub(result, result, tmp, num_words_secp256r1);
- /* d2 */
- tmp[0] = product[48];
- tmp[1] = product[49];
- tmp[2] = product[50];
- tmp[3] = product[51];
- tmp[4] = product[52];
- tmp[5] = product[53];
- tmp[6] = product[54];
- tmp[7] = product[55];
- tmp[8] = product[56];
- tmp[9] = product[57];
- tmp[10] = product[58];
- tmp[11] = product[59];
- tmp[12] = product[60];
- tmp[13] = product[61];
- tmp[14] = product[62];
- tmp[15] = product[63];
- tmp[16] = tmp[17] = tmp[18] = tmp[19] = 0;
- tmp[20] = tmp[21] = tmp[22] = tmp[23] = 0;
- tmp[24] = product[36];
- tmp[25] = product[37];
- tmp[26] = product[38];
- tmp[27] = product[39];
- tmp[28] = product[44];
- tmp[29] = product[45];
- tmp[30] = product[46];
- tmp[31] = product[47];
- carry -= uECC_vli_sub(result, result, tmp, num_words_secp256r1);
- /* d3 */
- tmp[0] = product[52];
- tmp[1] = product[53];
- tmp[2] = product[54];
- tmp[3] = product[55];
- tmp[4] = product[56];
- tmp[5] = product[57];
- tmp[6] = product[58];
- tmp[7] = product[59];
- tmp[8] = product[60];
- tmp[9] = product[61];
- tmp[10] = product[62];
- tmp[11] = product[63];
- tmp[12] = product[32];
- tmp[13] = product[33];
- tmp[14] = product[34];
- tmp[15] = product[35];
- tmp[16] = product[36];
- tmp[17] = product[37];
- tmp[18] = product[38];
- tmp[19] = product[39];
- tmp[20] = product[40];
- tmp[21] = product[41];
- tmp[22] = product[42];
- tmp[23] = product[43];
- tmp[24] = tmp[25] = tmp[26] = tmp[27] = 0;
- tmp[28] = product[48];
- tmp[29] = product[49];
- tmp[30] = product[50];
- tmp[31] = product[51];
- carry -= uECC_vli_sub(result, result, tmp, num_words_secp256r1);
- /* d4 */
- tmp[0] = product[56];
- tmp[1] = product[57];
- tmp[2] = product[58];
- tmp[3] = product[59];
- tmp[4] = product[60];
- tmp[5] = product[61];
- tmp[6] = product[62];
- tmp[7] = product[63];
- tmp[8] = tmp[9] = tmp[10] = tmp[11] = 0;
- tmp[12] = product[36];
- tmp[13] = product[37];
- tmp[14] = product[38];
- tmp[15] = product[39];
- tmp[16] = product[40];
- tmp[17] = product[41];
- tmp[18] = product[42];
- tmp[19] = product[43];
- tmp[20] = product[44];
- tmp[21] = product[45];
- tmp[22] = product[46];
- tmp[23] = product[47];
- tmp[24] = tmp[25] = tmp[26] = tmp[27] = 0;
- tmp[28] = product[52];
- tmp[29] = product[53];
- tmp[30] = product[54];
- tmp[31] = product[55];
- carry -= uECC_vli_sub(result, result, tmp, num_words_secp256r1);
- if (carry < 0) {
- do {
- carry +=
- uECC_vli_add(result, result, curve_secp256r1.p, num_words_secp256r1);
- } while (carry < 0);
- } else {
- while (carry || uECC_vli_cmp_unsafe(curve_secp256r1.p, result,
- num_words_secp256r1) != 1) {
- carry -=
- uECC_vli_sub(result, result, curve_secp256r1.p, num_words_secp256r1);
- }
- }
- }
- #elif uECC_WORD_SIZE == 4
- static void vli_mmod_fast_secp256r1(uint32_t *result, uint32_t *product) {
- uint32_t tmp[num_words_secp256r1];
- int carry;
- /* t */
- uECC_vli_set(result, product, num_words_secp256r1);
- /* s1 */
- tmp[0] = tmp[1] = tmp[2] = 0;
- tmp[3] = product[11];
- tmp[4] = product[12];
- tmp[5] = product[13];
- tmp[6] = product[14];
- tmp[7] = product[15];
- carry = (int) uECC_vli_add(tmp, tmp, tmp, num_words_secp256r1);
- carry += (int) uECC_vli_add(result, result, tmp, num_words_secp256r1);
- /* s2 */
- tmp[3] = product[12];
- tmp[4] = product[13];
- tmp[5] = product[14];
- tmp[6] = product[15];
- tmp[7] = 0;
- carry += (int) uECC_vli_add(tmp, tmp, tmp, num_words_secp256r1);
- carry += (int) uECC_vli_add(result, result, tmp, num_words_secp256r1);
- /* s3 */
- tmp[0] = product[8];
- tmp[1] = product[9];
- tmp[2] = product[10];
- tmp[3] = tmp[4] = tmp[5] = 0;
- tmp[6] = product[14];
- tmp[7] = product[15];
- carry += (int) uECC_vli_add(result, result, tmp, num_words_secp256r1);
- /* s4 */
- tmp[0] = product[9];
- tmp[1] = product[10];
- tmp[2] = product[11];
- tmp[3] = product[13];
- tmp[4] = product[14];
- tmp[5] = product[15];
- tmp[6] = product[13];
- tmp[7] = product[8];
- carry += (int) uECC_vli_add(result, result, tmp, num_words_secp256r1);
- /* d1 */
- tmp[0] = product[11];
- tmp[1] = product[12];
- tmp[2] = product[13];
- tmp[3] = tmp[4] = tmp[5] = 0;
- tmp[6] = product[8];
- tmp[7] = product[10];
- carry -= (int) uECC_vli_sub(result, result, tmp, num_words_secp256r1);
- /* d2 */
- tmp[0] = product[12];
- tmp[1] = product[13];
- tmp[2] = product[14];
- tmp[3] = product[15];
- tmp[4] = tmp[5] = 0;
- tmp[6] = product[9];
- tmp[7] = product[11];
- carry -= (int) uECC_vli_sub(result, result, tmp, num_words_secp256r1);
- /* d3 */
- tmp[0] = product[13];
- tmp[1] = product[14];
- tmp[2] = product[15];
- tmp[3] = product[8];
- tmp[4] = product[9];
- tmp[5] = product[10];
- tmp[6] = 0;
- tmp[7] = product[12];
- carry -= (int) uECC_vli_sub(result, result, tmp, num_words_secp256r1);
- /* d4 */
- tmp[0] = product[14];
- tmp[1] = product[15];
- tmp[2] = 0;
- tmp[3] = product[9];
- tmp[4] = product[10];
- tmp[5] = product[11];
- tmp[6] = 0;
- tmp[7] = product[13];
- carry -= (int) uECC_vli_sub(result, result, tmp, num_words_secp256r1);
- if (carry < 0) {
- do {
- carry +=
- (int) uECC_vli_add(result, result, curve_secp256r1.p, num_words_secp256r1);
- } while (carry < 0);
- } else {
- while (carry || uECC_vli_cmp_unsafe(curve_secp256r1.p, result,
- num_words_secp256r1) != 1) {
- carry -=
- (int) uECC_vli_sub(result, result, curve_secp256r1.p, num_words_secp256r1);
- }
- }
- }
- #else
- static void vli_mmod_fast_secp256r1(uint64_t *result, uint64_t *product) {
- uint64_t tmp[num_words_secp256r1];
- int carry;
- /* t */
- uECC_vli_set(result, product, num_words_secp256r1);
- /* s1 */
- tmp[0] = 0;
- tmp[1] = product[5] & 0xffffffff00000000U;
- tmp[2] = product[6];
- tmp[3] = product[7];
- carry = (int) uECC_vli_add(tmp, tmp, tmp, num_words_secp256r1);
- carry += (int) uECC_vli_add(result, result, tmp, num_words_secp256r1);
- /* s2 */
- tmp[1] = product[6] << 32;
- tmp[2] = (product[6] >> 32) | (product[7] << 32);
- tmp[3] = product[7] >> 32;
- carry += (int) uECC_vli_add(tmp, tmp, tmp, num_words_secp256r1);
- carry += (int) uECC_vli_add(result, result, tmp, num_words_secp256r1);
- /* s3 */
- tmp[0] = product[4];
- tmp[1] = product[5] & 0xffffffff;
- tmp[2] = 0;
- tmp[3] = product[7];
- carry += (int) uECC_vli_add(result, result, tmp, num_words_secp256r1);
- /* s4 */
- tmp[0] = (product[4] >> 32) | (product[5] << 32);
- tmp[1] = (product[5] >> 32) | (product[6] & 0xffffffff00000000U);
- tmp[2] = product[7];
- tmp[3] = (product[6] >> 32) | (product[4] << 32);
- carry += (int) uECC_vli_add(result, result, tmp, num_words_secp256r1);
- /* d1 */
- tmp[0] = (product[5] >> 32) | (product[6] << 32);
- tmp[1] = (product[6] >> 32);
- tmp[2] = 0;
- tmp[3] = (product[4] & 0xffffffff) | (product[5] << 32);
- carry -= (int) uECC_vli_sub(result, result, tmp, num_words_secp256r1);
- /* d2 */
- tmp[0] = product[6];
- tmp[1] = product[7];
- tmp[2] = 0;
- tmp[3] = (product[4] >> 32) | (product[5] & 0xffffffff00000000);
- carry -= (int) uECC_vli_sub(result, result, tmp, num_words_secp256r1);
- /* d3 */
- tmp[0] = (product[6] >> 32) | (product[7] << 32);
- tmp[1] = (product[7] >> 32) | (product[4] << 32);
- tmp[2] = (product[4] >> 32) | (product[5] << 32);
- tmp[3] = (product[6] << 32);
- carry -= (int) uECC_vli_sub(result, result, tmp, num_words_secp256r1);
- /* d4 */
- tmp[0] = product[7];
- tmp[1] = product[4] & 0xffffffff00000000U;
- tmp[2] = product[5];
- tmp[3] = product[6] & 0xffffffff00000000U;
- carry -= (int) uECC_vli_sub(result, result, tmp, num_words_secp256r1);
- if (carry < 0) {
- do {
- carry +=
- (int) uECC_vli_add(result, result, curve_secp256r1.p, num_words_secp256r1);
- } while (carry < 0);
- } else {
- while (carry || uECC_vli_cmp_unsafe(curve_secp256r1.p, result,
- num_words_secp256r1) != 1) {
- carry -=
- (int) uECC_vli_sub(result, result, curve_secp256r1.p, num_words_secp256r1);
- }
- }
- }
- #endif /* uECC_WORD_SIZE */
- #endif /* (uECC_OPTIMIZATION_LEVEL > 0 && !asm_mmod_fast_secp256r1) */
- #endif /* uECC_SUPPORTS_secp256r1 */
- #if uECC_SUPPORTS_secp256k1
- static void double_jacobian_secp256k1(uECC_word_t *X1, uECC_word_t *Y1,
- uECC_word_t *Z1, uECC_Curve curve);
- static void x_side_secp256k1(uECC_word_t *result, const uECC_word_t *x,
- uECC_Curve curve);
- #if (uECC_OPTIMIZATION_LEVEL > 0)
- static void vli_mmod_fast_secp256k1(uECC_word_t *result, uECC_word_t *product);
- #endif
- static const struct uECC_Curve_t curve_secp256k1 = {
- num_words_secp256k1,
- num_bytes_secp256k1,
- 256, /* num_n_bits */
- {BYTES_TO_WORDS_8(2F, FC, FF, FF, FE, FF, FF, FF),
- BYTES_TO_WORDS_8(FF, FF, FF, FF, FF, FF, FF, FF),
- BYTES_TO_WORDS_8(FF, FF, FF, FF, FF, FF, FF, FF),
- BYTES_TO_WORDS_8(FF, FF, FF, FF, FF, FF, FF, FF)},
- {BYTES_TO_WORDS_8(41, 41, 36, D0, 8C, 5E, D2, BF),
- BYTES_TO_WORDS_8(3B, A0, 48, AF, E6, DC, AE, BA),
- BYTES_TO_WORDS_8(FE, FF, FF, FF, FF, FF, FF, FF),
- BYTES_TO_WORDS_8(FF, FF, FF, FF, FF, FF, FF, FF)},
- {BYTES_TO_WORDS_8(98, 17, F8, 16, 5B, 81, F2, 59),
- BYTES_TO_WORDS_8(D9, 28, CE, 2D, DB, FC, 9B, 02),
- BYTES_TO_WORDS_8(07, 0B, 87, CE, 95, 62, A0, 55),
- BYTES_TO_WORDS_8(AC, BB, DC, F9, 7E, 66, BE, 79),
- BYTES_TO_WORDS_8(B8, D4, 10, FB, 8F, D0, 47, 9C),
- BYTES_TO_WORDS_8(19, 54, 85, A6, 48, B4, 17, FD),
- BYTES_TO_WORDS_8(A8, 08, 11, 0E, FC, FB, A4, 5D),
- BYTES_TO_WORDS_8(65, C4, A3, 26, 77, DA, 3A, 48)},
- {BYTES_TO_WORDS_8(07, 00, 00, 00, 00, 00, 00, 00),
- BYTES_TO_WORDS_8(00, 00, 00, 00, 00, 00, 00, 00),
- BYTES_TO_WORDS_8(00, 00, 00, 00, 00, 00, 00, 00),
- BYTES_TO_WORDS_8(00, 00, 00, 00, 00, 00, 00, 00)},
- &double_jacobian_secp256k1,
- #if uECC_SUPPORT_COMPRESSED_POINT
- &mod_sqrt_default,
- #endif
- &x_side_secp256k1,
- #if (uECC_OPTIMIZATION_LEVEL > 0)
- &vli_mmod_fast_secp256k1
- #endif
- };
- uECC_Curve uECC_secp256k1(void) {
- return &curve_secp256k1;
- }
- /* Double in place */
- static void double_jacobian_secp256k1(uECC_word_t *X1, uECC_word_t *Y1,
- uECC_word_t *Z1, uECC_Curve curve) {
- /* t1 = X, t2 = Y, t3 = Z */
- uECC_word_t t4[num_words_secp256k1];
- uECC_word_t t5[num_words_secp256k1];
- if (uECC_vli_isZero(Z1, num_words_secp256k1)) {
- return;
- }
- uECC_vli_modSquare_fast(t5, Y1, curve); /* t5 = y1^2 */
- uECC_vli_modMult_fast(t4, X1, t5, curve); /* t4 = x1*y1^2 = A */
- uECC_vli_modSquare_fast(X1, X1, curve); /* t1 = x1^2 */
- uECC_vli_modSquare_fast(t5, t5, curve); /* t5 = y1^4 */
- uECC_vli_modMult_fast(Z1, Y1, Z1, curve); /* t3 = y1*z1 = z3 */
- uECC_vli_modAdd(Y1, X1, X1, curve->p, num_words_secp256k1); /* t2 = 2*x1^2 */
- uECC_vli_modAdd(Y1, Y1, X1, curve->p, num_words_secp256k1); /* t2 = 3*x1^2 */
- if (uECC_vli_testBit(Y1, 0)) {
- uECC_word_t carry = uECC_vli_add(Y1, Y1, curve->p, num_words_secp256k1);
- uECC_vli_rshift1(Y1, num_words_secp256k1);
- Y1[num_words_secp256k1 - 1] |= carry << (uECC_WORD_BITS - 1);
- } else {
- uECC_vli_rshift1(Y1, num_words_secp256k1);
- }
- /* t2 = 3/2*(x1^2) = B */
- uECC_vli_modSquare_fast(X1, Y1, curve); /* t1 = B^2 */
- uECC_vli_modSub(X1, X1, t4, curve->p, num_words_secp256k1); /* t1 = B^2 - A */
- uECC_vli_modSub(X1, X1, t4, curve->p,
- num_words_secp256k1); /* t1 = B^2 - 2A = x3 */
- uECC_vli_modSub(t4, t4, X1, curve->p, num_words_secp256k1); /* t4 = A - x3 */
- uECC_vli_modMult_fast(Y1, Y1, t4, curve); /* t2 = B * (A - x3) */
- uECC_vli_modSub(Y1, Y1, t5, curve->p,
- num_words_secp256k1); /* t2 = B * (A - x3) - y1^4 = y3 */
- }
- /* Computes result = x^3 + b. result must not overlap x. */
- static void x_side_secp256k1(uECC_word_t *result, const uECC_word_t *x,
- uECC_Curve curve) {
- uECC_vli_modSquare_fast(result, x, curve); /* r = x^2 */
- uECC_vli_modMult_fast(result, result, x, curve); /* r = x^3 */
- uECC_vli_modAdd(result, result, curve->b, curve->p,
- num_words_secp256k1); /* r = x^3 + b */
- }
- #if (uECC_OPTIMIZATION_LEVEL > 0 && !asm_mmod_fast_secp256k1)
- static void omega_mult_secp256k1(uECC_word_t *result, const uECC_word_t *right);
- static void vli_mmod_fast_secp256k1(uECC_word_t *result, uECC_word_t *product) {
- uECC_word_t tmp[2 * num_words_secp256k1];
- uECC_word_t carry;
- uECC_vli_clear(tmp, num_words_secp256k1);
- uECC_vli_clear(tmp + num_words_secp256k1, num_words_secp256k1);
- omega_mult_secp256k1(tmp,
- product + num_words_secp256k1); /* (Rq, q) = q * c */
- carry = uECC_vli_add(result, product, tmp,
- num_words_secp256k1); /* (C, r) = r + q */
- uECC_vli_clear(product, num_words_secp256k1);
- omega_mult_secp256k1(product, tmp + num_words_secp256k1); /* Rq*c */
- carry += uECC_vli_add(result, result, product,
- num_words_secp256k1); /* (C1, r) = r + Rq*c */
- while (carry > 0) {
- --carry;
- uECC_vli_sub(result, result, curve_secp256k1.p, num_words_secp256k1);
- }
- if (uECC_vli_cmp_unsafe(result, curve_secp256k1.p, num_words_secp256k1) > 0) {
- uECC_vli_sub(result, result, curve_secp256k1.p, num_words_secp256k1);
- }
- }
- #if uECC_WORD_SIZE == 1
- static void omega_mult_secp256k1(uint8_t *result, const uint8_t *right) {
- /* Multiply by (2^32 + 2^9 + 2^8 + 2^7 + 2^6 + 2^4 + 1). */
- uECC_word_t r0 = 0;
- uECC_word_t r1 = 0;
- uECC_word_t r2 = 0;
- wordcount_t k;
- /* Multiply by (2^9 + 2^8 + 2^7 + 2^6 + 2^4 + 1). */
- muladd(0xD1, right[0], &r0, &r1, &r2);
- result[0] = r0;
- r0 = r1;
- r1 = r2;
- /* r2 is still 0 */
- for (k = 1; k < num_words_secp256k1; ++k) {
- muladd(0x03, right[k - 1], &r0, &r1, &r2);
- muladd(0xD1, right[k], &r0, &r1, &r2);
- result[k] = r0;
- r0 = r1;
- r1 = r2;
- r2 = 0;
- }
- muladd(0x03, right[num_words_secp256k1 - 1], &r0, &r1, &r2);
- result[num_words_secp256k1] = r0;
- result[num_words_secp256k1 + 1] = r1;
- /* add the 2^32 multiple */
- result[4 + num_words_secp256k1] =
- uECC_vli_add(result + 4, result + 4, right, num_words_secp256k1);
- }
- #elif uECC_WORD_SIZE == 4
- static void omega_mult_secp256k1(uint32_t *result, const uint32_t *right) {
- /* Multiply by (2^9 + 2^8 + 2^7 + 2^6 + 2^4 + 1). */
- uint32_t carry = 0;
- wordcount_t k;
- for (k = 0; k < num_words_secp256k1; ++k) {
- uint64_t p = (uint64_t) 0x3D1 * right[k] + carry;
- result[k] = (uint32_t) p;
- carry = p >> 32;
- }
- result[num_words_secp256k1] = carry;
- /* add the 2^32 multiple */
- result[1 + num_words_secp256k1] =
- uECC_vli_add(result + 1, result + 1, right, num_words_secp256k1);
- }
- #else
- static void omega_mult_secp256k1(uint64_t *result, const uint64_t *right) {
- uECC_word_t r0 = 0;
- uECC_word_t r1 = 0;
- uECC_word_t r2 = 0;
- wordcount_t k;
- /* Multiply by (2^32 + 2^9 + 2^8 + 2^7 + 2^6 + 2^4 + 1). */
- for (k = 0; k < num_words_secp256k1; ++k) {
- muladd(0x1000003D1ull, right[k], &r0, &r1, &r2);
- result[k] = r0;
- r0 = r1;
- r1 = r2;
- r2 = 0;
- }
- result[num_words_secp256k1] = r0;
- }
- #endif /* uECC_WORD_SIZE */
- #endif /* (uECC_OPTIMIZATION_LEVEL > 0 && && !asm_mmod_fast_secp256k1) */
- #endif /* uECC_SUPPORTS_secp256k1 */
- #endif /* _UECC_CURVE_SPECIFIC_H_ */
- /* Returns 1 if 'point' is the point at infinity, 0 otherwise. */
- #define EccPoint_isZero(point, curve) \
- uECC_vli_isZero((point), (wordcount_t) ((curve)->num_words * 2))
- /* Point multiplication algorithm using Montgomery's ladder with co-Z
- coordinates. From http://eprint.iacr.org/2011/338.pdf
- */
- /* Modify (x1, y1) => (x1 * z^2, y1 * z^3) */
- static void apply_z(uECC_word_t *X1, uECC_word_t *Y1,
- const uECC_word_t *const Z, uECC_Curve curve) {
- uECC_word_t t1[uECC_MAX_WORDS];
- uECC_vli_modSquare_fast(t1, Z, curve); /* z^2 */
- uECC_vli_modMult_fast(X1, X1, t1, curve); /* x1 * z^2 */
- uECC_vli_modMult_fast(t1, t1, Z, curve); /* z^3 */
- uECC_vli_modMult_fast(Y1, Y1, t1, curve); /* y1 * z^3 */
- }
- /* P = (x1, y1) => 2P, (x2, y2) => P' */
- static void XYcZ_initial_double(uECC_word_t *X1, uECC_word_t *Y1,
- uECC_word_t *X2, uECC_word_t *Y2,
- const uECC_word_t *const initial_Z,
- uECC_Curve curve) {
- uECC_word_t z[uECC_MAX_WORDS];
- wordcount_t num_words = curve->num_words;
- if (initial_Z) {
- uECC_vli_set(z, initial_Z, num_words);
- } else {
- uECC_vli_clear(z, num_words);
- z[0] = 1;
- }
- uECC_vli_set(X2, X1, num_words);
- uECC_vli_set(Y2, Y1, num_words);
- apply_z(X1, Y1, z, curve);
- curve->double_jacobian(X1, Y1, z, curve);
- apply_z(X2, Y2, z, curve);
- }
- /* Input P = (x1, y1, Z), Q = (x2, y2, Z)
- Output P' = (x1', y1', Z3), P + Q = (x3, y3, Z3)
- or P => P', Q => P + Q
- */
- static void XYcZ_add(uECC_word_t *X1, uECC_word_t *Y1, uECC_word_t *X2,
- uECC_word_t *Y2, uECC_Curve curve) {
- /* t1 = X1, t2 = Y1, t3 = X2, t4 = Y2 */
- uECC_word_t t5[uECC_MAX_WORDS] = {0};
- wordcount_t num_words = curve->num_words;
- uECC_vli_modSub(t5, X2, X1, curve->p, num_words); /* t5 = x2 - x1 */
- uECC_vli_modSquare_fast(t5, t5, curve); /* t5 = (x2 - x1)^2 = A */
- uECC_vli_modMult_fast(X1, X1, t5, curve); /* t1 = x1*A = B */
- uECC_vli_modMult_fast(X2, X2, t5, curve); /* t3 = x2*A = C */
- uECC_vli_modSub(Y2, Y2, Y1, curve->p, num_words); /* t4 = y2 - y1 */
- uECC_vli_modSquare_fast(t5, Y2, curve); /* t5 = (y2 - y1)^2 = D */
- uECC_vli_modSub(t5, t5, X1, curve->p, num_words); /* t5 = D - B */
- uECC_vli_modSub(t5, t5, X2, curve->p, num_words); /* t5 = D - B - C = x3 */
- uECC_vli_modSub(X2, X2, X1, curve->p, num_words); /* t3 = C - B */
- uECC_vli_modMult_fast(Y1, Y1, X2, curve); /* t2 = y1*(C - B) */
- uECC_vli_modSub(X2, X1, t5, curve->p, num_words); /* t3 = B - x3 */
- uECC_vli_modMult_fast(Y2, Y2, X2, curve); /* t4 = (y2 - y1)*(B - x3) */
- uECC_vli_modSub(Y2, Y2, Y1, curve->p, num_words); /* t4 = y3 */
- uECC_vli_set(X2, t5, num_words);
- }
- /* Input P = (x1, y1, Z), Q = (x2, y2, Z)
- Output P + Q = (x3, y3, Z3), P - Q = (x3', y3', Z3)
- or P => P - Q, Q => P + Q
- */
- static void XYcZ_addC(uECC_word_t *X1, uECC_word_t *Y1, uECC_word_t *X2,
- uECC_word_t *Y2, uECC_Curve curve) {
- /* t1 = X1, t2 = Y1, t3 = X2, t4 = Y2 */
- uECC_word_t t5[uECC_MAX_WORDS] = {0};
- uECC_word_t t6[uECC_MAX_WORDS];
- uECC_word_t t7[uECC_MAX_WORDS];
- wordcount_t num_words = curve->num_words;
- uECC_vli_modSub(t5, X2, X1, curve->p, num_words); /* t5 = x2 - x1 */
- uECC_vli_modSquare_fast(t5, t5, curve); /* t5 = (x2 - x1)^2 = A */
- uECC_vli_modMult_fast(X1, X1, t5, curve); /* t1 = x1*A = B */
- uECC_vli_modMult_fast(X2, X2, t5, curve); /* t3 = x2*A = C */
- uECC_vli_modAdd(t5, Y2, Y1, curve->p, num_words); /* t5 = y2 + y1 */
- uECC_vli_modSub(Y2, Y2, Y1, curve->p, num_words); /* t4 = y2 - y1 */
- uECC_vli_modSub(t6, X2, X1, curve->p, num_words); /* t6 = C - B */
- uECC_vli_modMult_fast(Y1, Y1, t6, curve); /* t2 = y1 * (C - B) = E */
- uECC_vli_modAdd(t6, X1, X2, curve->p, num_words); /* t6 = B + C */
- uECC_vli_modSquare_fast(X2, Y2, curve); /* t3 = (y2 - y1)^2 = D */
- uECC_vli_modSub(X2, X2, t6, curve->p, num_words); /* t3 = D - (B + C) = x3 */
- uECC_vli_modSub(t7, X1, X2, curve->p, num_words); /* t7 = B - x3 */
- uECC_vli_modMult_fast(Y2, Y2, t7, curve); /* t4 = (y2 - y1)*(B - x3) */
- uECC_vli_modSub(Y2, Y2, Y1, curve->p,
- num_words); /* t4 = (y2 - y1)*(B - x3) - E = y3 */
- uECC_vli_modSquare_fast(t7, t5, curve); /* t7 = (y2 + y1)^2 = F */
- uECC_vli_modSub(t7, t7, t6, curve->p, num_words); /* t7 = F - (B + C) = x3' */
- uECC_vli_modSub(t6, t7, X1, curve->p, num_words); /* t6 = x3' - B */
- uECC_vli_modMult_fast(t6, t6, t5, curve); /* t6 = (y2+y1)*(x3' - B) */
- uECC_vli_modSub(Y1, t6, Y1, curve->p,
- num_words); /* t2 = (y2+y1)*(x3' - B) - E = y3' */
- uECC_vli_set(X1, t7, num_words);
- }
- /* result may overlap point. */
- static void EccPoint_mult(uECC_word_t *result, const uECC_word_t *point,
- const uECC_word_t *scalar,
- const uECC_word_t *initial_Z, bitcount_t num_bits,
- uECC_Curve curve) {
- /* R0 and R1 */
- uECC_word_t Rx[2][uECC_MAX_WORDS];
- uECC_word_t Ry[2][uECC_MAX_WORDS];
- uECC_word_t z[uECC_MAX_WORDS];
- bitcount_t i;
- uECC_word_t nb;
- wordcount_t num_words = curve->num_words;
- uECC_vli_set(Rx[1], point, num_words);
- uECC_vli_set(Ry[1], point + num_words, num_words);
- XYcZ_initial_double(Rx[1], Ry[1], Rx[0], Ry[0], initial_Z, curve);
- for (i = num_bits - 2; i > 0; --i) {
- nb = !uECC_vli_testBit(scalar, i);
- XYcZ_addC(Rx[1 - nb], Ry[1 - nb], Rx[nb], Ry[nb], curve);
- XYcZ_add(Rx[nb], Ry[nb], Rx[1 - nb], Ry[1 - nb], curve);
- }
- nb = !uECC_vli_testBit(scalar, 0);
- XYcZ_addC(Rx[1 - nb], Ry[1 - nb], Rx[nb], Ry[nb], curve);
- /* Find final 1/Z value. */
- uECC_vli_modSub(z, Rx[1], Rx[0], curve->p, num_words); /* X1 - X0 */
- uECC_vli_modMult_fast(z, z, Ry[1 - nb], curve); /* Yb * (X1 - X0) */
- uECC_vli_modMult_fast(z, z, point, curve); /* xP * Yb * (X1 - X0) */
- uECC_vli_modInv(z, z, curve->p, num_words); /* 1 / (xP * Yb * (X1 - X0)) */
- /* yP / (xP * Yb * (X1 - X0)) */
- uECC_vli_modMult_fast(z, z, point + num_words, curve);
- uECC_vli_modMult_fast(z, z, Rx[1 - nb],
- curve); /* Xb * yP / (xP * Yb * (X1 - X0)) */
- /* End 1/Z calculation */
- XYcZ_add(Rx[nb], Ry[nb], Rx[1 - nb], Ry[1 - nb], curve);
- apply_z(Rx[0], Ry[0], z, curve);
- uECC_vli_set(result, Rx[0], num_words);
- uECC_vli_set(result + num_words, Ry[0], num_words);
- }
- static uECC_word_t regularize_k(const uECC_word_t *const k, uECC_word_t *k0,
- uECC_word_t *k1, uECC_Curve curve) {
- wordcount_t num_n_words = BITS_TO_WORDS(curve->num_n_bits);
- bitcount_t num_n_bits = curve->num_n_bits;
- uECC_word_t carry =
- uECC_vli_add(k0, k, curve->n, num_n_words) ||
- (num_n_bits < ((bitcount_t) num_n_words * uECC_WORD_SIZE * 8) &&
- uECC_vli_testBit(k0, num_n_bits));
- uECC_vli_add(k1, k0, curve->n, num_n_words);
- return carry;
- }
- /* Generates a random integer in the range 0 < random < top.
- Both random and top have num_words words. */
- uECC_VLI_API int uECC_generate_random_int(uECC_word_t *random,
- const uECC_word_t *top,
- wordcount_t num_words) {
- uECC_word_t mask = (uECC_word_t) -1;
- uECC_word_t tries;
- bitcount_t num_bits = uECC_vli_numBits(top, num_words);
- if (!g_rng_function) {
- return 0;
- }
- for (tries = 0; tries < uECC_RNG_MAX_TRIES; ++tries) {
- if (!g_rng_function((uint8_t *) random,
- (unsigned int) (num_words * uECC_WORD_SIZE))) {
- return 0;
- }
- random[num_words - 1] &=
- mask >> ((bitcount_t) (num_words * uECC_WORD_SIZE * 8 - num_bits));
- if (!uECC_vli_isZero(random, num_words) &&
- uECC_vli_cmp(top, random, num_words) == 1) {
- return 1;
- }
- }
- return 0;
- }
- static uECC_word_t EccPoint_compute_public_key(uECC_word_t *result,
- uECC_word_t *private_key,
- uECC_Curve curve) {
- uECC_word_t tmp1[uECC_MAX_WORDS];
- uECC_word_t tmp2[uECC_MAX_WORDS];
- uECC_word_t *p2[2] = {tmp1, tmp2};
- uECC_word_t *initial_Z = 0;
- uECC_word_t carry;
- /* Regularize the bitcount for the private key so that attackers cannot use a
- side channel attack to learn the number of leading zeros. */
- carry = regularize_k(private_key, tmp1, tmp2, curve);
- /* If an RNG function was specified, try to get a random initial Z value to
- improve protection against side-channel attacks. */
- if (g_rng_function) {
- if (!uECC_generate_random_int(p2[carry], curve->p, curve->num_words)) {
- return 0;
- }
- initial_Z = p2[carry];
- }
- EccPoint_mult(result, curve->G, p2[!carry], initial_Z,
- (bitcount_t) (curve->num_n_bits + 1), curve);
- if (EccPoint_isZero(result, curve)) {
- return 0;
- }
- return 1;
- }
- #if uECC_WORD_SIZE == 1
- uECC_VLI_API void uECC_vli_nativeToBytes(uint8_t *bytes, int num_bytes,
- const uint8_t *native) {
- wordcount_t i;
- for (i = 0; i < num_bytes; ++i) {
- bytes[i] = native[(num_bytes - 1) - i];
- }
- }
- uECC_VLI_API void uECC_vli_bytesToNative(uint8_t *native, const uint8_t *bytes,
- int num_bytes) {
- uECC_vli_nativeToBytes(native, num_bytes, bytes);
- }
- #else
- uECC_VLI_API void uECC_vli_nativeToBytes(uint8_t *bytes, int num_bytes,
- const uECC_word_t *native) {
- int i;
- for (i = 0; i < num_bytes; ++i) {
- unsigned b = (unsigned) (num_bytes - 1 - i);
- bytes[i] =
- (uint8_t) (native[b / uECC_WORD_SIZE] >> (8 * (b % uECC_WORD_SIZE)));
- }
- }
- uECC_VLI_API void uECC_vli_bytesToNative(uECC_word_t *native,
- const uint8_t *bytes, int num_bytes) {
- int i;
- uECC_vli_clear(native, (wordcount_t) ((num_bytes + (uECC_WORD_SIZE - 1)) /
- uECC_WORD_SIZE));
- for (i = 0; i < num_bytes; ++i) {
- unsigned b = (unsigned) (num_bytes - 1 - i);
- native[b / uECC_WORD_SIZE] |= (uECC_word_t) bytes[i]
- << (8 * (b % uECC_WORD_SIZE));
- }
- }
- #endif /* uECC_WORD_SIZE */
- int uECC_make_key(uint8_t *public_key, uint8_t *private_key, uECC_Curve curve) {
- #if uECC_VLI_NATIVE_LITTLE_ENDIAN
- uECC_word_t *_private = (uECC_word_t *) private_key;
- uECC_word_t *_public = (uECC_word_t *) public_key;
- #else
- uECC_word_t _private[uECC_MAX_WORDS];
- uECC_word_t _public[uECC_MAX_WORDS * 2];
- #endif
- uECC_word_t tries;
- for (tries = 0; tries < uECC_RNG_MAX_TRIES; ++tries) {
- if (!uECC_generate_random_int(_private, curve->n,
- BITS_TO_WORDS(curve->num_n_bits))) {
- return 0;
- }
- if (EccPoint_compute_public_key(_public, _private, curve)) {
- #if uECC_VLI_NATIVE_LITTLE_ENDIAN == 0
- uECC_vli_nativeToBytes(private_key, BITS_TO_BYTES(curve->num_n_bits),
- _private);
- uECC_vli_nativeToBytes(public_key, curve->num_bytes, _public);
- uECC_vli_nativeToBytes(public_key + curve->num_bytes, curve->num_bytes,
- _public + curve->num_words);
- #endif
- return 1;
- }
- }
- return 0;
- }
- int uECC_shared_secret(const uint8_t *public_key, const uint8_t *private_key,
- uint8_t *secret, uECC_Curve curve) {
- uECC_word_t _public[uECC_MAX_WORDS * 2];
- uECC_word_t _private[uECC_MAX_WORDS];
- uECC_word_t tmp[uECC_MAX_WORDS];
- uECC_word_t *p2[2] = {_private, tmp};
- uECC_word_t *initial_Z = 0;
- uECC_word_t carry;
- wordcount_t num_words = curve->num_words;
- wordcount_t num_bytes = curve->num_bytes;
- #if uECC_VLI_NATIVE_LITTLE_ENDIAN
- bcopy((uint8_t *) _private, private_key, num_bytes);
- bcopy((uint8_t *) _public, public_key, num_bytes * 2);
- #else
- uECC_vli_bytesToNative(_private, private_key,
- BITS_TO_BYTES(curve->num_n_bits));
- uECC_vli_bytesToNative(_public, public_key, num_bytes);
- uECC_vli_bytesToNative(_public + num_words, public_key + num_bytes,
- num_bytes);
- #endif
- /* Regularize the bitcount for the private key so that attackers cannot use a
- side channel attack to learn the number of leading zeros. */
- carry = regularize_k(_private, _private, tmp, curve);
- /* If an RNG function was specified, try to get a random initial Z value to
- improve protection against side-channel attacks. */
- if (g_rng_function) {
- if (!uECC_generate_random_int(p2[carry], curve->p, num_words)) {
- return 0;
- }
- initial_Z = p2[carry];
- }
- EccPoint_mult(_public, _public, p2[!carry], initial_Z,
- (bitcount_t) (curve->num_n_bits + 1), curve);
- #if uECC_VLI_NATIVE_LITTLE_ENDIAN
- bcopy((uint8_t *) secret, (uint8_t *) _public, num_bytes);
- #else
- uECC_vli_nativeToBytes(secret, num_bytes, _public);
- #endif
- return !EccPoint_isZero(_public, curve);
- }
- #if uECC_SUPPORT_COMPRESSED_POINT
- void uECC_compress(const uint8_t *public_key, uint8_t *compressed,
- uECC_Curve curve) {
- wordcount_t i;
- for (i = 0; i < curve->num_bytes; ++i) {
- compressed[i + 1] = public_key[i];
- }
- #if uECC_VLI_NATIVE_LITTLE_ENDIAN
- compressed[0] = 2 + (public_key[curve->num_bytes] & 0x01);
- #else
- compressed[0] = 2 + (public_key[curve->num_bytes * 2 - 1] & 0x01);
- #endif
- }
- void uECC_decompress(const uint8_t *compressed, uint8_t *public_key,
- uECC_Curve curve) {
- #if uECC_VLI_NATIVE_LITTLE_ENDIAN
- uECC_word_t *point = (uECC_word_t *) public_key;
- #else
- uECC_word_t point[uECC_MAX_WORDS * 2];
- #endif
- uECC_word_t *y = point + curve->num_words;
- #if uECC_VLI_NATIVE_LITTLE_ENDIAN
- bcopy(public_key, compressed + 1, curve->num_bytes);
- #else
- uECC_vli_bytesToNative(point, compressed + 1, curve->num_bytes);
- #endif
- curve->x_side(y, point, curve);
- curve->mod_sqrt(y, curve);
- if ((uint8_t) (y[0] & 0x01) != (compressed[0] & 0x01)) {
- uECC_vli_sub(y, curve->p, y, curve->num_words);
- }
- #if uECC_VLI_NATIVE_LITTLE_ENDIAN == 0
- uECC_vli_nativeToBytes(public_key, curve->num_bytes, point);
- uECC_vli_nativeToBytes(public_key + curve->num_bytes, curve->num_bytes, y);
- #endif
- }
- #endif /* uECC_SUPPORT_COMPRESSED_POINT */
- uECC_VLI_API int uECC_valid_point(const uECC_word_t *point, uECC_Curve curve) {
- uECC_word_t tmp1[uECC_MAX_WORDS];
- uECC_word_t tmp2[uECC_MAX_WORDS];
- wordcount_t num_words = curve->num_words;
- /* The point at infinity is invalid. */
- if (EccPoint_isZero(point, curve)) {
- return 0;
- }
- /* x and y must be smaller than p. */
- if (uECC_vli_cmp_unsafe(curve->p, point, num_words) != 1 ||
- uECC_vli_cmp_unsafe(curve->p, point + num_words, num_words) != 1) {
- return 0;
- }
- uECC_vli_modSquare_fast(tmp1, point + num_words, curve);
- curve->x_side(tmp2, point, curve); /* tmp2 = x^3 + ax + b */
- /* Make sure that y^2 == x^3 + ax + b */
- return (int) (uECC_vli_equal(tmp1, tmp2, num_words));
- }
- int uECC_valid_public_key(const uint8_t *public_key, uECC_Curve curve) {
- #if uECC_VLI_NATIVE_LITTLE_ENDIAN
- uECC_word_t *_public = (uECC_word_t *) public_key;
- #else
- uECC_word_t _public[uECC_MAX_WORDS * 2];
- #endif
- #if uECC_VLI_NATIVE_LITTLE_ENDIAN == 0
- uECC_vli_bytesToNative(_public, public_key, curve->num_bytes);
- uECC_vli_bytesToNative(_public + curve->num_words,
- public_key + curve->num_bytes, curve->num_bytes);
- #endif
- return uECC_valid_point(_public, curve);
- }
- int uECC_compute_public_key(const uint8_t *private_key, uint8_t *public_key,
- uECC_Curve curve) {
- #if uECC_VLI_NATIVE_LITTLE_ENDIAN
- uECC_word_t *_private = (uECC_word_t *) private_key;
- uECC_word_t *_public = (uECC_word_t *) public_key;
- #else
- uECC_word_t _private[uECC_MAX_WORDS];
- uECC_word_t _public[uECC_MAX_WORDS * 2];
- #endif
- #if uECC_VLI_NATIVE_LITTLE_ENDIAN == 0
- uECC_vli_bytesToNative(_private, private_key,
- BITS_TO_BYTES(curve->num_n_bits));
- #endif
- /* Make sure the private key is in the range [1, n-1]. */
- if (uECC_vli_isZero(_private, BITS_TO_WORDS(curve->num_n_bits))) {
- return 0;
- }
- if (uECC_vli_cmp(curve->n, _private, BITS_TO_WORDS(curve->num_n_bits)) != 1) {
- return 0;
- }
- /* Compute public key. */
- if (!EccPoint_compute_public_key(_public, _private, curve)) {
- return 0;
- }
- #if uECC_VLI_NATIVE_LITTLE_ENDIAN == 0
- uECC_vli_nativeToBytes(public_key, curve->num_bytes, _public);
- uECC_vli_nativeToBytes(public_key + curve->num_bytes, curve->num_bytes,
- _public + curve->num_words);
- #endif
- return 1;
- }
- /* -------- ECDSA code -------- */
- static void bits2int(uECC_word_t *native, const uint8_t *bits,
- unsigned bits_size, uECC_Curve curve) {
- unsigned num_n_bytes = (unsigned) BITS_TO_BYTES(curve->num_n_bits);
- unsigned num_n_words = (unsigned) BITS_TO_WORDS(curve->num_n_bits);
- int shift;
- uECC_word_t carry;
- uECC_word_t *ptr;
- if (bits_size > num_n_bytes) {
- bits_size = num_n_bytes;
- }
- uECC_vli_clear(native, (wordcount_t) num_n_words);
- #if uECC_VLI_NATIVE_LITTLE_ENDIAN
- bcopy((uint8_t *) native, bits, bits_size);
- #else
- uECC_vli_bytesToNative(native, bits, (int) bits_size);
- #endif
- if (bits_size * 8 <= (unsigned) curve->num_n_bits) {
- return;
- }
- shift = (int) bits_size * 8 - curve->num_n_bits;
- carry = 0;
- ptr = native + num_n_words;
- while (ptr-- > native) {
- uECC_word_t temp = *ptr;
- *ptr = (temp >> shift) | carry;
- carry = temp << (uECC_WORD_BITS - shift);
- }
- /* Reduce mod curve_n */
- if (uECC_vli_cmp_unsafe(curve->n, native, (wordcount_t) num_n_words) != 1) {
- uECC_vli_sub(native, native, curve->n, (wordcount_t) num_n_words);
- }
- }
- static int uECC_sign_with_k_internal(const uint8_t *private_key,
- const uint8_t *message_hash,
- unsigned hash_size, uECC_word_t *k,
- uint8_t *signature, uECC_Curve curve) {
- uECC_word_t tmp[uECC_MAX_WORDS];
- uECC_word_t s[uECC_MAX_WORDS];
- uECC_word_t *k2[2] = {tmp, s};
- uECC_word_t *initial_Z = 0;
- #if uECC_VLI_NATIVE_LITTLE_ENDIAN
- uECC_word_t *p = (uECC_word_t *) signature;
- #else
- uECC_word_t p[uECC_MAX_WORDS * 2];
- #endif
- uECC_word_t carry;
- wordcount_t num_words = curve->num_words;
- wordcount_t num_n_words = BITS_TO_WORDS(curve->num_n_bits);
- bitcount_t num_n_bits = curve->num_n_bits;
- /* Make sure 0 < k < curve_n */
- if (uECC_vli_isZero(k, num_words) ||
- uECC_vli_cmp(curve->n, k, num_n_words) != 1) {
- return 0;
- }
- carry = regularize_k(k, tmp, s, curve);
- /* If an RNG function was specified, try to get a random initial Z value to
- improve protection against side-channel attacks. */
- if (g_rng_function) {
- if (!uECC_generate_random_int(k2[carry], curve->p, num_words)) {
- return 0;
- }
- initial_Z = k2[carry];
- }
- EccPoint_mult(p, curve->G, k2[!carry], initial_Z,
- (bitcount_t) (num_n_bits + 1), curve);
- if (uECC_vli_isZero(p, num_words)) {
- return 0;
- }
- /* If an RNG function was specified, get a random number
- to prevent side channel analysis of k. */
- if (!g_rng_function) {
- uECC_vli_clear(tmp, num_n_words);
- tmp[0] = 1;
- } else if (!uECC_generate_random_int(tmp, curve->n, num_n_words)) {
- return 0;
- }
- /* Prevent side channel analysis of uECC_vli_modInv() to determine
- bits of k / the private key by premultiplying by a random number */
- uECC_vli_modMult(k, k, tmp, curve->n, num_n_words); /* k' = rand * k */
- uECC_vli_modInv(k, k, curve->n, num_n_words); /* k = 1 / k' */
- uECC_vli_modMult(k, k, tmp, curve->n, num_n_words); /* k = 1 / k */
- #if uECC_VLI_NATIVE_LITTLE_ENDIAN == 0
- uECC_vli_nativeToBytes(signature, curve->num_bytes, p); /* store r */
- #endif
- #if uECC_VLI_NATIVE_LITTLE_ENDIAN
- bcopy((uint8_t *) tmp, private_key, BITS_TO_BYTES(curve->num_n_bits));
- #else
- uECC_vli_bytesToNative(tmp, private_key,
- BITS_TO_BYTES(curve->num_n_bits)); /* tmp = d */
- #endif
- s[num_n_words - 1] = 0;
- uECC_vli_set(s, p, num_words);
- uECC_vli_modMult(s, tmp, s, curve->n, num_n_words); /* s = r*d */
- bits2int(tmp, message_hash, hash_size, curve);
- uECC_vli_modAdd(s, tmp, s, curve->n, num_n_words); /* s = e + r*d */
- uECC_vli_modMult(s, s, k, curve->n, num_n_words); /* s = (e + r*d) / k */
- if (uECC_vli_numBits(s, num_n_words) > (bitcount_t) curve->num_bytes * 8) {
- return 0;
- }
- #if uECC_VLI_NATIVE_LITTLE_ENDIAN
- bcopy((uint8_t *) signature + curve->num_bytes, (uint8_t *) s,
- curve->num_bytes);
- #else
- uECC_vli_nativeToBytes(signature + curve->num_bytes, curve->num_bytes, s);
- #endif
- return 1;
- }
- #if 0
- /* For testing - sign with an explicitly specified k value */
- int uECC_sign_with_k(const uint8_t *private_key, const uint8_t *message_hash,
- unsigned hash_size, const uint8_t *k, uint8_t *signature,
- uECC_Curve curve) {
- uECC_word_t k2[uECC_MAX_WORDS];
- bits2int(k2, k, (unsigned) BITS_TO_BYTES(curve->num_n_bits), curve);
- return uECC_sign_with_k_internal(private_key, message_hash, hash_size, k2,
- signature, curve);
- }
- #endif
- int uECC_sign(const uint8_t *private_key, const uint8_t *message_hash,
- unsigned hash_size, uint8_t *signature, uECC_Curve curve) {
- uECC_word_t k[uECC_MAX_WORDS];
- uECC_word_t tries;
- for (tries = 0; tries < uECC_RNG_MAX_TRIES; ++tries) {
- if (!uECC_generate_random_int(k, curve->n,
- BITS_TO_WORDS(curve->num_n_bits))) {
- return 0;
- }
- if (uECC_sign_with_k_internal(private_key, message_hash, hash_size, k,
- signature, curve)) {
- return 1;
- }
- }
- return 0;
- }
- /* Compute an HMAC using K as a key (as in RFC 6979). Note that K is always
- the same size as the hash result size. */
- static void HMAC_init(const uECC_HashContext *hash_context, const uint8_t *K) {
- uint8_t *pad = hash_context->tmp + 2 * hash_context->result_size;
- unsigned i;
- for (i = 0; i < hash_context->result_size; ++i) pad[i] = K[i] ^ 0x36;
- for (; i < hash_context->block_size; ++i) pad[i] = 0x36;
- hash_context->init_hash(hash_context);
- hash_context->update_hash(hash_context, pad, hash_context->block_size);
- }
- static void HMAC_update(const uECC_HashContext *hash_context,
- const uint8_t *message, unsigned message_size) {
- hash_context->update_hash(hash_context, message, message_size);
- }
- static void HMAC_finish(const uECC_HashContext *hash_context, const uint8_t *K,
- uint8_t *result) {
- uint8_t *pad = hash_context->tmp + 2 * hash_context->result_size;
- unsigned i;
- for (i = 0; i < hash_context->result_size; ++i) pad[i] = K[i] ^ 0x5c;
- for (; i < hash_context->block_size; ++i) pad[i] = 0x5c;
- hash_context->finish_hash(hash_context, result);
- hash_context->init_hash(hash_context);
- hash_context->update_hash(hash_context, pad, hash_context->block_size);
- hash_context->update_hash(hash_context, result, hash_context->result_size);
- hash_context->finish_hash(hash_context, result);
- }
- /* V = HMAC_K(V) */
- static void update_V(const uECC_HashContext *hash_context, uint8_t *K,
- uint8_t *V) {
- HMAC_init(hash_context, K);
- HMAC_update(hash_context, V, hash_context->result_size);
- HMAC_finish(hash_context, K, V);
- }
- /* Deterministic signing, similar to RFC 6979. Differences are:
- * We just use H(m) directly rather than bits2octets(H(m))
- (it is not reduced modulo curve_n).
- * We generate a value for k (aka T) directly rather than converting
- endianness.
- Layout of hash_context->tmp: <K> | <V> | (1 byte overlapped 0x00 or 0x01) /
- <HMAC pad> */
- int uECC_sign_deterministic(const uint8_t *private_key,
- const uint8_t *message_hash, unsigned hash_size,
- const uECC_HashContext *hash_context,
- uint8_t *signature, uECC_Curve curve) {
- uint8_t *K = hash_context->tmp;
- uint8_t *V = K + hash_context->result_size;
- wordcount_t num_bytes = curve->num_bytes;
- wordcount_t num_n_words = BITS_TO_WORDS(curve->num_n_bits);
- bitcount_t num_n_bits = curve->num_n_bits;
- uECC_word_t tries;
- unsigned i;
- for (i = 0; i < hash_context->result_size; ++i) {
- V[i] = 0x01;
- K[i] = 0;
- }
- /* K = HMAC_K(V || 0x00 || int2octets(x) || h(m)) */
- HMAC_init(hash_context, K);
- V[hash_context->result_size] = 0x00;
- HMAC_update(hash_context, V, hash_context->result_size + 1);
- HMAC_update(hash_context, private_key, (unsigned int) num_bytes);
- HMAC_update(hash_context, message_hash, hash_size);
- HMAC_finish(hash_context, K, K);
- update_V(hash_context, K, V);
- /* K = HMAC_K(V || 0x01 || int2octets(x) || h(m)) */
- HMAC_init(hash_context, K);
- V[hash_context->result_size] = 0x01;
- HMAC_update(hash_context, V, hash_context->result_size + 1);
- HMAC_update(hash_context, private_key, (unsigned int) num_bytes);
- HMAC_update(hash_context, message_hash, hash_size);
- HMAC_finish(hash_context, K, K);
- update_V(hash_context, K, V);
- for (tries = 0; tries < uECC_RNG_MAX_TRIES; ++tries) {
- uECC_word_t T[uECC_MAX_WORDS];
- uint8_t *T_ptr = (uint8_t *) T;
- wordcount_t T_bytes = 0;
- for (;;) {
- update_V(hash_context, K, V);
- for (i = 0; i < hash_context->result_size; ++i) {
- T_ptr[T_bytes++] = V[i];
- if (T_bytes >= num_n_words * uECC_WORD_SIZE) {
- goto filled;
- }
- }
- }
- filled:
- if ((bitcount_t) num_n_words * uECC_WORD_SIZE * 8 > num_n_bits) {
- uECC_word_t mask = (uECC_word_t) -1;
- T[num_n_words - 1] &=
- mask >>
- ((bitcount_t) (num_n_words * uECC_WORD_SIZE * 8 - num_n_bits));
- }
- if (uECC_sign_with_k_internal(private_key, message_hash, hash_size, T,
- signature, curve)) {
- return 1;
- }
- /* K = HMAC_K(V || 0x00) */
- HMAC_init(hash_context, K);
- V[hash_context->result_size] = 0x00;
- HMAC_update(hash_context, V, hash_context->result_size + 1);
- HMAC_finish(hash_context, K, K);
- update_V(hash_context, K, V);
- }
- return 0;
- }
- static bitcount_t smax(bitcount_t a, bitcount_t b) {
- return (a > b ? a : b);
- }
- int uECC_verify(const uint8_t *public_key, const uint8_t *message_hash,
- unsigned hash_size, const uint8_t *signature,
- uECC_Curve curve) {
- uECC_word_t u1[uECC_MAX_WORDS], u2[uECC_MAX_WORDS];
- uECC_word_t z[uECC_MAX_WORDS];
- uECC_word_t sum[uECC_MAX_WORDS * 2];
- uECC_word_t rx[uECC_MAX_WORDS];
- uECC_word_t ry[uECC_MAX_WORDS];
- uECC_word_t tx[uECC_MAX_WORDS];
- uECC_word_t ty[uECC_MAX_WORDS];
- uECC_word_t tz[uECC_MAX_WORDS];
- const uECC_word_t *points[4];
- const uECC_word_t *point;
- bitcount_t num_bits;
- bitcount_t i;
- #if uECC_VLI_NATIVE_LITTLE_ENDIAN
- uECC_word_t *_public = (uECC_word_t *) public_key;
- #else
- uECC_word_t _public[uECC_MAX_WORDS * 2];
- #endif
- uECC_word_t r[uECC_MAX_WORDS], s[uECC_MAX_WORDS];
- wordcount_t num_words = curve->num_words;
- wordcount_t num_n_words = BITS_TO_WORDS(curve->num_n_bits);
- rx[num_n_words - 1] = 0;
- r[num_n_words - 1] = 0;
- s[num_n_words - 1] = 0;
- #if uECC_VLI_NATIVE_LITTLE_ENDIAN
- bcopy((uint8_t *) r, signature, curve->num_bytes);
- bcopy((uint8_t *) s, signature + curve->num_bytes, curve->num_bytes);
- #else
- uECC_vli_bytesToNative(_public, public_key, curve->num_bytes);
- uECC_vli_bytesToNative(_public + num_words, public_key + curve->num_bytes,
- curve->num_bytes);
- uECC_vli_bytesToNative(r, signature, curve->num_bytes);
- uECC_vli_bytesToNative(s, signature + curve->num_bytes, curve->num_bytes);
- #endif
- /* r, s must not be 0. */
- if (uECC_vli_isZero(r, num_words) || uECC_vli_isZero(s, num_words)) {
- return 0;
- }
- /* r, s must be < n. */
- if (uECC_vli_cmp_unsafe(curve->n, r, num_n_words) != 1 ||
- uECC_vli_cmp_unsafe(curve->n, s, num_n_words) != 1) {
- return 0;
- }
- /* Calculate u1 and u2. */
- uECC_vli_modInv(z, s, curve->n, num_n_words); /* z = 1/s */
- u1[num_n_words - 1] = 0;
- bits2int(u1, message_hash, hash_size, curve);
- uECC_vli_modMult(u1, u1, z, curve->n, num_n_words); /* u1 = e/s */
- uECC_vli_modMult(u2, r, z, curve->n, num_n_words); /* u2 = r/s */
- /* Calculate sum = G + Q. */
- uECC_vli_set(sum, _public, num_words);
- uECC_vli_set(sum + num_words, _public + num_words, num_words);
- uECC_vli_set(tx, curve->G, num_words);
- uECC_vli_set(ty, curve->G + num_words, num_words);
- uECC_vli_modSub(z, sum, tx, curve->p, num_words); /* z = x2 - x1 */
- XYcZ_add(tx, ty, sum, sum + num_words, curve);
- uECC_vli_modInv(z, z, curve->p, num_words); /* z = 1/z */
- apply_z(sum, sum + num_words, z, curve);
- /* Use Shamir's trick to calculate u1*G + u2*Q */
- points[0] = 0;
- points[1] = curve->G;
- points[2] = _public;
- points[3] = sum;
- num_bits = smax(uECC_vli_numBits(u1, num_n_words),
- uECC_vli_numBits(u2, num_n_words));
- point = points[(!!uECC_vli_testBit(u1, (bitcount_t) (num_bits - 1))) |
- ((!!uECC_vli_testBit(u2, (bitcount_t) (num_bits - 1))) << 1)];
- uECC_vli_set(rx, point, num_words);
- uECC_vli_set(ry, point + num_words, num_words);
- uECC_vli_clear(z, num_words);
- z[0] = 1;
- for (i = num_bits - 2; i >= 0; --i) {
- uECC_word_t index;
- curve->double_jacobian(rx, ry, z, curve);
- index = (!!uECC_vli_testBit(u1, i)) |
- (uECC_word_t) ((!!uECC_vli_testBit(u2, i)) << 1);
- point = points[index];
- if (point) {
- uECC_vli_set(tx, point, num_words);
- uECC_vli_set(ty, point + num_words, num_words);
- apply_z(tx, ty, z, curve);
- uECC_vli_modSub(tz, rx, tx, curve->p, num_words); /* Z = x2 - x1 */
- XYcZ_add(tx, ty, rx, ry, curve);
- uECC_vli_modMult_fast(z, z, tz, curve);
- }
- }
- uECC_vli_modInv(z, z, curve->p, num_words); /* Z = 1/Z */
- apply_z(rx, ry, z, curve);
- /* v = x1 (mod n) */
- if (uECC_vli_cmp_unsafe(curve->n, rx, num_n_words) != 1) {
- uECC_vli_sub(rx, rx, curve->n, num_n_words);
- }
- /* Accept only if v == r. */
- return (int) (uECC_vli_equal(rx, r, num_words));
- }
- #if uECC_ENABLE_VLI_API
- unsigned uECC_curve_num_words(uECC_Curve curve) {
- return curve->num_words;
- }
- unsigned uECC_curve_num_bytes(uECC_Curve curve) {
- return curve->num_bytes;
- }
- unsigned uECC_curve_num_bits(uECC_Curve curve) {
- return curve->num_bytes * 8;
- }
- unsigned uECC_curve_num_n_words(uECC_Curve curve) {
- return BITS_TO_WORDS(curve->num_n_bits);
- }
- unsigned uECC_curve_num_n_bytes(uECC_Curve curve) {
- return BITS_TO_BYTES(curve->num_n_bits);
- }
- unsigned uECC_curve_num_n_bits(uECC_Curve curve) {
- return curve->num_n_bits;
- }
- const uECC_word_t *uECC_curve_p(uECC_Curve curve) {
- return curve->p;
- }
- const uECC_word_t *uECC_curve_n(uECC_Curve curve) {
- return curve->n;
- }
- const uECC_word_t *uECC_curve_G(uECC_Curve curve) {
- return curve->G;
- }
- const uECC_word_t *uECC_curve_b(uECC_Curve curve) {
- return curve->b;
- }
- #if uECC_SUPPORT_COMPRESSED_POINT
- void uECC_vli_mod_sqrt(uECC_word_t *a, uECC_Curve curve) {
- curve->mod_sqrt(a, curve);
- }
- #endif
- void uECC_vli_mmod_fast(uECC_word_t *result, uECC_word_t *product,
- uECC_Curve curve) {
- #if (uECC_OPTIMIZATION_LEVEL > 0)
- curve->mmod_fast(result, product);
- #else
- uECC_vli_mmod(result, product, curve->p, curve->num_words);
- #endif
- }
- void uECC_point_mult(uECC_word_t *result, const uECC_word_t *point,
- const uECC_word_t *scalar, uECC_Curve curve) {
- uECC_word_t tmp1[uECC_MAX_WORDS];
- uECC_word_t tmp2[uECC_MAX_WORDS];
- uECC_word_t *p2[2] = {tmp1, tmp2};
- uECC_word_t carry = regularize_k(scalar, tmp1, tmp2, curve);
- EccPoint_mult(result, point, p2[!carry], 0, curve->num_n_bits + 1, curve);
- }
- #endif /* uECC_ENABLE_VLI_API */
- #endif // MG_TLS_BUILTIN
- // End of uecc BSD-2
- #ifdef MG_ENABLE_LINES
- #line 1 "src/url.c"
- #endif
- struct url {
- size_t key, user, pass, host, port, uri, end;
- };
- int mg_url_is_ssl(const char *url) {
- return strncmp(url, "wss:", 4) == 0 || strncmp(url, "https:", 6) == 0 ||
- strncmp(url, "mqtts:", 6) == 0 || strncmp(url, "ssl:", 4) == 0 ||
- strncmp(url, "tls:", 4) == 0 || strncmp(url, "tcps:", 5) == 0;
- }
- static struct url urlparse(const char *url) {
- size_t i;
- struct url u;
- memset(&u, 0, sizeof(u));
- for (i = 0; url[i] != '\0'; i++) {
- if (url[i] == '/' && i > 0 && u.host == 0 && url[i - 1] == '/') {
- u.host = i + 1;
- u.port = 0;
- } else if (url[i] == ']') {
- u.port = 0; // IPv6 URLs, like http://[::1]/bar
- } else if (url[i] == ':' && u.port == 0 && u.uri == 0) {
- u.port = i + 1;
- } else if (url[i] == '@' && u.user == 0 && u.pass == 0 && u.uri == 0) {
- u.user = u.host;
- u.pass = u.port;
- u.host = i + 1;
- u.port = 0;
- } else if (url[i] == '/' && u.host && u.uri == 0) {
- u.uri = i;
- }
- }
- u.end = i;
- #if 0
- printf("[%s] %d %d %d %d %d\n", url, u.user, u.pass, u.host, u.port, u.uri);
- #endif
- return u;
- }
- struct mg_str mg_url_host(const char *url) {
- struct url u = urlparse(url);
- size_t n = u.port ? u.port - u.host - 1
- : u.uri ? u.uri - u.host
- : u.end - u.host;
- struct mg_str s = mg_str_n(url + u.host, n);
- return s;
- }
- const char *mg_url_uri(const char *url) {
- struct url u = urlparse(url);
- return u.uri ? url + u.uri : "/";
- }
- unsigned short mg_url_port(const char *url) {
- struct url u = urlparse(url);
- unsigned short port = 0;
- if (strncmp(url, "http:", 5) == 0 || strncmp(url, "ws:", 3) == 0) port = 80;
- if (strncmp(url, "wss:", 4) == 0 || strncmp(url, "https:", 6) == 0)
- port = 443;
- if (strncmp(url, "mqtt:", 5) == 0) port = 1883;
- if (strncmp(url, "mqtts:", 6) == 0) port = 8883;
- if (u.port) port = (unsigned short) atoi(url + u.port);
- return port;
- }
- struct mg_str mg_url_user(const char *url) {
- struct url u = urlparse(url);
- struct mg_str s = mg_str("");
- if (u.user && (u.pass || u.host)) {
- size_t n = u.pass ? u.pass - u.user - 1 : u.host - u.user - 1;
- s = mg_str_n(url + u.user, n);
- }
- return s;
- }
- struct mg_str mg_url_pass(const char *url) {
- struct url u = urlparse(url);
- struct mg_str s = mg_str_n("", 0UL);
- if (u.pass && u.host) {
- size_t n = u.host - u.pass - 1;
- s = mg_str_n(url + u.pass, n);
- }
- return s;
- }
- #ifdef MG_ENABLE_LINES
- #line 1 "src/util.c"
- #endif
- // Not using memset for zeroing memory, cause it can be dropped by compiler
- // See https://github.com/cesanta/mongoose/pull/1265
- void mg_bzero(volatile unsigned char *buf, size_t len) {
- if (buf != NULL) {
- while (len--) *buf++ = 0;
- }
- }
- #if MG_ENABLE_CUSTOM_RANDOM
- #else
- void mg_random(void *buf, size_t len) {
- bool done = false;
- unsigned char *p = (unsigned char *) buf;
- #if MG_ARCH == MG_ARCH_ESP32
- while (len--) *p++ = (unsigned char) (esp_random() & 255);
- done = true;
- #elif MG_ARCH == MG_ARCH_WIN32
- #elif MG_ARCH == MG_ARCH_UNIX
- FILE *fp = fopen("/dev/urandom", "rb");
- if (fp != NULL) {
- if (fread(buf, 1, len, fp) == len) done = true;
- fclose(fp);
- }
- #endif
- // If everything above did not work, fallback to a pseudo random generator
- while (!done && len--) *p++ = (unsigned char) (rand() & 255);
- }
- #endif
- char *mg_random_str(char *buf, size_t len) {
- size_t i;
- mg_random(buf, len);
- for (i = 0; i < len; i++) {
- uint8_t c = ((uint8_t *) buf)[i] % 62U;
- buf[i] = i == len - 1 ? (char) '\0' // 0-terminate last byte
- : c < 26 ? (char) ('a' + c) // lowercase
- : c < 52 ? (char) ('A' + c - 26) // uppercase
- : (char) ('0' + c - 52); // numeric
- }
- return buf;
- }
- uint32_t mg_ntohl(uint32_t net) {
- uint8_t data[4] = {0, 0, 0, 0};
- memcpy(&data, &net, sizeof(data));
- return (((uint32_t) data[3]) << 0) | (((uint32_t) data[2]) << 8) |
- (((uint32_t) data[1]) << 16) | (((uint32_t) data[0]) << 24);
- }
- uint16_t mg_ntohs(uint16_t net) {
- uint8_t data[2] = {0, 0};
- memcpy(&data, &net, sizeof(data));
- return (uint16_t) ((uint16_t) data[1] | (((uint16_t) data[0]) << 8));
- }
- uint32_t mg_crc32(uint32_t crc, const char *buf, size_t len) {
- static const uint32_t crclut[16] = {
- // table for polynomial 0xEDB88320 (reflected)
- 0x00000000, 0x1DB71064, 0x3B6E20C8, 0x26D930AC, 0x76DC4190, 0x6B6B51F4,
- 0x4DB26158, 0x5005713C, 0xEDB88320, 0xF00F9344, 0xD6D6A3E8, 0xCB61B38C,
- 0x9B64C2B0, 0x86D3D2D4, 0xA00AE278, 0xBDBDF21C};
- crc = ~crc;
- while (len--) {
- uint8_t byte = *(uint8_t *) buf++;
- crc = crclut[(crc ^ byte) & 0x0F] ^ (crc >> 4);
- crc = crclut[(crc ^ (byte >> 4)) & 0x0F] ^ (crc >> 4);
- }
- return ~crc;
- }
- static int isbyte(int n) {
- return n >= 0 && n <= 255;
- }
- static int parse_net(const char *spec, uint32_t *net, uint32_t *mask) {
- int n, a, b, c, d, slash = 32, len = 0;
- if ((sscanf(spec, "%d.%d.%d.%d/%d%n", &a, &b, &c, &d, &slash, &n) == 5 ||
- sscanf(spec, "%d.%d.%d.%d%n", &a, &b, &c, &d, &n) == 4) &&
- isbyte(a) && isbyte(b) && isbyte(c) && isbyte(d) && slash >= 0 &&
- slash < 33) {
- len = n;
- *net = ((uint32_t) a << 24) | ((uint32_t) b << 16) | ((uint32_t) c << 8) |
- (uint32_t) d;
- *mask = slash ? (uint32_t) (0xffffffffU << (32 - slash)) : (uint32_t) 0;
- }
- return len;
- }
- int mg_check_ip_acl(struct mg_str acl, struct mg_addr *remote_ip) {
- struct mg_str k, v;
- int allowed = acl.len == 0 ? '+' : '-'; // If any ACL is set, deny by default
- uint32_t remote_ip4;
- if (remote_ip->is_ip6) {
- return -1; // TODO(): handle IPv6 ACL and addresses
- } else { // IPv4
- memcpy((void *) &remote_ip4, remote_ip->ip, sizeof(remote_ip4));
- while (mg_commalist(&acl, &k, &v)) {
- uint32_t net, mask;
- if (k.ptr[0] != '+' && k.ptr[0] != '-') return -1;
- if (parse_net(&k.ptr[1], &net, &mask) == 0) return -2;
- if ((mg_ntohl(remote_ip4) & mask) == net) allowed = k.ptr[0];
- }
- }
- return allowed == '+';
- }
- #if MG_ENABLE_CUSTOM_MILLIS
- #else
- uint64_t mg_millis(void) {
- #if MG_ARCH == MG_ARCH_WIN32
- return GetTickCount();
- #elif MG_ARCH == MG_ARCH_RP2040
- return time_us_64() / 1000;
- #elif MG_ARCH == MG_ARCH_ESP8266 || MG_ARCH == MG_ARCH_ESP32 || \
- MG_ARCH == MG_ARCH_FREERTOS
- return xTaskGetTickCount() * portTICK_PERIOD_MS;
- #elif MG_ARCH == MG_ARCH_AZURERTOS
- return tx_time_get() * (1000 /* MS per SEC */ / TX_TIMER_TICKS_PER_SECOND);
- #elif MG_ARCH == MG_ARCH_TIRTOS
- return (uint64_t) Clock_getTicks();
- #elif MG_ARCH == MG_ARCH_ZEPHYR
- return (uint64_t) k_uptime_get();
- #elif MG_ARCH == MG_ARCH_CMSIS_RTOS1
- return (uint64_t) rt_time_get();
- #elif MG_ARCH == MG_ARCH_CMSIS_RTOS2
- return (uint64_t) ((osKernelGetTickCount() * 1000) / osKernelGetTickFreq());
- #elif MG_ARCH == MG_ARCH_RTTHREAD
- return (uint64_t) ((rt_tick_get() * 1000) / RT_TICK_PER_SECOND);
- #elif MG_ARCH == MG_ARCH_UNIX && defined(__APPLE__)
- // Apple CLOCK_MONOTONIC_RAW is equivalent to CLOCK_BOOTTIME on linux
- // Apple CLOCK_UPTIME_RAW is equivalent to CLOCK_MONOTONIC_RAW on linux
- return clock_gettime_nsec_np(CLOCK_UPTIME_RAW) / 1000000;
- #elif MG_ARCH == MG_ARCH_UNIX
- struct timespec ts = {0, 0};
- // See #1615 - prefer monotonic clock
- #if defined(CLOCK_MONOTONIC_RAW)
- // Raw hardware-based time that is not subject to NTP adjustment
- clock_gettime(CLOCK_MONOTONIC_RAW, &ts);
- #elif defined(CLOCK_MONOTONIC)
- // Affected by the incremental adjustments performed by adjtime and NTP
- clock_gettime(CLOCK_MONOTONIC, &ts);
- #else
- // Affected by discontinuous jumps in the system time and by the incremental
- // adjustments performed by adjtime and NTP
- clock_gettime(CLOCK_REALTIME, &ts);
- #endif
- return ((uint64_t) ts.tv_sec * 1000 + (uint64_t) ts.tv_nsec / 1000000);
- #elif defined(ARDUINO)
- return (uint64_t) millis();
- #else
- return (uint64_t) (time(NULL) * 1000);
- #endif
- }
- #endif
- #ifdef MG_ENABLE_LINES
- #line 1 "src/ws.c"
- #endif
- struct ws_msg {
- uint8_t flags;
- size_t header_len;
- size_t data_len;
- };
- size_t mg_ws_vprintf(struct mg_connection *c, int op, const char *fmt,
- va_list *ap) {
- size_t len = c->send.len;
- size_t n = mg_vxprintf(mg_pfn_iobuf, &c->send, fmt, ap);
- mg_ws_wrap(c, c->send.len - len, op);
- return n;
- }
- size_t mg_ws_printf(struct mg_connection *c, int op, const char *fmt, ...) {
- size_t len = 0;
- va_list ap;
- va_start(ap, fmt);
- len = mg_ws_vprintf(c, op, fmt, &ap);
- va_end(ap);
- return len;
- }
- static void ws_handshake(struct mg_connection *c, const struct mg_str *wskey,
- const struct mg_str *wsproto, const char *fmt,
- va_list *ap) {
- const char *magic = "258EAFA5-E914-47DA-95CA-C5AB0DC85B11";
- unsigned char sha[20], b64_sha[30];
- mg_sha1_ctx sha_ctx;
- mg_sha1_init(&sha_ctx);
- mg_sha1_update(&sha_ctx, (unsigned char *) wskey->ptr, wskey->len);
- mg_sha1_update(&sha_ctx, (unsigned char *) magic, 36);
- mg_sha1_final(sha, &sha_ctx);
- mg_base64_encode(sha, sizeof(sha), (char *) b64_sha, sizeof(b64_sha));
- mg_xprintf(mg_pfn_iobuf, &c->send,
- "HTTP/1.1 101 Switching Protocols\r\n"
- "Upgrade: websocket\r\n"
- "Connection: Upgrade\r\n"
- "Sec-WebSocket-Accept: %s\r\n",
- b64_sha);
- if (fmt != NULL) mg_vxprintf(mg_pfn_iobuf, &c->send, fmt, ap);
- if (wsproto != NULL) {
- mg_printf(c, "Sec-WebSocket-Protocol: %.*s\r\n", (int) wsproto->len,
- wsproto->ptr);
- }
- mg_send(c, "\r\n", 2);
- }
- static uint32_t be32(const uint8_t *p) {
- return (((uint32_t) p[3]) << 0) | (((uint32_t) p[2]) << 8) |
- (((uint32_t) p[1]) << 16) | (((uint32_t) p[0]) << 24);
- }
- static size_t ws_process(uint8_t *buf, size_t len, struct ws_msg *msg) {
- size_t i, n = 0, mask_len = 0;
- memset(msg, 0, sizeof(*msg));
- if (len >= 2) {
- n = buf[1] & 0x7f; // Frame length
- mask_len = buf[1] & 128 ? 4 : 0; // last bit is a mask bit
- msg->flags = buf[0];
- if (n < 126 && len >= mask_len) {
- msg->data_len = n;
- msg->header_len = 2 + mask_len;
- } else if (n == 126 && len >= 4 + mask_len) {
- msg->header_len = 4 + mask_len;
- msg->data_len = (((size_t) buf[2]) << 8) | buf[3];
- } else if (len >= 10 + mask_len) {
- msg->header_len = 10 + mask_len;
- msg->data_len =
- (size_t) (((uint64_t) be32(buf + 2) << 32) + be32(buf + 6));
- }
- }
- // Sanity check, and integer overflow protection for the boundary check below
- // data_len should not be larger than 1 Gb
- if (msg->data_len > 1024 * 1024 * 1024) return 0;
- if (msg->header_len + msg->data_len > len) return 0;
- if (mask_len > 0) {
- uint8_t *p = buf + msg->header_len, *m = p - mask_len;
- for (i = 0; i < msg->data_len; i++) p[i] ^= m[i & 3];
- }
- return msg->header_len + msg->data_len;
- }
- static size_t mkhdr(size_t len, int op, bool is_client, uint8_t *buf) {
- size_t n = 0;
- buf[0] = (uint8_t) (op | 128);
- if (len < 126) {
- buf[1] = (unsigned char) len;
- n = 2;
- } else if (len < 65536) {
- uint16_t tmp = mg_htons((uint16_t) len);
- buf[1] = 126;
- memcpy(&buf[2], &tmp, sizeof(tmp));
- n = 4;
- } else {
- uint32_t tmp;
- buf[1] = 127;
- tmp = mg_htonl((uint32_t) (((uint64_t) len) >> 32));
- memcpy(&buf[2], &tmp, sizeof(tmp));
- tmp = mg_htonl((uint32_t) (len & 0xffffffffU));
- memcpy(&buf[6], &tmp, sizeof(tmp));
- n = 10;
- }
- if (is_client) {
- buf[1] |= 1 << 7; // Set masking flag
- mg_random(&buf[n], 4);
- n += 4;
- }
- return n;
- }
- static void mg_ws_mask(struct mg_connection *c, size_t len) {
- if (c->is_client && c->send.buf != NULL) {
- size_t i;
- uint8_t *p = c->send.buf + c->send.len - len, *mask = p - 4;
- for (i = 0; i < len; i++) p[i] ^= mask[i & 3];
- }
- }
- size_t mg_ws_send(struct mg_connection *c, const void *buf, size_t len,
- int op) {
- uint8_t header[14];
- size_t header_len = mkhdr(len, op, c->is_client, header);
- mg_send(c, header, header_len);
- MG_VERBOSE(("WS out: %d [%.*s]", (int) len, (int) len, buf));
- mg_send(c, buf, len);
- mg_ws_mask(c, len);
- return header_len + len;
- }
- static bool mg_ws_client_handshake(struct mg_connection *c) {
- int n = mg_http_get_request_len(c->recv.buf, c->recv.len);
- if (n < 0) {
- mg_error(c, "not http"); // Some just, not an HTTP request
- } else if (n > 0) {
- if (n < 15 || memcmp(c->recv.buf + 9, "101", 3) != 0) {
- mg_error(c, "ws handshake error");
- } else {
- struct mg_http_message hm;
- if (mg_http_parse((char *) c->recv.buf, c->recv.len, &hm)) {
- c->is_websocket = 1;
- mg_call(c, MG_EV_WS_OPEN, &hm);
- } else {
- mg_error(c, "ws handshake error");
- }
- }
- mg_iobuf_del(&c->recv, 0, (size_t) n);
- } else {
- return true; // Request is not yet received, quit event handler
- }
- return false; // Continue event handler
- }
- static void mg_ws_cb(struct mg_connection *c, int ev, void *ev_data) {
- struct ws_msg msg;
- size_t ofs = (size_t) c->pfn_data;
- // assert(ofs < c->recv.len);
- if (ev == MG_EV_READ) {
- if (c->is_client && !c->is_websocket && mg_ws_client_handshake(c)) return;
- while (ws_process(c->recv.buf + ofs, c->recv.len - ofs, &msg) > 0) {
- char *s = (char *) c->recv.buf + ofs + msg.header_len;
- struct mg_ws_message m = {{s, msg.data_len}, msg.flags};
- size_t len = msg.header_len + msg.data_len;
- uint8_t final = msg.flags & 128, op = msg.flags & 15;
- // MG_VERBOSE ("fin %d op %d len %d [%.*s]", final, op,
- // (int) m.data.len, (int) m.data.len, m.data.ptr));
- switch (op) {
- case WEBSOCKET_OP_CONTINUE:
- mg_call(c, MG_EV_WS_CTL, &m);
- break;
- case WEBSOCKET_OP_PING:
- MG_DEBUG(("%s", "WS PONG"));
- mg_ws_send(c, s, msg.data_len, WEBSOCKET_OP_PONG);
- mg_call(c, MG_EV_WS_CTL, &m);
- break;
- case WEBSOCKET_OP_PONG:
- mg_call(c, MG_EV_WS_CTL, &m);
- break;
- case WEBSOCKET_OP_TEXT:
- case WEBSOCKET_OP_BINARY:
- if (final) mg_call(c, MG_EV_WS_MSG, &m);
- break;
- case WEBSOCKET_OP_CLOSE:
- MG_DEBUG(("%lu WS CLOSE", c->id));
- mg_call(c, MG_EV_WS_CTL, &m);
- // Echo the payload of the received CLOSE message back to the sender
- mg_ws_send(c, m.data.ptr, m.data.len, WEBSOCKET_OP_CLOSE);
- c->is_draining = 1;
- break;
- default:
- // Per RFC6455, close conn when an unknown op is recvd
- mg_error(c, "unknown WS op %d", op);
- break;
- }
- // Handle fragmented frames: strip header, keep in c->recv
- if (final == 0 || op == 0) {
- if (op) ofs++, len--, msg.header_len--; // First frame
- mg_iobuf_del(&c->recv, ofs, msg.header_len); // Strip header
- len -= msg.header_len;
- ofs += len;
- c->pfn_data = (void *) ofs;
- // MG_INFO(("FRAG %d [%.*s]", (int) ofs, (int) ofs, c->recv.buf));
- }
- // Remove non-fragmented frame
- if (final && op) mg_iobuf_del(&c->recv, ofs, len);
- // Last chunk of the fragmented frame
- if (final && !op) {
- m.flags = c->recv.buf[0];
- m.data = mg_str_n((char *) &c->recv.buf[1], (size_t) (ofs - 1));
- mg_call(c, MG_EV_WS_MSG, &m);
- mg_iobuf_del(&c->recv, 0, ofs);
- ofs = 0;
- c->pfn_data = NULL;
- }
- }
- }
- (void) ev_data;
- }
- struct mg_connection *mg_ws_connect(struct mg_mgr *mgr, const char *url,
- mg_event_handler_t fn, void *fn_data,
- const char *fmt, ...) {
- struct mg_connection *c = mg_connect(mgr, url, fn, fn_data);
- if (c != NULL) {
- char nonce[16], key[30];
- struct mg_str host = mg_url_host(url);
- mg_random(nonce, sizeof(nonce));
- mg_base64_encode((unsigned char *) nonce, sizeof(nonce), key, sizeof(key));
- mg_xprintf(mg_pfn_iobuf, &c->send,
- "GET %s HTTP/1.1\r\n"
- "Upgrade: websocket\r\n"
- "Host: %.*s\r\n"
- "Connection: Upgrade\r\n"
- "Sec-WebSocket-Version: 13\r\n"
- "Sec-WebSocket-Key: %s\r\n",
- mg_url_uri(url), (int) host.len, host.ptr, key);
- if (fmt != NULL) {
- va_list ap;
- va_start(ap, fmt);
- mg_vxprintf(mg_pfn_iobuf, &c->send, fmt, &ap);
- va_end(ap);
- }
- mg_xprintf(mg_pfn_iobuf, &c->send, "\r\n");
- c->pfn = mg_ws_cb;
- c->pfn_data = NULL;
- }
- return c;
- }
- void mg_ws_upgrade(struct mg_connection *c, struct mg_http_message *hm,
- const char *fmt, ...) {
- struct mg_str *wskey = mg_http_get_header(hm, "Sec-WebSocket-Key");
- c->pfn = mg_ws_cb;
- c->pfn_data = NULL;
- if (wskey == NULL) {
- mg_http_reply(c, 426, "", "WS upgrade expected\n");
- c->is_draining = 1;
- } else {
- struct mg_str *wsproto = mg_http_get_header(hm, "Sec-WebSocket-Protocol");
- va_list ap;
- va_start(ap, fmt);
- ws_handshake(c, wskey, wsproto, fmt, &ap);
- va_end(ap);
- c->is_websocket = 1;
- c->is_resp = 0;
- mg_call(c, MG_EV_WS_OPEN, hm);
- }
- }
- size_t mg_ws_wrap(struct mg_connection *c, size_t len, int op) {
- uint8_t header[14], *p;
- size_t header_len = mkhdr(len, op, c->is_client, header);
- // NOTE: order of operations is important!
- mg_iobuf_add(&c->send, c->send.len, NULL, header_len);
- p = &c->send.buf[c->send.len - len]; // p points to data
- memmove(p, p - header_len, len); // Shift data
- memcpy(p - header_len, header, header_len); // Prepend header
- mg_ws_mask(c, len); // Mask data
- return c->send.len;
- }
- #ifdef MG_ENABLE_LINES
- #line 1 "src/drivers/cmsis.c"
- #endif
- // https://arm-software.github.io/CMSIS_5/Driver/html/index.html
- #if MG_ENABLE_TCPIP && defined(MG_ENABLE_DRIVER_CMSIS) && MG_ENABLE_DRIVER_CMSIS
- extern ARM_DRIVER_ETH_MAC Driver_ETH_MAC0;
- extern ARM_DRIVER_ETH_PHY Driver_ETH_PHY0;
- static struct mg_tcpip_if *s_ifp;
- static void mac_cb(uint32_t);
- static bool cmsis_init(struct mg_tcpip_if *);
- static bool cmsis_up(struct mg_tcpip_if *);
- static size_t cmsis_tx(const void *, size_t, struct mg_tcpip_if *);
- static size_t cmsis_rx(void *, size_t, struct mg_tcpip_if *);
- struct mg_tcpip_driver mg_tcpip_driver_cmsis = {cmsis_init, cmsis_tx, NULL,
- cmsis_up};
- static bool cmsis_init(struct mg_tcpip_if *ifp) {
- ARM_ETH_MAC_ADDR addr;
- s_ifp = ifp;
- ARM_DRIVER_ETH_MAC *mac = &Driver_ETH_MAC0;
- ARM_DRIVER_ETH_PHY *phy = &Driver_ETH_PHY0;
- ARM_ETH_MAC_CAPABILITIES cap = mac->GetCapabilities();
- if (mac->Initialize(mac_cb) != ARM_DRIVER_OK) return false;
- if (phy->Initialize(mac->PHY_Read, mac->PHY_Write) != ARM_DRIVER_OK)
- return false;
- if (cap.event_rx_frame == 0) // polled mode driver
- mg_tcpip_driver_cmsis.rx = cmsis_rx;
- mac->PowerControl(ARM_POWER_FULL);
- if (cap.mac_address) { // driver provides MAC address
- mac->GetMacAddress(&addr);
- memcpy(ifp->mac, &addr, sizeof(ifp->mac));
- } else { // we provide MAC address
- memcpy(&addr, ifp->mac, sizeof(addr));
- mac->SetMacAddress(&addr);
- }
- phy->PowerControl(ARM_POWER_FULL);
- phy->SetInterface(cap.media_interface);
- phy->SetMode(ARM_ETH_PHY_AUTO_NEGOTIATE);
- return true;
- }
- static size_t cmsis_tx(const void *buf, size_t len, struct mg_tcpip_if *ifp) {
- ARM_DRIVER_ETH_MAC *mac = &Driver_ETH_MAC0;
- if (mac->SendFrame(buf, (uint32_t) len, 0) != ARM_DRIVER_OK) {
- ifp->nerr++;
- return 0;
- }
- ifp->nsent++;
- return len;
- }
- static bool cmsis_up(struct mg_tcpip_if *ifp) {
- ARM_DRIVER_ETH_PHY *phy = &Driver_ETH_PHY0;
- ARM_DRIVER_ETH_MAC *mac = &Driver_ETH_MAC0;
- bool up = (phy->GetLinkState() == ARM_ETH_LINK_UP) ? 1 : 0; // link state
- if ((ifp->state == MG_TCPIP_STATE_DOWN) && up) { // just went up
- ARM_ETH_LINK_INFO st = phy->GetLinkInfo();
- mac->Control(ARM_ETH_MAC_CONFIGURE,
- (st.speed << ARM_ETH_MAC_SPEED_Pos) |
- (st.duplex << ARM_ETH_MAC_DUPLEX_Pos) |
- ARM_ETH_MAC_ADDRESS_BROADCAST);
- MG_DEBUG(("Link is %uM %s-duplex",
- (st.speed == 2) ? 1000
- : st.speed ? 100
- : 10,
- st.duplex ? "full" : "half"));
- mac->Control(ARM_ETH_MAC_CONTROL_TX, 1);
- mac->Control(ARM_ETH_MAC_CONTROL_RX, 1);
- } else if ((ifp->state != MG_TCPIP_STATE_DOWN) && !up) { // just went down
- mac->Control(ARM_ETH_MAC_FLUSH,
- ARM_ETH_MAC_FLUSH_TX | ARM_ETH_MAC_FLUSH_RX);
- mac->Control(ARM_ETH_MAC_CONTROL_TX, 0);
- mac->Control(ARM_ETH_MAC_CONTROL_RX, 0);
- }
- return up;
- }
- static void mac_cb(uint32_t ev) {
- if ((ev & ARM_ETH_MAC_EVENT_RX_FRAME) == 0) return;
- ARM_DRIVER_ETH_MAC *mac = &Driver_ETH_MAC0;
- uint32_t len = mac->GetRxFrameSize(); // CRC already stripped
- if (len >= 60 && len <= 1518) { // proper frame
- char *p;
- if (mg_queue_book(&s_ifp->recv_queue, &p, len) >= len) { // have room
- if ((len = mac->ReadFrame((uint8_t *) p, len)) > 0) { // copy succeeds
- mg_queue_add(&s_ifp->recv_queue, len);
- s_ifp->nrecv++;
- }
- return;
- }
- s_ifp->ndrop++;
- }
- mac->ReadFrame(NULL, 0); // otherwise, discard
- }
- static size_t cmsis_rx(void *buf, size_t buflen, struct mg_tcpip_if *ifp) {
- ARM_DRIVER_ETH_MAC *mac = &Driver_ETH_MAC0;
- uint32_t len = mac->GetRxFrameSize(); // CRC already stripped
- if (len >= 60 && len <= 1518 &&
- ((len = mac->ReadFrame(buf, (uint32_t) buflen)) > 0))
- return len;
- if (len > 0) mac->ReadFrame(NULL, 0); // discard bad frames
- (void) ifp;
- return 0;
- }
- #endif
- #ifdef MG_ENABLE_LINES
- #line 1 "src/drivers/imxrt.c"
- #endif
- #if MG_ENABLE_TCPIP && defined(MG_ENABLE_DRIVER_IMXRT) && MG_ENABLE_DRIVER_IMXRT
- struct imxrt_enet {
- volatile uint32_t RESERVED0, EIR, EIMR, RESERVED1, RDAR, TDAR, RESERVED2[3],
- ECR, RESERVED3[6], MMFR, MSCR, RESERVED4[7], MIBC, RESERVED5[7], RCR,
- RESERVED6[15], TCR, RESERVED7[7], PALR, PAUR, OPD, TXIC0, TXIC1, TXIC2,
- RESERVED8, RXIC0, RXIC1, RXIC2, RESERVED9[3], IAUR, IALR, GAUR, GALR,
- RESERVED10[7], TFWR, RESERVED11[14], RDSR, TDSR, MRBR[2], RSFL, RSEM,
- RAEM, RAFL, TSEM, TAEM, TAFL, TIPG, FTRL, RESERVED12[3], TACC, RACC,
- RESERVED13[15], RMON_T_PACKETS, RMON_T_BC_PKT, RMON_T_MC_PKT,
- RMON_T_CRC_ALIGN, RMON_T_UNDERSIZE, RMON_T_OVERSIZE, RMON_T_FRAG,
- RMON_T_JAB, RMON_T_COL, RMON_T_P64, RMON_T_P65TO127, RMON_T_P128TO255,
- RMON_T_P256TO511, RMON_T_P512TO1023, RMON_T_P1024TO2048, RMON_T_GTE2048,
- RMON_T_OCTETS, IEEE_T_DROP, IEEE_T_FRAME_OK, IEEE_T_1COL, IEEE_T_MCOL,
- IEEE_T_DEF, IEEE_T_LCOL, IEEE_T_EXCOL, IEEE_T_MACERR, IEEE_T_CSERR,
- IEEE_T_SQE, IEEE_T_FDXFC, IEEE_T_OCTETS_OK, RESERVED14[3], RMON_R_PACKETS,
- RMON_R_BC_PKT, RMON_R_MC_PKT, RMON_R_CRC_ALIGN, RMON_R_UNDERSIZE,
- RMON_R_OVERSIZE, RMON_R_FRAG, RMON_R_JAB, RESERVED15, RMON_R_P64,
- RMON_R_P65TO127, RMON_R_P128TO255, RMON_R_P256TO511, RMON_R_P512TO1023,
- RMON_R_P1024TO2047, RMON_R_GTE2048, RMON_R_OCTETS, IEEE_R_DROP,
- IEEE_R_FRAME_OK, IEEE_R_CRC, IEEE_R_ALIGN, IEEE_R_MACERR, IEEE_R_FDXFC,
- IEEE_R_OCTETS_OK, RESERVED16[71], ATCR, ATVR, ATOFF, ATPER, ATCOR, ATINC,
- ATSTMP, RESERVED17[122], TGSR, TCSR0, TCCR0, TCSR1, TCCR1, TCSR2, TCCR2,
- TCSR3;
- };
- #undef ENET
- #define ENET ((struct imxrt_enet *) (uintptr_t) 0x402D8000U)
- #define ETH_PKT_SIZE 1536 // Max frame size, 64-bit aligned
- #define ETH_DESC_CNT 4 // Descriptors count
- struct enet_desc {
- uint16_t length; // Data length
- uint16_t control; // Control and status
- uint32_t *buffer; // Data ptr
- };
- // TODO(): handle these in a portable compiler-independent CMSIS-friendly way
- #define MG_64BIT_ALIGNED __attribute__((aligned((64U))))
- // Descriptors: in non-cached area (TODO(scaprile)), 64-bit aligned
- // Buffers: 64-bit aligned
- static volatile struct enet_desc s_rxdesc[ETH_DESC_CNT] MG_64BIT_ALIGNED;
- static volatile struct enet_desc s_txdesc[ETH_DESC_CNT] MG_64BIT_ALIGNED;
- static uint8_t s_rxbuf[ETH_DESC_CNT][ETH_PKT_SIZE] MG_64BIT_ALIGNED;
- static uint8_t s_txbuf[ETH_DESC_CNT][ETH_PKT_SIZE] MG_64BIT_ALIGNED;
- static struct mg_tcpip_if *s_ifp; // MIP interface
- enum { PHY_BCR = 0, PHY_BSR = 1, PHY_ID1 = 2, PHY_ID2 = 3 };
- static uint16_t enet_phy_read(uint8_t addr, uint8_t reg) {
- ENET->EIR |= MG_BIT(23); // MII interrupt clear
- ENET->MMFR = (1 << 30) | (2 << 28) | (addr << 23) | (reg << 18) | (2 << 16);
- while ((ENET->EIR & MG_BIT(23)) == 0) (void) 0;
- return ENET->MMFR & 0xffff;
- }
- static void enet_phy_write(uint8_t addr, uint8_t reg, uint16_t val) {
- ENET->EIR |= MG_BIT(23); // MII interrupt clear
- ENET->MMFR =
- (1 << 30) | (1 << 28) | (addr << 23) | (reg << 18) | (2 << 16) | val;
- while ((ENET->EIR & MG_BIT(23)) == 0) (void) 0;
- }
- static uint32_t enet_phy_id(uint8_t addr) {
- uint16_t phy_id1 = enet_phy_read(addr, PHY_ID1);
- uint16_t phy_id2 = enet_phy_read(addr, PHY_ID2);
- return (uint32_t) phy_id1 << 16 | phy_id2;
- }
- // MDC clock is generated from IPS Bus clock (ipg_clk); as per 802.3,
- // it must not exceed 2.5MHz
- // The PHY receives the PLL6-generated 50MHz clock
- static bool mg_tcpip_driver_imxrt_init(struct mg_tcpip_if *ifp) {
- struct mg_tcpip_driver_imxrt_data *d =
- (struct mg_tcpip_driver_imxrt_data *) ifp->driver_data;
- s_ifp = ifp;
- // Init RX descriptors
- for (int i = 0; i < ETH_DESC_CNT; i++) {
- s_rxdesc[i].control = MG_BIT(15); // Own (E)
- s_rxdesc[i].buffer = (uint32_t *) s_rxbuf[i]; // Point to data buffer
- }
- s_rxdesc[ETH_DESC_CNT - 1].control |= MG_BIT(13); // Wrap last descriptor
- // Init TX descriptors
- for (int i = 0; i < ETH_DESC_CNT; i++) {
- // s_txdesc[i].control = MG_BIT(10); // Own (TC)
- s_txdesc[i].buffer = (uint32_t *) s_txbuf[i];
- }
- s_txdesc[ETH_DESC_CNT - 1].control |= MG_BIT(13); // Wrap last descriptor
- ENET->ECR = MG_BIT(0); // Software reset, disable
- while ((ENET->ECR & MG_BIT(0))) (void) 0; // Wait until done
- // Set MDC clock divider. If user told us the value, use it.
- // TODO(): Otherwise, guess (currently assuming max freq)
- int cr = (d == NULL || d->mdc_cr < 0) ? 24 : d->mdc_cr;
- ENET->MSCR = (1 << 8) | ((cr & 0x3f) << 1); // HOLDTIME 2 clks
- enet_phy_write(d->phy_addr, PHY_BCR, MG_BIT(15)); // Reset PHY
- enet_phy_write(d->phy_addr, PHY_BCR, MG_BIT(12)); // Set autonegotiation
- // PHY: Enable 50 MHz external ref clock at XI (preserve defaults)
- uint32_t id = enet_phy_id(d->phy_addr);
- MG_INFO(("PHY ID: %#04x %#04x", (uint16_t) (id >> 16), (uint16_t) id));
- // 2000 a140 - TI DP83825I
- // 0007 c0fx - LAN8720
- // 0022 1561 - KSZ8081RNB
- if ((id & 0xffff0000) == 0x220000) { // KSZ8081RNB, like EVK-RTxxxx boards
- enet_phy_write(d->phy_addr, 31,
- MG_BIT(15) | MG_BIT(8) | MG_BIT(7)); // PC2R
- } else if ((id & 0xffff0000) == 0x20000000) { // DP83825I, like Teensy4.1
- enet_phy_write(d->phy_addr, 23, 0x81); // 50MHz clock input
- enet_phy_write(d->phy_addr, 24, 0x280); // LED status, active high
- } else { // Default to LAN8720
- MG_INFO(("Defaulting to LAN8720 PHY...")); // TODO()
- }
- // Select RMII mode, 100M, keep CRC, set max rx length, disable loop
- ENET->RCR = (1518 << 16) | MG_BIT(8) | MG_BIT(2);
- // ENET->RCR |= MG_BIT(3); // Receive all
- ENET->TCR = MG_BIT(2); // Full-duplex
- ENET->RDSR = (uint32_t) (uintptr_t) s_rxdesc;
- ENET->TDSR = (uint32_t) (uintptr_t) s_txdesc;
- ENET->MRBR[0] = ETH_PKT_SIZE; // Same size for RX/TX buffers
- // MAC address filtering (bytes in reversed order)
- ENET->PAUR = ((uint32_t) ifp->mac[4] << 24U) | (uint32_t) ifp->mac[5] << 16U;
- ENET->PALR = (uint32_t) (ifp->mac[0] << 24U) |
- ((uint32_t) ifp->mac[1] << 16U) |
- ((uint32_t) ifp->mac[2] << 8U) | ifp->mac[3];
- ENET->ECR = MG_BIT(8) | MG_BIT(1); // Little-endian CPU, Enable
- ENET->EIMR = MG_BIT(25); // Set interrupt mask
- ENET->RDAR = MG_BIT(24); // Receive Descriptors have changed
- ENET->TDAR = MG_BIT(24); // Transmit Descriptors have changed
- // ENET->OPD = 0x10014;
- return true;
- }
- // Transmit frame
- static size_t mg_tcpip_driver_imxrt_tx(const void *buf, size_t len,
- struct mg_tcpip_if *ifp) {
- static int s_txno; // Current descriptor index
- if (len > sizeof(s_txbuf[ETH_DESC_CNT])) {
- ifp->nerr++;
- MG_ERROR(("Frame too big, %ld", (long) len));
- len = (size_t) -1; // fail
- } else if ((s_txdesc[s_txno].control & MG_BIT(15))) {
- MG_ERROR(("No descriptors available"));
- len = 0; // retry later
- } else {
- memcpy(s_txbuf[s_txno], buf, len); // Copy data
- s_txdesc[s_txno].length = (uint16_t) len; // Set data len
- // Table 37-34, R, L, TC (Ready, last, transmit CRC after frame
- s_txdesc[s_txno].control |=
- (uint16_t) (MG_BIT(15) | MG_BIT(11) | MG_BIT(10));
- ENET->TDAR = MG_BIT(24); // Descriptor ring updated
- if (++s_txno >= ETH_DESC_CNT) s_txno = 0;
- }
- (void) ifp;
- return len;
- }
- static bool mg_tcpip_driver_imxrt_up(struct mg_tcpip_if *ifp) {
- struct mg_tcpip_driver_imxrt_data *d =
- (struct mg_tcpip_driver_imxrt_data *) ifp->driver_data;
- uint32_t bsr = enet_phy_read(d->phy_addr, PHY_BSR);
- bool up = bsr & MG_BIT(2) ? 1 : 0;
- if ((ifp->state == MG_TCPIP_STATE_DOWN) && up) { // link state just went up
- // tmp = reg with flags set to the most likely situation: 100M full-duplex
- // if(link is slow or half) set flags otherwise
- // reg = tmp
- uint32_t tcr = ENET->TCR | MG_BIT(2); // Full-duplex
- uint32_t rcr = ENET->RCR & ~MG_BIT(9); // 100M
- uint32_t phy_id = enet_phy_id(d->phy_addr);
- if ((phy_id & 0xffff0000) == 0x220000) { // KSZ8081RNB
- uint16_t pc1r = enet_phy_read(d->phy_addr, 30); // Read PC1R
- if ((pc1r & 3) == 1) rcr |= MG_BIT(9); // 10M
- if ((pc1r & MG_BIT(2)) == 0) tcr &= ~MG_BIT(2); // Half-duplex
- } else if ((phy_id & 0xffff0000) == 0x20000000) { // DP83825I
- uint16_t physts = enet_phy_read(d->phy_addr, 16); // Read PHYSTS
- if (physts & MG_BIT(1)) rcr |= MG_BIT(9); // 10M
- if ((physts & MG_BIT(2)) == 0) tcr &= ~MG_BIT(2); // Half-duplex
- } else { // Default to LAN8720
- uint16_t scsr = enet_phy_read(d->phy_addr, 31); // Read CSCR
- if ((scsr & MG_BIT(3)) == 0) rcr |= MG_BIT(9); // 10M
- if ((scsr & MG_BIT(4)) == 0) tcr &= ~MG_BIT(2); // Half-duplex
- }
- ENET->TCR = tcr; // IRQ handler does not fiddle with these registers
- ENET->RCR = rcr;
- MG_DEBUG(("Link is %uM %s-duplex", rcr & MG_BIT(9) ? 10 : 100,
- tcr & MG_BIT(2) ? "full" : "half"));
- }
- return up;
- }
- void ENET_IRQHandler(void);
- static uint32_t s_rxno;
- void ENET_IRQHandler(void) {
- ENET->EIR = MG_BIT(25); // Ack IRQ
- // Frame received, loop
- for (uint32_t i = 0; i < 10; i++) { // read as they arrive but not forever
- uint32_t r = s_rxdesc[s_rxno].control;
- if (r & MG_BIT(15)) break; // exit when done
- // skip partial/errored frames (Table 37-32)
- if ((r & MG_BIT(11)) &&
- !(r & (MG_BIT(5) | MG_BIT(4) | MG_BIT(2) | MG_BIT(1) | MG_BIT(0)))) {
- size_t len = s_rxdesc[s_rxno].length;
- mg_tcpip_qwrite(s_rxbuf[s_rxno], len > 4 ? len - 4 : len, s_ifp);
- }
- s_rxdesc[s_rxno].control |= MG_BIT(15);
- if (++s_rxno >= ETH_DESC_CNT) s_rxno = 0;
- }
- ENET->RDAR = MG_BIT(24); // Receive Descriptors have changed
- // If b24 == 0, descriptors were exhausted and probably frames were dropped
- }
- struct mg_tcpip_driver mg_tcpip_driver_imxrt = {mg_tcpip_driver_imxrt_init,
- mg_tcpip_driver_imxrt_tx, NULL,
- mg_tcpip_driver_imxrt_up};
- #endif
- #ifdef MG_ENABLE_LINES
- #line 1 "src/drivers/same54.c"
- #endif
- #if defined(MG_ENABLE_DRIVER_SAME54) && MG_ENABLE_DRIVER_SAME54
- #include <sam.h>
- #define ETH_PKT_SIZE 1536 // Max frame size
- #define ETH_DESC_CNT 4 // Descriptors count
- #define ETH_DS 2 // Descriptor size (words)
- static uint8_t s_rxbuf[ETH_DESC_CNT][ETH_PKT_SIZE];
- static uint8_t s_txbuf[ETH_DESC_CNT][ETH_PKT_SIZE];
- static uint32_t s_rxdesc[ETH_DESC_CNT][ETH_DS]; // RX descriptors
- static uint32_t s_txdesc[ETH_DESC_CNT][ETH_DS]; // TX descriptors
- static uint8_t s_txno; // Current TX descriptor
- static uint8_t s_rxno; // Current RX descriptor
- static struct mg_tcpip_if *s_ifp; // MIP interface
- enum { PHY_ADDR = 0, PHY_BCR = 0, PHY_BSR = 1 };
- #define PHY_BCR_DUPLEX_MODE_Msk MG_BIT(8)
- #define PHY_BCR_SPEED_Msk MG_BIT(13)
- #define PHY_BSR_LINK_STATUS_Msk MG_BIT(2)
- static uint16_t eth_read_phy(uint8_t addr, uint8_t reg) {
- GMAC_REGS->GMAC_MAN = GMAC_MAN_CLTTO_Msk |
- GMAC_MAN_OP(2) | // Setting the read operation
- GMAC_MAN_WTN(2) | GMAC_MAN_PHYA(addr) | // PHY address
- GMAC_MAN_REGA(reg); // Setting the register
- while (!(GMAC_REGS->GMAC_NSR & GMAC_NSR_IDLE_Msk)) (void) 0;
- return GMAC_REGS->GMAC_MAN & GMAC_MAN_DATA_Msk; // Getting the read value
- }
- #if 0
- static void eth_write_phy(uint8_t addr, uint8_t reg, uint16_t val) {
- GMAC_REGS->GMAC_MAN = GMAC_MAN_CLTTO_Msk | GMAC_MAN_OP(1) | // Setting the write operation
- GMAC_MAN_WTN(2) | GMAC_MAN_PHYA(addr) | // PHY address
- GMAC_MAN_REGA(reg) | GMAC_MAN_DATA(val); // Setting the register
- while (!(GMAC_REGS->GMAC_NSR & GMAC_NSR_IDLE_Msk)); // Waiting until the write op is complete
- }
- #endif
- int get_clock_rate(struct mg_tcpip_driver_same54_data *d) {
- if (d && d->mdc_cr >= 0 && d->mdc_cr <= 5) {
- return d->mdc_cr;
- } else {
- // get MCLK from GCLK_GENERATOR 0
- uint32_t div = 512;
- uint32_t mclk;
- if (!(GCLK_REGS->GCLK_GENCTRL[0] & GCLK_GENCTRL_DIVSEL_Msk)) {
- div = ((GCLK_REGS->GCLK_GENCTRL[0] & 0x00FF0000) >> 16);
- if (div == 0) div = 1;
- }
- switch (GCLK_REGS->GCLK_GENCTRL[0] & GCLK_GENCTRL_SRC_Msk) {
- case GCLK_GENCTRL_SRC_XOSC0_Val:
- mclk = 32000000UL; /* 32MHz */
- break;
- case GCLK_GENCTRL_SRC_XOSC1_Val:
- mclk = 32000000UL; /* 32MHz */
- break;
- case GCLK_GENCTRL_SRC_OSCULP32K_Val: mclk = 32000UL; break;
- case GCLK_GENCTRL_SRC_XOSC32K_Val: mclk = 32000UL; break;
- case GCLK_GENCTRL_SRC_DFLL_Val:
- mclk = 48000000UL; /* 48MHz */
- break;
- case GCLK_GENCTRL_SRC_DPLL0_Val:
- mclk = 200000000UL; /* 200MHz */
- break;
- case GCLK_GENCTRL_SRC_DPLL1_Val:
- mclk = 200000000UL; /* 200MHz */
- break;
- default: mclk = 200000000UL; /* 200MHz */
- }
- mclk /= div;
- uint8_t crs[] = {0, 1, 2, 3, 4, 5}; // GMAC->NCFGR::CLK values
- uint8_t dividers[] = {8, 16, 32, 48, 64, 96}; // Respective CLK dividers
- for (int i = 0; i < 6; i++) {
- if (mclk / dividers[i] <= 2375000UL /* 2.5MHz - 5% */) {
- return crs[i];
- }
- }
- return 5;
- }
- }
- static bool mg_tcpip_driver_same54_init(struct mg_tcpip_if *ifp) {
- struct mg_tcpip_driver_same54_data *d =
- (struct mg_tcpip_driver_same54_data *) ifp->driver_data;
- s_ifp = ifp;
- MCLK_REGS->MCLK_APBCMASK |= MCLK_APBCMASK_GMAC_Msk;
- MCLK_REGS->MCLK_AHBMASK |= MCLK_AHBMASK_GMAC_Msk;
- GMAC_REGS->GMAC_NCFGR = GMAC_NCFGR_CLK(get_clock_rate(d)); // Set MDC divider
- GMAC_REGS->GMAC_NCR = 0; // Disable RX & TX
- GMAC_REGS->GMAC_NCR |= GMAC_NCR_MPE_Msk; // Enable MDC & MDIO
- for (int i = 0; i < ETH_DESC_CNT; i++) { // Init TX descriptors
- s_txdesc[i][0] = (uint32_t) s_txbuf[i]; // Point to data buffer
- s_txdesc[i][1] = MG_BIT(31); // OWN bit
- }
- s_txdesc[ETH_DESC_CNT - 1][1] |= MG_BIT(30); // Last tx descriptor - wrap
- GMAC_REGS->GMAC_DCFGR = GMAC_DCFGR_DRBS(0x18) // DMA recv buf 1536
- | GMAC_DCFGR_RXBMS(GMAC_DCFGR_RXBMS_FULL_Val) |
- GMAC_DCFGR_TXPBMS(1); // See #2487
- for (int i = 0; i < ETH_DESC_CNT; i++) { // Init RX descriptors
- s_rxdesc[i][0] = (uint32_t) s_rxbuf[i]; // Address of the data buffer
- s_rxdesc[i][1] = 0; // Clear status
- }
- s_rxdesc[ETH_DESC_CNT - 1][0] |= MG_BIT(1); // Last rx descriptor - wrap
- GMAC_REGS->GMAC_TBQB = (uint32_t) s_txdesc; // about the descriptor addresses
- GMAC_REGS->GMAC_RBQB = (uint32_t) s_rxdesc; // Let the controller know
- GMAC_REGS->SA[0].GMAC_SAB =
- MG_U32(ifp->mac[3], ifp->mac[2], ifp->mac[1], ifp->mac[0]);
- GMAC_REGS->SA[0].GMAC_SAT = MG_U32(0, 0, ifp->mac[5], ifp->mac[4]);
- GMAC_REGS->GMAC_UR &= ~GMAC_UR_MII_Msk; // Disable MII, use RMII
- GMAC_REGS->GMAC_NCFGR |= GMAC_NCFGR_MAXFS_Msk | GMAC_NCFGR_MTIHEN_Msk |
- GMAC_NCFGR_EFRHD_Msk | GMAC_NCFGR_CAF_Msk;
- GMAC_REGS->GMAC_TSR = GMAC_TSR_HRESP_Msk | GMAC_TSR_UND_Msk |
- GMAC_TSR_TXCOMP_Msk | GMAC_TSR_TFC_Msk |
- GMAC_TSR_TXGO_Msk | GMAC_TSR_RLE_Msk |
- GMAC_TSR_COL_Msk | GMAC_TSR_UBR_Msk;
- GMAC_REGS->GMAC_RSR = GMAC_RSR_HNO_Msk | GMAC_RSR_RXOVR_Msk |
- GMAC_RSR_REC_Msk | GMAC_RSR_BNA_Msk;
- GMAC_REGS->GMAC_IDR = ~0U; // Disable interrupts, then enable required
- GMAC_REGS->GMAC_IER = GMAC_IER_HRESP_Msk | GMAC_IER_ROVR_Msk |
- GMAC_IER_TCOMP_Msk | GMAC_IER_TFC_Msk |
- GMAC_IER_RLEX_Msk | GMAC_IER_TUR_Msk |
- GMAC_IER_RXUBR_Msk | GMAC_IER_RCOMP_Msk;
- GMAC_REGS->GMAC_NCR |= GMAC_NCR_TXEN_Msk | GMAC_NCR_RXEN_Msk;
- NVIC_EnableIRQ(GMAC_IRQn);
- return true;
- }
- static size_t mg_tcpip_driver_same54_tx(const void *buf, size_t len,
- struct mg_tcpip_if *ifp) {
- if (len > sizeof(s_txbuf[s_txno])) {
- MG_ERROR(("Frame too big, %ld", (long) len));
- len = 0; // Frame is too big
- } else if ((s_txdesc[s_txno][1] & MG_BIT(31)) == 0) {
- ifp->nerr++;
- MG_ERROR(("No free descriptors"));
- len = 0; // All descriptors are busy, fail
- } else {
- uint32_t status = len | MG_BIT(15); // Frame length, last chunk
- if (s_txno == ETH_DESC_CNT - 1) status |= MG_BIT(30); // wrap
- memcpy(s_txbuf[s_txno], buf, len); // Copy data
- s_txdesc[s_txno][1] = status;
- if (++s_txno >= ETH_DESC_CNT) s_txno = 0;
- }
- __DSB(); // Ensure descriptors have been written
- GMAC_REGS->GMAC_NCR |= GMAC_NCR_TSTART_Msk; // Enable transmission
- return len;
- }
- static bool mg_tcpip_driver_same54_up(struct mg_tcpip_if *ifp) {
- uint16_t bsr = eth_read_phy(PHY_ADDR, PHY_BSR);
- bool up = bsr & PHY_BSR_LINK_STATUS_Msk ? 1 : 0;
- // If PHY is ready, update NCFGR accordingly
- if (ifp->state == MG_TCPIP_STATE_DOWN && up) {
- uint16_t bcr = eth_read_phy(PHY_ADDR, PHY_BCR);
- bool fd = bcr & PHY_BCR_DUPLEX_MODE_Msk ? 1 : 0;
- bool spd = bcr & PHY_BCR_SPEED_Msk ? 1 : 0;
- GMAC_REGS->GMAC_NCFGR =
- (GMAC_REGS->GMAC_NCFGR & ~(GMAC_NCFGR_SPD_Msk | PHY_BCR_SPEED_Msk)) |
- GMAC_NCFGR_SPD(spd) | GMAC_NCFGR_FD(fd);
- }
- return up;
- }
- void GMAC_Handler(void);
- void GMAC_Handler(void) {
- uint32_t isr = GMAC_REGS->GMAC_ISR;
- uint32_t rsr = GMAC_REGS->GMAC_RSR;
- uint32_t tsr = GMAC_REGS->GMAC_TSR;
- if (isr & GMAC_ISR_RCOMP_Msk) {
- if (rsr & GMAC_ISR_RCOMP_Msk) {
- for (uint8_t i = 0; i < ETH_DESC_CNT; i++) {
- if ((s_rxdesc[s_rxno][0] & MG_BIT(0)) == 0) break;
- size_t len = s_rxdesc[s_rxno][1] & (MG_BIT(13) - 1);
- mg_tcpip_qwrite(s_rxbuf[s_rxno], len, s_ifp);
- s_rxdesc[s_rxno][0] &= ~MG_BIT(0); // Disown
- if (++s_rxno >= ETH_DESC_CNT) s_rxno = 0;
- }
- }
- }
- if ((tsr & (GMAC_TSR_HRESP_Msk | GMAC_TSR_UND_Msk | GMAC_TSR_TXCOMP_Msk |
- GMAC_TSR_TFC_Msk | GMAC_TSR_TXGO_Msk | GMAC_TSR_RLE_Msk |
- GMAC_TSR_COL_Msk | GMAC_TSR_UBR_Msk)) != 0) {
- // MG_INFO((" --> %#x %#x", s_txdesc[s_txno][1], tsr));
- if (!(s_txdesc[s_txno][1] & MG_BIT(31))) s_txdesc[s_txno][1] |= MG_BIT(31);
- }
- GMAC_REGS->GMAC_RSR = rsr;
- GMAC_REGS->GMAC_TSR = tsr;
- }
- struct mg_tcpip_driver mg_tcpip_driver_same54 = {
- mg_tcpip_driver_same54_init, mg_tcpip_driver_same54_tx, NULL,
- mg_tcpip_driver_same54_up};
- #endif
- #ifdef MG_ENABLE_LINES
- #line 1 "src/drivers/stm32f.c"
- #endif
- #if MG_ENABLE_TCPIP && defined(MG_ENABLE_DRIVER_STM32F) && \
- MG_ENABLE_DRIVER_STM32F
- struct stm32f_eth {
- volatile uint32_t MACCR, MACFFR, MACHTHR, MACHTLR, MACMIIAR, MACMIIDR, MACFCR,
- MACVLANTR, RESERVED0[2], MACRWUFFR, MACPMTCSR, RESERVED1, MACDBGR, MACSR,
- MACIMR, MACA0HR, MACA0LR, MACA1HR, MACA1LR, MACA2HR, MACA2LR, MACA3HR,
- MACA3LR, RESERVED2[40], MMCCR, MMCRIR, MMCTIR, MMCRIMR, MMCTIMR,
- RESERVED3[14], MMCTGFSCCR, MMCTGFMSCCR, RESERVED4[5], MMCTGFCR,
- RESERVED5[10], MMCRFCECR, MMCRFAECR, RESERVED6[10], MMCRGUFCR,
- RESERVED7[334], PTPTSCR, PTPSSIR, PTPTSHR, PTPTSLR, PTPTSHUR, PTPTSLUR,
- PTPTSAR, PTPTTHR, PTPTTLR, RESERVED8, PTPTSSR, PTPPPSCR, RESERVED9[564],
- DMABMR, DMATPDR, DMARPDR, DMARDLAR, DMATDLAR, DMASR, DMAOMR, DMAIER,
- DMAMFBOCR, DMARSWTR, RESERVED10[8], DMACHTDR, DMACHRDR, DMACHTBAR,
- DMACHRBAR;
- };
- #undef ETH
- #define ETH ((struct stm32f_eth *) (uintptr_t) 0x40028000)
- #define ETH_PKT_SIZE 1540 // Max frame size
- #define ETH_DESC_CNT 4 // Descriptors count
- #define ETH_DS 4 // Descriptor size (words)
- static uint32_t s_rxdesc[ETH_DESC_CNT][ETH_DS]; // RX descriptors
- static uint32_t s_txdesc[ETH_DESC_CNT][ETH_DS]; // TX descriptors
- static uint8_t s_rxbuf[ETH_DESC_CNT][ETH_PKT_SIZE]; // RX ethernet buffers
- static uint8_t s_txbuf[ETH_DESC_CNT][ETH_PKT_SIZE]; // TX ethernet buffers
- static uint8_t s_txno; // Current TX descriptor
- static uint8_t s_rxno; // Current RX descriptor
- static struct mg_tcpip_if *s_ifp; // MIP interface
- enum { PHY_BCR = 0, PHY_BSR = 1, PHY_ID1 = 2, PHY_ID2 = 3, PHY_CSCR = 31 };
- static uint32_t eth_read_phy(uint8_t addr, uint8_t reg) {
- ETH->MACMIIAR &= (7 << 2);
- ETH->MACMIIAR |= ((uint32_t) addr << 11) | ((uint32_t) reg << 6);
- ETH->MACMIIAR |= MG_BIT(0);
- while (ETH->MACMIIAR & MG_BIT(0)) (void) 0;
- return ETH->MACMIIDR;
- }
- static void eth_write_phy(uint8_t addr, uint8_t reg, uint32_t val) {
- ETH->MACMIIDR = val;
- ETH->MACMIIAR &= (7 << 2);
- ETH->MACMIIAR |= ((uint32_t) addr << 11) | ((uint32_t) reg << 6) | MG_BIT(1);
- ETH->MACMIIAR |= MG_BIT(0);
- while (ETH->MACMIIAR & MG_BIT(0)) (void) 0;
- }
- static uint32_t get_hclk(void) {
- struct rcc {
- volatile uint32_t CR, PLLCFGR, CFGR;
- } *rcc = (struct rcc *) 0x40023800;
- uint32_t clk = 0, hsi = 16000000 /* 16 MHz */, hse = 8000000 /* 8MHz */;
- if (rcc->CFGR & (1 << 2)) {
- clk = hse;
- } else if (rcc->CFGR & (1 << 3)) {
- uint32_t vco, m, n, p;
- m = (rcc->PLLCFGR & (0x3f << 0)) >> 0;
- n = (rcc->PLLCFGR & (0x1ff << 6)) >> 6;
- p = (((rcc->PLLCFGR & (3 << 16)) >> 16) + 1) * 2;
- clk = (rcc->PLLCFGR & (1 << 22)) ? hse : hsi;
- vco = (uint32_t) ((uint64_t) clk * n / m);
- clk = vco / p;
- } else {
- clk = hsi;
- }
- uint32_t hpre = (rcc->CFGR & (15 << 4)) >> 4;
- if (hpre < 8) return clk;
- uint8_t ahbptab[8] = {1, 2, 3, 4, 6, 7, 8, 9}; // log2(div)
- return ((uint32_t) clk) >> ahbptab[hpre - 8];
- }
- // Guess CR from HCLK. MDC clock is generated from HCLK (AHB); as per 802.3,
- // it must not exceed 2.5MHz As the AHB clock can be (and usually is) derived
- // from the HSI (internal RC), and it can go above specs, the datasheets
- // specify a range of frequencies and activate one of a series of dividers to
- // keep the MDC clock safely below 2.5MHz. We guess a divider setting based on
- // HCLK with a +5% drift. If the user uses a different clock from our
- // defaults, needs to set the macros on top Valid for STM32F74xxx/75xxx
- // (38.8.1) and STM32F42xxx/43xxx (33.8.1) (both 4.5% worst case drift)
- static int guess_mdc_cr(void) {
- uint8_t crs[] = {2, 3, 0, 1, 4, 5}; // ETH->MACMIIAR::CR values
- uint8_t div[] = {16, 26, 42, 62, 102, 124}; // Respective HCLK dividers
- uint32_t hclk = get_hclk(); // Guess system HCLK
- int result = -1; // Invalid CR value
- if (hclk < 25000000) {
- MG_ERROR(("HCLK too low"));
- } else {
- for (int i = 0; i < 6; i++) {
- if (hclk / div[i] <= 2375000UL /* 2.5MHz - 5% */) {
- result = crs[i];
- break;
- }
- }
- if (result < 0) MG_ERROR(("HCLK too high"));
- }
- MG_DEBUG(("HCLK: %u, CR: %d", hclk, result));
- return result;
- }
- static bool mg_tcpip_driver_stm32f_init(struct mg_tcpip_if *ifp) {
- struct mg_tcpip_driver_stm32f_data *d =
- (struct mg_tcpip_driver_stm32f_data *) ifp->driver_data;
- uint8_t phy_addr = d == NULL ? 0 : d->phy_addr;
- s_ifp = ifp;
- // Init RX descriptors
- for (int i = 0; i < ETH_DESC_CNT; i++) {
- s_rxdesc[i][0] = MG_BIT(31); // Own
- s_rxdesc[i][1] = sizeof(s_rxbuf[i]) | MG_BIT(14); // 2nd address chained
- s_rxdesc[i][2] = (uint32_t) (uintptr_t) s_rxbuf[i]; // Point to data buffer
- s_rxdesc[i][3] =
- (uint32_t) (uintptr_t) s_rxdesc[(i + 1) % ETH_DESC_CNT]; // Chain
- }
- // Init TX descriptors
- for (int i = 0; i < ETH_DESC_CNT; i++) {
- s_txdesc[i][2] = (uint32_t) (uintptr_t) s_txbuf[i]; // Buf pointer
- s_txdesc[i][3] =
- (uint32_t) (uintptr_t) s_txdesc[(i + 1) % ETH_DESC_CNT]; // Chain
- }
- ETH->DMABMR |= MG_BIT(0); // Software reset
- while ((ETH->DMABMR & MG_BIT(0)) != 0) (void) 0; // Wait until done
- // Set MDC clock divider. If user told us the value, use it. Otherwise, guess
- int cr = (d == NULL || d->mdc_cr < 0) ? guess_mdc_cr() : d->mdc_cr;
- ETH->MACMIIAR = ((uint32_t) cr & 7) << 2;
- // NOTE(cpq): we do not use extended descriptor bit 7, and do not use
- // hardware checksum. Therefore, descriptor size is 4, not 8
- // ETH->DMABMR = MG_BIT(13) | MG_BIT(16) | MG_BIT(22) | MG_BIT(23) |
- // MG_BIT(25);
- ETH->MACIMR = MG_BIT(3) | MG_BIT(9); // Mask timestamp & PMT IT
- ETH->MACFCR = MG_BIT(7); // Disable zero quarta pause
- // ETH->MACFFR = MG_BIT(31); // Receive all
- eth_write_phy(phy_addr, PHY_BCR, MG_BIT(15)); // Reset PHY
- eth_write_phy(phy_addr, PHY_BCR, MG_BIT(12)); // Set autonegotiation
- ETH->DMARDLAR = (uint32_t) (uintptr_t) s_rxdesc; // RX descriptors
- ETH->DMATDLAR = (uint32_t) (uintptr_t) s_txdesc; // RX descriptors
- ETH->DMAIER = MG_BIT(6) | MG_BIT(16); // RIE, NISE
- ETH->MACCR =
- MG_BIT(2) | MG_BIT(3) | MG_BIT(11) | MG_BIT(14); // RE, TE, Duplex, Fast
- ETH->DMAOMR =
- MG_BIT(1) | MG_BIT(13) | MG_BIT(21) | MG_BIT(25); // SR, ST, TSF, RSF
- MG_DEBUG(("PHY ID: %#04hx %#04hx", eth_read_phy(phy_addr, PHY_ID1),
- eth_read_phy(phy_addr, PHY_ID2)));
- // MAC address filtering
- ETH->MACA0HR = ((uint32_t) ifp->mac[5] << 8U) | ifp->mac[4];
- ETH->MACA0LR = (uint32_t) (ifp->mac[3] << 24) |
- ((uint32_t) ifp->mac[2] << 16) |
- ((uint32_t) ifp->mac[1] << 8) | ifp->mac[0];
- return true;
- }
- static size_t mg_tcpip_driver_stm32f_tx(const void *buf, size_t len,
- struct mg_tcpip_if *ifp) {
- if (len > sizeof(s_txbuf[s_txno])) {
- MG_ERROR(("Frame too big, %ld", (long) len));
- len = 0; // Frame is too big
- } else if ((s_txdesc[s_txno][0] & MG_BIT(31))) {
- ifp->nerr++;
- MG_ERROR(("No free descriptors"));
- // printf("D0 %lx SR %lx\n", (long) s_txdesc[0][0], (long) ETH->DMASR);
- len = 0; // All descriptors are busy, fail
- } else {
- memcpy(s_txbuf[s_txno], buf, len); // Copy data
- s_txdesc[s_txno][1] = (uint32_t) len; // Set data len
- s_txdesc[s_txno][0] = MG_BIT(20) | MG_BIT(28) | MG_BIT(29); // Chain,FS,LS
- s_txdesc[s_txno][0] |= MG_BIT(31); // Set OWN bit - let DMA take over
- if (++s_txno >= ETH_DESC_CNT) s_txno = 0;
- }
- MG_DSB(); // ensure descriptors have been written
- ETH->DMASR = MG_BIT(2) | MG_BIT(5); // Clear any prior TBUS/TUS
- ETH->DMATPDR = 0; // and resume
- return len;
- }
- static bool mg_tcpip_driver_stm32f_up(struct mg_tcpip_if *ifp) {
- struct mg_tcpip_driver_stm32f_data *d =
- (struct mg_tcpip_driver_stm32f_data *) ifp->driver_data;
- uint8_t phy_addr = d == NULL ? 0 : d->phy_addr;
- uint32_t bsr = eth_read_phy(phy_addr, PHY_BSR);
- bool up = bsr & MG_BIT(2) ? 1 : 0;
- if ((ifp->state == MG_TCPIP_STATE_DOWN) && up) { // link state just went up
- uint32_t scsr = eth_read_phy(phy_addr, PHY_CSCR);
- // tmp = reg with flags set to the most likely situation: 100M full-duplex
- // if(link is slow or half) set flags otherwise
- // reg = tmp
- uint32_t maccr = ETH->MACCR | MG_BIT(14) | MG_BIT(11); // 100M, Full-duplex
- if ((scsr & MG_BIT(3)) == 0) maccr &= ~MG_BIT(14); // 10M
- if ((scsr & MG_BIT(4)) == 0) maccr &= ~MG_BIT(11); // Half-duplex
- ETH->MACCR = maccr; // IRQ handler does not fiddle with this register
- MG_DEBUG(("Link is %uM %s-duplex", maccr & MG_BIT(14) ? 100 : 10,
- maccr & MG_BIT(11) ? "full" : "half"));
- }
- return up;
- }
- #ifdef __riscv
- __attribute__((interrupt())) // For RISCV CH32V307, which share the same MAC
- #endif
- void ETH_IRQHandler(void);
- void ETH_IRQHandler(void) {
- if (ETH->DMASR & MG_BIT(6)) { // Frame received, loop
- ETH->DMASR = MG_BIT(16) | MG_BIT(6); // Clear flag
- for (uint32_t i = 0; i < 10; i++) { // read as they arrive but not forever
- if (s_rxdesc[s_rxno][0] & MG_BIT(31)) break; // exit when done
- if (((s_rxdesc[s_rxno][0] & (MG_BIT(8) | MG_BIT(9))) ==
- (MG_BIT(8) | MG_BIT(9))) &&
- !(s_rxdesc[s_rxno][0] & MG_BIT(15))) { // skip partial/errored frames
- uint32_t len = ((s_rxdesc[s_rxno][0] >> 16) & (MG_BIT(14) - 1));
- // printf("%lx %lu %lx %.8lx\n", s_rxno, len, s_rxdesc[s_rxno][0],
- // ETH->DMASR);
- mg_tcpip_qwrite(s_rxbuf[s_rxno], len > 4 ? len - 4 : len, s_ifp);
- }
- s_rxdesc[s_rxno][0] = MG_BIT(31);
- if (++s_rxno >= ETH_DESC_CNT) s_rxno = 0;
- }
- }
- // Cleanup flags
- ETH->DMASR = MG_BIT(16) // NIS, normal interrupt summary
- | MG_BIT(7); // Clear possible RBUS while processing
- ETH->DMARPDR = 0; // and resume RX
- }
- struct mg_tcpip_driver mg_tcpip_driver_stm32f = {
- mg_tcpip_driver_stm32f_init, mg_tcpip_driver_stm32f_tx, NULL,
- mg_tcpip_driver_stm32f_up};
- #endif
- #ifdef MG_ENABLE_LINES
- #line 1 "src/drivers/stm32h.c"
- #endif
- #if MG_ENABLE_TCPIP && defined(MG_ENABLE_DRIVER_STM32H) && \
- MG_ENABLE_DRIVER_STM32H
- struct stm32h_eth {
- volatile uint32_t MACCR, MACECR, MACPFR, MACWTR, MACHT0R, MACHT1R,
- RESERVED1[14], MACVTR, RESERVED2, MACVHTR, RESERVED3, MACVIR, MACIVIR,
- RESERVED4[2], MACTFCR, RESERVED5[7], MACRFCR, RESERVED6[7], MACISR,
- MACIER, MACRXTXSR, RESERVED7, MACPCSR, MACRWKPFR, RESERVED8[2], MACLCSR,
- MACLTCR, MACLETR, MAC1USTCR, RESERVED9[12], MACVR, MACDR, RESERVED10,
- MACHWF0R, MACHWF1R, MACHWF2R, RESERVED11[54], MACMDIOAR, MACMDIODR,
- RESERVED12[2], MACARPAR, RESERVED13[59], MACA0HR, MACA0LR, MACA1HR,
- MACA1LR, MACA2HR, MACA2LR, MACA3HR, MACA3LR, RESERVED14[248], MMCCR,
- MMCRIR, MMCTIR, MMCRIMR, MMCTIMR, RESERVED15[14], MMCTSCGPR, MMCTMCGPR,
- RESERVED16[5], MMCTPCGR, RESERVED17[10], MMCRCRCEPR, MMCRAEPR,
- RESERVED18[10], MMCRUPGR, RESERVED19[9], MMCTLPIMSTR, MMCTLPITCR,
- MMCRLPIMSTR, MMCRLPITCR, RESERVED20[65], MACL3L4C0R, MACL4A0R,
- RESERVED21[2], MACL3A0R0R, MACL3A1R0R, MACL3A2R0R, MACL3A3R0R,
- RESERVED22[4], MACL3L4C1R, MACL4A1R, RESERVED23[2], MACL3A0R1R,
- MACL3A1R1R, MACL3A2R1R, MACL3A3R1R, RESERVED24[108], MACTSCR, MACSSIR,
- MACSTSR, MACSTNR, MACSTSUR, MACSTNUR, MACTSAR, RESERVED25, MACTSSR,
- RESERVED26[3], MACTTSSNR, MACTTSSSR, RESERVED27[2], MACACR, RESERVED28,
- MACATSNR, MACATSSR, MACTSIACR, MACTSEACR, MACTSICNR, MACTSECNR,
- RESERVED29[4], MACPPSCR, RESERVED30[3], MACPPSTTSR, MACPPSTTNR, MACPPSIR,
- MACPPSWR, RESERVED31[12], MACPOCR, MACSPI0R, MACSPI1R, MACSPI2R, MACLMIR,
- RESERVED32[11], MTLOMR, RESERVED33[7], MTLISR, RESERVED34[55], MTLTQOMR,
- MTLTQUR, MTLTQDR, RESERVED35[8], MTLQICSR, MTLRQOMR, MTLRQMPOCR, MTLRQDR,
- RESERVED36[177], DMAMR, DMASBMR, DMAISR, DMADSR, RESERVED37[60], DMACCR,
- DMACTCR, DMACRCR, RESERVED38[2], DMACTDLAR, RESERVED39, DMACRDLAR,
- DMACTDTPR, RESERVED40, DMACRDTPR, DMACTDRLR, DMACRDRLR, DMACIER,
- DMACRIWTR, DMACSFCSR, RESERVED41, DMACCATDR, RESERVED42, DMACCARDR,
- RESERVED43, DMACCATBR, RESERVED44, DMACCARBR, DMACSR, RESERVED45[2],
- DMACMFCR;
- };
- #undef ETH
- #define ETH \
- ((struct stm32h_eth *) (uintptr_t) (0x40000000UL + 0x00020000UL + 0x8000UL))
- #define ETH_PKT_SIZE 1540 // Max frame size
- #define ETH_DESC_CNT 4 // Descriptors count
- #define ETH_DS 4 // Descriptor size (words)
- static volatile uint32_t s_rxdesc[ETH_DESC_CNT][ETH_DS]; // RX descriptors
- static volatile uint32_t s_txdesc[ETH_DESC_CNT][ETH_DS]; // TX descriptors
- static uint8_t s_rxbuf[ETH_DESC_CNT][ETH_PKT_SIZE]; // RX ethernet buffers
- static uint8_t s_txbuf[ETH_DESC_CNT][ETH_PKT_SIZE]; // TX ethernet buffers
- static struct mg_tcpip_if *s_ifp; // MIP interface
- enum {
- PHY_ADDR = 0,
- PHY_BCR = 0,
- PHY_BSR = 1,
- PHY_CSCR = 31
- }; // PHY constants
- static uint32_t eth_read_phy(uint8_t addr, uint8_t reg) {
- ETH->MACMDIOAR &= (0xF << 8);
- ETH->MACMDIOAR |= ((uint32_t) addr << 21) | ((uint32_t) reg << 16) | 3 << 2;
- ETH->MACMDIOAR |= MG_BIT(0);
- while (ETH->MACMDIOAR & MG_BIT(0)) (void) 0;
- return ETH->MACMDIODR;
- }
- static void eth_write_phy(uint8_t addr, uint8_t reg, uint32_t val) {
- ETH->MACMDIODR = val;
- ETH->MACMDIOAR &= (0xF << 8);
- ETH->MACMDIOAR |= ((uint32_t) addr << 21) | ((uint32_t) reg << 16) | 1 << 2;
- ETH->MACMDIOAR |= MG_BIT(0);
- while (ETH->MACMDIOAR & MG_BIT(0)) (void) 0;
- }
- static uint32_t get_hclk(void) {
- struct rcc {
- volatile uint32_t CR, HSICFGR, CRRCR, CSICFGR, CFGR, RESERVED1, D1CFGR,
- D2CFGR, D3CFGR, RESERVED2, PLLCKSELR, PLLCFGR, PLL1DIVR, PLL1FRACR,
- PLL2DIVR, PLL2FRACR, PLL3DIVR, PLL3FRACR, RESERVED3, D1CCIPR, D2CCIP1R,
- D2CCIP2R, D3CCIPR, RESERVED4, CIER, CIFR, CICR, RESERVED5, BDCR, CSR,
- RESERVED6, AHB3RSTR, AHB1RSTR, AHB2RSTR, AHB4RSTR, APB3RSTR, APB1LRSTR,
- APB1HRSTR, APB2RSTR, APB4RSTR, GCR, RESERVED8, D3AMR, RESERVED11[9],
- RSR, AHB3ENR, AHB1ENR, AHB2ENR, AHB4ENR, APB3ENR, APB1LENR, APB1HENR,
- APB2ENR, APB4ENR, RESERVED12, AHB3LPENR, AHB1LPENR, AHB2LPENR,
- AHB4LPENR, APB3LPENR, APB1LLPENR, APB1HLPENR, APB2LPENR, APB4LPENR,
- RESERVED13[4];
- } *rcc = ((struct rcc *) (0x40000000 + 0x18020000 + 0x4400));
- uint32_t clk = 0, hsi = 64000000 /* 64 MHz */, hse = 8000000 /* 8MHz */,
- csi = 4000000 /* 4MHz */;
- unsigned int sel = (rcc->CFGR & (7 << 3)) >> 3;
- if (sel == 1) {
- clk = csi;
- } else if (sel == 2) {
- clk = hse;
- } else if (sel == 3) {
- uint32_t vco, m, n, p;
- unsigned int src = (rcc->PLLCKSELR & (3 << 0)) >> 0;
- m = ((rcc->PLLCKSELR & (0x3F << 4)) >> 4);
- n = ((rcc->PLL1DIVR & (0x1FF << 0)) >> 0) + 1 +
- ((rcc->PLLCFGR & MG_BIT(0)) ? 1 : 0); // round-up in fractional mode
- p = ((rcc->PLL1DIVR & (0x7F << 9)) >> 9) + 1;
- if (src == 1) {
- clk = csi;
- } else if (src == 2) {
- clk = hse;
- } else {
- clk = hsi;
- clk >>= ((rcc->CR & 3) >> 3);
- }
- vco = (uint32_t) ((uint64_t) clk * n / m);
- clk = vco / p;
- } else {
- clk = hsi;
- clk >>= ((rcc->CR & 3) >> 3);
- }
- const uint8_t cptab[12] = {1, 2, 3, 4, 6, 7, 8, 9}; // log2(div)
- uint32_t d1cpre = (rcc->D1CFGR & (0x0F << 8)) >> 8;
- if (d1cpre >= 8) clk >>= cptab[d1cpre - 8];
- MG_DEBUG(("D1 CLK: %u", clk));
- uint32_t hpre = (rcc->D1CFGR & (0x0F << 0)) >> 0;
- if (hpre < 8) return clk;
- return ((uint32_t) clk) >> cptab[hpre - 8];
- }
- // Guess CR from AHB1 clock. MDC clock is generated from the ETH peripheral
- // clock (AHB1); as per 802.3, it must not exceed 2. As the AHB clock can
- // be derived from HSI or CSI (internal RC) clocks, and those can go above
- // specs, the datasheets specify a range of frequencies and activate one of a
- // series of dividers to keep the MDC clock safely below 2.5MHz. We guess a
- // divider setting based on HCLK with some drift. If the user uses a different
- // clock from our defaults, needs to set the macros on top. Valid for
- // STM32H74xxx/75xxx (58.11.4)(4.5% worst case drift)(CSI clock has a 7.5 %
- // worst case drift @ max temp)
- static int guess_mdc_cr(void) {
- const uint8_t crs[] = {2, 3, 0, 1, 4, 5}; // ETH->MACMDIOAR::CR values
- const uint8_t div[] = {16, 26, 42, 62, 102, 124}; // Respective HCLK dividers
- uint32_t hclk = get_hclk(); // Guess system HCLK
- int result = -1; // Invalid CR value
- for (int i = 0; i < 6; i++) {
- if (hclk / div[i] <= 2375000UL /* 2.5MHz - 5% */) {
- result = crs[i];
- break;
- }
- }
- if (result < 0) MG_ERROR(("HCLK too high"));
- MG_DEBUG(("HCLK: %u, CR: %d", hclk, result));
- return result;
- }
- static bool mg_tcpip_driver_stm32h_init(struct mg_tcpip_if *ifp) {
- struct mg_tcpip_driver_stm32h_data *d =
- (struct mg_tcpip_driver_stm32h_data *) ifp->driver_data;
- s_ifp = ifp;
- // Init RX descriptors
- for (int i = 0; i < ETH_DESC_CNT; i++) {
- s_rxdesc[i][0] = (uint32_t) (uintptr_t) s_rxbuf[i]; // Point to data buffer
- s_rxdesc[i][3] = MG_BIT(31) | MG_BIT(30) | MG_BIT(24); // OWN, IOC, BUF1V
- }
- // Init TX descriptors
- for (int i = 0; i < ETH_DESC_CNT; i++) {
- s_txdesc[i][0] = (uint32_t) (uintptr_t) s_txbuf[i]; // Buf pointer
- }
- ETH->DMAMR |= MG_BIT(0); // Software reset
- while ((ETH->DMAMR & MG_BIT(0)) != 0) (void) 0; // Wait until done
- // Set MDC clock divider. If user told us the value, use it. Otherwise, guess
- int cr = (d == NULL || d->mdc_cr < 0) ? guess_mdc_cr() : d->mdc_cr;
- ETH->MACMDIOAR = ((uint32_t) cr & 0xF) << 8;
- // NOTE(scaprile): We do not use timing facilities so the DMA engine does not
- // re-write buffer address
- ETH->DMAMR = 0 << 16; // use interrupt mode 0 (58.8.1) (reset value)
- ETH->DMASBMR |= MG_BIT(12); // AAL NOTE(scaprile): is this actually needed
- ETH->MACIER = 0; // Do not enable additional irq sources (reset value)
- ETH->MACTFCR = MG_BIT(7); // Disable zero-quanta pause
- // ETH->MACPFR = MG_BIT(31); // Receive all
- eth_write_phy(PHY_ADDR, PHY_BCR, MG_BIT(15)); // Reset PHY
- eth_write_phy(PHY_ADDR, PHY_BCR, MG_BIT(12)); // Set autonegotiation
- ETH->DMACRDLAR =
- (uint32_t) (uintptr_t) s_rxdesc; // RX descriptors start address
- ETH->DMACRDRLR = ETH_DESC_CNT - 1; // ring length
- ETH->DMACRDTPR =
- (uint32_t) (uintptr_t) &s_rxdesc[ETH_DESC_CNT -
- 1]; // last valid descriptor address
- ETH->DMACTDLAR =
- (uint32_t) (uintptr_t) s_txdesc; // TX descriptors start address
- ETH->DMACTDRLR = ETH_DESC_CNT - 1; // ring length
- ETH->DMACTDTPR =
- (uint32_t) (uintptr_t) s_txdesc; // first available descriptor address
- ETH->DMACCR = 0; // DSL = 0 (contiguous descriptor table) (reset value)
- ETH->DMACIER = MG_BIT(6) | MG_BIT(15); // RIE, NIE
- ETH->MACCR = MG_BIT(0) | MG_BIT(1) | MG_BIT(13) | MG_BIT(14) |
- MG_BIT(15); // RE, TE, Duplex, Fast, Reserved
- ETH->MTLTQOMR |= MG_BIT(1); // TSF
- ETH->MTLRQOMR |= MG_BIT(5); // RSF
- ETH->DMACTCR |= MG_BIT(0); // ST
- ETH->DMACRCR |= MG_BIT(0); // SR
- // MAC address filtering
- ETH->MACA0HR = ((uint32_t) ifp->mac[5] << 8U) | ifp->mac[4];
- ETH->MACA0LR = (uint32_t) (ifp->mac[3] << 24) |
- ((uint32_t) ifp->mac[2] << 16) |
- ((uint32_t) ifp->mac[1] << 8) | ifp->mac[0];
- return true;
- }
- static uint32_t s_txno;
- static size_t mg_tcpip_driver_stm32h_tx(const void *buf, size_t len,
- struct mg_tcpip_if *ifp) {
- if (len > sizeof(s_txbuf[s_txno])) {
- MG_ERROR(("Frame too big, %ld", (long) len));
- len = 0; // Frame is too big
- } else if ((s_txdesc[s_txno][3] & MG_BIT(31))) {
- ifp->nerr++;
- MG_ERROR(("No free descriptors: %u %08X %08X %08X", s_txno,
- s_txdesc[s_txno][3], ETH->DMACSR, ETH->DMACTCR));
- for (int i = 0; i < ETH_DESC_CNT; i++) MG_ERROR(("%08X", s_txdesc[i][3]));
- len = 0; // All descriptors are busy, fail
- } else {
- memcpy(s_txbuf[s_txno], buf, len); // Copy data
- s_txdesc[s_txno][2] = (uint32_t) len; // Set data len
- s_txdesc[s_txno][3] = MG_BIT(28) | MG_BIT(29); // FD, LD
- s_txdesc[s_txno][3] |= MG_BIT(31); // Set OWN bit - let DMA take over
- if (++s_txno >= ETH_DESC_CNT) s_txno = 0;
- }
- ETH->DMACSR |= MG_BIT(2) | MG_BIT(1); // Clear any prior TBU, TPS
- ETH->DMACTDTPR = (uint32_t) (uintptr_t) &s_txdesc[s_txno]; // and resume
- return len;
- (void) ifp;
- }
- static bool mg_tcpip_driver_stm32h_up(struct mg_tcpip_if *ifp) {
- uint32_t bsr = eth_read_phy(PHY_ADDR, PHY_BSR);
- bool up = bsr & MG_BIT(2) ? 1 : 0;
- if ((ifp->state == MG_TCPIP_STATE_DOWN) && up) { // link state just went up
- uint32_t scsr = eth_read_phy(PHY_ADDR, PHY_CSCR);
- // tmp = reg with flags set to the most likely situation: 100M full-duplex
- // if(link is slow or half) set flags otherwise
- // reg = tmp
- uint32_t maccr = ETH->MACCR | MG_BIT(14) | MG_BIT(13); // 100M, Full-duplex
- if ((scsr & MG_BIT(3)) == 0) maccr &= ~MG_BIT(14); // 10M
- if ((scsr & MG_BIT(4)) == 0) maccr &= ~MG_BIT(13); // Half-duplex
- ETH->MACCR = maccr; // IRQ handler does not fiddle with this register
- MG_DEBUG(("Link is %uM %s-duplex", maccr & MG_BIT(14) ? 100 : 10,
- maccr & MG_BIT(13) ? "full" : "half"));
- }
- return up;
- }
- void ETH_IRQHandler(void);
- static uint32_t s_rxno;
- void ETH_IRQHandler(void) {
- if (ETH->DMACSR & MG_BIT(6)) { // Frame received, loop
- ETH->DMACSR = MG_BIT(15) | MG_BIT(6); // Clear flag
- for (uint32_t i = 0; i < 10; i++) { // read as they arrive but not forever
- if (s_rxdesc[s_rxno][3] & MG_BIT(31)) break; // exit when done
- if (((s_rxdesc[s_rxno][3] & (MG_BIT(28) | MG_BIT(29))) ==
- (MG_BIT(28) | MG_BIT(29))) &&
- !(s_rxdesc[s_rxno][3] & MG_BIT(15))) { // skip partial/errored frames
- uint32_t len = s_rxdesc[s_rxno][3] & (MG_BIT(15) - 1);
- // MG_DEBUG(("%lx %lu %lx %08lx", s_rxno, len, s_rxdesc[s_rxno][3],
- // ETH->DMACSR));
- mg_tcpip_qwrite(s_rxbuf[s_rxno], len > 4 ? len - 4 : len, s_ifp);
- }
- s_rxdesc[s_rxno][3] =
- MG_BIT(31) | MG_BIT(30) | MG_BIT(24); // OWN, IOC, BUF1V
- if (++s_rxno >= ETH_DESC_CNT) s_rxno = 0;
- }
- }
- ETH->DMACSR =
- MG_BIT(7) | MG_BIT(8); // Clear possible RBU RPS while processing
- ETH->DMACRDTPR =
- (uint32_t) (uintptr_t) &s_rxdesc[ETH_DESC_CNT - 1]; // and resume RX
- }
- struct mg_tcpip_driver mg_tcpip_driver_stm32h = {
- mg_tcpip_driver_stm32h_init, mg_tcpip_driver_stm32h_tx, NULL,
- mg_tcpip_driver_stm32h_up};
- #endif
- #ifdef MG_ENABLE_LINES
- #line 1 "src/drivers/tm4c.c"
- #endif
- #if MG_ENABLE_TCPIP && defined(MG_ENABLE_DRIVER_TM4C) && MG_ENABLE_DRIVER_TM4C
- struct tm4c_emac {
- volatile uint32_t EMACCFG, EMACFRAMEFLTR, EMACHASHTBLH, EMACHASHTBLL,
- EMACMIIADDR, EMACMIIDATA, EMACFLOWCTL, EMACVLANTG, RESERVED0, EMACSTATUS,
- EMACRWUFF, EMACPMTCTLSTAT, RESERVED1[2], EMACRIS, EMACIM, EMACADDR0H,
- EMACADDR0L, EMACADDR1H, EMACADDR1L, EMACADDR2H, EMACADDR2L, EMACADDR3H,
- EMACADDR3L, RESERVED2[31], EMACWDOGTO, RESERVED3[8], EMACMMCCTRL,
- EMACMMCRXRIS, EMACMMCTXRIS, EMACMMCRXIM, EMACMMCTXIM, RESERVED4,
- EMACTXCNTGB, RESERVED5[12], EMACTXCNTSCOL, EMACTXCNTMCOL, RESERVED6[4],
- EMACTXOCTCNTG, RESERVED7[6], EMACRXCNTGB, RESERVED8[4], EMACRXCNTCRCERR,
- EMACRXCNTALGNERR, RESERVED9[10], EMACRXCNTGUNI, RESERVED10[239],
- EMACVLNINCREP, EMACVLANHASH, RESERVED11[93], EMACTIMSTCTRL, EMACSUBSECINC,
- EMACTIMSEC, EMACTIMNANO, EMACTIMSECU, EMACTIMNANOU, EMACTIMADD,
- EMACTARGSEC, EMACTARGNANO, EMACHWORDSEC, EMACTIMSTAT, EMACPPSCTRL,
- RESERVED12[12], EMACPPS0INTVL, EMACPPS0WIDTH, RESERVED13[294],
- EMACDMABUSMOD, EMACTXPOLLD, EMACRXPOLLD, EMACRXDLADDR, EMACTXDLADDR,
- EMACDMARIS, EMACDMAOPMODE, EMACDMAIM, EMACMFBOC, EMACRXINTWDT,
- RESERVED14[8], EMACHOSTXDESC, EMACHOSRXDESC, EMACHOSTXBA, EMACHOSRXBA,
- RESERVED15[218], EMACPP, EMACPC, EMACCC, RESERVED16, EMACEPHYRIS,
- EMACEPHYIM, EMACEPHYIMSC;
- };
- #undef EMAC
- #define EMAC ((struct tm4c_emac *) (uintptr_t) 0x400EC000)
- #define ETH_PKT_SIZE 1540 // Max frame size
- #define ETH_DESC_CNT 4 // Descriptors count
- #define ETH_DS 4 // Descriptor size (words)
- static uint32_t s_rxdesc[ETH_DESC_CNT][ETH_DS]; // RX descriptors
- static uint32_t s_txdesc[ETH_DESC_CNT][ETH_DS]; // TX descriptors
- static uint8_t s_rxbuf[ETH_DESC_CNT][ETH_PKT_SIZE]; // RX ethernet buffers
- static uint8_t s_txbuf[ETH_DESC_CNT][ETH_PKT_SIZE]; // TX ethernet buffers
- static struct mg_tcpip_if *s_ifp; // MIP interface
- enum {
- EPHY_ADDR = 0,
- EPHYBMCR = 0,
- EPHYBMSR = 1,
- EPHYSTS = 16
- }; // PHY constants
- static inline void tm4cspin(volatile uint32_t count) {
- while (count--) (void) 0;
- }
- static uint32_t emac_read_phy(uint8_t addr, uint8_t reg) {
- EMAC->EMACMIIADDR &= (0xf << 2);
- EMAC->EMACMIIADDR |= ((uint32_t) addr << 11) | ((uint32_t) reg << 6);
- EMAC->EMACMIIADDR |= MG_BIT(0);
- while (EMAC->EMACMIIADDR & MG_BIT(0)) tm4cspin(1);
- return EMAC->EMACMIIDATA;
- }
- static void emac_write_phy(uint8_t addr, uint8_t reg, uint32_t val) {
- EMAC->EMACMIIDATA = val;
- EMAC->EMACMIIADDR &= (0xf << 2);
- EMAC->EMACMIIADDR |= ((uint32_t) addr << 11) | ((uint32_t) reg << 6) | MG_BIT(1);
- EMAC->EMACMIIADDR |= MG_BIT(0);
- while (EMAC->EMACMIIADDR & MG_BIT(0)) tm4cspin(1);
- }
- static uint32_t get_sysclk(void) {
- struct sysctl {
- volatile uint32_t DONTCARE0[44], RSCLKCFG, DONTCARE1[43], PLLFREQ0,
- PLLFREQ1;
- } *sysctl = (struct sysctl *) 0x400FE000;
- uint32_t clk = 0, piosc = 16000000 /* 16 MHz */, mosc = 25000000 /* 25MHz */;
- if (sysctl->RSCLKCFG & (1 << 28)) { // USEPLL
- uint32_t fin, vco, mdiv, n, q, psysdiv;
- uint32_t pllsrc = (sysctl->RSCLKCFG & (0xf << 24)) >> 24;
- if (pllsrc == 0) {
- clk = piosc;
- } else if (pllsrc == 3) {
- clk = mosc;
- } else {
- MG_ERROR(("Unsupported clock source"));
- }
- q = (sysctl->PLLFREQ1 & (0x1f << 8)) >> 8;
- n = (sysctl->PLLFREQ1 & (0x1f << 0)) >> 0;
- fin = clk / ((q + 1) * (n + 1));
- mdiv = (sysctl->PLLFREQ0 & (0x3ff << 0)) >>
- 0; // mint + (mfrac / 1024); MFRAC not supported
- psysdiv = (sysctl->RSCLKCFG & (0x3f << 0)) >> 0;
- vco = (uint32_t) ((uint64_t) fin * mdiv);
- return vco / (psysdiv + 1);
- }
- uint32_t oscsrc = (sysctl->RSCLKCFG & (0xf << 20)) >> 20;
- if (oscsrc == 0) {
- clk = piosc;
- } else if (oscsrc == 3) {
- clk = mosc;
- } else {
- MG_ERROR(("Unsupported clock source"));
- }
- uint32_t osysdiv = (sysctl->RSCLKCFG & (0xf << 16)) >> 16;
- return clk / (osysdiv + 1);
- }
- // Guess CR from SYSCLK. MDC clock is generated from SYSCLK (AHB); as per
- // 802.3, it must not exceed 2.5MHz (also 20.4.2.6) As the AHB clock can be
- // derived from the PIOSC (internal RC), and it can go above specs, the
- // datasheets specify a range of frequencies and activate one of a series of
- // dividers to keep the MDC clock safely below 2.5MHz. We guess a divider
- // setting based on SYSCLK with a +5% drift. If the user uses a different clock
- // from our defaults, needs to set the macros on top Valid for TM4C129x (20.7)
- // (4.5% worst case drift)
- // The PHY receives the main oscillator (MOSC) (20.3.1)
- static int guess_mdc_cr(void) {
- uint8_t crs[] = {2, 3, 0, 1}; // EMAC->MACMIIAR::CR values
- uint8_t div[] = {16, 26, 42, 62}; // Respective HCLK dividers
- uint32_t sysclk = get_sysclk(); // Guess system SYSCLK
- int result = -1; // Invalid CR value
- if (sysclk < 25000000) {
- MG_ERROR(("SYSCLK too low"));
- } else {
- for (int i = 0; i < 4; i++) {
- if (sysclk / div[i] <= 2375000UL /* 2.5MHz - 5% */) {
- result = crs[i];
- break;
- }
- }
- if (result < 0) MG_ERROR(("SYSCLK too high"));
- }
- MG_DEBUG(("SYSCLK: %u, CR: %d", sysclk, result));
- return result;
- }
- static bool mg_tcpip_driver_tm4c_init(struct mg_tcpip_if *ifp) {
- struct mg_tcpip_driver_tm4c_data *d =
- (struct mg_tcpip_driver_tm4c_data *) ifp->driver_data;
- s_ifp = ifp;
- // Init RX descriptors
- for (int i = 0; i < ETH_DESC_CNT; i++) {
- s_rxdesc[i][0] = MG_BIT(31); // Own
- s_rxdesc[i][1] = sizeof(s_rxbuf[i]) | MG_BIT(14); // 2nd address chained
- s_rxdesc[i][2] = (uint32_t) (uintptr_t) s_rxbuf[i]; // Point to data buffer
- s_rxdesc[i][3] =
- (uint32_t) (uintptr_t) s_rxdesc[(i + 1) % ETH_DESC_CNT]; // Chain
- // MG_DEBUG(("%d %p", i, s_rxdesc[i]));
- }
- // Init TX descriptors
- for (int i = 0; i < ETH_DESC_CNT; i++) {
- s_txdesc[i][2] = (uint32_t) (uintptr_t) s_txbuf[i]; // Buf pointer
- s_txdesc[i][3] =
- (uint32_t) (uintptr_t) s_txdesc[(i + 1) % ETH_DESC_CNT]; // Chain
- }
- EMAC->EMACDMABUSMOD |= MG_BIT(0); // Software reset
- while ((EMAC->EMACDMABUSMOD & MG_BIT(0)) != 0) tm4cspin(1); // Wait until done
- // Set MDC clock divider. If user told us the value, use it. Otherwise, guess
- int cr = (d == NULL || d->mdc_cr < 0) ? guess_mdc_cr() : d->mdc_cr;
- EMAC->EMACMIIADDR = ((uint32_t) cr & 0xf) << 2;
- // NOTE(cpq): we do not use extended descriptor bit 7, and do not use
- // hardware checksum. Therefore, descriptor size is 4, not 8
- // EMAC->EMACDMABUSMOD = MG_BIT(13) | MG_BIT(16) | MG_BIT(22) | MG_BIT(23) | MG_BIT(25);
- EMAC->EMACIM = MG_BIT(3) | MG_BIT(9); // Mask timestamp & PMT IT
- EMAC->EMACFLOWCTL = MG_BIT(7); // Disable zero-quanta pause
- // EMAC->EMACFRAMEFLTR = MG_BIT(31); // Receive all
- // EMAC->EMACPC defaults to internal PHY (EPHY) in MMI mode
- emac_write_phy(EPHY_ADDR, EPHYBMCR, MG_BIT(15)); // Reset internal PHY (EPHY)
- emac_write_phy(EPHY_ADDR, EPHYBMCR, MG_BIT(12)); // Set autonegotiation
- EMAC->EMACRXDLADDR = (uint32_t) (uintptr_t) s_rxdesc; // RX descriptors
- EMAC->EMACTXDLADDR = (uint32_t) (uintptr_t) s_txdesc; // TX descriptors
- EMAC->EMACDMAIM = MG_BIT(6) | MG_BIT(16); // RIE, NIE
- EMAC->EMACCFG = MG_BIT(2) | MG_BIT(3) | MG_BIT(11) | MG_BIT(14); // RE, TE, Duplex, Fast
- EMAC->EMACDMAOPMODE =
- MG_BIT(1) | MG_BIT(13) | MG_BIT(21) | MG_BIT(25); // SR, ST, TSF, RSF
- EMAC->EMACADDR0H = ((uint32_t) ifp->mac[5] << 8U) | ifp->mac[4];
- EMAC->EMACADDR0L = (uint32_t) (ifp->mac[3] << 24) |
- ((uint32_t) ifp->mac[2] << 16) |
- ((uint32_t) ifp->mac[1] << 8) | ifp->mac[0];
- // NOTE(scaprile) There are 3 additional slots for filtering, disabled by
- // default. This also applies to the STM32 driver (at least for F7)
- return true;
- }
- static uint32_t s_txno;
- static size_t mg_tcpip_driver_tm4c_tx(const void *buf, size_t len,
- struct mg_tcpip_if *ifp) {
- if (len > sizeof(s_txbuf[s_txno])) {
- MG_ERROR(("Frame too big, %ld", (long) len));
- len = 0; // fail
- } else if ((s_txdesc[s_txno][0] & MG_BIT(31))) {
- ifp->nerr++;
- MG_ERROR(("No descriptors available"));
- // printf("D0 %lx SR %lx\n", (long) s_txdesc[0][0], (long)
- // EMAC->EMACDMARIS);
- len = 0; // fail
- } else {
- memcpy(s_txbuf[s_txno], buf, len); // Copy data
- s_txdesc[s_txno][1] = (uint32_t) len; // Set data len
- s_txdesc[s_txno][0] =
- MG_BIT(20) | MG_BIT(28) | MG_BIT(29) | MG_BIT(30); // Chain,FS,LS,IC
- s_txdesc[s_txno][0] |= MG_BIT(31); // Set OWN bit - let DMA take over
- if (++s_txno >= ETH_DESC_CNT) s_txno = 0;
- }
- EMAC->EMACDMARIS = MG_BIT(2) | MG_BIT(5); // Clear any prior TU/UNF
- EMAC->EMACTXPOLLD = 0; // and resume
- return len;
- (void) ifp;
- }
- static bool mg_tcpip_driver_tm4c_up(struct mg_tcpip_if *ifp) {
- uint32_t bmsr = emac_read_phy(EPHY_ADDR, EPHYBMSR);
- bool up = (bmsr & MG_BIT(2)) ? 1 : 0;
- if ((ifp->state == MG_TCPIP_STATE_DOWN) && up) { // link state just went up
- uint32_t sts = emac_read_phy(EPHY_ADDR, EPHYSTS);
- // tmp = reg with flags set to the most likely situation: 100M full-duplex
- // if(link is slow or half) set flags otherwise
- // reg = tmp
- uint32_t emaccfg = EMAC->EMACCFG | MG_BIT(14) | MG_BIT(11); // 100M, Full-duplex
- if (sts & MG_BIT(1)) emaccfg &= ~MG_BIT(14); // 10M
- if ((sts & MG_BIT(2)) == 0) emaccfg &= ~MG_BIT(11); // Half-duplex
- EMAC->EMACCFG = emaccfg; // IRQ handler does not fiddle with this register
- MG_DEBUG(("Link is %uM %s-duplex", emaccfg & MG_BIT(14) ? 100 : 10,
- emaccfg & MG_BIT(11) ? "full" : "half"));
- }
- return up;
- }
- void EMAC0_IRQHandler(void);
- static uint32_t s_rxno;
- void EMAC0_IRQHandler(void) {
- if (EMAC->EMACDMARIS & MG_BIT(6)) { // Frame received, loop
- EMAC->EMACDMARIS = MG_BIT(16) | MG_BIT(6); // Clear flag
- for (uint32_t i = 0; i < 10; i++) { // read as they arrive but not forever
- if (s_rxdesc[s_rxno][0] & MG_BIT(31)) break; // exit when done
- if (((s_rxdesc[s_rxno][0] & (MG_BIT(8) | MG_BIT(9))) == (MG_BIT(8) | MG_BIT(9))) &&
- !(s_rxdesc[s_rxno][0] & MG_BIT(15))) { // skip partial/errored frames
- uint32_t len = ((s_rxdesc[s_rxno][0] >> 16) & (MG_BIT(14) - 1));
- // printf("%lx %lu %lx %.8lx\n", s_rxno, len, s_rxdesc[s_rxno][0],
- // EMAC->EMACDMARIS);
- mg_tcpip_qwrite(s_rxbuf[s_rxno], len > 4 ? len - 4 : len, s_ifp);
- }
- s_rxdesc[s_rxno][0] = MG_BIT(31);
- if (++s_rxno >= ETH_DESC_CNT) s_rxno = 0;
- }
- }
- EMAC->EMACDMARIS = MG_BIT(7); // Clear possible RU while processing
- EMAC->EMACRXPOLLD = 0; // and resume RX
- }
- struct mg_tcpip_driver mg_tcpip_driver_tm4c = {mg_tcpip_driver_tm4c_init,
- mg_tcpip_driver_tm4c_tx, NULL,
- mg_tcpip_driver_tm4c_up};
- #endif
- #ifdef MG_ENABLE_LINES
- #line 1 "src/drivers/w5500.c"
- #endif
- #if MG_ENABLE_TCPIP
- enum { W5500_CR = 0, W5500_S0 = 1, W5500_TX0 = 2, W5500_RX0 = 3 };
- static void w5500_txn(struct mg_tcpip_spi *s, uint8_t block, uint16_t addr, bool wr,
- void *buf, size_t len) {
- uint8_t *p = (uint8_t *) buf;
- uint8_t cmd[] = {(uint8_t) (addr >> 8), (uint8_t) (addr & 255),
- (uint8_t) ((block << 3) | (wr ? 4 : 0))};
- s->begin(s->spi);
- for (size_t i = 0; i < sizeof(cmd); i++) s->txn(s->spi, cmd[i]);
- for (size_t i = 0; i < len; i++) {
- uint8_t r = s->txn(s->spi, p[i]);
- if (!wr) p[i] = r;
- }
- s->end(s->spi);
- }
- // clang-format off
- static void w5500_wn(struct mg_tcpip_spi *s, uint8_t block, uint16_t addr, void *buf, size_t len) { w5500_txn(s, block, addr, true, buf, len); }
- static void w5500_w1(struct mg_tcpip_spi *s, uint8_t block, uint16_t addr, uint8_t val) { w5500_wn(s, block, addr, &val, 1); }
- static void w5500_w2(struct mg_tcpip_spi *s, uint8_t block, uint16_t addr, uint16_t val) { uint8_t buf[2] = {(uint8_t) (val >> 8), (uint8_t) (val & 255)}; w5500_wn(s, block, addr, buf, sizeof(buf)); }
- static void w5500_rn(struct mg_tcpip_spi *s, uint8_t block, uint16_t addr, void *buf, size_t len) { w5500_txn(s, block, addr, false, buf, len); }
- static uint8_t w5500_r1(struct mg_tcpip_spi *s, uint8_t block, uint16_t addr) { uint8_t r = 0; w5500_rn(s, block, addr, &r, 1); return r; }
- static uint16_t w5500_r2(struct mg_tcpip_spi *s, uint8_t block, uint16_t addr) { uint8_t buf[2] = {0, 0}; w5500_rn(s, block, addr, buf, sizeof(buf)); return (uint16_t) ((buf[0] << 8) | buf[1]); }
- // clang-format on
- static size_t w5500_rx(void *buf, size_t buflen, struct mg_tcpip_if *ifp) {
- struct mg_tcpip_spi *s = (struct mg_tcpip_spi *) ifp->driver_data;
- uint16_t r = 0, n = 0, len = (uint16_t) buflen, n2; // Read recv len
- while ((n2 = w5500_r2(s, W5500_S0, 0x26)) > n) n = n2; // Until it is stable
- // printf("RSR: %d\n", (int) n);
- if (n > 0) {
- uint16_t ptr = w5500_r2(s, W5500_S0, 0x28); // Get read pointer
- n = w5500_r2(s, W5500_RX0, ptr); // Read frame length
- if (n <= len + 2 && n > 1) {
- r = (uint16_t) (n - 2);
- w5500_rn(s, W5500_RX0, (uint16_t) (ptr + 2), buf, r);
- }
- w5500_w2(s, W5500_S0, 0x28, (uint16_t) (ptr + n)); // Advance read pointer
- w5500_w1(s, W5500_S0, 1, 0x40); // Sock0 CR -> RECV
- // printf(" RX_RD: tot=%u n=%u r=%u\n", n2, n, r);
- }
- return r;
- }
- static size_t w5500_tx(const void *buf, size_t buflen, struct mg_tcpip_if *ifp) {
- struct mg_tcpip_spi *s = (struct mg_tcpip_spi *) ifp->driver_data;
- uint16_t n = 0, len = (uint16_t) buflen;
- while (n < len) n = w5500_r2(s, W5500_S0, 0x20); // Wait for space
- uint16_t ptr = w5500_r2(s, W5500_S0, 0x24); // Get write pointer
- w5500_wn(s, W5500_TX0, ptr, (void *) buf, len); // Write data
- w5500_w2(s, W5500_S0, 0x24, (uint16_t) (ptr + len)); // Advance write pointer
- w5500_w1(s, W5500_S0, 1, 0x20); // Sock0 CR -> SEND
- for (int i = 0; i < 40; i++) {
- uint8_t ir = w5500_r1(s, W5500_S0, 2); // Read S0 IR
- if (ir == 0) continue;
- // printf("IR %d, len=%d, free=%d, ptr %d\n", ir, (int) len, (int) n, ptr);
- w5500_w1(s, W5500_S0, 2, ir); // Write S0 IR: clear it!
- if (ir & 8) len = 0; // Timeout. Report error
- if (ir & (16 | 8)) break; // Stop on SEND_OK or timeout
- }
- return len;
- }
- static bool w5500_init(struct mg_tcpip_if *ifp) {
- struct mg_tcpip_spi *s = (struct mg_tcpip_spi *) ifp->driver_data;
- s->end(s->spi);
- w5500_w1(s, W5500_CR, 0, 0x80); // Reset chip: CR -> 0x80
- w5500_w1(s, W5500_CR, 0x2e, 0); // CR PHYCFGR -> reset
- w5500_w1(s, W5500_CR, 0x2e, 0xf8); // CR PHYCFGR -> set
- // w5500_wn(s, W5500_CR, 9, s->mac, 6); // Set source MAC
- w5500_w1(s, W5500_S0, 0x1e, 16); // Sock0 RX buf size
- w5500_w1(s, W5500_S0, 0x1f, 16); // Sock0 TX buf size
- w5500_w1(s, W5500_S0, 0, 4); // Sock0 MR -> MACRAW
- w5500_w1(s, W5500_S0, 1, 1); // Sock0 CR -> OPEN
- return w5500_r1(s, W5500_S0, 3) == 0x42; // Sock0 SR == MACRAW
- }
- static bool w5500_up(struct mg_tcpip_if *ifp) {
- struct mg_tcpip_spi *spi = (struct mg_tcpip_spi *) ifp->driver_data;
- uint8_t phycfgr = w5500_r1(spi, W5500_CR, 0x2e);
- return phycfgr & 1; // Bit 0 of PHYCFGR is LNK (0 - down, 1 - up)
- }
- struct mg_tcpip_driver mg_tcpip_driver_w5500 = {w5500_init, w5500_tx, w5500_rx, w5500_up};
- #endif
|