apprentice.c 81 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758
  1. /*
  2. * Copyright (c) Ian F. Darwin 1986-1995.
  3. * Software written by Ian F. Darwin and others;
  4. * maintained 1995-present by Christos Zoulas and others.
  5. *
  6. * Redistribution and use in source and binary forms, with or without
  7. * modification, are permitted provided that the following conditions
  8. * are met:
  9. * 1. Redistributions of source code must retain the above copyright
  10. * notice immediately at the beginning of the file, without modification,
  11. * this list of conditions, and the following disclaimer.
  12. * 2. Redistributions in binary form must reproduce the above copyright
  13. * notice, this list of conditions and the following disclaimer in the
  14. * documentation and/or other materials provided with the distribution.
  15. *
  16. * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
  17. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  18. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  19. * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
  20. * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  21. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  22. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  23. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  24. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  25. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  26. * SUCH DAMAGE.
  27. */
  28. /*
  29. * apprentice - make one pass through /etc/magic, learning its secrets.
  30. */
  31. #include "file.h"
  32. #ifndef lint
  33. FILE_RCSID("@(#)$File: apprentice.c,v 1.356 2024/11/27 15:37:00 christos Exp $")
  34. #endif /* lint */
  35. #include "magic.h"
  36. #include <stdlib.h>
  37. #ifdef HAVE_UNISTD_H
  38. #include <unistd.h>
  39. #endif
  40. #include <stddef.h>
  41. #include <string.h>
  42. #include <assert.h>
  43. #include <ctype.h>
  44. #include <fcntl.h>
  45. #ifdef QUICK
  46. #include <sys/mman.h>
  47. #endif
  48. #include <dirent.h>
  49. #include <limits.h>
  50. #ifdef HAVE_BYTESWAP_H
  51. #include <byteswap.h>
  52. #endif
  53. #ifdef HAVE_SYS_BSWAP_H
  54. #include <sys/bswap.h>
  55. #endif
  56. #define EATAB {while (isascii(CAST(unsigned char, *l)) && \
  57. isspace(CAST(unsigned char, *l))) ++l;}
  58. #define LOWCASE(l) (isupper(CAST(unsigned char, l)) ? \
  59. tolower(CAST(unsigned char, l)) : (l))
  60. /*
  61. * Work around a bug in headers on Digital Unix.
  62. * At least confirmed for: OSF1 V4.0 878
  63. */
  64. #if defined(__osf__) && defined(__DECC)
  65. #ifdef MAP_FAILED
  66. #undef MAP_FAILED
  67. #endif
  68. #endif
  69. #ifndef MAP_FAILED
  70. #define MAP_FAILED (void *) -1
  71. #endif
  72. #ifndef MAP_FILE
  73. #define MAP_FILE 0
  74. #endif
  75. #define ALLOC_CHUNK CAST(size_t, 10)
  76. #define ALLOC_INCR CAST(size_t, 200)
  77. #define MAP_TYPE_USER 0
  78. #define MAP_TYPE_MALLOC 1
  79. #define MAP_TYPE_MMAP 2
  80. struct magic_entry {
  81. struct magic *mp;
  82. uint32_t cont_count;
  83. uint32_t max_count;
  84. };
  85. struct magic_entry_set {
  86. struct magic_entry *me;
  87. uint32_t count;
  88. uint32_t max;
  89. };
  90. struct magic_map {
  91. void *p;
  92. size_t len;
  93. int type;
  94. struct magic *magic[MAGIC_SETS];
  95. uint32_t nmagic[MAGIC_SETS];
  96. };
  97. file_private int file_formats[FILE_NAMES_SIZE];
  98. file_private const size_t file_nformats = FILE_NAMES_SIZE;
  99. file_protected const char *file_names[FILE_NAMES_SIZE];
  100. file_protected const size_t file_nnames = FILE_NAMES_SIZE;
  101. file_private int getvalue(struct magic_set *ms, struct magic *, const char **, int);
  102. file_private int hextoint(int);
  103. file_private const char *getstr(struct magic_set *, struct magic *, const char *,
  104. int);
  105. file_private int parse(struct magic_set *, struct magic_entry *, const char *,
  106. const char *, size_t, int);
  107. file_private void eatsize(const char **);
  108. file_private int apprentice_1(struct magic_set *, const char *, int);
  109. file_private ssize_t apprentice_magic_strength_1(const struct magic *);
  110. file_private int apprentice_sort(const void *, const void *);
  111. file_private void apprentice_list(struct mlist *, int );
  112. file_private struct magic_map *apprentice_load(struct magic_set *,
  113. const char *, int);
  114. file_private struct mlist *mlist_alloc(void);
  115. file_private void mlist_free_all(struct magic_set *);
  116. file_private void mlist_free(struct mlist *);
  117. file_private void byteswap(struct magic *, uint32_t);
  118. file_private void bs1(struct magic *);
  119. #if defined(HAVE_BYTESWAP_H)
  120. #define swap2(x) bswap_16(x)
  121. #define swap4(x) bswap_32(x)
  122. #define swap8(x) bswap_64(x)
  123. #elif defined(HAVE_SYS_BSWAP_H)
  124. #define swap2(x) bswap16(x)
  125. #define swap4(x) bswap32(x)
  126. #define swap8(x) bswap64(x)
  127. #else
  128. file_private uint16_t swap2(uint16_t);
  129. file_private uint32_t swap4(uint32_t);
  130. file_private uint64_t swap8(uint64_t);
  131. #endif
  132. file_private char *mkdbname(struct magic_set *, const char *, int);
  133. file_private struct magic_map *apprentice_buf(struct magic_set *, struct magic *,
  134. size_t);
  135. file_private struct magic_map *apprentice_map(struct magic_set *, const char *);
  136. file_private int check_buffer(struct magic_set *, struct magic_map *, const char *);
  137. file_private void apprentice_unmap(struct magic_map *);
  138. file_private int apprentice_compile(struct magic_set *, struct magic_map *,
  139. const char *);
  140. file_private int check_format_type(const char *, int, const char **);
  141. file_private int check_format(struct magic_set *, struct magic *);
  142. file_private int get_op(char);
  143. file_private int parse_mime(struct magic_set *, struct magic_entry *, const char *,
  144. size_t);
  145. file_private int parse_strength(struct magic_set *, struct magic_entry *,
  146. const char *, size_t);
  147. file_private int parse_apple(struct magic_set *, struct magic_entry *, const char *,
  148. size_t);
  149. file_private int parse_ext(struct magic_set *, struct magic_entry *, const char *,
  150. size_t);
  151. file_private size_t magicsize = sizeof(struct magic);
  152. file_private const char usg_hdr[] = "cont\toffset\ttype\topcode\tmask\tvalue\tdesc";
  153. file_private struct {
  154. const char *name;
  155. size_t len;
  156. int (*fun)(struct magic_set *, struct magic_entry *, const char *,
  157. size_t);
  158. } bang[] = {
  159. #define DECLARE_FIELD(name) { # name, sizeof(# name) - 1, parse_ ## name }
  160. DECLARE_FIELD(mime),
  161. DECLARE_FIELD(apple),
  162. DECLARE_FIELD(ext),
  163. DECLARE_FIELD(strength),
  164. #undef DECLARE_FIELD
  165. { NULL, 0, NULL }
  166. };
  167. #ifdef COMPILE_ONLY
  168. int main(int, char *[]);
  169. int
  170. main(int argc, char *argv[])
  171. {
  172. int ret;
  173. struct magic_set *ms;
  174. char *progname;
  175. if ((progname = strrchr(argv[0], '/')) != NULL)
  176. progname++;
  177. else
  178. progname = argv[0];
  179. if (argc != 2) {
  180. (void)fprintf(stderr, "Usage: %s file\n", progname);
  181. return 1;
  182. }
  183. if ((ms = magic_open(MAGIC_CHECK)) == NULL) {
  184. (void)fprintf(stderr, "%s: %s\n", progname, strerror(errno));
  185. return 1;
  186. }
  187. ret = magic_compile(ms, argv[1]) == -1 ? 1 : 0;
  188. if (ret == 1)
  189. (void)fprintf(stderr, "%s: %s\n", progname, magic_error(ms));
  190. magic_close(ms);
  191. return ret;
  192. }
  193. #endif /* COMPILE_ONLY */
  194. struct type_tbl_s {
  195. const char name[16];
  196. const size_t len;
  197. const int type;
  198. const int format;
  199. };
  200. /*
  201. * XXX - the actual Single UNIX Specification says that "long" means "long",
  202. * as in the C data type, but we treat it as meaning "4-byte integer".
  203. * Given that the OS X version of file 5.04 did the same, I guess that passes
  204. * the actual test; having "long" be dependent on how big a "long" is on
  205. * the machine running "file" is silly.
  206. */
  207. static const struct type_tbl_s type_tbl[] = {
  208. # define XX(s) s, (sizeof(s) - 1)
  209. # define XX_NULL "", 0
  210. { XX("invalid"), FILE_INVALID, FILE_FMT_NONE },
  211. { XX("byte"), FILE_BYTE, FILE_FMT_NUM },
  212. { XX("short"), FILE_SHORT, FILE_FMT_NUM },
  213. { XX("default"), FILE_DEFAULT, FILE_FMT_NONE },
  214. { XX("long"), FILE_LONG, FILE_FMT_NUM },
  215. { XX("string"), FILE_STRING, FILE_FMT_STR },
  216. { XX("date"), FILE_DATE, FILE_FMT_STR },
  217. { XX("beshort"), FILE_BESHORT, FILE_FMT_NUM },
  218. { XX("belong"), FILE_BELONG, FILE_FMT_NUM },
  219. { XX("bedate"), FILE_BEDATE, FILE_FMT_STR },
  220. { XX("leshort"), FILE_LESHORT, FILE_FMT_NUM },
  221. { XX("lelong"), FILE_LELONG, FILE_FMT_NUM },
  222. { XX("ledate"), FILE_LEDATE, FILE_FMT_STR },
  223. { XX("pstring"), FILE_PSTRING, FILE_FMT_STR },
  224. { XX("ldate"), FILE_LDATE, FILE_FMT_STR },
  225. { XX("beldate"), FILE_BELDATE, FILE_FMT_STR },
  226. { XX("leldate"), FILE_LELDATE, FILE_FMT_STR },
  227. { XX("regex"), FILE_REGEX, FILE_FMT_STR },
  228. { XX("bestring16"), FILE_BESTRING16, FILE_FMT_STR },
  229. { XX("lestring16"), FILE_LESTRING16, FILE_FMT_STR },
  230. { XX("search"), FILE_SEARCH, FILE_FMT_STR },
  231. { XX("medate"), FILE_MEDATE, FILE_FMT_STR },
  232. { XX("meldate"), FILE_MELDATE, FILE_FMT_STR },
  233. { XX("melong"), FILE_MELONG, FILE_FMT_NUM },
  234. { XX("quad"), FILE_QUAD, FILE_FMT_QUAD },
  235. { XX("lequad"), FILE_LEQUAD, FILE_FMT_QUAD },
  236. { XX("bequad"), FILE_BEQUAD, FILE_FMT_QUAD },
  237. { XX("qdate"), FILE_QDATE, FILE_FMT_STR },
  238. { XX("leqdate"), FILE_LEQDATE, FILE_FMT_STR },
  239. { XX("beqdate"), FILE_BEQDATE, FILE_FMT_STR },
  240. { XX("qldate"), FILE_QLDATE, FILE_FMT_STR },
  241. { XX("leqldate"), FILE_LEQLDATE, FILE_FMT_STR },
  242. { XX("beqldate"), FILE_BEQLDATE, FILE_FMT_STR },
  243. { XX("float"), FILE_FLOAT, FILE_FMT_FLOAT },
  244. { XX("befloat"), FILE_BEFLOAT, FILE_FMT_FLOAT },
  245. { XX("lefloat"), FILE_LEFLOAT, FILE_FMT_FLOAT },
  246. { XX("double"), FILE_DOUBLE, FILE_FMT_DOUBLE },
  247. { XX("bedouble"), FILE_BEDOUBLE, FILE_FMT_DOUBLE },
  248. { XX("ledouble"), FILE_LEDOUBLE, FILE_FMT_DOUBLE },
  249. { XX("leid3"), FILE_LEID3, FILE_FMT_NUM },
  250. { XX("beid3"), FILE_BEID3, FILE_FMT_NUM },
  251. { XX("indirect"), FILE_INDIRECT, FILE_FMT_NUM },
  252. { XX("qwdate"), FILE_QWDATE, FILE_FMT_STR },
  253. { XX("leqwdate"), FILE_LEQWDATE, FILE_FMT_STR },
  254. { XX("beqwdate"), FILE_BEQWDATE, FILE_FMT_STR },
  255. { XX("name"), FILE_NAME, FILE_FMT_NONE },
  256. { XX("use"), FILE_USE, FILE_FMT_NONE },
  257. { XX("clear"), FILE_CLEAR, FILE_FMT_NONE },
  258. { XX("der"), FILE_DER, FILE_FMT_STR },
  259. { XX("guid"), FILE_GUID, FILE_FMT_STR },
  260. { XX("offset"), FILE_OFFSET, FILE_FMT_QUAD },
  261. { XX("bevarint"), FILE_BEVARINT, FILE_FMT_STR },
  262. { XX("levarint"), FILE_LEVARINT, FILE_FMT_STR },
  263. { XX("msdosdate"), FILE_MSDOSDATE, FILE_FMT_STR },
  264. { XX("lemsdosdate"), FILE_LEMSDOSDATE, FILE_FMT_STR },
  265. { XX("bemsdosdate"), FILE_BEMSDOSDATE, FILE_FMT_STR },
  266. { XX("msdostime"), FILE_MSDOSTIME, FILE_FMT_STR },
  267. { XX("lemsdostime"), FILE_LEMSDOSTIME, FILE_FMT_STR },
  268. { XX("bemsdostime"), FILE_BEMSDOSTIME, FILE_FMT_STR },
  269. { XX("octal"), FILE_OCTAL, FILE_FMT_STR },
  270. { XX_NULL, FILE_INVALID, FILE_FMT_NONE },
  271. };
  272. /*
  273. * These are not types, and cannot be preceded by "u" to make them
  274. * unsigned.
  275. */
  276. static const struct type_tbl_s special_tbl[] = {
  277. { XX("der"), FILE_DER, FILE_FMT_STR },
  278. { XX("name"), FILE_NAME, FILE_FMT_STR },
  279. { XX("use"), FILE_USE, FILE_FMT_STR },
  280. { XX("octal"), FILE_OCTAL, FILE_FMT_STR },
  281. { XX_NULL, FILE_INVALID, FILE_FMT_NONE },
  282. };
  283. # undef XX
  284. # undef XX_NULL
  285. file_private int
  286. get_type(const struct type_tbl_s *tbl, const char *l, const char **t)
  287. {
  288. const struct type_tbl_s *p;
  289. for (p = tbl; p->len; p++) {
  290. if (strncmp(l, p->name, p->len) == 0) {
  291. if (t)
  292. *t = l + p->len;
  293. break;
  294. }
  295. }
  296. return p->type;
  297. }
  298. file_private off_t
  299. maxoff_t(void) {
  300. if (/*CONSTCOND*/sizeof(off_t) == sizeof(int))
  301. return CAST(off_t, INT_MAX);
  302. if (/*CONSTCOND*/sizeof(off_t) == sizeof(long))
  303. return CAST(off_t, LONG_MAX);
  304. return 0x7fffffff;
  305. }
  306. file_private int
  307. get_standard_integer_type(const char *l, const char **t)
  308. {
  309. int type;
  310. if (isalpha(CAST(unsigned char, l[1]))) {
  311. switch (l[1]) {
  312. case 'C':
  313. /* "dC" and "uC" */
  314. type = FILE_BYTE;
  315. break;
  316. case 'S':
  317. /* "dS" and "uS" */
  318. type = FILE_SHORT;
  319. break;
  320. case 'I':
  321. case 'L':
  322. /*
  323. * "dI", "dL", "uI", and "uL".
  324. *
  325. * XXX - the actual Single UNIX Specification says
  326. * that "L" means "long", as in the C data type,
  327. * but we treat it as meaning "4-byte integer".
  328. * Given that the OS X version of file 5.04 did
  329. * the same, I guess that passes the actual SUS
  330. * validation suite; having "dL" be dependent on
  331. * how big a "long" is on the machine running
  332. * "file" is silly.
  333. */
  334. type = FILE_LONG;
  335. break;
  336. case 'Q':
  337. /* "dQ" and "uQ" */
  338. type = FILE_QUAD;
  339. break;
  340. default:
  341. /* "d{anything else}", "u{anything else}" */
  342. return FILE_INVALID;
  343. }
  344. l += 2;
  345. } else if (isdigit(CAST(unsigned char, l[1]))) {
  346. /*
  347. * "d{num}" and "u{num}"; we only support {num} values
  348. * of 1, 2, 4, and 8 - the Single UNIX Specification
  349. * doesn't say anything about whether arbitrary
  350. * values should be supported, but both the Solaris 10
  351. * and OS X Mountain Lion versions of file passed the
  352. * Single UNIX Specification validation suite, and
  353. * neither of them support values bigger than 8 or
  354. * non-power-of-2 values.
  355. */
  356. if (isdigit(CAST(unsigned char, l[2]))) {
  357. /* Multi-digit, so > 9 */
  358. return FILE_INVALID;
  359. }
  360. switch (l[1]) {
  361. case '1':
  362. type = FILE_BYTE;
  363. break;
  364. case '2':
  365. type = FILE_SHORT;
  366. break;
  367. case '4':
  368. type = FILE_LONG;
  369. break;
  370. case '8':
  371. type = FILE_QUAD;
  372. break;
  373. default:
  374. /* XXX - what about 3, 5, 6, or 7? */
  375. return FILE_INVALID;
  376. }
  377. l += 2;
  378. } else {
  379. /*
  380. * "d" or "u" by itself.
  381. */
  382. type = FILE_LONG;
  383. ++l;
  384. }
  385. if (t)
  386. *t = l;
  387. return type;
  388. }
  389. file_private void
  390. init_file_tables(void)
  391. {
  392. static int done = 0;
  393. const struct type_tbl_s *p;
  394. if (done)
  395. return;
  396. done++;
  397. for (p = type_tbl; p->len; p++) {
  398. assert(p->type < FILE_NAMES_SIZE);
  399. file_names[p->type] = p->name;
  400. file_formats[p->type] = p->format;
  401. }
  402. assert(p - type_tbl == FILE_NAMES_SIZE);
  403. }
  404. file_private int
  405. add_mlist(struct mlist *mlp, struct magic_map *map, size_t idx)
  406. {
  407. struct mlist *ml;
  408. mlp->map = NULL;
  409. if ((ml = CAST(struct mlist *, malloc(sizeof(*ml)))) == NULL)
  410. return -1;
  411. ml->map = idx == 0 ? map : NULL;
  412. ml->magic = map->magic[idx];
  413. ml->nmagic = map->nmagic[idx];
  414. if (ml->nmagic) {
  415. ml->magic_rxcomp = CAST(file_regex_t **,
  416. calloc(ml->nmagic, sizeof(*ml->magic_rxcomp)));
  417. if (ml->magic_rxcomp == NULL) {
  418. free(ml);
  419. return -1;
  420. }
  421. } else
  422. ml->magic_rxcomp = NULL;
  423. mlp->prev->next = ml;
  424. ml->prev = mlp->prev;
  425. ml->next = mlp;
  426. mlp->prev = ml;
  427. return 0;
  428. }
  429. /*
  430. * Handle one file or directory.
  431. */
  432. file_private int
  433. apprentice_1(struct magic_set *ms, const char *fn, int action)
  434. {
  435. struct magic_map *map;
  436. #ifndef COMPILE_ONLY
  437. size_t i;
  438. #endif
  439. if (magicsize != FILE_MAGICSIZE) {
  440. file_error(ms, 0, "magic element size %lu != %lu",
  441. CAST(unsigned long, sizeof(*map->magic[0])),
  442. CAST(unsigned long, FILE_MAGICSIZE));
  443. return -1;
  444. }
  445. if (action == FILE_COMPILE) {
  446. map = apprentice_load(ms, fn, action);
  447. if (map == NULL)
  448. return -1;
  449. return apprentice_compile(ms, map, fn);
  450. }
  451. #ifndef COMPILE_ONLY
  452. map = apprentice_map(ms, fn);
  453. if (map == NULL) {
  454. if (ms->flags & MAGIC_CHECK)
  455. file_magwarn(ms, "using regular magic file `%s'", fn);
  456. map = apprentice_load(ms, fn, action);
  457. if (map == NULL)
  458. return -1;
  459. }
  460. for (i = 0; i < MAGIC_SETS; i++) {
  461. if (add_mlist(ms->mlist[i], map, i) == -1) {
  462. /* failed to add to any list, free explicitly */
  463. if (i == 0)
  464. apprentice_unmap(map);
  465. else
  466. mlist_free_all(ms);
  467. file_oomem(ms, sizeof(*ms->mlist[0]));
  468. return -1;
  469. }
  470. }
  471. if (action == FILE_LIST) {
  472. for (i = 0; i < MAGIC_SETS; i++) {
  473. printf("Set %" SIZE_T_FORMAT "u:\nBinary patterns:\n",
  474. i);
  475. apprentice_list(ms->mlist[i], BINTEST);
  476. printf("Text patterns:\n");
  477. apprentice_list(ms->mlist[i], TEXTTEST);
  478. }
  479. }
  480. return 0;
  481. #else
  482. return 0;
  483. #endif /* COMPILE_ONLY */
  484. }
  485. file_protected void
  486. file_ms_free(struct magic_set *ms)
  487. {
  488. size_t i;
  489. if (ms == NULL)
  490. return;
  491. for (i = 0; i < MAGIC_SETS; i++)
  492. mlist_free(ms->mlist[i]);
  493. free(ms->o.pbuf);
  494. free(ms->o.buf);
  495. free(ms->c.li);
  496. free(ms->fnamebuf);
  497. #ifdef USE_C_LOCALE
  498. freelocale(ms->c_lc_ctype);
  499. #endif
  500. free(ms);
  501. }
  502. file_protected struct magic_set *
  503. file_ms_alloc(int flags)
  504. {
  505. struct magic_set *ms;
  506. size_t i, len;
  507. if ((ms = CAST(struct magic_set *, calloc(CAST(size_t, 1u),
  508. sizeof(*ms)))) == NULL)
  509. return NULL;
  510. if (magic_setflags(ms, flags) == -1) {
  511. errno = EINVAL;
  512. goto free;
  513. }
  514. ms->o.buf = ms->o.pbuf = NULL;
  515. ms->o.blen = 0;
  516. len = (ms->c.len = 10) * sizeof(*ms->c.li);
  517. if ((ms->c.li = CAST(struct level_info *, malloc(len))) == NULL)
  518. goto free;
  519. ms->event_flags = 0;
  520. ms->error = -1;
  521. for (i = 0; i < MAGIC_SETS; i++)
  522. ms->mlist[i] = NULL;
  523. ms->fnamebuf = NULL;
  524. ms->file = "unknown";
  525. ms->line = 0;
  526. ms->magwarn = 0;
  527. ms->indir_max = FILE_INDIR_MAX;
  528. ms->name_max = FILE_NAME_MAX;
  529. ms->elf_shnum_max = FILE_ELF_SHNUM_MAX;
  530. ms->elf_shsize_max = FILE_ELF_SHSIZE_MAX;
  531. ms->elf_phnum_max = FILE_ELF_PHNUM_MAX;
  532. ms->elf_notes_max = FILE_ELF_NOTES_MAX;
  533. ms->regex_max = FILE_REGEX_MAX;
  534. ms->bytes_max = FILE_BYTES_MAX;
  535. ms->encoding_max = FILE_ENCODING_MAX;
  536. ms->magwarn_max = FILE_MAGWARN_MAX;
  537. #ifdef USE_C_LOCALE
  538. ms->c_lc_ctype = newlocale(LC_CTYPE_MASK, "C", 0);
  539. assert(ms->c_lc_ctype != NULL);
  540. #endif
  541. return ms;
  542. free:
  543. free(ms);
  544. return NULL;
  545. }
  546. file_private void
  547. apprentice_unmap(struct magic_map *map)
  548. {
  549. size_t i;
  550. char *p;
  551. if (map == NULL)
  552. return;
  553. switch (map->type) {
  554. case MAP_TYPE_USER:
  555. break;
  556. case MAP_TYPE_MALLOC:
  557. p = CAST(char *, map->p);
  558. for (i = 0; i < MAGIC_SETS; i++) {
  559. char *b = RCAST(char *, map->magic[i]);
  560. if (p != NULL && b >= p && b <= p + map->len)
  561. continue;
  562. free(b);
  563. }
  564. free(p);
  565. break;
  566. #ifdef QUICK
  567. case MAP_TYPE_MMAP:
  568. if (map->p && map->p != MAP_FAILED)
  569. (void)munmap(map->p, map->len);
  570. break;
  571. #endif
  572. default:
  573. fprintf(stderr, "Bad map type %d", map->type);
  574. abort();
  575. }
  576. free(map);
  577. }
  578. file_private struct mlist *
  579. mlist_alloc(void)
  580. {
  581. struct mlist *mlist;
  582. if ((mlist = CAST(struct mlist *, calloc(1, sizeof(*mlist)))) == NULL) {
  583. return NULL;
  584. }
  585. mlist->next = mlist->prev = mlist;
  586. return mlist;
  587. }
  588. file_private void
  589. mlist_free_all(struct magic_set *ms)
  590. {
  591. size_t i;
  592. for (i = 0; i < MAGIC_SETS; i++) {
  593. mlist_free(ms->mlist[i]);
  594. ms->mlist[i] = NULL;
  595. }
  596. }
  597. file_private void
  598. mlist_free_one(struct mlist *ml)
  599. {
  600. size_t i;
  601. if (ml->map)
  602. apprentice_unmap(CAST(struct magic_map *, ml->map));
  603. for (i = 0; i < ml->nmagic; ++i) {
  604. if (ml->magic_rxcomp[i]) {
  605. file_regfree(ml->magic_rxcomp[i]);
  606. free(ml->magic_rxcomp[i]);
  607. ml->magic_rxcomp[i] = NULL;
  608. }
  609. }
  610. free(ml->magic_rxcomp);
  611. ml->magic_rxcomp = NULL;
  612. free(ml);
  613. }
  614. file_private void
  615. mlist_free(struct mlist *mlist)
  616. {
  617. struct mlist *ml, *next;
  618. if (mlist == NULL)
  619. return;
  620. for (ml = mlist->next; ml != mlist;) {
  621. next = ml->next;
  622. mlist_free_one(ml);
  623. ml = next;
  624. }
  625. mlist_free_one(mlist);
  626. }
  627. #ifndef COMPILE_ONLY
  628. /* void **bufs: an array of compiled magic files */
  629. file_protected int
  630. buffer_apprentice(struct magic_set *ms, struct magic **bufs,
  631. size_t *sizes, size_t nbufs)
  632. {
  633. size_t i, j;
  634. struct magic_map *map;
  635. if (nbufs == 0)
  636. return -1;
  637. (void)file_reset(ms, 0);
  638. init_file_tables();
  639. for (i = 0; i < MAGIC_SETS; i++) {
  640. mlist_free(ms->mlist[i]);
  641. if ((ms->mlist[i] = mlist_alloc()) == NULL) {
  642. file_oomem(ms, sizeof(*ms->mlist[0]));
  643. goto fail;
  644. }
  645. }
  646. for (i = 0; i < nbufs; i++) {
  647. map = apprentice_buf(ms, bufs[i], sizes[i]);
  648. if (map == NULL)
  649. goto fail;
  650. for (j = 0; j < MAGIC_SETS; j++) {
  651. if (add_mlist(ms->mlist[j], map, j) == -1) {
  652. file_oomem(ms, sizeof(*ms->mlist[0]));
  653. goto fail;
  654. }
  655. }
  656. }
  657. return 0;
  658. fail:
  659. mlist_free_all(ms);
  660. return -1;
  661. }
  662. #endif
  663. /* const char *fn: list of magic files and directories */
  664. file_protected int
  665. file_apprentice(struct magic_set *ms, const char *fn, int action)
  666. {
  667. char *p;
  668. int fileerr, errs = -1;
  669. size_t i, j;
  670. (void)file_reset(ms, 0);
  671. if ((fn = magic_getpath(fn, action)) == NULL)
  672. return -1;
  673. init_file_tables();
  674. free(ms->fnamebuf);
  675. if ((ms->fnamebuf = strdup(fn)) == NULL) {
  676. file_oomem(ms, strlen(fn));
  677. return -1;
  678. }
  679. for (i = 0; i < MAGIC_SETS; i++) {
  680. mlist_free(ms->mlist[i]);
  681. if ((ms->mlist[i] = mlist_alloc()) == NULL) {
  682. file_oomem(ms, sizeof(*ms->mlist[0]));
  683. for (j = 0; j < i; j++) {
  684. mlist_free(ms->mlist[j]);
  685. ms->mlist[j] = NULL;
  686. }
  687. return -1;
  688. }
  689. }
  690. fn = ms->fnamebuf;
  691. while (fn) {
  692. p = CCAST(char *, strchr(fn, PATHSEP));
  693. if (p)
  694. *p++ = '\0';
  695. if (*fn == '\0')
  696. break;
  697. fileerr = apprentice_1(ms, fn, action);
  698. errs = MAX(errs, fileerr);
  699. fn = p;
  700. }
  701. if (errs == -1) {
  702. for (i = 0; i < MAGIC_SETS; i++) {
  703. mlist_free(ms->mlist[i]);
  704. ms->mlist[i] = NULL;
  705. }
  706. file_error(ms, 0, "could not find any valid magic files!");
  707. return -1;
  708. }
  709. #if 0
  710. /*
  711. * Always leave the database loaded
  712. */
  713. if (action == FILE_LOAD)
  714. return 0;
  715. for (i = 0; i < MAGIC_SETS; i++) {
  716. mlist_free(ms->mlist[i]);
  717. ms->mlist[i] = NULL;
  718. }
  719. #endif
  720. switch (action) {
  721. case FILE_LOAD:
  722. case FILE_COMPILE:
  723. case FILE_CHECK:
  724. case FILE_LIST:
  725. return 0;
  726. default:
  727. file_error(ms, 0, "Invalid action %d", action);
  728. return -1;
  729. }
  730. }
  731. /*
  732. * Compute the real length of a magic expression, for the purposes
  733. * of determining how "strong" a magic expression is (approximating
  734. * how specific its matches are):
  735. * - magic characters count 0 unless escaped.
  736. * - [] expressions count 1
  737. * - {} expressions count 0
  738. * - regular characters or escaped magic characters count 1
  739. * - 0 length expressions count as one
  740. */
  741. file_private size_t
  742. nonmagic(const char *str)
  743. {
  744. const char *p;
  745. size_t rv = 0;
  746. for (p = str; *p; p++)
  747. switch (*p) {
  748. case '\\': /* Escaped anything counts 1 */
  749. if (!*++p)
  750. p--;
  751. rv++;
  752. continue;
  753. case '?': /* Magic characters count 0 */
  754. case '*':
  755. case '.':
  756. case '+':
  757. case '^':
  758. case '$':
  759. continue;
  760. case '[': /* Bracketed expressions count 1 the ']' */
  761. while (*p && *p != ']')
  762. p++;
  763. p--;
  764. continue;
  765. case '{': /* Braced expressions count 0 */
  766. while (*p && *p != '}')
  767. p++;
  768. if (!*p)
  769. p--;
  770. continue;
  771. default: /* Anything else counts 1 */
  772. rv++;
  773. continue;
  774. }
  775. return rv == 0 ? 1 : rv; /* Return at least 1 */
  776. }
  777. file_private size_t
  778. typesize(int type)
  779. {
  780. switch (type) {
  781. case FILE_BYTE:
  782. return 1;
  783. case FILE_SHORT:
  784. case FILE_LESHORT:
  785. case FILE_BESHORT:
  786. case FILE_MSDOSDATE:
  787. case FILE_BEMSDOSDATE:
  788. case FILE_LEMSDOSDATE:
  789. case FILE_MSDOSTIME:
  790. case FILE_BEMSDOSTIME:
  791. case FILE_LEMSDOSTIME:
  792. return 2;
  793. case FILE_LONG:
  794. case FILE_LELONG:
  795. case FILE_BELONG:
  796. case FILE_MELONG:
  797. return 4;
  798. case FILE_DATE:
  799. case FILE_LEDATE:
  800. case FILE_BEDATE:
  801. case FILE_MEDATE:
  802. case FILE_LDATE:
  803. case FILE_LELDATE:
  804. case FILE_BELDATE:
  805. case FILE_MELDATE:
  806. case FILE_FLOAT:
  807. case FILE_BEFLOAT:
  808. case FILE_LEFLOAT:
  809. case FILE_BEID3:
  810. case FILE_LEID3:
  811. return 4;
  812. case FILE_QUAD:
  813. case FILE_BEQUAD:
  814. case FILE_LEQUAD:
  815. case FILE_QDATE:
  816. case FILE_LEQDATE:
  817. case FILE_BEQDATE:
  818. case FILE_QLDATE:
  819. case FILE_LEQLDATE:
  820. case FILE_BEQLDATE:
  821. case FILE_QWDATE:
  822. case FILE_LEQWDATE:
  823. case FILE_BEQWDATE:
  824. case FILE_DOUBLE:
  825. case FILE_BEDOUBLE:
  826. case FILE_LEDOUBLE:
  827. case FILE_OFFSET:
  828. case FILE_BEVARINT:
  829. case FILE_LEVARINT:
  830. return 8;
  831. case FILE_GUID:
  832. return 16;
  833. default:
  834. return FILE_BADSIZE;
  835. }
  836. }
  837. /*
  838. * Get weight of this magic entry, for sorting purposes.
  839. */
  840. file_private ssize_t
  841. apprentice_magic_strength_1(const struct magic *m)
  842. {
  843. #define MULT 10U
  844. size_t ts, v;
  845. ssize_t val = 2 * MULT; /* baseline strength */
  846. switch (m->type) {
  847. case FILE_DEFAULT: /* make sure this sorts last */
  848. if (m->factor_op != FILE_FACTOR_OP_NONE) {
  849. file_magwarn1("Unsupported factor_op in default %d",
  850. m->factor_op);
  851. }
  852. return 0;
  853. case FILE_BYTE:
  854. case FILE_SHORT:
  855. case FILE_LESHORT:
  856. case FILE_BESHORT:
  857. case FILE_LONG:
  858. case FILE_LELONG:
  859. case FILE_BELONG:
  860. case FILE_MELONG:
  861. case FILE_DATE:
  862. case FILE_LEDATE:
  863. case FILE_BEDATE:
  864. case FILE_MEDATE:
  865. case FILE_LDATE:
  866. case FILE_LELDATE:
  867. case FILE_BELDATE:
  868. case FILE_MELDATE:
  869. case FILE_FLOAT:
  870. case FILE_BEFLOAT:
  871. case FILE_LEFLOAT:
  872. case FILE_QUAD:
  873. case FILE_BEQUAD:
  874. case FILE_LEQUAD:
  875. case FILE_QDATE:
  876. case FILE_LEQDATE:
  877. case FILE_BEQDATE:
  878. case FILE_QLDATE:
  879. case FILE_LEQLDATE:
  880. case FILE_BEQLDATE:
  881. case FILE_QWDATE:
  882. case FILE_LEQWDATE:
  883. case FILE_BEQWDATE:
  884. case FILE_DOUBLE:
  885. case FILE_BEDOUBLE:
  886. case FILE_LEDOUBLE:
  887. case FILE_BEVARINT:
  888. case FILE_LEVARINT:
  889. case FILE_GUID:
  890. case FILE_BEID3:
  891. case FILE_LEID3:
  892. case FILE_OFFSET:
  893. case FILE_MSDOSDATE:
  894. case FILE_BEMSDOSDATE:
  895. case FILE_LEMSDOSDATE:
  896. case FILE_MSDOSTIME:
  897. case FILE_BEMSDOSTIME:
  898. case FILE_LEMSDOSTIME:
  899. ts = typesize(m->type);
  900. if (ts == FILE_BADSIZE) {
  901. (void)fprintf(stderr, "Bad size for type %d\n",
  902. m->type);
  903. abort();
  904. }
  905. val += ts * MULT;
  906. break;
  907. case FILE_PSTRING:
  908. case FILE_STRING:
  909. case FILE_OCTAL:
  910. val += m->vallen * MULT;
  911. break;
  912. case FILE_BESTRING16:
  913. case FILE_LESTRING16:
  914. val += m->vallen * MULT / 2;
  915. break;
  916. case FILE_SEARCH:
  917. if (m->vallen == 0)
  918. break;
  919. val += m->vallen * MAX(MULT / m->vallen, 1);
  920. break;
  921. case FILE_REGEX:
  922. v = nonmagic(m->value.s);
  923. val += v * MAX(MULT / v, 1);
  924. break;
  925. case FILE_INDIRECT:
  926. case FILE_NAME:
  927. case FILE_USE:
  928. case FILE_CLEAR:
  929. break;
  930. case FILE_DER:
  931. val += MULT;
  932. break;
  933. default:
  934. (void)fprintf(stderr, "Bad type %d\n", m->type);
  935. abort();
  936. }
  937. switch (m->reln) {
  938. case 'x': /* matches anything penalize */
  939. case '!': /* matches almost anything penalize */
  940. val = 0;
  941. break;
  942. case '=': /* Exact match, prefer */
  943. val += MULT;
  944. break;
  945. case '>':
  946. case '<': /* comparison match reduce strength */
  947. val -= 2 * MULT;
  948. break;
  949. case '^':
  950. case '&': /* masking bits, we could count them too */
  951. val -= MULT;
  952. break;
  953. default:
  954. (void)fprintf(stderr, "Bad relation %c\n", m->reln);
  955. abort();
  956. }
  957. return val;
  958. }
  959. /*ARGSUSED*/
  960. file_protected size_t
  961. file_magic_strength(const struct magic *m,
  962. size_t nmagic __attribute__((__unused__)))
  963. {
  964. ssize_t val = apprentice_magic_strength_1(m);
  965. #ifdef notyet
  966. if (m->desc[0] == '\0') {
  967. size_t i;
  968. /*
  969. * Magic entries with no description get their continuations
  970. * added
  971. */
  972. for (i = 1; m[i].cont_level != 0 && i < MIN(nmagic, 3); i++) {
  973. ssize_t v = apprentice_magic_strength_1(&m[i]) >>
  974. (i + 1);
  975. val += v;
  976. if (m[i].desc[0] != '\0')
  977. break;
  978. }
  979. }
  980. #endif
  981. switch (m->factor_op) {
  982. case FILE_FACTOR_OP_NONE:
  983. break;
  984. case FILE_FACTOR_OP_PLUS:
  985. val += m->factor;
  986. break;
  987. case FILE_FACTOR_OP_MINUS:
  988. val -= m->factor;
  989. break;
  990. case FILE_FACTOR_OP_TIMES:
  991. val *= m->factor;
  992. break;
  993. case FILE_FACTOR_OP_DIV:
  994. val /= m->factor;
  995. break;
  996. default:
  997. (void)fprintf(stderr, "Bad factor_op %u\n", m->factor_op);
  998. abort();
  999. }
  1000. if (val <= 0) /* ensure we only return 0 for FILE_DEFAULT */
  1001. val = 1;
  1002. #ifndef notyet
  1003. /*
  1004. * Magic entries with no description get a bonus because they depend
  1005. * on subsequent magic entries to print something.
  1006. */
  1007. if (m->desc[0] == '\0')
  1008. val++;
  1009. #endif
  1010. return val;
  1011. }
  1012. /*
  1013. * Sort callback for sorting entries by "strength" (basically length)
  1014. */
  1015. file_private int
  1016. apprentice_sort(const void *a, const void *b)
  1017. {
  1018. const struct magic_entry *ma = CAST(const struct magic_entry *, a);
  1019. const struct magic_entry *mb = CAST(const struct magic_entry *, b);
  1020. size_t sa = file_magic_strength(ma->mp, ma->cont_count);
  1021. size_t sb = file_magic_strength(mb->mp, mb->cont_count);
  1022. if (sa == sb) {
  1023. struct magic mpa = *ma->mp;
  1024. struct magic mpb = *mb->mp;
  1025. mpa.lineno = mpb.lineno = 0;
  1026. int x = memcmp(&mpa, &mpb, sizeof(mpa));
  1027. if (x == 0) {
  1028. // Don't warn for DER
  1029. if (mpa.type == FILE_DER)
  1030. return 0;
  1031. file_magwarn1("Duplicate magic entry `%s'",
  1032. ma->mp->desc);
  1033. file_mdump(ma->mp);
  1034. file_mdump(mb->mp);
  1035. return 0;
  1036. }
  1037. return x > 0 ? -1 : 1;
  1038. }
  1039. return sa > sb ? -1 : 1;
  1040. }
  1041. /*
  1042. * Shows sorted patterns list in the order which is used for the matching
  1043. */
  1044. file_private void
  1045. apprentice_list(struct mlist *mlist, int mode)
  1046. {
  1047. uint32_t magindex, descindex, mimeindex, lineindex;
  1048. struct mlist *ml;
  1049. for (ml = mlist->next; ml != mlist; ml = ml->next) {
  1050. for (magindex = 0; magindex < ml->nmagic; magindex++) {
  1051. struct magic *m = &ml->magic[magindex];
  1052. if ((m->flag & mode) != mode) {
  1053. /* Skip sub-tests */
  1054. while (magindex + 1 < ml->nmagic &&
  1055. ml->magic[magindex + 1].cont_level != 0)
  1056. ++magindex;
  1057. continue; /* Skip to next top-level test*/
  1058. }
  1059. /*
  1060. * Try to iterate over the tree until we find item with
  1061. * description/mimetype.
  1062. */
  1063. lineindex = descindex = mimeindex = magindex;
  1064. for (; magindex + 1 < ml->nmagic &&
  1065. ml->magic[magindex + 1].cont_level != 0;
  1066. magindex++) {
  1067. uint32_t mi = magindex + 1;
  1068. if (*ml->magic[descindex].desc == '\0'
  1069. && *ml->magic[mi].desc)
  1070. descindex = mi;
  1071. if (*ml->magic[mimeindex].mimetype == '\0'
  1072. && *ml->magic[mi].mimetype)
  1073. mimeindex = mi;
  1074. }
  1075. printf("Strength = %3" SIZE_T_FORMAT "u@%u: %s [%s]\n",
  1076. file_magic_strength(m, ml->nmagic - magindex),
  1077. ml->magic[lineindex].lineno,
  1078. ml->magic[descindex].desc,
  1079. ml->magic[mimeindex].mimetype);
  1080. }
  1081. }
  1082. }
  1083. file_private void
  1084. set_test_type(struct magic *mstart, struct magic *m)
  1085. {
  1086. switch (m->type) {
  1087. case FILE_BYTE:
  1088. case FILE_SHORT:
  1089. case FILE_LONG:
  1090. case FILE_DATE:
  1091. case FILE_BESHORT:
  1092. case FILE_BELONG:
  1093. case FILE_BEDATE:
  1094. case FILE_LESHORT:
  1095. case FILE_LELONG:
  1096. case FILE_LEDATE:
  1097. case FILE_LDATE:
  1098. case FILE_BELDATE:
  1099. case FILE_LELDATE:
  1100. case FILE_MEDATE:
  1101. case FILE_MELDATE:
  1102. case FILE_MELONG:
  1103. case FILE_QUAD:
  1104. case FILE_LEQUAD:
  1105. case FILE_BEQUAD:
  1106. case FILE_QDATE:
  1107. case FILE_LEQDATE:
  1108. case FILE_BEQDATE:
  1109. case FILE_QLDATE:
  1110. case FILE_LEQLDATE:
  1111. case FILE_BEQLDATE:
  1112. case FILE_QWDATE:
  1113. case FILE_LEQWDATE:
  1114. case FILE_BEQWDATE:
  1115. case FILE_FLOAT:
  1116. case FILE_BEFLOAT:
  1117. case FILE_LEFLOAT:
  1118. case FILE_DOUBLE:
  1119. case FILE_BEDOUBLE:
  1120. case FILE_LEDOUBLE:
  1121. case FILE_BEVARINT:
  1122. case FILE_LEVARINT:
  1123. case FILE_DER:
  1124. case FILE_GUID:
  1125. case FILE_OFFSET:
  1126. case FILE_MSDOSDATE:
  1127. case FILE_BEMSDOSDATE:
  1128. case FILE_LEMSDOSDATE:
  1129. case FILE_MSDOSTIME:
  1130. case FILE_BEMSDOSTIME:
  1131. case FILE_LEMSDOSTIME:
  1132. case FILE_OCTAL:
  1133. mstart->flag |= BINTEST;
  1134. break;
  1135. case FILE_STRING:
  1136. case FILE_PSTRING:
  1137. case FILE_BESTRING16:
  1138. case FILE_LESTRING16:
  1139. /* Allow text overrides */
  1140. if (mstart->str_flags & STRING_TEXTTEST)
  1141. mstart->flag |= TEXTTEST;
  1142. else
  1143. mstart->flag |= BINTEST;
  1144. break;
  1145. case FILE_REGEX:
  1146. case FILE_SEARCH:
  1147. /* Check for override */
  1148. if (mstart->str_flags & STRING_BINTEST)
  1149. mstart->flag |= BINTEST;
  1150. if (mstart->str_flags & STRING_TEXTTEST)
  1151. mstart->flag |= TEXTTEST;
  1152. if (mstart->flag & (TEXTTEST|BINTEST))
  1153. break;
  1154. /* binary test if pattern is not text */
  1155. if (file_looks_utf8(m->value.us, CAST(size_t, m->vallen), NULL,
  1156. NULL) <= 0)
  1157. mstart->flag |= BINTEST;
  1158. else
  1159. mstart->flag |= TEXTTEST;
  1160. break;
  1161. case FILE_DEFAULT:
  1162. /* can't deduce anything; we shouldn't see this at the
  1163. top level anyway */
  1164. break;
  1165. case FILE_INVALID:
  1166. default:
  1167. /* invalid search type, but no need to complain here */
  1168. break;
  1169. }
  1170. }
  1171. file_private int
  1172. addentry(struct magic_set *ms, struct magic_entry *me,
  1173. struct magic_entry_set *mset)
  1174. {
  1175. size_t i = me->mp->type == FILE_NAME ? 1 : 0;
  1176. if (mset[i].me == NULL || mset[i].count == mset[i].max) {
  1177. struct magic_entry *mp;
  1178. size_t incr = mset[i].max + ALLOC_INCR;
  1179. if ((mp = CAST(struct magic_entry *,
  1180. realloc(mset[i].me, sizeof(*mp) * incr))) ==
  1181. NULL) {
  1182. file_oomem(ms, sizeof(*mp) * incr);
  1183. return -1;
  1184. }
  1185. (void)memset(&mp[mset[i].count], 0, sizeof(*mp) *
  1186. ALLOC_INCR);
  1187. mset[i].me = mp;
  1188. mset[i].max = CAST(uint32_t, incr);
  1189. assert(mset[i].max == incr);
  1190. }
  1191. mset[i].me[mset[i].count++] = *me;
  1192. memset(me, 0, sizeof(*me));
  1193. return 0;
  1194. }
  1195. /*
  1196. * Load and parse one file.
  1197. */
  1198. file_private void
  1199. load_1(struct magic_set *ms, int action, const char *fn, int *errs,
  1200. struct magic_entry_set *mset)
  1201. {
  1202. size_t lineno = 0, llen = 0;
  1203. char *line = NULL;
  1204. ssize_t len;
  1205. struct magic_entry me;
  1206. FILE *f = fopen(ms->file = fn, "r");
  1207. if (f == NULL) {
  1208. if (errno != ENOENT)
  1209. file_error(ms, errno, "cannot read magic file `%s'",
  1210. fn);
  1211. (*errs)++;
  1212. return;
  1213. }
  1214. memset(&me, 0, sizeof(me));
  1215. /* read and parse this file */
  1216. for (ms->line = 1; (len = getline(&line, &llen, f)) != -1;
  1217. ms->line++) {
  1218. if (ms->magwarn >= ms->magwarn_max)
  1219. break;
  1220. if (len == 0) /* null line, garbage, etc */
  1221. continue;
  1222. if (line[len - 1] == '\n') {
  1223. lineno++;
  1224. line[len - 1] = '\0'; /* delete newline */
  1225. }
  1226. switch (line[0]) {
  1227. case '\0': /* empty, do not parse */
  1228. case '#': /* comment, do not parse */
  1229. continue;
  1230. case '!':
  1231. if (line[1] == ':') {
  1232. size_t i;
  1233. for (i = 0; bang[i].name != NULL; i++) {
  1234. if (CAST(size_t, len - 2) > bang[i].len &&
  1235. memcmp(bang[i].name, line + 2,
  1236. bang[i].len) == 0)
  1237. break;
  1238. }
  1239. if (bang[i].name == NULL) {
  1240. file_error(ms, 0,
  1241. "Unknown !: entry `%s'", line);
  1242. (*errs)++;
  1243. continue;
  1244. }
  1245. if (me.mp == NULL) {
  1246. file_error(ms, 0,
  1247. "No current entry for :!%s type",
  1248. bang[i].name);
  1249. (*errs)++;
  1250. continue;
  1251. }
  1252. if ((*bang[i].fun)(ms, &me,
  1253. line + bang[i].len + 2,
  1254. len - bang[i].len - 2) != 0) {
  1255. (*errs)++;
  1256. continue;
  1257. }
  1258. continue;
  1259. }
  1260. /*FALLTHROUGH*/
  1261. default:
  1262. again:
  1263. switch (parse(ms, &me, fn, line, lineno, action)) {
  1264. case 0:
  1265. continue;
  1266. case 1:
  1267. (void)addentry(ms, &me, mset);
  1268. goto again;
  1269. default:
  1270. (*errs)++;
  1271. break;
  1272. }
  1273. }
  1274. }
  1275. if (me.mp)
  1276. (void)addentry(ms, &me, mset);
  1277. free(line);
  1278. (void)fclose(f);
  1279. }
  1280. /*
  1281. * parse a file or directory of files
  1282. * const char *fn: name of magic file or directory
  1283. */
  1284. file_private int
  1285. cmpstrp(const void *p1, const void *p2)
  1286. {
  1287. return strcmp(*RCAST(char *const *, p1), *RCAST(char *const *, p2));
  1288. }
  1289. file_private uint32_t
  1290. set_text_binary(struct magic_set *ms, struct magic_entry *me, uint32_t nme,
  1291. uint32_t starttest)
  1292. {
  1293. static const char text[] = "text";
  1294. static const char binary[] = "binary";
  1295. static const size_t len = sizeof(text);
  1296. uint32_t i = starttest;
  1297. do {
  1298. set_test_type(me[starttest].mp, me[i].mp);
  1299. if ((ms->flags & MAGIC_DEBUG) == 0)
  1300. continue;
  1301. (void)fprintf(stderr, "%s%s%s: %s\n",
  1302. me[i].mp->mimetype,
  1303. me[i].mp->mimetype[0] == '\0' ? "" : "; ",
  1304. me[i].mp->desc[0] ? me[i].mp->desc : "(no description)",
  1305. me[i].mp->flag & BINTEST ? binary : text);
  1306. if (me[i].mp->flag & BINTEST) {
  1307. char *p = strstr(me[i].mp->desc, text);
  1308. if (p && (p == me[i].mp->desc ||
  1309. isspace(CAST(unsigned char, p[-1]))) &&
  1310. (p + len - me[i].mp->desc == MAXstring
  1311. || (p[len] == '\0' ||
  1312. isspace(CAST(unsigned char, p[len])))))
  1313. (void)fprintf(stderr, "*** Possible "
  1314. "binary test for text type\n");
  1315. }
  1316. } while (++i < nme && me[i].mp->cont_level != 0);
  1317. return i;
  1318. }
  1319. file_private void
  1320. set_last_default(struct magic_set *ms, struct magic_entry *me, uint32_t nme)
  1321. {
  1322. uint32_t i;
  1323. for (i = 0; i < nme; i++) {
  1324. if (me[i].mp->cont_level == 0 &&
  1325. me[i].mp->type == FILE_DEFAULT) {
  1326. while (++i < nme)
  1327. if (me[i].mp->cont_level == 0)
  1328. break;
  1329. if (i != nme) {
  1330. /* XXX - Ugh! */
  1331. ms->line = me[i].mp->lineno;
  1332. file_magwarn(ms,
  1333. "level 0 \"default\" did not sort last");
  1334. }
  1335. return;
  1336. }
  1337. }
  1338. }
  1339. file_private int
  1340. coalesce_entries(struct magic_set *ms, struct magic_entry *me, uint32_t nme,
  1341. struct magic **ma, uint32_t *nma)
  1342. {
  1343. uint32_t i, mentrycount = 0;
  1344. size_t slen;
  1345. for (i = 0; i < nme; i++)
  1346. mentrycount += me[i].cont_count;
  1347. if (mentrycount == 0) {
  1348. *ma = NULL;
  1349. *nma = 0;
  1350. return 0;
  1351. }
  1352. slen = sizeof(**ma) * mentrycount;
  1353. if ((*ma = CAST(struct magic *, malloc(slen))) == NULL) {
  1354. file_oomem(ms, slen);
  1355. return -1;
  1356. }
  1357. mentrycount = 0;
  1358. for (i = 0; i < nme; i++) {
  1359. (void)memcpy(*ma + mentrycount, me[i].mp,
  1360. me[i].cont_count * sizeof(**ma));
  1361. mentrycount += me[i].cont_count;
  1362. }
  1363. *nma = mentrycount;
  1364. return 0;
  1365. }
  1366. file_private void
  1367. magic_entry_free(struct magic_entry *me, uint32_t nme)
  1368. {
  1369. uint32_t i;
  1370. if (me == NULL)
  1371. return;
  1372. for (i = 0; i < nme; i++)
  1373. free(me[i].mp);
  1374. free(me);
  1375. }
  1376. file_private struct magic_map *
  1377. apprentice_load(struct magic_set *ms, const char *fn, int action)
  1378. {
  1379. int errs = 0;
  1380. uint32_t i, j;
  1381. size_t files = 0, maxfiles = 0;
  1382. char **filearr = NULL, *mfn;
  1383. struct stat st;
  1384. struct magic_map *map;
  1385. struct magic_entry_set mset[MAGIC_SETS];
  1386. DIR *dir;
  1387. struct dirent *d;
  1388. memset(mset, 0, sizeof(mset));
  1389. ms->flags |= MAGIC_CHECK; /* Enable checks for parsed files */
  1390. if ((map = CAST(struct magic_map *, calloc(1, sizeof(*map)))) == NULL)
  1391. {
  1392. file_oomem(ms, sizeof(*map));
  1393. return NULL;
  1394. }
  1395. map->type = MAP_TYPE_MALLOC;
  1396. /* print silly verbose header for USG compat. */
  1397. if (action == FILE_CHECK)
  1398. (void)fprintf(stderr, "%s\n", usg_hdr);
  1399. /* load directory or file */
  1400. if (stat(fn, &st) == 0 && S_ISDIR(st.st_mode)) {
  1401. dir = opendir(fn);
  1402. if (!dir) {
  1403. errs++;
  1404. goto out;
  1405. }
  1406. while ((d = readdir(dir)) != NULL) {
  1407. if (d->d_name[0] == '.')
  1408. continue;
  1409. if (asprintf(&mfn, "%s/%s", fn, d->d_name) < 0) {
  1410. file_oomem(ms,
  1411. strlen(fn) + strlen(d->d_name) + 2);
  1412. errs++;
  1413. closedir(dir);
  1414. goto out;
  1415. }
  1416. if (stat(mfn, &st) == -1 || !S_ISREG(st.st_mode)) {
  1417. free(mfn);
  1418. continue;
  1419. }
  1420. if (files >= maxfiles) {
  1421. size_t mlen;
  1422. char **nfilearr;
  1423. maxfiles = (maxfiles + 1) * 2;
  1424. mlen = maxfiles * sizeof(*filearr);
  1425. if ((nfilearr = CAST(char **,
  1426. realloc(filearr, mlen))) == NULL) {
  1427. file_oomem(ms, mlen);
  1428. free(mfn);
  1429. closedir(dir);
  1430. errs++;
  1431. goto out;
  1432. }
  1433. filearr = nfilearr;
  1434. }
  1435. filearr[files++] = mfn;
  1436. }
  1437. closedir(dir);
  1438. if (filearr) {
  1439. qsort(filearr, files, sizeof(*filearr), cmpstrp);
  1440. for (i = 0; i < files; i++) {
  1441. load_1(ms, action, filearr[i], &errs, mset);
  1442. free(filearr[i]);
  1443. }
  1444. free(filearr);
  1445. filearr = NULL;
  1446. }
  1447. } else
  1448. load_1(ms, action, fn, &errs, mset);
  1449. if (errs)
  1450. goto out;
  1451. for (j = 0; j < MAGIC_SETS; j++) {
  1452. /* Set types of tests */
  1453. for (i = 0; i < mset[j].count; ) {
  1454. if (mset[j].me[i].mp->cont_level != 0) {
  1455. i++;
  1456. continue;
  1457. }
  1458. i = set_text_binary(ms, mset[j].me, mset[j].count, i);
  1459. }
  1460. if (mset[j].me)
  1461. qsort(mset[j].me, mset[j].count, sizeof(*mset[0].me),
  1462. apprentice_sort);
  1463. /*
  1464. * Make sure that any level 0 "default" line is last
  1465. * (if one exists).
  1466. */
  1467. set_last_default(ms, mset[j].me, mset[j].count);
  1468. /* coalesce per file arrays into a single one, if needed */
  1469. if (mset[j].count == 0)
  1470. continue;
  1471. if (coalesce_entries(ms, mset[j].me, mset[j].count,
  1472. &map->magic[j], &map->nmagic[j]) == -1) {
  1473. errs++;
  1474. goto out;
  1475. }
  1476. }
  1477. out:
  1478. free(filearr);
  1479. for (j = 0; j < MAGIC_SETS; j++)
  1480. magic_entry_free(mset[j].me, mset[j].count);
  1481. if (errs) {
  1482. apprentice_unmap(map);
  1483. return NULL;
  1484. }
  1485. return map;
  1486. }
  1487. /*
  1488. * extend the sign bit if the comparison is to be signed
  1489. */
  1490. file_protected uint64_t
  1491. file_signextend(struct magic_set *ms, struct magic *m, uint64_t v)
  1492. {
  1493. if (!(m->flag & UNSIGNED)) {
  1494. switch(m->type) {
  1495. /*
  1496. * Do not remove the casts below. They are
  1497. * vital. When later compared with the data,
  1498. * the sign extension must have happened.
  1499. */
  1500. case FILE_BYTE:
  1501. v = CAST(signed char, v);
  1502. break;
  1503. case FILE_SHORT:
  1504. case FILE_BESHORT:
  1505. case FILE_LESHORT:
  1506. v = CAST(short, v);
  1507. break;
  1508. case FILE_DATE:
  1509. case FILE_BEDATE:
  1510. case FILE_LEDATE:
  1511. case FILE_MEDATE:
  1512. case FILE_LDATE:
  1513. case FILE_BELDATE:
  1514. case FILE_LELDATE:
  1515. case FILE_MELDATE:
  1516. case FILE_LONG:
  1517. case FILE_BELONG:
  1518. case FILE_LELONG:
  1519. case FILE_MELONG:
  1520. case FILE_FLOAT:
  1521. case FILE_BEFLOAT:
  1522. case FILE_LEFLOAT:
  1523. case FILE_MSDOSDATE:
  1524. case FILE_BEMSDOSDATE:
  1525. case FILE_LEMSDOSDATE:
  1526. case FILE_MSDOSTIME:
  1527. case FILE_BEMSDOSTIME:
  1528. case FILE_LEMSDOSTIME:
  1529. v = CAST(int32_t, v);
  1530. break;
  1531. case FILE_QUAD:
  1532. case FILE_BEQUAD:
  1533. case FILE_LEQUAD:
  1534. case FILE_QDATE:
  1535. case FILE_QLDATE:
  1536. case FILE_QWDATE:
  1537. case FILE_BEQDATE:
  1538. case FILE_BEQLDATE:
  1539. case FILE_BEQWDATE:
  1540. case FILE_LEQDATE:
  1541. case FILE_LEQLDATE:
  1542. case FILE_LEQWDATE:
  1543. case FILE_DOUBLE:
  1544. case FILE_BEDOUBLE:
  1545. case FILE_LEDOUBLE:
  1546. case FILE_OFFSET:
  1547. case FILE_BEVARINT:
  1548. case FILE_LEVARINT:
  1549. v = CAST(int64_t, v);
  1550. break;
  1551. case FILE_STRING:
  1552. case FILE_PSTRING:
  1553. case FILE_BESTRING16:
  1554. case FILE_LESTRING16:
  1555. case FILE_REGEX:
  1556. case FILE_SEARCH:
  1557. case FILE_DEFAULT:
  1558. case FILE_INDIRECT:
  1559. case FILE_NAME:
  1560. case FILE_USE:
  1561. case FILE_CLEAR:
  1562. case FILE_DER:
  1563. case FILE_GUID:
  1564. case FILE_OCTAL:
  1565. break;
  1566. default:
  1567. if (ms->flags & MAGIC_CHECK)
  1568. file_magwarn(ms, "cannot happen: m->type=%d\n",
  1569. m->type);
  1570. return FILE_BADSIZE;
  1571. }
  1572. }
  1573. return v;
  1574. }
  1575. file_private int
  1576. string_modifier_check(struct magic_set *ms, struct magic *m)
  1577. {
  1578. if ((ms->flags & MAGIC_CHECK) == 0)
  1579. return 0;
  1580. if ((m->type != FILE_REGEX || (m->str_flags & REGEX_LINE_COUNT) == 0) &&
  1581. (m->type != FILE_PSTRING && (m->str_flags & PSTRING_LEN) != 0)) {
  1582. file_magwarn(ms,
  1583. "'/BHhLl' modifiers are only allowed for pascal strings\n");
  1584. return -1;
  1585. }
  1586. switch (m->type) {
  1587. case FILE_BESTRING16:
  1588. case FILE_LESTRING16:
  1589. if (m->str_flags != 0) {
  1590. file_magwarn(ms,
  1591. "no modifiers allowed for 16-bit strings\n");
  1592. return -1;
  1593. }
  1594. break;
  1595. case FILE_STRING:
  1596. case FILE_PSTRING:
  1597. if ((m->str_flags & REGEX_OFFSET_START) != 0) {
  1598. file_magwarn(ms,
  1599. "'/%c' only allowed on regex and search\n",
  1600. CHAR_REGEX_OFFSET_START);
  1601. return -1;
  1602. }
  1603. break;
  1604. case FILE_SEARCH:
  1605. if (m->str_range == 0) {
  1606. file_magwarn(ms,
  1607. "missing range; defaulting to %d\n",
  1608. STRING_DEFAULT_RANGE);
  1609. m->str_range = STRING_DEFAULT_RANGE;
  1610. return -1;
  1611. }
  1612. break;
  1613. case FILE_REGEX:
  1614. if ((m->str_flags & STRING_COMPACT_WHITESPACE) != 0) {
  1615. file_magwarn(ms, "'/%c' not allowed on regex\n",
  1616. CHAR_COMPACT_WHITESPACE);
  1617. return -1;
  1618. }
  1619. if ((m->str_flags & STRING_COMPACT_OPTIONAL_WHITESPACE) != 0) {
  1620. file_magwarn(ms, "'/%c' not allowed on regex\n",
  1621. CHAR_COMPACT_OPTIONAL_WHITESPACE);
  1622. return -1;
  1623. }
  1624. break;
  1625. default:
  1626. file_magwarn(ms, "coding error: m->type=%d\n",
  1627. m->type);
  1628. return -1;
  1629. }
  1630. return 0;
  1631. }
  1632. file_private int
  1633. get_op(char c)
  1634. {
  1635. switch (c) {
  1636. case '&':
  1637. return FILE_OPAND;
  1638. case '|':
  1639. return FILE_OPOR;
  1640. case '^':
  1641. return FILE_OPXOR;
  1642. case '+':
  1643. return FILE_OPADD;
  1644. case '-':
  1645. return FILE_OPMINUS;
  1646. case '*':
  1647. return FILE_OPMULTIPLY;
  1648. case '/':
  1649. return FILE_OPDIVIDE;
  1650. case '%':
  1651. return FILE_OPMODULO;
  1652. default:
  1653. return -1;
  1654. }
  1655. }
  1656. #ifdef ENABLE_CONDITIONALS
  1657. file_private int
  1658. get_cond(const char *l, const char **t)
  1659. {
  1660. static const struct cond_tbl_s {
  1661. char name[8];
  1662. size_t len;
  1663. int cond;
  1664. } cond_tbl[] = {
  1665. { "if", 2, COND_IF },
  1666. { "elif", 4, COND_ELIF },
  1667. { "else", 4, COND_ELSE },
  1668. { "", 0, COND_NONE },
  1669. };
  1670. const struct cond_tbl_s *p;
  1671. for (p = cond_tbl; p->len; p++) {
  1672. if (strncmp(l, p->name, p->len) == 0 &&
  1673. isspace(CAST(unsigned char, l[p->len]))) {
  1674. if (t)
  1675. *t = l + p->len;
  1676. break;
  1677. }
  1678. }
  1679. return p->cond;
  1680. }
  1681. file_private int
  1682. check_cond(struct magic_set *ms, int cond, uint32_t cont_level)
  1683. {
  1684. int last_cond;
  1685. last_cond = ms->c.li[cont_level].last_cond;
  1686. switch (cond) {
  1687. case COND_IF:
  1688. if (last_cond != COND_NONE && last_cond != COND_ELIF) {
  1689. if (ms->flags & MAGIC_CHECK)
  1690. file_magwarn(ms, "syntax error: `if'");
  1691. return -1;
  1692. }
  1693. last_cond = COND_IF;
  1694. break;
  1695. case COND_ELIF:
  1696. if (last_cond != COND_IF && last_cond != COND_ELIF) {
  1697. if (ms->flags & MAGIC_CHECK)
  1698. file_magwarn(ms, "syntax error: `elif'");
  1699. return -1;
  1700. }
  1701. last_cond = COND_ELIF;
  1702. break;
  1703. case COND_ELSE:
  1704. if (last_cond != COND_IF && last_cond != COND_ELIF) {
  1705. if (ms->flags & MAGIC_CHECK)
  1706. file_magwarn(ms, "syntax error: `else'");
  1707. return -1;
  1708. }
  1709. last_cond = COND_NONE;
  1710. break;
  1711. case COND_NONE:
  1712. last_cond = COND_NONE;
  1713. break;
  1714. }
  1715. ms->c.li[cont_level].last_cond = last_cond;
  1716. return 0;
  1717. }
  1718. #endif /* ENABLE_CONDITIONALS */
  1719. file_private int
  1720. parse_indirect_modifier(struct magic_set *ms, struct magic *m, const char **lp)
  1721. {
  1722. const char *l = *lp;
  1723. while (!isspace(CAST(unsigned char, *++l)))
  1724. switch (*l) {
  1725. case CHAR_INDIRECT_RELATIVE:
  1726. m->str_flags |= INDIRECT_RELATIVE;
  1727. break;
  1728. default:
  1729. if (ms->flags & MAGIC_CHECK)
  1730. file_magwarn(ms, "indirect modifier `%c' "
  1731. "invalid", *l);
  1732. *lp = l;
  1733. return -1;
  1734. }
  1735. *lp = l;
  1736. return 0;
  1737. }
  1738. file_private void
  1739. parse_op_modifier(struct magic_set *ms, struct magic *m, const char **lp,
  1740. int op)
  1741. {
  1742. const char *l = *lp;
  1743. char *t;
  1744. uint64_t val;
  1745. ++l;
  1746. m->mask_op |= op;
  1747. val = CAST(uint64_t, strtoull(l, &t, 0));
  1748. l = t;
  1749. m->num_mask = file_signextend(ms, m, val);
  1750. eatsize(&l);
  1751. *lp = l;
  1752. }
  1753. file_private int
  1754. parse_string_modifier(struct magic_set *ms, struct magic *m, const char **lp)
  1755. {
  1756. const char *l = *lp;
  1757. char *t;
  1758. int have_range = 0;
  1759. while (!isspace(CAST(unsigned char, *++l))) {
  1760. switch (*l) {
  1761. case '0': case '1': case '2':
  1762. case '3': case '4': case '5':
  1763. case '6': case '7': case '8':
  1764. case '9':
  1765. if (have_range && (ms->flags & MAGIC_CHECK))
  1766. file_magwarn(ms, "multiple ranges");
  1767. have_range = 1;
  1768. m->str_range = CAST(uint32_t, strtoul(l, &t, 0));
  1769. if (m->str_range == 0)
  1770. file_magwarn(ms, "zero range");
  1771. l = t - 1;
  1772. break;
  1773. case CHAR_COMPACT_WHITESPACE:
  1774. m->str_flags |= STRING_COMPACT_WHITESPACE;
  1775. break;
  1776. case CHAR_COMPACT_OPTIONAL_WHITESPACE:
  1777. m->str_flags |= STRING_COMPACT_OPTIONAL_WHITESPACE;
  1778. break;
  1779. case CHAR_IGNORE_LOWERCASE:
  1780. m->str_flags |= STRING_IGNORE_LOWERCASE;
  1781. break;
  1782. case CHAR_IGNORE_UPPERCASE:
  1783. m->str_flags |= STRING_IGNORE_UPPERCASE;
  1784. break;
  1785. case CHAR_REGEX_OFFSET_START:
  1786. m->str_flags |= REGEX_OFFSET_START;
  1787. break;
  1788. case CHAR_BINTEST:
  1789. m->str_flags |= STRING_BINTEST;
  1790. break;
  1791. case CHAR_TEXTTEST:
  1792. m->str_flags |= STRING_TEXTTEST;
  1793. break;
  1794. case CHAR_TRIM:
  1795. m->str_flags |= STRING_TRIM;
  1796. break;
  1797. case CHAR_FULL_WORD:
  1798. m->str_flags |= STRING_FULL_WORD;
  1799. break;
  1800. case CHAR_PSTRING_1_LE:
  1801. #define SET_LENGTH(a) m->str_flags = (m->str_flags & ~PSTRING_LEN) | (a)
  1802. if (m->type != FILE_PSTRING)
  1803. goto bad;
  1804. SET_LENGTH(PSTRING_1_LE);
  1805. break;
  1806. case CHAR_PSTRING_2_BE:
  1807. if (m->type != FILE_PSTRING)
  1808. goto bad;
  1809. SET_LENGTH(PSTRING_2_BE);
  1810. break;
  1811. case CHAR_PSTRING_2_LE:
  1812. if (m->type != FILE_PSTRING)
  1813. goto bad;
  1814. SET_LENGTH(PSTRING_2_LE);
  1815. break;
  1816. case CHAR_PSTRING_4_BE:
  1817. if (m->type != FILE_PSTRING)
  1818. goto bad;
  1819. SET_LENGTH(PSTRING_4_BE);
  1820. break;
  1821. case CHAR_PSTRING_4_LE:
  1822. switch (m->type) {
  1823. case FILE_PSTRING:
  1824. case FILE_REGEX:
  1825. break;
  1826. default:
  1827. goto bad;
  1828. }
  1829. SET_LENGTH(PSTRING_4_LE);
  1830. break;
  1831. case CHAR_PSTRING_LENGTH_INCLUDES_ITSELF:
  1832. if (m->type != FILE_PSTRING)
  1833. goto bad;
  1834. m->str_flags |= PSTRING_LENGTH_INCLUDES_ITSELF;
  1835. break;
  1836. default:
  1837. bad:
  1838. if (ms->flags & MAGIC_CHECK)
  1839. file_magwarn(ms, "string modifier `%c' "
  1840. "invalid", *l);
  1841. goto out;
  1842. }
  1843. /* allow multiple '/' for readability */
  1844. if (l[1] == '/' && !isspace(CAST(unsigned char, l[2])))
  1845. l++;
  1846. }
  1847. if (string_modifier_check(ms, m) == -1)
  1848. goto out;
  1849. *lp = l;
  1850. return 0;
  1851. out:
  1852. *lp = l;
  1853. return -1;
  1854. }
  1855. /*
  1856. * parse one line from magic file, put into magic[index++] if valid
  1857. */
  1858. file_private int
  1859. parse(struct magic_set *ms, struct magic_entry *me, const char *file,
  1860. const char *line, size_t lineno, int action)
  1861. {
  1862. #ifdef ENABLE_CONDITIONALS
  1863. static uint32_t last_cont_level = 0;
  1864. #endif
  1865. size_t i;
  1866. struct magic *m;
  1867. const char *l = line;
  1868. char *t;
  1869. int op;
  1870. uint32_t cont_level;
  1871. int32_t diff;
  1872. cont_level = 0;
  1873. /*
  1874. * Parse the offset.
  1875. */
  1876. while (*l == '>') {
  1877. ++l; /* step over */
  1878. cont_level++;
  1879. }
  1880. #ifdef ENABLE_CONDITIONALS
  1881. if (cont_level == 0 || cont_level > last_cont_level)
  1882. if (file_check_mem(ms, cont_level) == -1)
  1883. return -1;
  1884. last_cont_level = cont_level;
  1885. #endif
  1886. if (cont_level != 0) {
  1887. if (me->mp == NULL) {
  1888. file_magerror(ms, "No current entry for continuation");
  1889. return -1;
  1890. }
  1891. if (me->cont_count == 0) {
  1892. file_magerror(ms, "Continuations present with 0 count");
  1893. return -1;
  1894. }
  1895. m = &me->mp[me->cont_count - 1];
  1896. diff = CAST(int32_t, cont_level) - CAST(int32_t, m->cont_level);
  1897. if (diff > 1)
  1898. file_magwarn(ms, "New continuation level %u is more "
  1899. "than one larger than current level %u", cont_level,
  1900. m->cont_level);
  1901. if (me->cont_count == me->max_count) {
  1902. struct magic *nm;
  1903. size_t cnt = me->max_count + ALLOC_CHUNK;
  1904. if ((nm = CAST(struct magic *, realloc(me->mp,
  1905. sizeof(*nm) * cnt))) == NULL) {
  1906. file_oomem(ms, sizeof(*nm) * cnt);
  1907. return -1;
  1908. }
  1909. me->mp = nm;
  1910. me->max_count = CAST(uint32_t, cnt);
  1911. }
  1912. m = &me->mp[me->cont_count++];
  1913. (void)memset(m, 0, sizeof(*m));
  1914. m->cont_level = cont_level;
  1915. } else {
  1916. static const size_t len = sizeof(*m) * ALLOC_CHUNK;
  1917. if (me->mp != NULL)
  1918. return 1;
  1919. if ((m = CAST(struct magic *, malloc(len))) == NULL) {
  1920. file_oomem(ms, len);
  1921. return -1;
  1922. }
  1923. me->mp = m;
  1924. me->max_count = ALLOC_CHUNK;
  1925. (void)memset(m, 0, sizeof(*m));
  1926. m->factor_op = FILE_FACTOR_OP_NONE;
  1927. m->cont_level = 0;
  1928. me->cont_count = 1;
  1929. }
  1930. m->lineno = CAST(uint32_t, lineno);
  1931. if (*l == '&') { /* m->cont_level == 0 checked below. */
  1932. ++l; /* step over */
  1933. m->flag |= OFFADD;
  1934. }
  1935. if (*l == '(') {
  1936. ++l; /* step over */
  1937. m->flag |= INDIR;
  1938. if (m->flag & OFFADD)
  1939. m->flag = (m->flag & ~OFFADD) | INDIROFFADD;
  1940. if (*l == '&') { /* m->cont_level == 0 checked below */
  1941. ++l; /* step over */
  1942. m->flag |= OFFADD;
  1943. }
  1944. }
  1945. /* Indirect offsets are not valid at level 0. */
  1946. if (m->cont_level == 0 && (m->flag & (OFFADD | INDIROFFADD))) {
  1947. if (ms->flags & MAGIC_CHECK)
  1948. file_magwarn(ms, "relative offset at level 0");
  1949. return -1;
  1950. }
  1951. /* get offset, then skip over it */
  1952. if (*l == '-' || *l == '+') {
  1953. ++l; /* step over */
  1954. m->flag |= l[-1] == '-' ? OFFNEGATIVE : OFFPOSITIVE;
  1955. }
  1956. m->offset = CAST(int32_t, strtol(l, &t, 0));
  1957. if (l == t) {
  1958. if (ms->flags & MAGIC_CHECK)
  1959. file_magwarn(ms, "offset `%s' invalid", l);
  1960. return -1;
  1961. }
  1962. l = t;
  1963. if (m->flag & INDIR) {
  1964. m->in_type = FILE_LONG;
  1965. m->in_offset = 0;
  1966. m->in_op = 0;
  1967. /*
  1968. * read [.,lbs][+-]nnnnn)
  1969. */
  1970. if (*l == '.' || *l == ',') {
  1971. if (*l == ',')
  1972. m->in_op |= FILE_OPSIGNED;
  1973. l++;
  1974. switch (*l) {
  1975. case 'l':
  1976. m->in_type = FILE_LELONG;
  1977. break;
  1978. case 'L':
  1979. m->in_type = FILE_BELONG;
  1980. break;
  1981. case 'm':
  1982. m->in_type = FILE_MELONG;
  1983. break;
  1984. case 'h':
  1985. case 's':
  1986. m->in_type = FILE_LESHORT;
  1987. break;
  1988. case 'H':
  1989. case 'S':
  1990. m->in_type = FILE_BESHORT;
  1991. break;
  1992. case 'c':
  1993. case 'b':
  1994. case 'C':
  1995. case 'B':
  1996. m->in_type = FILE_BYTE;
  1997. break;
  1998. case 'e':
  1999. case 'f':
  2000. case 'g':
  2001. m->in_type = FILE_LEDOUBLE;
  2002. break;
  2003. case 'E':
  2004. case 'F':
  2005. case 'G':
  2006. m->in_type = FILE_BEDOUBLE;
  2007. break;
  2008. case 'i':
  2009. m->in_type = FILE_LEID3;
  2010. break;
  2011. case 'I':
  2012. m->in_type = FILE_BEID3;
  2013. break;
  2014. case 'o':
  2015. m->in_type = FILE_OCTAL;
  2016. break;
  2017. case 'q':
  2018. m->in_type = FILE_LEQUAD;
  2019. break;
  2020. case 'Q':
  2021. m->in_type = FILE_BEQUAD;
  2022. break;
  2023. default:
  2024. if (ms->flags & MAGIC_CHECK)
  2025. file_magwarn(ms,
  2026. "indirect offset type `%c' invalid",
  2027. *l);
  2028. return -1;
  2029. }
  2030. l++;
  2031. }
  2032. if (*l == '~') {
  2033. m->in_op |= FILE_OPINVERSE;
  2034. l++;
  2035. }
  2036. if ((op = get_op(*l)) != -1) {
  2037. m->in_op |= op;
  2038. l++;
  2039. }
  2040. if (*l == '(') {
  2041. m->in_op |= FILE_OPINDIRECT;
  2042. l++;
  2043. }
  2044. if (isdigit(CAST(unsigned char, *l)) || *l == '-') {
  2045. m->in_offset = CAST(int32_t, strtol(l, &t, 0));
  2046. if (l == t) {
  2047. if (ms->flags & MAGIC_CHECK)
  2048. file_magwarn(ms,
  2049. "in_offset `%s' invalid", l);
  2050. return -1;
  2051. }
  2052. l = t;
  2053. }
  2054. if (*l++ != ')' ||
  2055. ((m->in_op & FILE_OPINDIRECT) && *l++ != ')')) {
  2056. if (ms->flags & MAGIC_CHECK)
  2057. file_magwarn(ms,
  2058. "missing ')' in indirect offset");
  2059. return -1;
  2060. }
  2061. }
  2062. EATAB;
  2063. #ifdef ENABLE_CONDITIONALS
  2064. m->cond = get_cond(l, &l);
  2065. if (check_cond(ms, m->cond, cont_level) == -1)
  2066. return -1;
  2067. EATAB;
  2068. #endif
  2069. /*
  2070. * Parse the type.
  2071. */
  2072. if (*l == 'u') {
  2073. /*
  2074. * Try it as a keyword type prefixed by "u"; match what
  2075. * follows the "u". If that fails, try it as an SUS
  2076. * integer type.
  2077. */
  2078. m->type = get_type(type_tbl, l + 1, &l);
  2079. if (m->type == FILE_INVALID) {
  2080. /*
  2081. * Not a keyword type; parse it as an SUS type,
  2082. * 'u' possibly followed by a number or C/S/L.
  2083. */
  2084. m->type = get_standard_integer_type(l, &l);
  2085. }
  2086. /* It's unsigned. */
  2087. if (m->type != FILE_INVALID)
  2088. m->flag |= UNSIGNED;
  2089. } else {
  2090. /*
  2091. * Try it as a keyword type. If that fails, try it as
  2092. * an SUS integer type if it begins with "d" or as an
  2093. * SUS string type if it begins with "s". In any case,
  2094. * it's not unsigned.
  2095. */
  2096. m->type = get_type(type_tbl, l, &l);
  2097. if (m->type == FILE_INVALID) {
  2098. /*
  2099. * Not a keyword type; parse it as an SUS type,
  2100. * either 'd' possibly followed by a number or
  2101. * C/S/L, or just 's'.
  2102. */
  2103. if (*l == 'd')
  2104. m->type = get_standard_integer_type(l, &l);
  2105. else if (*l == 's'
  2106. && !isalpha(CAST(unsigned char, l[1]))) {
  2107. m->type = FILE_STRING;
  2108. ++l;
  2109. }
  2110. }
  2111. }
  2112. if (m->type == FILE_INVALID) {
  2113. /* Not found - try it as a special keyword. */
  2114. m->type = get_type(special_tbl, l, &l);
  2115. }
  2116. if (m->type == FILE_INVALID) {
  2117. if (ms->flags & MAGIC_CHECK)
  2118. file_magwarn(ms, "type `%s' invalid", l);
  2119. return -1;
  2120. }
  2121. if (m->type == FILE_NAME && cont_level != 0) {
  2122. if (ms->flags & MAGIC_CHECK)
  2123. file_magwarn(ms, "`name%s' entries can only be "
  2124. "declared at top level", l);
  2125. return -1;
  2126. }
  2127. /* New-style anding: "0 byte&0x80 =0x80 dynamically linked" */
  2128. /* New and improved: ~ & | ^ + - * / % -- exciting, isn't it? */
  2129. m->mask_op = 0;
  2130. if (*l == '~') {
  2131. if (!IS_STRING(m->type))
  2132. m->mask_op |= FILE_OPINVERSE;
  2133. else if (ms->flags & MAGIC_CHECK)
  2134. file_magwarn(ms, "'~' invalid for string types");
  2135. ++l;
  2136. }
  2137. m->str_range = 0;
  2138. m->str_flags = m->type == FILE_PSTRING ? PSTRING_1_LE : 0;
  2139. if ((op = get_op(*l)) != -1) {
  2140. if (IS_STRING(m->type)) {
  2141. int r;
  2142. if (op != FILE_OPDIVIDE) {
  2143. if (ms->flags & MAGIC_CHECK)
  2144. file_magwarn(ms,
  2145. "invalid string/indirect op: "
  2146. "`%c'", *t);
  2147. return -1;
  2148. }
  2149. if (m->type == FILE_INDIRECT)
  2150. r = parse_indirect_modifier(ms, m, &l);
  2151. else
  2152. r = parse_string_modifier(ms, m, &l);
  2153. if (r == -1)
  2154. return -1;
  2155. } else
  2156. parse_op_modifier(ms, m, &l, op);
  2157. }
  2158. /*
  2159. * We used to set mask to all 1's here, instead let's just not do
  2160. * anything if mask = 0 (unless you have a better idea)
  2161. */
  2162. EATAB;
  2163. switch (*l) {
  2164. case '>':
  2165. case '<':
  2166. m->reln = *l;
  2167. ++l;
  2168. if (*l == '=') {
  2169. if (ms->flags & MAGIC_CHECK) {
  2170. file_magwarn(ms, "%c= not supported",
  2171. m->reln);
  2172. return -1;
  2173. }
  2174. ++l;
  2175. }
  2176. break;
  2177. /* Old-style anding: "0 byte &0x80 dynamically linked" */
  2178. case '&':
  2179. case '^':
  2180. case '=':
  2181. m->reln = *l;
  2182. ++l;
  2183. if (*l == '=') {
  2184. /* HP compat: ignore &= etc. */
  2185. ++l;
  2186. }
  2187. break;
  2188. case '!':
  2189. m->reln = *l;
  2190. ++l;
  2191. break;
  2192. default:
  2193. m->reln = '='; /* the default relation */
  2194. if (*l == 'x' && ((isascii(CAST(unsigned char, l[1])) &&
  2195. isspace(CAST(unsigned char, l[1]))) || !l[1])) {
  2196. m->reln = *l;
  2197. ++l;
  2198. }
  2199. break;
  2200. }
  2201. /*
  2202. * Grab the value part, except for an 'x' reln.
  2203. */
  2204. if (m->reln != 'x' && getvalue(ms, m, &l, action))
  2205. return -1;
  2206. /*
  2207. * TODO finish this macro and start using it!
  2208. * #define offsetcheck {if (offset > ms->bytes_max -1)
  2209. * magwarn("offset too big"); }
  2210. */
  2211. /*
  2212. * Now get last part - the description
  2213. */
  2214. EATAB;
  2215. if (l[0] == '\b') {
  2216. ++l;
  2217. m->flag |= NOSPACE;
  2218. } else if ((l[0] == '\\') && (l[1] == 'b')) {
  2219. ++l;
  2220. ++l;
  2221. m->flag |= NOSPACE;
  2222. }
  2223. for (i = 0; (m->desc[i++] = *l++) != '\0' && i < sizeof(m->desc); )
  2224. continue;
  2225. if (m->desc[0] == '\0') {
  2226. // Tuck in the filename for debugging.
  2227. strlcpy(m->desc + 1, file, sizeof(m->desc) - 1);
  2228. }
  2229. if (i == sizeof(m->desc)) {
  2230. m->desc[sizeof(m->desc) - 1] = '\0';
  2231. if (ms->flags & MAGIC_CHECK)
  2232. file_magwarn(ms, "description `%s' truncated", m->desc);
  2233. }
  2234. /*
  2235. * We only do this check while compiling, or if any of the magic
  2236. * files were not compiled.
  2237. */
  2238. if (ms->flags & MAGIC_CHECK) {
  2239. if (check_format(ms, m) == -1)
  2240. return -1;
  2241. }
  2242. #ifndef COMPILE_ONLY
  2243. if (action == FILE_CHECK) {
  2244. file_mdump(m);
  2245. }
  2246. #endif
  2247. m->mimetype[0] = '\0'; /* initialise MIME type to none */
  2248. return 0;
  2249. }
  2250. /*
  2251. * parse a STRENGTH annotation line from magic file, put into magic[index - 1]
  2252. * if valid
  2253. */
  2254. /*ARGSUSED*/
  2255. file_private int
  2256. parse_strength(struct magic_set *ms, struct magic_entry *me, const char *line,
  2257. size_t len __attribute__((__unused__)))
  2258. {
  2259. const char *l = line;
  2260. char *el;
  2261. unsigned long factor;
  2262. char sbuf[512];
  2263. struct magic *m = &me->mp[0];
  2264. if (m->factor_op != FILE_FACTOR_OP_NONE) {
  2265. file_magwarn(ms,
  2266. "Current entry already has a strength type: %c %d",
  2267. m->factor_op, m->factor);
  2268. return -1;
  2269. }
  2270. if (m->type == FILE_NAME) {
  2271. file_magwarn(ms, "%s: Strength setting is not supported in "
  2272. "\"name\" magic entries",
  2273. file_printable(ms, sbuf, sizeof(sbuf), m->value.s,
  2274. sizeof(m->value.s)));
  2275. return -1;
  2276. }
  2277. EATAB;
  2278. switch (*l) {
  2279. case FILE_FACTOR_OP_NONE:
  2280. break;
  2281. case FILE_FACTOR_OP_PLUS:
  2282. case FILE_FACTOR_OP_MINUS:
  2283. case FILE_FACTOR_OP_TIMES:
  2284. case FILE_FACTOR_OP_DIV:
  2285. m->factor_op = *l++;
  2286. break;
  2287. default:
  2288. file_magwarn(ms, "Unknown factor op `%c'", *l);
  2289. return -1;
  2290. }
  2291. EATAB;
  2292. factor = strtoul(l, &el, 0);
  2293. if (factor > 255) {
  2294. file_magwarn(ms, "Too large factor `%lu'", factor);
  2295. goto out;
  2296. }
  2297. if (*el && !isspace(CAST(unsigned char, *el))) {
  2298. file_magwarn(ms, "Bad factor `%s'", l);
  2299. goto out;
  2300. }
  2301. m->factor = CAST(uint8_t, factor);
  2302. if (m->factor == 0 && m->factor_op == FILE_FACTOR_OP_DIV) {
  2303. file_magwarn(ms, "Cannot have factor op `%c' and factor %u",
  2304. m->factor_op, m->factor);
  2305. goto out;
  2306. }
  2307. return 0;
  2308. out:
  2309. m->factor_op = FILE_FACTOR_OP_NONE;
  2310. m->factor = 0;
  2311. return -1;
  2312. }
  2313. file_private int
  2314. goodchar(unsigned char x, const char *extra)
  2315. {
  2316. return (isascii(x) && isalnum(x)) || strchr(extra, x);
  2317. }
  2318. file_private int
  2319. parse_extra(struct magic_set *ms, struct magic_entry *me, const char *line,
  2320. size_t llen, off_t off, size_t len, const char *name, const char *extra,
  2321. int nt)
  2322. {
  2323. size_t i;
  2324. const char *l = line;
  2325. struct magic *m = &me->mp[me->cont_count == 0 ? 0 : me->cont_count - 1];
  2326. char *buf = CAST(char *, CAST(void *, m)) + off;
  2327. if (buf[0] != '\0') {
  2328. len = nt ? strlen(buf) : len;
  2329. file_magwarn(ms, "Current entry already has a %s type "
  2330. "`%.*s', new type `%s'", name, CAST(int, len), buf, l);
  2331. return -1;
  2332. }
  2333. if (*m->desc == '\0') {
  2334. file_magwarn(ms, "Current entry does not yet have a "
  2335. "description for adding a %s type", name);
  2336. return -1;
  2337. }
  2338. EATAB;
  2339. for (i = 0; *l && i < llen && i < len && goodchar(*l, extra);
  2340. buf[i++] = *l++)
  2341. continue;
  2342. if (i == len && *l) {
  2343. if (nt)
  2344. buf[len - 1] = '\0';
  2345. if (ms->flags & MAGIC_CHECK)
  2346. file_magwarn(ms, "%s type `%s' truncated %"
  2347. SIZE_T_FORMAT "u", name, line, i);
  2348. } else {
  2349. if (!isspace(CAST(unsigned char, *l)) && !goodchar(*l, extra))
  2350. file_magwarn(ms, "%s type `%s' has bad char '%c'",
  2351. name, line, *l);
  2352. if (nt)
  2353. buf[i] = '\0';
  2354. }
  2355. if (i > 0)
  2356. return 0;
  2357. file_magerror(ms, "Bad magic entry '%s'", line);
  2358. return -1;
  2359. }
  2360. /*
  2361. * Parse an Apple CREATOR/TYPE annotation from magic file and put it into
  2362. * magic[index - 1]
  2363. */
  2364. file_private int
  2365. parse_apple(struct magic_set *ms, struct magic_entry *me, const char *line,
  2366. size_t len)
  2367. {
  2368. return parse_extra(ms, me, line, len,
  2369. CAST(off_t, offsetof(struct magic, apple)),
  2370. sizeof(me->mp[me->cont_count - 1].apple), "APPLE", "!+-./?", 0);
  2371. }
  2372. /*
  2373. * Parse a comma-separated list of extensions
  2374. */
  2375. file_private int
  2376. parse_ext(struct magic_set *ms, struct magic_entry *me, const char *line,
  2377. size_t len)
  2378. {
  2379. return parse_extra(ms, me, line, len,
  2380. CAST(off_t, offsetof(struct magic, ext)),
  2381. sizeof(me->mp[me->cont_count - 1].ext), "EXTENSION", ",!+-/@?_$&~",
  2382. 0);
  2383. /* & for b&w */
  2384. /* ~ for journal~ */
  2385. }
  2386. /*
  2387. * parse a MIME annotation line from magic file, put into magic[index - 1]
  2388. * if valid
  2389. */
  2390. file_private int
  2391. parse_mime(struct magic_set *ms, struct magic_entry *me, const char *line,
  2392. size_t len)
  2393. {
  2394. return parse_extra(ms, me, line, len,
  2395. CAST(off_t, offsetof(struct magic, mimetype)),
  2396. sizeof(me->mp[me->cont_count - 1].mimetype), "MIME", "+-/.$?:{};=",
  2397. 1);
  2398. }
  2399. file_private int
  2400. check_format_type(const char *ptr, int type, const char **estr)
  2401. {
  2402. int quad = 0, h;
  2403. size_t len, cnt;
  2404. if (*ptr == '\0') {
  2405. /* Missing format string; bad */
  2406. *estr = "missing format spec";
  2407. return -1;
  2408. }
  2409. switch (file_formats[type]) {
  2410. case FILE_FMT_QUAD:
  2411. quad = 1;
  2412. /*FALLTHROUGH*/
  2413. case FILE_FMT_NUM:
  2414. if (quad == 0) {
  2415. switch (type) {
  2416. case FILE_BYTE:
  2417. h = 2;
  2418. break;
  2419. case FILE_SHORT:
  2420. case FILE_BESHORT:
  2421. case FILE_LESHORT:
  2422. h = 1;
  2423. break;
  2424. case FILE_LONG:
  2425. case FILE_BELONG:
  2426. case FILE_LELONG:
  2427. case FILE_MELONG:
  2428. case FILE_LEID3:
  2429. case FILE_BEID3:
  2430. case FILE_INDIRECT:
  2431. h = 0;
  2432. break;
  2433. default:
  2434. fprintf(stderr, "Bad number format %d", type);
  2435. abort();
  2436. }
  2437. } else
  2438. h = 0;
  2439. while (*ptr && strchr("-.#", *ptr) != NULL)
  2440. ptr++;
  2441. #define CHECKLEN() do { \
  2442. for (len = cnt = 0; isdigit(CAST(unsigned char, *ptr)); ptr++, cnt++) \
  2443. len = len * 10 + (*ptr - '0'); \
  2444. if (cnt > 5 || len > 1024) \
  2445. goto toolong; \
  2446. } while (/*CONSTCOND*/0)
  2447. CHECKLEN();
  2448. if (*ptr == '.')
  2449. ptr++;
  2450. CHECKLEN();
  2451. if (quad) {
  2452. if (*ptr++ != 'l')
  2453. goto invalid;
  2454. if (*ptr++ != 'l')
  2455. goto invalid;
  2456. }
  2457. switch (*ptr++) {
  2458. #ifdef STRICT_FORMAT /* "long" formats are int formats for us */
  2459. /* so don't accept the 'l' modifier */
  2460. case 'l':
  2461. switch (*ptr++) {
  2462. case 'i':
  2463. case 'd':
  2464. case 'u':
  2465. case 'o':
  2466. case 'x':
  2467. case 'X':
  2468. if (h == 0)
  2469. return 0;
  2470. /*FALLTHROUGH*/
  2471. default:
  2472. goto invalid;
  2473. }
  2474. /*
  2475. * Don't accept h and hh modifiers. They make writing
  2476. * magic entries more complicated, for very little benefit
  2477. */
  2478. case 'h':
  2479. if (h-- <= 0)
  2480. goto invalid;
  2481. switch (*ptr++) {
  2482. case 'h':
  2483. if (h-- <= 0)
  2484. goto invalid;
  2485. switch (*ptr++) {
  2486. case 'i':
  2487. case 'd':
  2488. case 'u':
  2489. case 'o':
  2490. case 'x':
  2491. case 'X':
  2492. return 0;
  2493. default:
  2494. goto invalid;
  2495. }
  2496. case 'i':
  2497. case 'd':
  2498. case 'u':
  2499. case 'o':
  2500. case 'x':
  2501. case 'X':
  2502. if (h == 0)
  2503. return 0;
  2504. /*FALLTHROUGH*/
  2505. default:
  2506. goto invalid;
  2507. }
  2508. #endif
  2509. case 'c':
  2510. if (h == 2)
  2511. return 0;
  2512. goto invalid;
  2513. case 'i':
  2514. case 'd':
  2515. case 'u':
  2516. case 'o':
  2517. case 'x':
  2518. case 'X':
  2519. #ifdef STRICT_FORMAT
  2520. if (h == 0)
  2521. return 0;
  2522. /*FALLTHROUGH*/
  2523. #else
  2524. return 0;
  2525. #endif
  2526. default:
  2527. goto invalid;
  2528. }
  2529. case FILE_FMT_FLOAT:
  2530. case FILE_FMT_DOUBLE:
  2531. if (*ptr == '-')
  2532. ptr++;
  2533. if (*ptr == '.')
  2534. ptr++;
  2535. CHECKLEN();
  2536. if (*ptr == '.')
  2537. ptr++;
  2538. CHECKLEN();
  2539. switch (*ptr++) {
  2540. case 'e':
  2541. case 'E':
  2542. case 'f':
  2543. case 'F':
  2544. case 'g':
  2545. case 'G':
  2546. return 0;
  2547. default:
  2548. goto invalid;
  2549. }
  2550. case FILE_FMT_STR:
  2551. if (*ptr == '-')
  2552. ptr++;
  2553. while (isdigit(CAST(unsigned char, *ptr)))
  2554. ptr++;
  2555. if (*ptr == '.') {
  2556. ptr++;
  2557. while (isdigit(CAST(unsigned char , *ptr)))
  2558. ptr++;
  2559. }
  2560. switch (*ptr++) {
  2561. case 's':
  2562. return 0;
  2563. default:
  2564. goto invalid;
  2565. }
  2566. default:
  2567. /* internal error */
  2568. fprintf(stderr, "Bad file format %d", type);
  2569. abort();
  2570. }
  2571. invalid:
  2572. *estr = "not valid";
  2573. return -1;
  2574. toolong:
  2575. *estr = "too long";
  2576. return -1;
  2577. }
  2578. /*
  2579. * Check that the optional printf format in description matches
  2580. * the type of the magic.
  2581. */
  2582. file_private int
  2583. check_format(struct magic_set *ms, struct magic *m)
  2584. {
  2585. char *ptr;
  2586. const char *estr;
  2587. for (ptr = m->desc; *ptr; ptr++)
  2588. if (*ptr == '%')
  2589. break;
  2590. if (*ptr == '\0') {
  2591. /* No format string; ok */
  2592. return 1;
  2593. }
  2594. assert(file_nformats == file_nnames);
  2595. if (m->type >= file_nformats) {
  2596. file_magwarn(ms, "Internal error inconsistency between "
  2597. "m->type and format strings");
  2598. return -1;
  2599. }
  2600. if (file_formats[m->type] == FILE_FMT_NONE) {
  2601. file_magwarn(ms, "No format string for `%s' with description "
  2602. "`%s'", m->desc, file_names[m->type]);
  2603. return -1;
  2604. }
  2605. ptr++;
  2606. if (check_format_type(ptr, m->type, &estr) == -1) {
  2607. /*
  2608. * TODO: this error message is unhelpful if the format
  2609. * string is not one character long
  2610. */
  2611. file_magwarn(ms, "Printf format is %s for type "
  2612. "`%s' in description `%s'", estr,
  2613. file_names[m->type], m->desc);
  2614. return -1;
  2615. }
  2616. for (; *ptr; ptr++) {
  2617. if (*ptr == '%') {
  2618. file_magwarn(ms,
  2619. "Too many format strings (should have at most one) "
  2620. "for `%s' with description `%s'",
  2621. file_names[m->type], m->desc);
  2622. return -1;
  2623. }
  2624. }
  2625. return 0;
  2626. }
  2627. /*
  2628. * Read a numeric value from a pointer, into the value union of a magic
  2629. * pointer, according to the magic type. Update the string pointer to point
  2630. * just after the number read. Return 0 for success, non-zero for failure.
  2631. */
  2632. file_private int
  2633. getvalue(struct magic_set *ms, struct magic *m, const char **p, int action)
  2634. {
  2635. char *ep;
  2636. uint64_t ull;
  2637. int y;
  2638. switch (m->type) {
  2639. case FILE_BESTRING16:
  2640. case FILE_LESTRING16:
  2641. case FILE_STRING:
  2642. case FILE_PSTRING:
  2643. case FILE_REGEX:
  2644. case FILE_SEARCH:
  2645. case FILE_NAME:
  2646. case FILE_USE:
  2647. case FILE_DER:
  2648. case FILE_OCTAL:
  2649. *p = getstr(ms, m, *p, action == FILE_COMPILE);
  2650. if (*p == NULL) {
  2651. if (ms->flags & MAGIC_CHECK)
  2652. file_magwarn(ms, "cannot get string from `%s'",
  2653. m->value.s);
  2654. return -1;
  2655. }
  2656. if (m->type == FILE_REGEX) {
  2657. file_regex_t rx;
  2658. int rc =
  2659. file_regcomp(ms, &rx, m->value.s, REG_EXTENDED);
  2660. if (rc == 0) {
  2661. file_regfree(&rx);
  2662. }
  2663. return rc ? -1 : 0;
  2664. }
  2665. return 0;
  2666. default:
  2667. if (m->reln == 'x')
  2668. return 0;
  2669. break;
  2670. }
  2671. switch (m->type) {
  2672. case FILE_FLOAT:
  2673. case FILE_BEFLOAT:
  2674. case FILE_LEFLOAT:
  2675. errno = 0;
  2676. #ifdef HAVE_STRTOF
  2677. m->value.f = strtof(*p, &ep);
  2678. #else
  2679. m->value.f = (float)strtod(*p, &ep);
  2680. #endif
  2681. if (errno == 0)
  2682. *p = ep;
  2683. return 0;
  2684. case FILE_DOUBLE:
  2685. case FILE_BEDOUBLE:
  2686. case FILE_LEDOUBLE:
  2687. errno = 0;
  2688. m->value.d = strtod(*p, &ep);
  2689. if (errno == 0)
  2690. *p = ep;
  2691. return 0;
  2692. case FILE_GUID:
  2693. if (file_parse_guid(*p, m->value.guid) == -1)
  2694. return -1;
  2695. *p += FILE_GUID_SIZE - 1;
  2696. return 0;
  2697. default:
  2698. errno = 0;
  2699. ull = CAST(uint64_t, strtoull(*p, &ep, 0));
  2700. m->value.q = file_signextend(ms, m, ull);
  2701. if (*p == ep) {
  2702. file_magwarn(ms, "Unparsable number `%s'", *p);
  2703. return -1;
  2704. } else {
  2705. size_t ts = typesize(m->type);
  2706. uint64_t x;
  2707. const char *q;
  2708. if (ts == FILE_BADSIZE) {
  2709. file_magwarn(ms,
  2710. "Expected numeric type got `%s'",
  2711. type_tbl[m->type].name);
  2712. return -1;
  2713. }
  2714. for (q = *p; isspace(CAST(unsigned char, *q)); q++)
  2715. continue;
  2716. if (*q == '-' && ull != UINT64_MAX)
  2717. ull = -CAST(int64_t, ull);
  2718. switch (ts) {
  2719. case 1:
  2720. x = CAST(uint64_t, ull & ~0xffULL);
  2721. y = (x & ~0xffULL) != ~0xffULL;
  2722. break;
  2723. case 2:
  2724. x = CAST(uint64_t, ull & ~0xffffULL);
  2725. y = (x & ~0xffffULL) != ~0xffffULL;
  2726. break;
  2727. case 4:
  2728. x = CAST(uint64_t, ull & ~0xffffffffULL);
  2729. y = (x & ~0xffffffffULL) != ~0xffffffffULL;
  2730. break;
  2731. case 8:
  2732. x = 0;
  2733. y = 0;
  2734. break;
  2735. default:
  2736. fprintf(stderr, "Bad width %zu", ts);
  2737. abort();
  2738. }
  2739. if (x && y) {
  2740. file_magwarn(ms, "Overflow for numeric"
  2741. " type `%s' value %#" PRIx64,
  2742. type_tbl[m->type].name, ull);
  2743. return -1;
  2744. }
  2745. }
  2746. if (errno == 0) {
  2747. *p = ep;
  2748. eatsize(p);
  2749. }
  2750. return 0;
  2751. }
  2752. }
  2753. /*
  2754. * Convert a string containing C character escapes. Stop at an unescaped
  2755. * space or tab.
  2756. * Copy the converted version to "m->value.s", and the length in m->vallen.
  2757. * Return updated scan pointer as function result. Warn if set.
  2758. */
  2759. file_private const char *
  2760. getstr(struct magic_set *ms, struct magic *m, const char *s, int warn)
  2761. {
  2762. const char *origs = s;
  2763. char *p = m->value.s;
  2764. size_t plen = sizeof(m->value.s);
  2765. char *origp = p;
  2766. char *pmax = p + plen - 1;
  2767. int c;
  2768. int val;
  2769. size_t bracket_nesting = 0;
  2770. while ((c = *s++) != '\0') {
  2771. if (isspace(CAST(unsigned char, c)))
  2772. break;
  2773. if (p >= pmax) {
  2774. file_error(ms, 0, "string too long: `%s'", origs);
  2775. return NULL;
  2776. }
  2777. if (c != '\\') {
  2778. if (c == '[') {
  2779. bracket_nesting++;
  2780. }
  2781. if (c == ']' && bracket_nesting > 0) {
  2782. bracket_nesting--;
  2783. }
  2784. *p++ = CAST(char, c);
  2785. continue;
  2786. }
  2787. switch(c = *s++) {
  2788. case '\0':
  2789. if (warn)
  2790. file_magwarn(ms, "incomplete escape");
  2791. s--;
  2792. goto out;
  2793. case '.':
  2794. if (m->type == FILE_REGEX &&
  2795. bracket_nesting == 0 && warn) {
  2796. file_magwarn(ms, "escaped dot ('.') found, "
  2797. "use \\\\. instead");
  2798. }
  2799. warn = 0; /* already did */
  2800. /*FALLTHROUGH*/
  2801. case '\t':
  2802. if (warn) {
  2803. file_magwarn(ms,
  2804. "escaped tab found, use \\\\t instead");
  2805. warn = 0; /* already did */
  2806. }
  2807. /*FALLTHROUGH*/
  2808. default:
  2809. if (warn) {
  2810. if (isprint(CAST(unsigned char, c))) {
  2811. /* Allow escaping of
  2812. * ``relations'' */
  2813. if (strchr("<>&^=!", c) == NULL
  2814. && (m->type != FILE_REGEX ||
  2815. strchr("[]().*?^$|{}", c)
  2816. == NULL)) {
  2817. file_magwarn(ms, "no "
  2818. "need to escape "
  2819. "`%c'", c);
  2820. }
  2821. } else {
  2822. file_magwarn(ms,
  2823. "unknown escape sequence: "
  2824. "\\%03o", c);
  2825. }
  2826. }
  2827. /*FALLTHROUGH*/
  2828. /* space, perhaps force people to use \040? */
  2829. case ' ':
  2830. #if 0
  2831. /*
  2832. * Other things people escape, but shouldn't need to,
  2833. * so we disallow them
  2834. */
  2835. case '\'':
  2836. case '"':
  2837. case '?':
  2838. #endif
  2839. /* Relations */
  2840. case '>':
  2841. case '<':
  2842. case '&':
  2843. case '^':
  2844. case '=':
  2845. case '!':
  2846. /* and backslash itself */
  2847. case '\\':
  2848. *p++ = CAST(char, c);
  2849. break;
  2850. case 'a':
  2851. *p++ = '\a';
  2852. break;
  2853. case 'b':
  2854. *p++ = '\b';
  2855. break;
  2856. case 'f':
  2857. *p++ = '\f';
  2858. break;
  2859. case 'n':
  2860. *p++ = '\n';
  2861. break;
  2862. case 'r':
  2863. *p++ = '\r';
  2864. break;
  2865. case 't':
  2866. *p++ = '\t';
  2867. break;
  2868. case 'v':
  2869. *p++ = '\v';
  2870. break;
  2871. /* \ and up to 3 octal digits */
  2872. case '0':
  2873. case '1':
  2874. case '2':
  2875. case '3':
  2876. case '4':
  2877. case '5':
  2878. case '6':
  2879. case '7':
  2880. val = c - '0';
  2881. c = *s++; /* try for 2 */
  2882. if (c >= '0' && c <= '7') {
  2883. val = (val << 3) | (c - '0');
  2884. c = *s++; /* try for 3 */
  2885. if (c >= '0' && c <= '7')
  2886. val = (val << 3) | (c-'0');
  2887. else
  2888. --s;
  2889. }
  2890. else
  2891. --s;
  2892. *p++ = CAST(char, val);
  2893. break;
  2894. /* \x and up to 2 hex digits */
  2895. case 'x':
  2896. val = 'x'; /* Default if no digits */
  2897. c = hextoint(*s++); /* Get next char */
  2898. if (c >= 0) {
  2899. val = c;
  2900. c = hextoint(*s++);
  2901. if (c >= 0)
  2902. val = (val << 4) + c;
  2903. else
  2904. --s;
  2905. } else
  2906. --s;
  2907. *p++ = CAST(char, val);
  2908. break;
  2909. }
  2910. }
  2911. --s;
  2912. out:
  2913. *p = '\0';
  2914. m->vallen = CAST(unsigned char, (p - origp));
  2915. if (m->type == FILE_PSTRING) {
  2916. size_t l = file_pstring_length_size(ms, m);
  2917. if (l == FILE_BADSIZE)
  2918. return NULL;
  2919. m->vallen += CAST(unsigned char, l);
  2920. }
  2921. return s;
  2922. }
  2923. /* Single hex char to int; -1 if not a hex char. */
  2924. file_private int
  2925. hextoint(int c)
  2926. {
  2927. if (!isascii(CAST(unsigned char, c)))
  2928. return -1;
  2929. if (isdigit(CAST(unsigned char, c)))
  2930. return c - '0';
  2931. if ((c >= 'a') && (c <= 'f'))
  2932. return c + 10 - 'a';
  2933. if (( c>= 'A') && (c <= 'F'))
  2934. return c + 10 - 'A';
  2935. return -1;
  2936. }
  2937. /*
  2938. * Print a string containing C character escapes.
  2939. */
  2940. file_protected void
  2941. file_showstr(FILE *fp, const char *s, size_t len)
  2942. {
  2943. char c;
  2944. for (;;) {
  2945. if (len == FILE_BADSIZE) {
  2946. c = *s++;
  2947. if (c == '\0')
  2948. break;
  2949. }
  2950. else {
  2951. if (len-- == 0)
  2952. break;
  2953. c = *s++;
  2954. }
  2955. if (c >= 040 && c <= 0176) /* TODO isprint && !iscntrl */
  2956. (void) fputc(c, fp);
  2957. else {
  2958. (void) fputc('\\', fp);
  2959. switch (c) {
  2960. case '\a':
  2961. (void) fputc('a', fp);
  2962. break;
  2963. case '\b':
  2964. (void) fputc('b', fp);
  2965. break;
  2966. case '\f':
  2967. (void) fputc('f', fp);
  2968. break;
  2969. case '\n':
  2970. (void) fputc('n', fp);
  2971. break;
  2972. case '\r':
  2973. (void) fputc('r', fp);
  2974. break;
  2975. case '\t':
  2976. (void) fputc('t', fp);
  2977. break;
  2978. case '\v':
  2979. (void) fputc('v', fp);
  2980. break;
  2981. default:
  2982. (void) fprintf(fp, "%.3o", c & 0377);
  2983. break;
  2984. }
  2985. }
  2986. }
  2987. }
  2988. /*
  2989. * eatsize(): Eat the size spec from a number [eg. 10UL]
  2990. */
  2991. file_private void
  2992. eatsize(const char **p)
  2993. {
  2994. const char *l = *p;
  2995. if (LOWCASE(*l) == 'u')
  2996. l++;
  2997. switch (LOWCASE(*l)) {
  2998. case 'l': /* long */
  2999. case 's': /* short */
  3000. case 'h': /* short */
  3001. case 'b': /* char/byte */
  3002. case 'c': /* char/byte */
  3003. l++;
  3004. /*FALLTHROUGH*/
  3005. default:
  3006. break;
  3007. }
  3008. *p = l;
  3009. }
  3010. /*
  3011. * handle a buffer containing a compiled file.
  3012. */
  3013. file_private struct magic_map *
  3014. apprentice_buf(struct magic_set *ms, struct magic *buf, size_t len)
  3015. {
  3016. struct magic_map *map;
  3017. if ((map = CAST(struct magic_map *, calloc(1, sizeof(*map)))) == NULL) {
  3018. file_oomem(ms, sizeof(*map));
  3019. return NULL;
  3020. }
  3021. map->len = len;
  3022. map->p = buf;
  3023. map->type = MAP_TYPE_USER;
  3024. if (check_buffer(ms, map, "buffer") != 0) {
  3025. apprentice_unmap(map);
  3026. return NULL;
  3027. }
  3028. return map;
  3029. }
  3030. /*
  3031. * handle a compiled file.
  3032. */
  3033. file_private struct magic_map *
  3034. apprentice_map(struct magic_set *ms, const char *fn)
  3035. {
  3036. int fd;
  3037. struct stat st;
  3038. char *dbname = NULL;
  3039. struct magic_map *map;
  3040. struct magic_map *rv = NULL;
  3041. fd = -1;
  3042. if ((map = CAST(struct magic_map *, calloc(1, sizeof(*map)))) == NULL) {
  3043. file_oomem(ms, sizeof(*map));
  3044. goto error;
  3045. }
  3046. map->type = MAP_TYPE_USER; /* unspecified */
  3047. dbname = mkdbname(ms, fn, 0);
  3048. if (dbname == NULL)
  3049. goto error;
  3050. if ((fd = open(dbname, O_RDONLY|O_BINARY)) == -1)
  3051. goto error;
  3052. if (fstat(fd, &st) == -1) {
  3053. file_error(ms, errno, "cannot stat `%s'", dbname);
  3054. goto error;
  3055. }
  3056. if (st.st_size < 8 || st.st_size > maxoff_t()) {
  3057. file_error(ms, 0, "file `%s' is too %s", dbname,
  3058. st.st_size < 8 ? "small" : "large");
  3059. goto error;
  3060. }
  3061. map->len = CAST(size_t, st.st_size);
  3062. #ifdef QUICK
  3063. map->type = MAP_TYPE_MMAP;
  3064. if ((map->p = mmap(0, CAST(size_t, st.st_size), PROT_READ|PROT_WRITE,
  3065. MAP_PRIVATE|MAP_FILE, fd, CAST(off_t, 0))) == MAP_FAILED) {
  3066. file_error(ms, errno, "cannot map `%s'", dbname);
  3067. goto error;
  3068. }
  3069. #else
  3070. map->type = MAP_TYPE_MALLOC;
  3071. if ((map->p = CAST(void *, malloc(map->len))) == NULL) {
  3072. file_oomem(ms, map->len);
  3073. goto error;
  3074. }
  3075. if (read(fd, map->p, map->len) != (ssize_t)map->len) {
  3076. file_badread(ms);
  3077. goto error;
  3078. }
  3079. #endif
  3080. (void)close(fd);
  3081. fd = -1;
  3082. if (check_buffer(ms, map, dbname) != 0) {
  3083. goto error;
  3084. }
  3085. #ifdef QUICK
  3086. if (mprotect(map->p, CAST(size_t, st.st_size), PROT_READ) == -1) {
  3087. file_error(ms, errno, "cannot mprotect `%s'", dbname);
  3088. goto error;
  3089. }
  3090. #endif
  3091. free(dbname);
  3092. return map;
  3093. error:
  3094. if (fd != -1)
  3095. (void)close(fd);
  3096. apprentice_unmap(map);
  3097. free(dbname);
  3098. return rv;
  3099. }
  3100. file_private int
  3101. check_buffer(struct magic_set *ms, struct magic_map *map, const char *dbname)
  3102. {
  3103. uint32_t *ptr;
  3104. uint32_t entries, nentries;
  3105. uint32_t version;
  3106. int i, needsbyteswap;
  3107. entries = CAST(uint32_t, map->len / sizeof(struct magic));
  3108. if (entries < MAGIC_SETS + 1) {
  3109. file_error(ms, 0, "Too few magic entries %u in `%s'",
  3110. entries, dbname);
  3111. return -1;
  3112. }
  3113. if ((entries * sizeof(struct magic)) != map->len) {
  3114. file_error(ms, 0, "Size of `%s' %" SIZE_T_FORMAT "u is not "
  3115. "a multiple of %" SIZE_T_FORMAT "u",
  3116. dbname, map->len, sizeof(struct magic));
  3117. return -1;
  3118. }
  3119. ptr = CAST(uint32_t *, map->p);
  3120. if (*ptr != MAGICNO) {
  3121. if (swap4(*ptr) != MAGICNO) {
  3122. file_error(ms, 0, "bad magic in `%s'", dbname);
  3123. return -1;
  3124. }
  3125. needsbyteswap = 1;
  3126. } else
  3127. needsbyteswap = 0;
  3128. if (needsbyteswap)
  3129. version = swap4(ptr[1]);
  3130. else
  3131. version = ptr[1];
  3132. if (version != VERSIONNO) {
  3133. file_error(ms, 0, "File %s supports only version %d magic "
  3134. "files. `%s' is version %d", VERSION,
  3135. VERSIONNO, dbname, version);
  3136. return -1;
  3137. }
  3138. map->magic[0] = CAST(struct magic *, map->p) + 1;
  3139. nentries = 0;
  3140. for (i = 0; i < MAGIC_SETS; i++) {
  3141. if (needsbyteswap)
  3142. map->nmagic[i] = swap4(ptr[i + 2]);
  3143. else
  3144. map->nmagic[i] = ptr[i + 2];
  3145. if (i != MAGIC_SETS - 1)
  3146. map->magic[i + 1] = map->magic[i] + map->nmagic[i];
  3147. nentries += map->nmagic[i];
  3148. }
  3149. if (entries != nentries + 1) {
  3150. file_error(ms, 0, "Inconsistent entries in `%s' %u != %u",
  3151. dbname, entries, nentries + 1);
  3152. return -1;
  3153. }
  3154. if (needsbyteswap)
  3155. for (i = 0; i < MAGIC_SETS; i++)
  3156. byteswap(map->magic[i], map->nmagic[i]);
  3157. return 0;
  3158. }
  3159. /*
  3160. * handle an mmaped file.
  3161. */
  3162. file_private int
  3163. apprentice_compile(struct magic_set *ms, struct magic_map *map, const char *fn)
  3164. {
  3165. static const size_t nm = sizeof(*map->nmagic) * MAGIC_SETS;
  3166. static const size_t m = sizeof(**map->magic);
  3167. int fd = -1;
  3168. size_t len;
  3169. char *dbname;
  3170. int rv = -1;
  3171. uint32_t i;
  3172. union {
  3173. struct magic m;
  3174. uint32_t h[2 + MAGIC_SETS];
  3175. } hdr;
  3176. dbname = mkdbname(ms, fn, 1);
  3177. if (dbname == NULL)
  3178. goto out;
  3179. if ((fd = open(dbname, O_WRONLY|O_CREAT|O_TRUNC|O_BINARY, 0644)) == -1)
  3180. {
  3181. file_error(ms, errno, "cannot open `%s'", dbname);
  3182. goto out;
  3183. }
  3184. memset(&hdr, 0, sizeof(hdr));
  3185. hdr.h[0] = MAGICNO;
  3186. hdr.h[1] = VERSIONNO;
  3187. memcpy(hdr.h + 2, map->nmagic, nm);
  3188. if (write(fd, &hdr, sizeof(hdr)) != CAST(ssize_t, sizeof(hdr))) {
  3189. file_error(ms, errno, "error writing `%s'", dbname);
  3190. goto out2;
  3191. }
  3192. for (i = 0; i < MAGIC_SETS; i++) {
  3193. len = m * map->nmagic[i];
  3194. if (write(fd, map->magic[i], len) != CAST(ssize_t, len)) {
  3195. file_error(ms, errno, "error writing `%s'", dbname);
  3196. goto out2;
  3197. }
  3198. }
  3199. rv = 0;
  3200. out2:
  3201. if (fd != -1)
  3202. (void)close(fd);
  3203. out:
  3204. apprentice_unmap(map);
  3205. free(dbname);
  3206. return rv;
  3207. }
  3208. file_private const char ext[] = ".mgc";
  3209. /*
  3210. * make a dbname
  3211. */
  3212. file_private char *
  3213. mkdbname(struct magic_set *ms, const char *fn, int strip)
  3214. {
  3215. const char *p, *q;
  3216. char *buf;
  3217. if (strip) {
  3218. if ((p = strrchr(fn, '/')) != NULL)
  3219. fn = ++p;
  3220. }
  3221. for (q = fn; *q; q++)
  3222. continue;
  3223. /* Look for .mgc */
  3224. for (p = ext + sizeof(ext) - 1; p >= ext && q >= fn; p--, q--)
  3225. if (*p != *q)
  3226. break;
  3227. /* Did not find .mgc, restore q */
  3228. if (p >= ext)
  3229. for (q = fn; *q; q++)
  3230. continue;
  3231. q++;
  3232. /* Compatibility with old code that looked in .mime */
  3233. if (ms->flags & MAGIC_MIME) {
  3234. if (asprintf(&buf, "%.*s.mime%s", CAST(int, q - fn), fn, ext)
  3235. < 0)
  3236. return NULL;
  3237. if (access(buf, R_OK) != -1) {
  3238. ms->flags &= MAGIC_MIME_TYPE;
  3239. return buf;
  3240. }
  3241. free(buf);
  3242. }
  3243. if (asprintf(&buf, "%.*s%s", CAST(int, q - fn), fn, ext) < 0)
  3244. return NULL;
  3245. /* Compatibility with old code that looked in .mime */
  3246. if (strstr(fn, ".mime") != NULL)
  3247. ms->flags &= MAGIC_MIME_TYPE;
  3248. return buf;
  3249. }
  3250. /*
  3251. * Byteswap an mmap'ed file if needed
  3252. */
  3253. file_private void
  3254. byteswap(struct magic *magic, uint32_t nmagic)
  3255. {
  3256. uint32_t i;
  3257. for (i = 0; i < nmagic; i++)
  3258. bs1(&magic[i]);
  3259. }
  3260. #if !defined(HAVE_BYTESWAP_H) && !defined(HAVE_SYS_BSWAP_H)
  3261. /*
  3262. * swap a short
  3263. */
  3264. file_private uint16_t
  3265. swap2(uint16_t sv)
  3266. {
  3267. uint16_t rv;
  3268. uint8_t *s = RCAST(uint8_t *, RCAST(void *, &sv));
  3269. uint8_t *d = RCAST(uint8_t *, RCAST(void *, &rv));
  3270. d[0] = s[1];
  3271. d[1] = s[0];
  3272. return rv;
  3273. }
  3274. /*
  3275. * swap an int
  3276. */
  3277. file_private uint32_t
  3278. swap4(uint32_t sv)
  3279. {
  3280. uint32_t rv;
  3281. uint8_t *s = RCAST(uint8_t *, RCAST(void *, &sv));
  3282. uint8_t *d = RCAST(uint8_t *, RCAST(void *, &rv));
  3283. d[0] = s[3];
  3284. d[1] = s[2];
  3285. d[2] = s[1];
  3286. d[3] = s[0];
  3287. return rv;
  3288. }
  3289. /*
  3290. * swap a quad
  3291. */
  3292. file_private uint64_t
  3293. swap8(uint64_t sv)
  3294. {
  3295. uint64_t rv;
  3296. uint8_t *s = RCAST(uint8_t *, RCAST(void *, &sv));
  3297. uint8_t *d = RCAST(uint8_t *, RCAST(void *, &rv));
  3298. # if 0
  3299. d[0] = s[3];
  3300. d[1] = s[2];
  3301. d[2] = s[1];
  3302. d[3] = s[0];
  3303. d[4] = s[7];
  3304. d[5] = s[6];
  3305. d[6] = s[5];
  3306. d[7] = s[4];
  3307. # else
  3308. d[0] = s[7];
  3309. d[1] = s[6];
  3310. d[2] = s[5];
  3311. d[3] = s[4];
  3312. d[4] = s[3];
  3313. d[5] = s[2];
  3314. d[6] = s[1];
  3315. d[7] = s[0];
  3316. # endif
  3317. return rv;
  3318. }
  3319. #endif
  3320. file_protected uintmax_t
  3321. file_varint2uintmax_t(const unsigned char *us, int t, size_t *l)
  3322. {
  3323. uintmax_t x = 0;
  3324. const unsigned char *c;
  3325. if (t == FILE_LEVARINT) {
  3326. for (c = us; *c; c++) {
  3327. if ((*c & 0x80) == 0)
  3328. break;
  3329. }
  3330. if (l)
  3331. *l = c - us + 1;
  3332. for (; c >= us; c--) {
  3333. x |= *c & 0x7f;
  3334. x <<= 7;
  3335. }
  3336. } else {
  3337. for (c = us; *c; c++) {
  3338. x |= *c & 0x7f;
  3339. if ((*c & 0x80) == 0)
  3340. break;
  3341. x <<= 7;
  3342. }
  3343. if (l)
  3344. *l = c - us + 1;
  3345. }
  3346. return x;
  3347. }
  3348. /*
  3349. * byteswap a single magic entry
  3350. */
  3351. file_private void
  3352. bs1(struct magic *m)
  3353. {
  3354. m->cont_level = swap2(m->cont_level);
  3355. m->offset = swap4(CAST(uint32_t, m->offset));
  3356. m->in_offset = swap4(CAST(uint32_t, m->in_offset));
  3357. m->lineno = swap4(CAST(uint32_t, m->lineno));
  3358. if (IS_STRING(m->type)) {
  3359. m->str_range = swap4(m->str_range);
  3360. m->str_flags = swap4(m->str_flags);
  3361. }
  3362. else {
  3363. m->value.q = swap8(m->value.q);
  3364. m->num_mask = swap8(m->num_mask);
  3365. }
  3366. }
  3367. file_protected size_t
  3368. file_pstring_length_size(struct magic_set *ms, const struct magic *m)
  3369. {
  3370. switch (m->str_flags & PSTRING_LEN) {
  3371. case PSTRING_1_LE:
  3372. return 1;
  3373. case PSTRING_2_LE:
  3374. case PSTRING_2_BE:
  3375. return 2;
  3376. case PSTRING_4_LE:
  3377. case PSTRING_4_BE:
  3378. return 4;
  3379. default:
  3380. file_error(ms, 0, "corrupt magic file "
  3381. "(bad pascal string length %d)",
  3382. m->str_flags & PSTRING_LEN);
  3383. return FILE_BADSIZE;
  3384. }
  3385. }
  3386. file_protected size_t
  3387. file_pstring_get_length(struct magic_set *ms, const struct magic *m,
  3388. const char *ss)
  3389. {
  3390. size_t len = 0;
  3391. const unsigned char *s = RCAST(const unsigned char *, ss);
  3392. unsigned int s3, s2, s1, s0;
  3393. switch (m->str_flags & PSTRING_LEN) {
  3394. case PSTRING_1_LE:
  3395. len = *s;
  3396. break;
  3397. case PSTRING_2_LE:
  3398. s0 = s[0];
  3399. s1 = s[1];
  3400. len = (s1 << 8) | s0;
  3401. break;
  3402. case PSTRING_2_BE:
  3403. s0 = s[0];
  3404. s1 = s[1];
  3405. len = (s0 << 8) | s1;
  3406. break;
  3407. case PSTRING_4_LE:
  3408. s0 = s[0];
  3409. s1 = s[1];
  3410. s2 = s[2];
  3411. s3 = s[3];
  3412. len = (s3 << 24) | (s2 << 16) | (s1 << 8) | s0;
  3413. break;
  3414. case PSTRING_4_BE:
  3415. s0 = s[0];
  3416. s1 = s[1];
  3417. s2 = s[2];
  3418. s3 = s[3];
  3419. len = (s0 << 24) | (s1 << 16) | (s2 << 8) | s3;
  3420. break;
  3421. default:
  3422. file_error(ms, 0, "corrupt magic file "
  3423. "(bad pascal string length %d)",
  3424. m->str_flags & PSTRING_LEN);
  3425. return FILE_BADSIZE;
  3426. }
  3427. if (m->str_flags & PSTRING_LENGTH_INCLUDES_ITSELF) {
  3428. size_t l = file_pstring_length_size(ms, m);
  3429. if (l == FILE_BADSIZE)
  3430. return l;
  3431. len -= l;
  3432. }
  3433. return len;
  3434. }
  3435. file_protected int
  3436. file_magicfind(struct magic_set *ms, const char *name, struct mlist *v)
  3437. {
  3438. uint32_t i, j;
  3439. struct mlist *mlist, *ml;
  3440. mlist = ms->mlist[1];
  3441. for (ml = mlist->next; ml != mlist; ml = ml->next) {
  3442. struct magic *ma = ml->magic;
  3443. for (i = 0; i < ml->nmagic; i++) {
  3444. if (ma[i].type != FILE_NAME)
  3445. continue;
  3446. if (strcmp(ma[i].value.s, name) == 0) {
  3447. v->magic = &ma[i];
  3448. v->magic_rxcomp = &(ml->magic_rxcomp[i]);
  3449. for (j = i + 1; j < ml->nmagic; j++)
  3450. if (ma[j].cont_level == 0)
  3451. break;
  3452. v->nmagic = j - i;
  3453. return 0;
  3454. }
  3455. }
  3456. }
  3457. return -1;
  3458. }