From 678de81f24a50e03d6d03cd5d53f2aac1a79ba58 Mon Sep 17 00:00:00 2001 From: turbocat Date: Tue, 6 Jul 2021 18:18:46 +0000 Subject: [PATCH] kolibri-libc: - added qsort and assert - delete junk files - updated libc loader git-svn-id: svn://kolibrios.org@9013 a494cfbc-eb01-0410-851d-a64ba20cac60 --- .../develop/ktcc/trunk/bin/lib/libc.obj.a | Bin 82150 -> 83226 bytes .../ktcc/trunk/libc.obj/include/assert.h | 9 + .../ktcc/trunk/libc.obj/include/stdlib.h | 3 + .../ktcc/trunk/libc.obj/lib/libc.obj.a | Bin 82150 -> 0 bytes .../develop/ktcc/trunk/libc.obj/lib/libtcc.a | Bin 6644 -> 0 bytes .../ktcc/trunk/libc.obj/samples/Makefile | 3 +- .../ktcc/trunk/libc.obj/samples/assert_test.c | 9 + .../ktcc/trunk/libc.obj/source/Makefile | 2 +- .../develop/ktcc/trunk/libc.obj/source/libc.c | 2 + .../trunk/libc.obj/source/stdlib/assert.c | 14 ++ .../ktcc/trunk/libc.obj/source/stdlib/qsort.c | 238 ++++++++++++++++++ .../ktcc/trunk/libc.obj/source/symbols.txt | 4 +- .../develop/ktcc/trunk/libc/stdlib/assert.c | 28 +-- 13 files changed, 288 insertions(+), 24 deletions(-) create mode 100644 programs/develop/ktcc/trunk/libc.obj/include/assert.h delete mode 100644 programs/develop/ktcc/trunk/libc.obj/lib/libc.obj.a delete mode 100644 programs/develop/ktcc/trunk/libc.obj/lib/libtcc.a create mode 100644 programs/develop/ktcc/trunk/libc.obj/samples/assert_test.c create mode 100644 programs/develop/ktcc/trunk/libc.obj/source/stdlib/assert.c create mode 100644 programs/develop/ktcc/trunk/libc.obj/source/stdlib/qsort.c diff --git a/programs/develop/ktcc/trunk/bin/lib/libc.obj.a b/programs/develop/ktcc/trunk/bin/lib/libc.obj.a index 2cbc133460b61cbabd9ff9fd444f7215631ff28d..e1e9c1e85afaa2e8ff58332ee1751ba50a64c084 100644 GIT binary patch delta 799 zcmY+=eMpm06vy%J8BT535S1Y!LqvuS88T$ZFhwOJBSj-43E!$wCM%~%NVt-SkTCIy z5u+p|B#e|)L@XpMBqXdPBt#@6L_{P;NQ{t9FMs5P59h#hIp=qujT`20ueskF%+JsG za~dtcLx`^dOC=;|wbnwSN~(jDda$X~0Hk$7dKcJLhRW=QEagzyJ>XQiz2F*vyb!p< zkUs>TQ7D)J?-~?Fq1Z~05+{^-;BXNfDTkxF@K`e(_d%5|tJVQ0#^K~VoLYg?5jdk^ z>tmtO2F-Rjmj*tq7gUS(t;(F&<*R8I5gV0k1H%sAGIoz&* zUUf(RKwk~?*TO&@+^dI>hPv;Aa0@)}!=QQ;fFbo*4XY=eFruFBz_SR9?ZWdYOlsIE z6HIHJvA|0!%qGFBpbh3U?Hf%xuik3f1qZxy!lL@1{gT#CYS{&!)ruQdJ+P*}cwt>1 z@U;RqDq*t*wrXKpL+_|>8a$%Gzx!Y}06#h*s(yCEUJnwa4>1iOF(D*2jKmKjmLViz z7_p8ZiK9r;IFd4j*k+N`IV5c!Nnb$hi%7;2lDUjztsssyBzqlkZXmf^h)d<|Aa0c( zK|H%iK@{=sA%{#zaV&9CVnNDm#-u6dU_(Pwd;9r7M}x2FV(Y}JY13qGYrh=mn0Rdt zChq@g+^s%q-FF|Ou{o6R{{*8tImdV(A7}UvBpS}b$%#_i^ozd}jVk-4f8Cfh6!UwF R(NIS!JR-WzPRlXi*=>va1v<^TZ3T-h6 zCZT-_LOJLtLbyttbtYJEfem)p=z&dIzFEt+XxUc%!L|hKNWsoY*p-Fd1=y2^y=BVAKy+byO+{*FumE!woeSftzYv-BJ^sa9iD(g}Yg}HxKu7@Ic3A7T}TQlL9;| z!gL8{%J3qtYhUWpS87hzzOKNVD!f(i^!}jvQGHUMYw*PY1@+YgMSa1d9ZC-P=7h2v zet2L>E$i?V9sW~?uZH1w1S;xJ7gW39Zx7V=A#wT;LqD=+05J_Bby3888mS*bEHT8I zKx|2*VHmNGB8@4;kw%)v5a&4Jnn2u>Nb?lpd5Cx)BR +#include + +#define assert(x) ((void)((x) || (__assert_fail(#x, __FILE__, __LINE__, __func__),0))) + +#endif // _ASSERT_H_ \ No newline at end of file diff --git a/programs/develop/ktcc/trunk/libc.obj/include/stdlib.h b/programs/develop/ktcc/trunk/libc.obj/include/stdlib.h index c01384e208..2f2681eed4 100644 --- a/programs/develop/ktcc/trunk/libc.obj/include/stdlib.h +++ b/programs/develop/ktcc/trunk/libc.obj/include/stdlib.h @@ -40,4 +40,7 @@ extern void _FUNC(exit)(int status); extern void _FUNC(srand)(unsigned s); extern int _FUNC(rand)(void); +extern void _FUNC(__assert_fail)(const char *expr, const char *file, int line, const char *func); +extern void _FUNC(qsort)(void *base0, size_t n, size_t size, int (*compar)(const void *, const void *)); + #endif diff --git a/programs/develop/ktcc/trunk/libc.obj/lib/libc.obj.a b/programs/develop/ktcc/trunk/libc.obj/lib/libc.obj.a deleted file mode 100644 index 2cbc133460b61cbabd9ff9fd444f7215631ff28d..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 82150 zcmd^I4TvPib$+dr73J&*NfC-sj2HbwVH{(G5k^rG$N47-afm`3qL4qwF+vDogb~IVV@wc61d;c; zySnSWc{ANdYx=521>Ie*r>5UG?|t*Cx~jVRmb<%gZ|}^}^$t(REHTU5`%dThspFej zk+Vku;P(Ko-UK*$0^n_Uyyi5(wYXh>2H=MK0B*$X?GFIl^g)1k;C3@^oeu%rirYJJ zyX|KIZpZD8j{&@U8(^&uaO@nwi5OtxQGm_I0Zx4Z;Pi6g2w@%umX7{Jdx0q~J$0Dk^ifM0k4;1|CJ@XN0NY<&ly`z?ST z9z)!AF+adZ<@#)N}AUz=bOS9zlJ-hTEe@0e<}&fXA)}_>CI@e)A@P z-@@(jn*o0NR)A032Jky~0DN){;CB(z6Po~^It}pYGXS5#?X&j*Jc--qaC-{3&p!b0 zG;Y8DC4fJ87T}M*4DiR#0sIMK{j;wC`~@EW>IHzmehJ`jUk3QQR{;JVvHk<%{72mW z39}8Nag3R08tx484D_P$R&O{>kKu(ul4f?pq_=mX%$nR*?;xH=@z!2A z*xf6NnzNHAy9|DNt3T}ST2eGl#FwVU<+Eagaju&(TM=4-knL~pWv9nsFFP}d2jirl zemF%vvw*C#1`wSp0g;ppl3|!$$c^rnc%ZkOR!fCHNMm5tg+^2n#UN{Mn1^x7gLF&nFoF32b z&|wOD7bj5yTU&!E43ek|LxMfrp$iV_XWcU#Z1>ip?Q<|3OcTU3%u1vmBB8p&)B?k3 z7lzSz_uOa#ql{^zaMat2fev(XpJ+DPPfO!3><@wVKtF&!nPk?PMCXqm1KgjW9pt}1 z{o!#JSxi5kisLb*a~$>#Q5Z#sAs)tE{Aa}BdE|Rmh;k5*NXV>1#z`gA3TUJ4gFYR4 zXbwCOdOS>{-ae5IvxjK``m0UHIT-ph#1GTMq)V4JpQI3{xuzuUb+H&8&*i{pX* zmUNt4Ob^q^n2tLK>8F_$P#&VG@i5M>G0wj|&c9|Z8i$8eEWZfmNJ^sp?2szD(2qxe zVPOx53-setA0(qme}KHlBbp5`T14kV{46?{pfBKHoD%e~pZ%J{{3jk3W;o1$C#=g# z)v8mq?D3PQ^3!LJ(%%~O@PF=Fv@SnDD%)rKWe72+(O3FatPiZK*#C5MiR>KO5C80R z?kN5h@L2wad98)bjg7R>#zy(eK7Rj04+KGgjfN}*a0DxqGW}3Y`zR+4Mei=(8wjYlL59h2}v0&8(N zT-(7~#QNh)Sk{$ivxJL&Cu&F&{XWuZlF1WZyWA<1uQrA7Xv+Nv=6}#Se-GyA_t590 zgO2n)`&uZ%hx6?%cqH>tIr<)5%QokeD6ivY5?zN&)gfgi&%bvW>TELVpE4`VsvK@|s{!ZO$tEK6%<%{49M^AEGXcL z{}pI9%$dB#0nN9v9=IE?q?MCxfo0SKcUr%qSVJBu=IK$?bPFTb;bV*G!9fq z8V9_L0o04qG6!U^b%+BJn(#UoSBV1_1(shAAm_Lx-DwLb&?MAC*8J~hJrE7r^*@f~ zh~!KRn1v>gmf{Nee>k)Vu>5uajTi9bj{j$%aiBudIN)bHAhIdYLLCrE3OI8=h~q}W z%kxFe|320MG@fpSfTjCC9lsZ5btDF8&;-&_TowOkQz=RYEV~ZKr*4#n#GE7k*Pt<+ zQqVZy$dYdrd@!UBA*o~+6brW&nf?Yu1|>zd~Upji?RU{mF#z!=b5Vy z0|=-KMU5l)2w0KkaReXxs>P9qv0R;d${j3M=brM<_wzb=ol|Fh#atxG)`P&m6^v0d{nd+ zCmzCbbvW@$SgsBy{t(O2{AiO5C)PLaBKH@mk`t#)iDvP_dJM}zN{;~oBilJrpUi{F zFiSz>#tl}XdEB5j<>iVO)b2IOa3hZwQ!{tbc%I0j#*582c(s&K6?!HjB7)SpNB?c9K}Pr_adPTJU^I%E+{3A>OrUeGy{=Jie7j|H@Q7CDE8#;xj% zah=6-b;h{9h~;Sg7n4li#QO0&FB31a1py5nb99auI!pt1=C~@n5X*B__fs@nqmdSY zwUaYE;IM3nGkMMTCJsHCftMN>cj+!2X$h?lUPn$qtRZBmwG5F>x#{0 z{nxfWgv62~JXi#g;k5;g4?gx^oAsDYr)4!COo{4w5ZW_YMxSj<%Dch^vpluLH&51h z;N$ovu3K#=(4l0!T;{VgMPF6JI)T>7wo`zO7K)*ldH#!pWka0FYrZ%202MZQ*Xx9A z8TQismA-E{Zjmqh&g|)k|21d~rxY{}`1owL{rpY&pQoIO1>*mIvi=;&ujWRx?;*7Z zTmm;@fCf#vy^uBk`}k}&zPz9e0EN%V`*Zx?F#gla66_SX;(HFuhB%Ygd~aet6*hU- z<3GK2!*+gk{BQQ(PhayPtm%mVHE059DQf=r@xPzFaiwHHwg2n)A3mR(%Z~l|8(vC7 zV$K!+YtM)?phD0%;A8zyuiGgZU}8Q7e@q!4-q`v-eZ7ycW#C2~pg|KzOHuQ`moXrH zi%!XarN@Bmtv#h7G3Si`)0a*$XbT06175~}^fg;8av*!H7qhJ^98jP!oKjdB4$u?l zB?YScfg1J&Wbbt2)^vpfWD1UKv7~Xp$2D2VCphD#V8PPsf=nMXu0tHSq{&Ab2ek1Y zc~3~=w^}(lcKm)UcP(yoZ@K7QUJv8vb;gOF!g6=wW)e2R(v-ekv0#8{19sA+w+9>E z6CelVaGXONkkE{|)T71$FXI5cTeD3Lr0??NCUu1a3N#K>NGrnueB-D^fg0_BhJ8cy zCRdSM;eY~7AT34B|6bk~(#vKo0xZ2PkiMO_v?JwQ@xKC%0~M0S0Wa$T`+=5D3vB`A zffiRdpgR;EptFNydC0z zgtm|oE5iYLn|zxbAbrBJu5dtsCXjM*g*Xse6j=T}K^%tMlJ2w#6=)J_A#48k@}3|L z*k;i;J|s&N$3y< zBsA%ECTkqYL)x4avu69byf9V2~(5%Y{A zF+hVRp%(J0_@fs~6H2YhS; z48_7S)%SwU>HyNmE$K`fK!YZs7P97lAKL(1Tf@Qj)>hFBsPg}v$Ll{w@|oOP=GpQq z;Rt->nf2+#={hQ<4QDKFpDS!?GGtqmj^JDA=@}bJ^z6%Zv|pQE93|atJSK5^Ou`EZ z+%xxr>9_Tr=EobXqF3g5(oN6vnDiiKj^TC$H}jkiJ@-RvOVK%#E@0*sBjAy)Luoje zCicYbD!Xqqe2y>Em+3ZpS7L8!3InRfQS+IPeK14O09!f-lva)_98jPwWP-*4FY8}X z0WY5evlXy29GHdn=HNio>kgB_$V}R-{vFbAGM%SA07`1p>ZVYFMc z#X6WOxzKQ(FVx2j=?n)rEQV1En(s}!jmnz5e1^xhwSR}vc=z0>T<5LQ_f6Y`nLcJt zXZ)XEot#gaaBh4pc}Q2YkFQ7=@$WUO7dhx(;X< z2Qq!!n67XjH3f&ZP+BDpSXDtQ92kktS%)|vp}jdcu)i~~!oc!5K>CDbUEzQNO(5l> z76*Ln9~kXhH-?=W_XADqf>a;3r868LQ*dYtC5;1Kwg;k}{;+HkE_{0$ zVt@vX;go{L0U!GYCM~Z4oay7%bc6#MG!9fq8V7uA3rwQ($B$VR!Ls8(s!!O`6%LRo z1hj>s#sMGO0_c+y76q2x79f4nuMLwW8Fzfo zU@a6h-)!-fK0)mEtE74_;@c6hvRNBakv!@ zkUnl&XE-nmjRO_Z>TuxvU~IJrE9-%V^T*>b*C*`h3=ed80xcIcF8DZqJo8Q2Jy^+w zhW$gCK5k2=c)+18lr#=_StpF_yTcaR1*A_{))fvY&;(L0Y8>!!j7Ti~TceM#S=&%s zU)K>1XwbORg|spp!1ZqJNU-d>fR-ATk-!xWDA0u0xu|i#$9|$IP8%v)19j?xW_<*t zk6Y52@j?xngj&d&|9$Kuz@?bC53HGk%Z~x1uP|epaV7@LLgPS%q;bH<_8@Yg)%89z zecYJtZ~#rgp)HhFhy(VcrOR&*h6(E9rget{Gtf9tA*~PxrcrM{n&bkAoGG#)Y?9W#-KzdLNe2+K=-6;SXXtT1SYkW7ZX-@5%LtK8oi)j2pE{ zXuTmSPv4X44?T_NHgPk_tUrXlIkX!Fm0W1pPn7F3Fw&ztJRnmrXbT061DbE;Tr$_* zAwM0A_gcL-Kz-7%u5dtsCZQIx=6^5m4aR&nVPy>1G$qa+{rLS4JrI!d@)TecDkXpy z^Ydoyx2rHxO>=$bJLc#L2j;*tFlUY$4=DbcG_NjrFBZ_^MH_WN=8p`a@fX#Cp|u#e z@p1=Kme2N^8yj@0({wGmOrNn*js?Mxy#jmjyu1k6*(72a#Z{AzU@duz5%5TL;Jb2} zu6G^PqWXG)YjHSS+vz4;_Xo;MUROAvK)YlPcsYhB z1`(Ie0cE7l6%HuSE|~*fwhNND*KMz{FB zI>Z49jRO_ZDsiCA^~i_=u8tol(1h2yxJn#|thdN6y*+@2Mt#hf4#fcpjp3An#sM$y z3(zN%i)F8I8yuKihsDkO~qzP1OZlW{?UHaLL#m^B^ZfP}_yN`C?QWtr`UqzFV%*`t3^e9* zDXbC)lCmmjg#(GRV~2R>DjmH*ULg)7(SFe!XoCZ&j~mvVI4}c^0~OLralm?sNek_P zB;rGd4)qhxKoef);tFx#LO&iAfuIErkUnNicjCYdG=@_O8V7vrBTBmMK66C+q%9rc zfCf!MEo9CAK0b4lghPDedD$Rbb_~e%6?UYIEB?<+!JsV^G!A$f1IkyOcPLeJpxK%v z+H2!n;lQQ5(N6QfmoZ>8=?{kG!ll*zZ?-m7lIdgrEm!=nKw~(ipmD&<7%-aPYMn(> zutp4M%mLKLt?3R2W}tDPLee7TW@uK4wis|W9D>*1F0z(w1vW|aNuCPiz`$W6j*v)km=*5b%X;NG!9fq8V7u=3l97I zVZ&v|fm|Q6rXw8CpfQ|M&^X{@U2xd)bLY7}W=>Z)@MeAP{Lm~ClUE0oaiHNk6oo#< q0%!V&=D`zaxv0ehAJ?)!oVHviWcrvfU5N(@G=@_O8V7u=6aF9nUV1+O diff --git a/programs/develop/ktcc/trunk/libc.obj/lib/libtcc.a b/programs/develop/ktcc/trunk/libc.obj/lib/libtcc.a deleted file mode 100644 index 77e05da5e8b1232f9ec40bed14c96f5e922a6c9e..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 6644 zcmd^DVN4vy6`lhU4)@x-rdDGoX?;#<%BATAj7@`7HCB@8kBUw0DBJW$6^uD7s326_ z;o4OkhhAtj8eHXvt44}{SSm?q#0RdT-Dzz)^&AgfS-n{p{H*fZ4@Aq1ITHC+Bd+vudegoBSWCLS#~bVPdl>8V#xkv~&8^2X&Brp`oltPBv%4kJ`$VcEeJn_& z)=(!D)p4TtiFEo{s)HC6kqQzgd}5Vnl|j$8cDA+jG`F_2wzn~I82%@_O^h~+O~d~E zDkk;&49Afjr+L#4LZJ{sYL&g=30s;yxan7740e*BoUV*QshRkAlCPlb!u z2Adz3Jbd|0&F(i}_IrpvG$RrG=N4KinLgQ-X*r5E)1%r<+lh>J$>-dv#{QySZxigl>S5pbStfG2GW3_wI}iWp(`$ppO#%U3*B=YDuL9nGes`l-BmyFv z#o`EfwiAozz_%x$FAxiCd_NQ#e-G{rV^O#LSe(=A1!M7;e6l($AF7VXrs~+=%Zu0k z2qN5k1NQ*cvF$$_;l3*%z8UUK;MorDPl9iwJ46xFcK2Y#zPaG#Q;Ik65d`9xT;8T*%W(zFZ ze_qMXOKYleBKm7`NrJ_mlGgkuR|TIC_RKH_nc(Bj{T{E9i=sbF*#^eCzY;4JnR){Q zG(z;afR<8SlJ6q%XR3*h&j`M#wJ%{t@L_2!O1>oRVX-4SRw2rq8dM_Ks_lCaVp?Fr zm}OMn>8pex0!m2XYewN~M&Wxf8VaL-9ufSaFh3eo48NRZ8IfEZ}(dE1pU? z1S)$ID2Fzi@*CJ-9cj&c+nT?f&jM0m%{XD2#tXc*XW#{6;00q~0}LFFLxr?1B_;$P zQSM)wUW6IKIxnpeX`i3|s0uzJqKF)(JoGU&jc89QyOh9;u+AxgbDn?-h$nzNn3DD+ zJk@c=+ysU01HlJ{JtX;%2l}&jku8Sm_b?fRZ4q=Z<%RP)XFRjAiL%HJ0%1U+| z`*=y%ImwG^<4`by1|jPvr42xGh!$y`B(0tV_ED}B0nb}ng%I#pi2*oa0~hQWS{};* z4gr(wnB-JTsCc|9?4?gWfRz9OD@I?%7JvglWGVXUSZEaK7@7bu@RX9%4oe8To;|4!6;IRIl~LE zXk*^>fJPu;GQJ=zL^+l%#G?aV5sqbZacLpkc|l>BE~q_J94(+O7M*$}3w{*sZ>c^q zKQ^6vJx+ujqm(O7e@NAcl7{A>V1wH)o4lYPxlS7(f1Ne}APoens<-!H z%LX_oUl)To6ud&E76uNG2PCE09fQAfr@&L}n_vJ1Omkg@E2rGKE)2RTF2P_E_u9~@ zGBB`9jUyDr!-uZiQ=J_TJ4p;ViFM-(w!1L9KqZ>ZbJwG|`@gsbVKT?Vb9QlIR&UFG z^_fDxt1lC01U*cR=5FmgUz@Ann2> z=o+_Nu{BuaWfc&s|ykc>E^iQ1t8w!l)`XO*>!0kHn+4whRQZ?jv4L+c`rL5nx?z2}Q{XEr z5rVC()MZLr34y+4I_(x#tqlJ^TL~zz`{@^t`{2ecs@K|QE84%mA+ZW}b){d+6Z9e6 z1pN*z^$q<8^yyqO^!w=V!b=H7{8U^h?1pyHkK;A`dGu=nbQ%8e)CTBE(Dw!CFQ8A) zT}WNJC!@8fPjW=>1zm&1UPenaW$inluWGsh?Fdqk4oI3mi1uHgsTvdgL$q;ZFZoUM zqiA0Q{fwp`N1H&AG;}-YS3nzmzX1I=&?(I?(B2Pc4gCV>-v{VdKv!152F*{^=-;64 z*8aQ&dJmj_PtVVw{TTF1n*Jx+bNF&FbOH1OUtFal(31mAxRF21TuQX++g<<8*T3lv z-VXbhzBlwDxG70@%l_3cE`ytrbQkT9;6k`5dBDF1UcKp8S#bdD$0U2rnhl4)Vdqv`be%i^B4PR*2V*B8i;+vbBTp-fqGXM7E7 zn+L9{2PP{%K%kx)94-fSpBlqQqHxQ +#include +int a=431; +int b=532; + +int main(){ + assert(a!=b); + assert(a==b); +} \ No newline at end of file diff --git a/programs/develop/ktcc/trunk/libc.obj/source/Makefile b/programs/develop/ktcc/trunk/libc.obj/source/Makefile index 02da7ffcdd..cca348a88f 100644 --- a/programs/develop/ktcc/trunk/libc.obj/source/Makefile +++ b/programs/develop/ktcc/trunk/libc.obj/source/Makefile @@ -22,7 +22,7 @@ all: $(MAKE) -C libtcc rm -rf exports install: - cp -f ../lib/libc.obj ~/.kex/root/RD/1/LIB + cp -f libc.obj ~/.kex/root/RD/1/LIB clean: rm ../../bin/lib/libc.obj.a ../../bin/lib/libtcc.a diff --git a/programs/develop/ktcc/trunk/libc.obj/source/libc.c b/programs/develop/ktcc/trunk/libc.obj/source/libc.c index 1ef9ddf9e7..23ffc9d4c2 100644 --- a/programs/develop/ktcc/trunk/libc.obj/source/libc.c +++ b/programs/develop/ktcc/trunk/libc.obj/source/libc.c @@ -98,6 +98,8 @@ #include "stdlib/itoa.c" #include "stdlib/strtol.c" #include "stdlib/rand.c" +#include "stdlib/qsort.c" +#include "stdlib/assert.c" #include "math/acosh.c" #include "math/asinh.c" diff --git a/programs/develop/ktcc/trunk/libc.obj/source/stdlib/assert.c b/programs/develop/ktcc/trunk/libc.obj/source/stdlib/assert.c new file mode 100644 index 0000000000..553b90465b --- /dev/null +++ b/programs/develop/ktcc/trunk/libc.obj/source/stdlib/assert.c @@ -0,0 +1,14 @@ +#include +#include + + +#pragma GCC push_options +#pragma GCC optimize("O0") + +void __assert_fail(const char *expr, const char *file, int line, const char *func) +{ + fprintf(stdout, "Assertion failed: %s (%s: %s: %d)\n", expr, file, func, line); + exit(0); +} + +#pragma GCC pop_options \ No newline at end of file diff --git a/programs/develop/ktcc/trunk/libc.obj/source/stdlib/qsort.c b/programs/develop/ktcc/trunk/libc.obj/source/stdlib/qsort.c new file mode 100644 index 0000000000..456834ffe7 --- /dev/null +++ b/programs/develop/ktcc/trunk/libc.obj/source/stdlib/qsort.c @@ -0,0 +1,238 @@ +/* Copyright (C) 1994 DJ Delorie, see COPYING.DJ for details */ +#include + +/*- + * Copyright (c) 1980, 1983 The Regents of the University of California. + * All rights reserved. + * + * Redistribution and use in source and binary forms are permitted + * provided that: (1) source distributions retain this entire copyright + * notice and comment, and (2) distributions including binaries display + * the following acknowledgement: ``This product includes software + * developed by the University of California, Berkeley and its contributors'' + * in the documentation or other materials provided with the distribution + * and in all advertising materials mentioning features or use of this + * software. Neither the name of the University nor the names of its + * contributors may be used to endorse or promote products derived + * from this software without specific prior written permission. + * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR + * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED + * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. + */ + +/* + * qsort.c: + * Our own version of the system qsort routine which is faster by an average + * of 25%, with lows and highs of 10% and 50%. + * The THRESHold below is the insertion sort threshold, and has been adjusted + * for records of size 48 bytes. + * The MTHREShold is where we stop finding a better median. + */ + +#define THRESH 4 /* threshold for insertion */ +#define MTHRESH 6 /* threshold for median */ + +static int (*qcmp)(const void *, const void *); /* the comparison routine */ +static int qsz; /* size of each record */ +static int thresh; /* THRESHold in chars */ +static int mthresh; /* MTHRESHold in chars */ + +/* + * qst: + * Do a quicksort + * First, find the median element, and put that one in the first place as the + * discriminator. (This "median" is just the median of the first, last and + * middle elements). (Using this median instead of the first element is a big + * win). Then, the usual partitioning/swapping, followed by moving the + * discriminator into the right place. Then, figure out the sizes of the two + * partions, do the smaller one recursively and the larger one via a repeat of + * this code. Stopping when there are less than THRESH elements in a partition + * and cleaning up with an insertion sort (in our caller) is a huge win. + * All data swaps are done in-line, which is space-losing but time-saving. + * (And there are only three places where this is done). + */ + +static void +qst(char *base, char *max) +{ + char c, *i, *j, *jj; + int ii; + char *mid, *tmp; + int lo, hi; + + /* + * At the top here, lo is the number of characters of elements in the + * current partition. (Which should be max - base). + * Find the median of the first, last, and middle element and make + * that the middle element. Set j to largest of first and middle. + * If max is larger than that guy, then it's that guy, else compare + * max with loser of first and take larger. Things are set up to + * prefer the middle, then the first in case of ties. + */ + lo = max - base; /* number of elements as chars */ + do { + mid = i = base + qsz * ((lo / qsz) >> 1); + if (lo >= mthresh) + { + j = (qcmp((jj = base), i) > 0 ? jj : i); + if (qcmp(j, (tmp = max - qsz)) > 0) + { + /* switch to first loser */ + j = (j == jj ? i : jj); + if (qcmp(j, tmp) < 0) + j = tmp; + } + if (j != i) + { + ii = qsz; + do { + c = *i; + *i++ = *j; + *j++ = c; + } while (--ii); + } + } + /* + * Semi-standard quicksort partitioning/swapping + */ + for (i = base, j = max - qsz; ; ) + { + while (i < mid && qcmp(i, mid) <= 0) + i += qsz; + while (j > mid) + { + if (qcmp(mid, j) <= 0) + { + j -= qsz; + continue; + } + tmp = i + qsz; /* value of i after swap */ + if (i == mid) + { + /* j <-> mid, new mid is j */ + mid = jj = j; + } + else + { + /* i <-> j */ + jj = j; + j -= qsz; + } + goto swap; + } + if (i == mid) + { + break; + } + else + { + /* i <-> mid, new mid is i */ + jj = mid; + tmp = mid = i; /* value of i after swap */ + j -= qsz; + } + swap: + ii = qsz; + do { + c = *i; + *i++ = *jj; + *jj++ = c; + } while (--ii); + i = tmp; + } + /* + * Look at sizes of the two partitions, do the smaller + * one first by recursion, then do the larger one by + * making sure lo is its size, base and max are update + * correctly, and branching back. But only repeat + * (recursively or by branching) if the partition is + * of at least size THRESH. + */ + i = (j = mid) + qsz; + if ((lo = j - base) <= (hi = max - i)) + { + if (lo >= thresh) + qst(base, j); + base = i; + lo = hi; + } + else + { + if (hi >= thresh) + qst(i, max); + max = j; + } + } while (lo >= thresh); +} + +/* + * qsort: + * First, set up some global parameters for qst to share. Then, quicksort + * with qst(), and then a cleanup insertion sort ourselves. Sound simple? + * It's not... + */ + +void +qsort(void *base0, size_t n, size_t size, int (*compar)(const void *, const void *)) +{ + char *base = (char *)base0; + char c, *i, *j, *lo, *hi; + char *min, *max; + + if (n <= 1) + return; + qsz = size; + qcmp = compar; + thresh = qsz * THRESH; + mthresh = qsz * MTHRESH; + max = base + n * qsz; + if (n >= THRESH) + { + qst(base, max); + hi = base + thresh; + } + else + { + hi = max; + } + /* + * First put smallest element, which must be in the first THRESH, in + * the first position as a sentinel. This is done just by searching + * the first THRESH elements (or the first n if n < THRESH), finding + * the min, and swapping it into the first position. + */ + for (j = lo = base; (lo += qsz) < hi; ) + if (qcmp(j, lo) > 0) + j = lo; + if (j != base) + { + /* swap j into place */ + for (i = base, hi = base + qsz; i < hi; ) + { + c = *j; + *j++ = *i; + *i++ = c; + } + } + /* + * With our sentinel in place, we now run the following hyper-fast + * insertion sort. For each remaining element, min, from [1] to [n-1], + * set hi to the index of the element AFTER which this one goes. + * Then, do the standard insertion sort shift on a character at a time + * basis for each element in the frob. + */ + for (min = base; (hi = min += qsz) < max; ) + { + while (qcmp(hi -= qsz, min) > 0) + /* void */; + if ((hi += qsz) != min) { + for (lo = min + qsz; --lo >= min; ) + { + c = *lo; + for (i = j = lo; (j -= qsz) >= hi; i = j) + *i = *j; + *i = c; + } + } + } +} diff --git a/programs/develop/ktcc/trunk/libc.obj/source/symbols.txt b/programs/develop/ktcc/trunk/libc.obj/source/symbols.txt index 456a47f61a..9b3505dde7 100644 --- a/programs/develop/ktcc/trunk/libc.obj/source/symbols.txt +++ b/programs/develop/ktcc/trunk/libc.obj/source/symbols.txt @@ -60,6 +60,8 @@ realloc strtol srand rand +qsort +__assert_fail !____STRING____ !memcpy memchr @@ -169,4 +171,4 @@ mktime time localtime asctime -difftime \ No newline at end of file +difftime diff --git a/programs/develop/ktcc/trunk/libc/stdlib/assert.c b/programs/develop/ktcc/trunk/libc/stdlib/assert.c index cd13544f7e..b5d6ca901c 100644 --- a/programs/develop/ktcc/trunk/libc/stdlib/assert.c +++ b/programs/develop/ktcc/trunk/libc/stdlib/assert.c @@ -1,21 +1,7 @@ -#include -#include -#include -#include - - -void __assert_func (char *file, int line, char *ass) -{ - char buf[100]; - - snprintf(buf,100,"Assertion failed: %s, file %s, line %d\n", ass, file, line); - debug_out_str(buf); - exit(-1); -} - -void __trace_func (char *file, int line, char *msg) -{ - char buf[100]; - snprintf(buf,100,"Trace: %s, file %s, line %d\n", msg, file, line); - debug_out_str(buf); -} +#include +#include + +void __assert_fail(const char *expr, const char *file, int line, const char *func){ + fprintf(stderr, "Assertion failed: %s (%s: %s: %d)\n", expr, file, func, line); + abort(); +}