scat.c 30 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676
  1. /*
  2. * This file is part of the UCB release of Plan 9. It is subject to the license
  3. * terms in the LICENSE file found in the top-level directory of this
  4. * distribution and at http://akaros.cs.berkeley.edu/files/Plan9License. No
  5. * part of the UCB release of Plan 9, including this file, may be copied,
  6. * modified, propagated, or distributed except according to the terms contained
  7. * in the LICENSE file.
  8. */
  9. #include <u.h>
  10. #include <libc.h>
  11. #include <bio.h>
  12. #include <draw.h>
  13. #include <event.h>
  14. #include "sky.h"
  15. #include "strings.c"
  16. enum
  17. {
  18. NNGC=7840, /* number of NGC numbers [1..NNGC] */
  19. NIC = 5386, /* number of IC numbers */
  20. NNGCrec=NNGC+NIC, /* number of records in the NGC catalog (including IC's, starting at NNGC */
  21. NMrec=122, /* number of M records */
  22. NM=110, /* number of M numbers */
  23. NAbell=2712, /* number of records in the Abell catalog */
  24. NName=1000, /* number of prose names; estimated maximum (read from editable text file) */
  25. NBayer=1517, /* number of bayer entries */
  26. NSAO=258998, /* number of SAO stars */
  27. MAXcon=1932, /* maximum number of patches in a constellation */
  28. Ncon=88, /* number of constellations */
  29. Npatch=92053, /* highest patch number */
  30. };
  31. char ngctype[NNGCrec];
  32. Mindexrec mindex[NMrec];
  33. Namerec name[NName];
  34. Bayerec bayer[NBayer];
  35. int32_t con[MAXcon];
  36. uint16_t conindex[Ncon+1];
  37. int32_t patchaddr[Npatch+1];
  38. Record *rec;
  39. Record *orec;
  40. Record *cur;
  41. char *dir=DIR;
  42. int saodb;
  43. int ngcdb;
  44. int abelldb;
  45. int ngctypedb;
  46. int mindexdb;
  47. int namedb;
  48. int bayerdb;
  49. int condb;
  50. int conindexdb;
  51. int patchdb;
  52. char parsed[3];
  53. int32_t nrec;
  54. int32_t nreca;
  55. int32_t norec;
  56. int32_t noreca;
  57. Biobuf bin;
  58. Biobuf bout;
  59. main(int argc, char *argv[])
  60. {
  61. char *line;
  62. Binit(&bin, 0, OREAD);
  63. Binit(&bout, 1, OWRITE);
  64. if(argc != 1)
  65. dir = argv[1];
  66. astro("", 1);
  67. while(line = Brdline(&bin, '\n')){
  68. line[Blinelen(&bin)-1] = 0;
  69. lookup(line, 1);
  70. Bflush(&bout);
  71. }
  72. if(display != nil){
  73. closedisplay(display);
  74. /* automatic refresh of rio window is triggered by mouse */
  75. close(open("/dev/mouse", OREAD));
  76. }
  77. return 0;
  78. }
  79. void
  80. reset(void)
  81. {
  82. nrec = 0;
  83. cur = rec;
  84. }
  85. void
  86. grow(void)
  87. {
  88. nrec++;
  89. if(nreca < nrec){
  90. nreca = nrec+50;
  91. rec = realloc(rec, nreca*sizeof(Record));
  92. if(rec == 0){
  93. fprint(2, "scat: realloc fails\n");
  94. exits("realloc");
  95. }
  96. }
  97. cur = rec+nrec-1;
  98. }
  99. void
  100. copy(void)
  101. {
  102. if(noreca < nreca){
  103. noreca = nreca;
  104. orec = realloc(orec, nreca*sizeof(Record));
  105. if(orec == 0){
  106. fprint(2, "scat: realloc fails\n");
  107. exits("realloc");
  108. }
  109. }
  110. memmove(orec, rec, nrec*sizeof(Record));
  111. norec = nrec;
  112. }
  113. int
  114. eopen(char *s)
  115. {
  116. char buf[128];
  117. int f;
  118. sprint(buf, "%s/%s.scat", dir, s);
  119. f = open(buf, 0);
  120. if(f<0){
  121. fprint(2, "scat: can't open %s\n", buf);
  122. exits("open");
  123. }
  124. return f;
  125. }
  126. void
  127. Eread(int f, char *name, void *addr, int32_t n)
  128. {
  129. if(read(f, addr, n) != n){ /* BUG! */
  130. fprint(2, "scat: read error on %s\n", name);
  131. exits("read");
  132. }
  133. }
  134. char*
  135. skipbl(char *s)
  136. {
  137. while(*s!=0 && (*s==' ' || *s=='\t'))
  138. s++;
  139. return s;
  140. }
  141. char*
  142. skipstr(char *s, char *t)
  143. {
  144. while(*s && *s==*t)
  145. s++, t++;
  146. return skipbl(s);
  147. }
  148. /* produce little-endian long at address l */
  149. int32_t
  150. Long(int32_t *l)
  151. {
  152. uint8_t *p;
  153. p = (uint8_t*)l;
  154. return (int32_t)p[0]|((int32_t)p[1]<<8)|((int32_t)p[2]<<16)|((int32_t)p[3]<<24);
  155. }
  156. /* produce little-endian long at address l */
  157. int
  158. Short(int16_t *s)
  159. {
  160. uint8_t *p;
  161. p = (uint8_t*)s;
  162. return p[0]|(p[1]<<8);
  163. }
  164. void
  165. nameopen(void)
  166. {
  167. Biobuf b;
  168. int i;
  169. char *l, *p;
  170. if(namedb == 0){
  171. namedb = eopen("name");
  172. Binit(&b, namedb, OREAD);
  173. for(i=0; i<NName; i++){
  174. l = Brdline(&b, '\n');
  175. if(l == 0)
  176. break;
  177. p = strchr(l, '\t');
  178. if(p == 0){
  179. Badformat:
  180. Bprint(&bout, "warning: name.scat bad format; line %d\n", i+1);
  181. break;
  182. }
  183. *p++ = 0;
  184. strcpy(name[i].name, l);
  185. if(strncmp(p, "ngc", 3) == 0)
  186. name[i].ngc = atoi(p+3);
  187. else if(strncmp(p, "ic", 2) == 0)
  188. name[i].ngc = atoi(p+2)+NNGC;
  189. else if(strncmp(p, "sao", 3) == 0)
  190. name[i].sao = atoi(p+3);
  191. else if(strncmp(p, "abell", 5) == 0)
  192. name[i].abell = atoi(p+5);
  193. else
  194. goto Badformat;
  195. }
  196. if(i == NName)
  197. Bprint(&bout, "warning: too many names in name.scat (max %d); extra ignored\n", NName);
  198. close(namedb);
  199. bayerdb = eopen("bayer");
  200. Eread(bayerdb, "bayer", bayer, sizeof bayer);
  201. close(bayerdb);
  202. for(i=0; i<NBayer; i++)
  203. bayer[i].sao = Long(&bayer[i].sao);
  204. }
  205. }
  206. void
  207. saoopen(void)
  208. {
  209. if(saodb == 0){
  210. nameopen();
  211. saodb = eopen("sao");
  212. }
  213. }
  214. void
  215. ngcopen(void)
  216. {
  217. if(ngcdb == 0){
  218. nameopen();
  219. ngcdb = eopen("ngc2000");
  220. ngctypedb = eopen("ngc2000type");
  221. Eread(ngctypedb, "ngctype", ngctype, sizeof ngctype);
  222. close(ngctypedb);
  223. }
  224. }
  225. void
  226. abellopen(void)
  227. {
  228. /* nothing extra to do with abell: it's directly indexed by number */
  229. if(abelldb == 0)
  230. abelldb = eopen("abell");
  231. }
  232. void
  233. patchopen(void)
  234. {
  235. Biobuf *b;
  236. int32_t l, m;
  237. char buf[100];
  238. if(patchdb == 0){
  239. patchdb = eopen("patch");
  240. sprint(buf, "%s/patchindex.scat", dir);
  241. b = Bopen(buf, OREAD);
  242. if(b == 0){
  243. fprint(2, "can't open %s\n", buf);
  244. exits("open");
  245. }
  246. for(m=0,l=0; l<=Npatch; l++)
  247. patchaddr[l] = m += Bgetc(b)*4;
  248. Bterm(b);
  249. }
  250. }
  251. void
  252. mopen(void)
  253. {
  254. int i;
  255. if(mindexdb == 0){
  256. mindexdb = eopen("mindex");
  257. Eread(mindexdb, "mindex", mindex, sizeof mindex);
  258. close(mindexdb);
  259. for(i=0; i<NMrec; i++)
  260. mindex[i].ngc = Short(&mindex[i].ngc);
  261. }
  262. }
  263. void
  264. constelopen(void)
  265. {
  266. int i;
  267. if(condb == 0){
  268. condb = eopen("con");
  269. conindexdb = eopen("conindex");
  270. Eread(conindexdb, "conindex", conindex, sizeof conindex);
  271. close(conindexdb);
  272. for(i=0; i<Ncon+1; i++)
  273. conindex[i] = Short((int16_t*)&conindex[i]);
  274. }
  275. }
  276. void
  277. lowercase(char *s)
  278. {
  279. for(; *s; s++)
  280. if('A'<=*s && *s<='Z')
  281. *s += 'a'-'A';
  282. }
  283. int
  284. loadngc(int32_t index)
  285. {
  286. static int failed;
  287. int32_t j;
  288. ngcopen();
  289. j = (index-1)*sizeof(NGCrec);
  290. grow();
  291. cur->type = NGC;
  292. cur->index = index;
  293. seek(ngcdb, j, 0);
  294. /* special case: NGC data may not be available */
  295. if(read(ngcdb, &cur->ngc, sizeof(NGCrec)) != sizeof(NGCrec)){
  296. if(!failed){
  297. fprint(2, "scat: NGC database not available\n");
  298. failed++;
  299. }
  300. cur->type = NONGC;
  301. cur->ngc.ngc = 0;
  302. cur->ngc.ra = 0;
  303. cur->ngc.dec = 0;
  304. cur->ngc.diam = 0;
  305. cur->ngc.mag = 0;
  306. return 0;
  307. }
  308. cur->ngc.ngc = Short(&cur->ngc.ngc);
  309. cur->ngc.ra = Long(&cur->ngc.ra);
  310. cur->ngc.dec = Long(&cur->ngc.dec);
  311. cur->ngc.diam = Long(&cur->ngc.diam);
  312. cur->ngc.mag = Short(&cur->ngc.mag);
  313. return 1;
  314. }
  315. int
  316. loadabell(int32_t index)
  317. {
  318. int32_t j;
  319. abellopen();
  320. j = index-1;
  321. grow();
  322. cur->type = Abell;
  323. cur->index = index;
  324. seek(abelldb, j*sizeof(Abellrec), 0);
  325. Eread(abelldb, "abell", &cur->abell, sizeof(Abellrec));
  326. cur->abell.abell = Short(&cur->abell.abell);
  327. if(cur->abell.abell != index){
  328. fprint(2, "bad format in abell catalog\n");
  329. exits("abell");
  330. }
  331. cur->abell.ra = Long(&cur->abell.ra);
  332. cur->abell.dec = Long(&cur->abell.dec);
  333. cur->abell.glat = Long(&cur->abell.glat);
  334. cur->abell.glong = Long(&cur->abell.glong);
  335. cur->abell.rad = Long(&cur->abell.rad);
  336. cur->abell.mag10 = Short(&cur->abell.mag10);
  337. cur->abell.pop = Short(&cur->abell.pop);
  338. cur->abell.dist = Short(&cur->abell.dist);
  339. return 1;
  340. }
  341. int
  342. loadsao(int index)
  343. {
  344. if(index<=0 || index>NSAO)
  345. return 0;
  346. saoopen();
  347. grow();
  348. cur->type = SAO;
  349. cur->index = index;
  350. seek(saodb, (index-1)*sizeof(SAOrec), 0);
  351. Eread(saodb, "sao", &cur->sao, sizeof(SAOrec));
  352. cur->sao.ra = Long(&cur->sao.ra);
  353. cur->sao.dec = Long(&cur->sao.dec);
  354. cur->sao.dra = Long(&cur->sao.dra);
  355. cur->sao.ddec = Long(&cur->sao.ddec);
  356. cur->sao.mag = Short(&cur->sao.mag);
  357. cur->sao.mpg = Short(&cur->sao.mpg);
  358. cur->sao.hd = Long(&cur->sao.hd);
  359. return 1;
  360. }
  361. int
  362. loadplanet(int index, Record *r)
  363. {
  364. if(index<0 || index>NPlanet || planet[index].name[0]=='\0')
  365. return 0;
  366. grow();
  367. cur->type = Planet;
  368. cur->index = index;
  369. /* check whether to take new or existing record */
  370. if(r == nil)
  371. memmove(&cur->planet, &planet[index], sizeof(Planetrec));
  372. else
  373. memmove(&cur->planet, &r->planet, sizeof(Planetrec));
  374. return 1;
  375. }
  376. int
  377. loadpatch(int32_t index)
  378. {
  379. int i;
  380. patchopen();
  381. if(index<=0 || index>Npatch)
  382. return 0;
  383. grow();
  384. cur->type = Patch;
  385. cur->index = index;
  386. seek(patchdb, patchaddr[index-1], 0);
  387. cur->patch.nkey = (patchaddr[index]-patchaddr[index-1])/4;
  388. Eread(patchdb, "patch", cur->patch.key, cur->patch.nkey*4);
  389. for(i=0; i<cur->patch.nkey; i++)
  390. cur->patch.key[i] = Long(&cur->patch.key[i]);
  391. return 1;
  392. }
  393. int
  394. loadtype(int t)
  395. {
  396. int i;
  397. ngcopen();
  398. for(i=0; i<NNGCrec; i++)
  399. if(t == (ngctype[i])){
  400. grow();
  401. cur->type = NGCN;
  402. cur->index = i+1;
  403. }
  404. return 1;
  405. }
  406. void
  407. flatten(void)
  408. {
  409. int i, j, notflat;
  410. Record *or;
  411. int32_t key;
  412. loop:
  413. copy();
  414. reset();
  415. notflat = 0;
  416. for(i=0,or=orec; i<norec; i++,or++){
  417. switch(or->type){
  418. default:
  419. fprint(2, "bad type %d in flatten\n", or->type);
  420. break;
  421. case NONGC:
  422. break;
  423. case Planet:
  424. case Abell:
  425. case NGC:
  426. case SAO:
  427. grow();
  428. memmove(cur, or, sizeof(Record));
  429. break;
  430. case NGCN:
  431. if(loadngc(or->index))
  432. notflat = 1;
  433. break;
  434. case NamedSAO:
  435. loadsao(or->index);
  436. notflat = 1;
  437. break;
  438. case NamedNGC:
  439. if(loadngc(or->index))
  440. notflat = 1;
  441. break;
  442. case NamedAbell:
  443. loadabell(or->index);
  444. notflat = 1;
  445. break;
  446. case PatchC:
  447. loadpatch(or->index);
  448. notflat = 1;
  449. break;
  450. case Patch:
  451. for(j=1; j<or->patch.nkey; j++){
  452. key = or->patch.key[j];
  453. if((key&0x3F) == SAO)
  454. loadsao((key>>8)&0xFFFFFF);
  455. else if((key&0x3F) == Abell)
  456. loadabell((key>>8)&0xFFFFFF);
  457. else
  458. loadngc((key>>16)&0xFFFF);
  459. }
  460. break;
  461. }
  462. }
  463. if(notflat)
  464. goto loop;
  465. }
  466. int
  467. ism(int index)
  468. {
  469. int i;
  470. for(i=0; i<NMrec; i++)
  471. if(mindex[i].ngc == index)
  472. return 1;
  473. return 0;
  474. }
  475. char*
  476. alpha(char *s, char *t)
  477. {
  478. int n;
  479. n = strlen(t);
  480. if(strncmp(s, t, n)==0 && (s[n]<'a' || 'z'<s[n]))
  481. return skipbl(s+n);
  482. return 0;
  483. }
  484. char*
  485. text(char *s, char *t)
  486. {
  487. int n;
  488. n = strlen(t);
  489. if(strncmp(s, t, n)==0 && (s[n]==0 || s[n]==' ' || s[n]=='\t'))
  490. return skipbl(s+n);
  491. return 0;
  492. }
  493. int
  494. cull(char *s, int keep, int dobbox)
  495. {
  496. int i, j, nobj, keepthis;
  497. Record *or;
  498. char *t;
  499. int dogrtr, doless, dom, dosao, dongc, doabell;
  500. int mgrtr, mless;
  501. char obj[100];
  502. memset(obj, 0, sizeof(obj));
  503. nobj = 0;
  504. dogrtr = 0;
  505. doless = 0;
  506. dom = 0;
  507. dongc = 0;
  508. dosao = 0;
  509. doabell = 0;
  510. mgrtr = mless= 0;
  511. if(dobbox)
  512. goto Cull;
  513. for(;;){
  514. if(s[0] == '>'){
  515. dogrtr = 1;
  516. mgrtr = 10 * strtod(s+1, &t);
  517. if(mgrtr==0 && t==s+1){
  518. fprint(2, "bad magnitude\n");
  519. return 0;
  520. }
  521. s = skipbl(t);
  522. continue;
  523. }
  524. if(s[0] == '<'){
  525. doless = 1;
  526. mless = 10 * strtod(s+1, &t);
  527. if(mless==0 && t==s+1){
  528. fprint(2, "bad magnitude\n");
  529. return 0;
  530. }
  531. s = skipbl(t);
  532. continue;
  533. }
  534. if(t = text(s, "m")){
  535. dom = 1;
  536. s = t;
  537. continue;
  538. }
  539. if(t = text(s, "sao")){
  540. dosao = 1;
  541. s = t;
  542. continue;
  543. }
  544. if(t = text(s, "ngc")){
  545. dongc = 1;
  546. s = t;
  547. continue;
  548. }
  549. if(t = text(s, "abell")){
  550. doabell = 1;
  551. s = t;
  552. continue;
  553. }
  554. for(i=0; names[i].name; i++)
  555. if(t = alpha(s, names[i].name)){
  556. if(nobj > 100){
  557. fprint(2, "too many object types\n");
  558. return 0;
  559. }
  560. obj[nobj++] = names[i].type;
  561. s = t;
  562. goto Continue;
  563. }
  564. break;
  565. Continue:;
  566. }
  567. if(*s){
  568. fprint(2, "syntax error in object list\n");
  569. return 0;
  570. }
  571. Cull:
  572. flatten();
  573. copy();
  574. reset();
  575. if(dom)
  576. mopen();
  577. if(dosao)
  578. saoopen();
  579. if(dongc || nobj)
  580. ngcopen();
  581. if(doabell)
  582. abellopen();
  583. for(i=0,or=orec; i<norec; i++,or++){
  584. keepthis = !keep;
  585. if(dobbox && inbbox(or->ngc.ra, or->ngc.dec))
  586. keepthis = keep;
  587. if(doless && or->ngc.mag <= mless)
  588. keepthis = keep;
  589. if(dogrtr && or->ngc.mag >= mgrtr)
  590. keepthis = keep;
  591. if(dom && (or->type==NGC && ism(or->ngc.ngc)))
  592. keepthis = keep;
  593. if(dongc && or->type==NGC)
  594. keepthis = keep;
  595. if(doabell && or->type==Abell)
  596. keepthis = keep;
  597. if(dosao && or->type==SAO)
  598. keepthis = keep;
  599. for(j=0; j<nobj; j++)
  600. if(or->type==NGC && or->ngc.type==obj[j])
  601. keepthis = keep;
  602. if(keepthis){
  603. grow();
  604. memmove(cur, or, sizeof(Record));
  605. }
  606. }
  607. return 1;
  608. }
  609. int
  610. compar(const void *va, const void *vb)
  611. {
  612. Record *a=va, *b=vb;
  613. if(a->type == b->type)
  614. return a->index - b->index;
  615. return a->type - b->type;
  616. }
  617. void
  618. sort(void)
  619. {
  620. int i;
  621. Record *r, *s;
  622. if(nrec == 0)
  623. return;
  624. qsort(rec, nrec, sizeof(Record), compar);
  625. r = rec+1;
  626. s = rec;
  627. for(i=1; i<nrec; i++,r++){
  628. /* may have multiple instances of a planet in the scene */
  629. if(r->type==s->type && r->index==s->index && r->type!=Planet)
  630. continue;
  631. memmove(++s, r, sizeof(Record));
  632. }
  633. nrec = (s+1)-rec;
  634. }
  635. char greekbuf[128];
  636. char*
  637. togreek(char *s)
  638. {
  639. char *t;
  640. int i, n;
  641. Rune r;
  642. t = greekbuf;
  643. while(*s){
  644. for(i=1; i<=24; i++){
  645. n = strlen(greek[i]);
  646. if(strncmp(s, greek[i], n)==0 && (s[n]==' ' || s[n]=='\t')){
  647. s += n;
  648. t += runetochar(t, &greeklet[i]);
  649. goto Cont;
  650. }
  651. }
  652. n = chartorune(&r, s);
  653. for(i=0; i<n; i++)
  654. *t++ = *s++;
  655. Cont:;
  656. }
  657. *t = 0;
  658. return greekbuf;
  659. }
  660. char*
  661. fromgreek(char *s)
  662. {
  663. char *t;
  664. int i, n;
  665. Rune r;
  666. t = greekbuf;
  667. while(*s){
  668. n = chartorune(&r, s);
  669. for(i=1; i<=24; i++){
  670. if(r == greeklet[i]){
  671. strcpy(t, greek[i]);
  672. t += strlen(greek[i]);
  673. s += n;
  674. goto Cont;
  675. }
  676. }
  677. for(i=0; i<n; i++)
  678. *t++ = *s++;
  679. Cont:;
  680. }
  681. *t = 0;
  682. return greekbuf;
  683. }
  684. #ifdef OLD
  685. /*
  686. * Old version
  687. */
  688. int
  689. coords(int deg)
  690. {
  691. int i;
  692. int x, y;
  693. Record *or;
  694. int32_t dec, ra, ndec, nra;
  695. int rdeg;
  696. flatten();
  697. copy();
  698. reset();
  699. deg *= 2;
  700. for(i=0,or=orec; i<norec; i++,or++){
  701. if(or->type == Planet) /* must keep it here */
  702. loadplanet(or->index, or);
  703. dec = or->ngc.dec/MILLIARCSEC;
  704. ra = or->ngc.ra/MILLIARCSEC;
  705. rdeg = deg/cos((dec*PI)/180);
  706. for(y=-deg; y<=+deg; y++){
  707. ndec = dec*2+y;
  708. if(ndec/2>=90 || ndec/2<=-90)
  709. continue;
  710. /* fp errors hurt here, so we round 1' to the pole */
  711. if(ndec >= 0)
  712. ndec = ndec*500*60*60 + 60000;
  713. else
  714. ndec = ndec*500*60*60 - 60000;
  715. for(x=-rdeg; x<=+rdeg; x++){
  716. nra = ra*2+x;
  717. if(nra/2 < 0)
  718. nra += 360*2;
  719. if(nra/2 >= 360)
  720. nra -= 360*2;
  721. /* fp errors hurt here, so we round up 1' */
  722. nra = nra/2*MILLIARCSEC + 60000;
  723. loadpatch(patcha(angle(nra), angle(ndec)));
  724. }
  725. }
  726. }
  727. sort();
  728. return 1;
  729. }
  730. #endif
  731. /*
  732. * New version attempts to match the boundaries of the plot better.
  733. */
  734. int
  735. coords(int deg)
  736. {
  737. int i;
  738. int x, y, xx;
  739. Record *or;
  740. int32_t min, circle;
  741. double factor;
  742. flatten();
  743. circle = 360*MILLIARCSEC;
  744. deg *= MILLIARCSEC;
  745. /* find center */
  746. folded = 0;
  747. bbox(0, 0, 0);
  748. /* now expand */
  749. factor = cos(angle((decmax+decmin)/2));
  750. if(factor < .2)
  751. factor = .2;
  752. factor = floor(1/factor);
  753. folded = 0;
  754. bbox(factor*deg, deg, 1);
  755. Bprint(&bout, "%s to ", hms(angle(ramin)));
  756. Bprint(&bout, "%s\n", hms(angle(ramax)));
  757. Bprint(&bout, "%s to ", dms(angle(decmin)));
  758. Bprint(&bout, "%s\n", dms(angle(decmax)));
  759. copy();
  760. reset();
  761. for(i=0,or=orec; i<norec; i++,or++)
  762. if(or->type == Planet) /* must keep it here */
  763. loadplanet(or->index, or);
  764. min = ramin;
  765. if(ramin > ramax)
  766. min -= circle;
  767. for(x=min; x<=ramax; x+=250*60*60){
  768. xx = x;
  769. if(xx < 0)
  770. xx += circle;
  771. for(y=decmin; y<=decmax; y+=250*60*60)
  772. if(-circle/4 < y && y < circle/4)
  773. loadpatch(patcha(angle(xx), angle(y)));
  774. }
  775. sort();
  776. cull(nil, 1, 1);
  777. return 1;
  778. }
  779. void
  780. pplate(char *flags)
  781. {
  782. int i;
  783. int32_t c;
  784. int na, rah, ram, d1, d2;
  785. double r0;
  786. int ra, dec;
  787. int32_t ramin, ramax, decmin, decmax; /* all in degrees */
  788. Record *r;
  789. int folded;
  790. Angle racenter, deccenter, rasize, decsize, a[4];
  791. Picture *pic;
  792. rasize = -1.0;
  793. decsize = -1.0;
  794. na = 0;
  795. for(;;){
  796. while(*flags==' ')
  797. flags++;
  798. if(('0'<=*flags && *flags<='9') || *flags=='+' || *flags=='-'){
  799. if(na >= 3)
  800. goto err;
  801. a[na++] = getra(flags);
  802. while(*flags && *flags!=' ')
  803. flags++;
  804. continue;
  805. }
  806. if(*flags){
  807. err:
  808. Bprint(&bout, "syntax error in plate\n");
  809. return;
  810. }
  811. break;
  812. }
  813. switch(na){
  814. case 0:
  815. break;
  816. case 1:
  817. rasize = a[0];
  818. decsize = rasize;
  819. break;
  820. case 2:
  821. rasize = a[0];
  822. decsize = a[1];
  823. break;
  824. case 3:
  825. case 4:
  826. racenter = a[0];
  827. deccenter = a[1];
  828. rasize = a[2];
  829. if(na == 4)
  830. decsize = a[3];
  831. else
  832. decsize = rasize;
  833. if(rasize<0.0 || decsize<0.0){
  834. Bprint(&bout, "negative sizes\n");
  835. return;
  836. }
  837. goto done;
  838. }
  839. folded = 0;
  840. /* convert to milliarcsec */
  841. c = 1000*60*60;
  842. Again:
  843. if(nrec == 0){
  844. Bprint(&bout, "empty\n");
  845. return;
  846. }
  847. ramin = 0x7FFFFFFF;
  848. ramax = -0x7FFFFFFF;
  849. decmin = 0x7FFFFFFF;
  850. decmax = -0x7FFFFFFF;
  851. for(r=rec,i=0; i<nrec; i++,r++){
  852. if(r->type == Patch){
  853. radec(r->index, &rah, &ram, &dec);
  854. ra = 15*rah+ram/4;
  855. r0 = c/cos(RAD(dec));
  856. ra *= c;
  857. dec *= c;
  858. if(dec == 0)
  859. d1 = c, d2 = c;
  860. else if(dec < 0)
  861. d1 = c, d2 = 0;
  862. else
  863. d1 = 0, d2 = c;
  864. }else if(r->type==SAO || r->type==NGC || r->type==Abell){
  865. ra = r->ngc.ra;
  866. dec = r->ngc.dec;
  867. d1 = 0, d2 = 0, r0 = 0;
  868. }else if(r->type==NGCN){
  869. loadngc(r->index);
  870. continue;
  871. }else if(r->type==NamedSAO){
  872. loadsao(r->index);
  873. continue;
  874. }else if(r->type==NamedNGC){
  875. loadngc(r->index);
  876. continue;
  877. }else if(r->type==NamedAbell){
  878. loadabell(r->index);
  879. continue;
  880. }else
  881. continue;
  882. if(dec+d2 > decmax)
  883. decmax = dec+d2;
  884. if(dec-d1 < decmin)
  885. decmin = dec-d1;
  886. if(folded){
  887. ra -= 180*c;
  888. if(ra < 0)
  889. ra += 360*c;
  890. }
  891. if(ra+r0 > ramax)
  892. ramax = ra+r0;
  893. if(ra < ramin)
  894. ramin = ra;
  895. }
  896. if(!folded && ramax-ramin>270*c){
  897. folded = 1;
  898. goto Again;
  899. }
  900. racenter = angle(ramin+(ramax-ramin)/2);
  901. deccenter = angle(decmin+(decmax-decmin)/2);
  902. if(rasize<0 || decsize<0){
  903. rasize = angle(ramax-ramin)*cos(deccenter);
  904. decsize = angle(decmax-decmin);
  905. }
  906. done:
  907. if(DEG(rasize)>1.1 || DEG(decsize)>1.1){
  908. Bprint(&bout, "plate too big: %s", ms(rasize));
  909. Bprint(&bout, " x %s\n", ms(decsize));
  910. Bprint(&bout, "trimming to 30'x30'\n");
  911. rasize = RAD(0.5);
  912. decsize = RAD(0.5);
  913. }
  914. Bprint(&bout, "%s %s ", hms(racenter), dms(deccenter));
  915. Bprint(&bout, "%s", ms(rasize));
  916. Bprint(&bout, " x %s\n", ms(decsize));
  917. Bflush(&bout);
  918. flatten();
  919. pic = image(racenter, deccenter, rasize, decsize);
  920. if(pic == 0)
  921. return;
  922. Bprint(&bout, "plate %s locn %d %d %d %d\n", pic->name, pic->minx, pic->miny, pic->maxx, pic->maxy);
  923. Bflush(&bout);
  924. displaypic(pic);
  925. }
  926. void
  927. lookup(char *s, int doreset)
  928. {
  929. int i, j, k;
  930. int rah, ram, deg;
  931. char *starts, *inputline=s, *t, *u;
  932. Record *r;
  933. int32_t n;
  934. double x;
  935. Angle ra;
  936. lowercase(s);
  937. s = skipbl(s);
  938. if(*s == 0)
  939. goto Print;
  940. if(t = alpha(s, "flat")){
  941. if(*t){
  942. fprint(2, "flat takes no arguments\n");
  943. return;
  944. }
  945. if(nrec == 0){
  946. fprint(2, "no records\n");
  947. return;
  948. }
  949. flatten();
  950. goto Print;
  951. }
  952. if(t = alpha(s, "print")){
  953. if(*t){
  954. fprint(2, "print takes no arguments\n");
  955. return;
  956. }
  957. for(i=0,r=rec; i<nrec; i++,r++)
  958. prrec(r);
  959. return;
  960. }
  961. if(t = alpha(s, "add")){
  962. lookup(t, 0);
  963. return;
  964. }
  965. if(t = alpha(s, "sao")){
  966. n = strtoul(t, &u, 10);
  967. if(n<=0 || n>NSAO)
  968. goto NotFound;
  969. t = skipbl(u);
  970. if(*t){
  971. fprint(2, "syntax error in sao\n");
  972. return;
  973. }
  974. if(doreset)
  975. reset();
  976. if(!loadsao(n))
  977. goto NotFound;
  978. goto Print;
  979. }
  980. if(t = alpha(s, "ngc")){
  981. n = strtoul(t, &u, 10);
  982. if(n<=0 || n>NNGC)
  983. goto NotFound;
  984. t = skipbl(u);
  985. if(*t){
  986. fprint(2, "syntax error in ngc\n");
  987. return;
  988. }
  989. if(doreset)
  990. reset();
  991. if(!loadngc(n))
  992. goto NotFound;
  993. goto Print;
  994. }
  995. if(t = alpha(s, "ic")){
  996. n = strtoul(t, &u, 10);
  997. if(n<=0 || n>NIC)
  998. goto NotFound;
  999. t = skipbl(u);
  1000. if(*t){
  1001. fprint(2, "syntax error in ic\n");
  1002. return;
  1003. }
  1004. if(doreset)
  1005. reset();
  1006. if(!loadngc(n+NNGC))
  1007. goto NotFound;
  1008. goto Print;
  1009. }
  1010. if(t = alpha(s, "abell")){
  1011. n = strtoul(t, &u, 10);
  1012. if(n<=0 || n>NAbell)
  1013. goto NotFound;
  1014. if(doreset)
  1015. reset();
  1016. if(!loadabell(n))
  1017. goto NotFound;
  1018. goto Print;
  1019. }
  1020. if(t = alpha(s, "m")){
  1021. n = strtoul(t, &u, 10);
  1022. if(n<=0 || n>NM)
  1023. goto NotFound;
  1024. mopen();
  1025. for(j=n-1; mindex[j].m<n; j++)
  1026. ;
  1027. if(doreset)
  1028. reset();
  1029. while(mindex[j].m == n){
  1030. if(mindex[j].ngc){
  1031. grow();
  1032. cur->type = NGCN;
  1033. cur->index = mindex[j].ngc;
  1034. }
  1035. j++;
  1036. }
  1037. goto Print;
  1038. }
  1039. for(i=1; i<=Ncon; i++)
  1040. if(t = alpha(s, constel[i])){
  1041. if(*t){
  1042. fprint(2, "syntax error in constellation\n");
  1043. return;
  1044. }
  1045. constelopen();
  1046. seek(condb, 4L*conindex[i-1], 0);
  1047. j = conindex[i]-conindex[i-1];
  1048. Eread(condb, "con", con, 4*j);
  1049. if(doreset)
  1050. reset();
  1051. for(k=0; k<j; k++){
  1052. grow();
  1053. cur->type = PatchC;
  1054. cur->index = Long(&con[k]);
  1055. }
  1056. goto Print;
  1057. }
  1058. if(t = alpha(s, "expand")){
  1059. n = 0;
  1060. if(*t){
  1061. if(*t<'0' && '9'<*t){
  1062. Expanderr:
  1063. fprint(2, "syntax error in expand\n");
  1064. return;
  1065. }
  1066. n = strtoul(t, &u, 10);
  1067. t = skipbl(u);
  1068. if(*t)
  1069. goto Expanderr;
  1070. }
  1071. coords(n);
  1072. goto Print;
  1073. }
  1074. if(t = alpha(s, "plot")){
  1075. if(nrec == 0){
  1076. Bprint(&bout, "empty\n");
  1077. return;
  1078. }
  1079. plot(t);
  1080. return;
  1081. }
  1082. if(t = alpha(s, "astro")){
  1083. astro(t, 0);
  1084. return;
  1085. }
  1086. if(t = alpha(s, "plate")){
  1087. pplate(t);
  1088. return;
  1089. }
  1090. if(t = alpha(s, "gamma")){
  1091. while(*t==' ')
  1092. t++;
  1093. u = t;
  1094. x = strtod(t, &u);
  1095. if(u > t)
  1096. gam.gamma = x;
  1097. Bprint(&bout, "%.2f\n", gam.gamma);
  1098. return;
  1099. }
  1100. if(t = alpha(s, "keep")){
  1101. if(!cull(t, 1, 0))
  1102. return;
  1103. goto Print;
  1104. }
  1105. if(t = alpha(s, "drop")){
  1106. if(!cull(t, 0, 0))
  1107. return;
  1108. goto Print;
  1109. }
  1110. for(i=0; planet[i].name[0]; i++){
  1111. if(t = alpha(s, planet[i].name)){
  1112. if(doreset)
  1113. reset();
  1114. loadplanet(i, nil);
  1115. goto Print;
  1116. }
  1117. }
  1118. for(i=0; names[i].name; i++){
  1119. if(t = alpha(s, names[i].name)){
  1120. if(*t){
  1121. fprint(2, "syntax error in type\n");
  1122. return;
  1123. }
  1124. if(doreset)
  1125. reset();
  1126. loadtype(names[i].type);
  1127. goto Print;
  1128. }
  1129. }
  1130. switch(s[0]){
  1131. case '"':
  1132. starts = ++s;
  1133. while(*s != '"')
  1134. if(*s++ == 0){
  1135. fprint(2, "bad star name\n");
  1136. return;
  1137. }
  1138. *s = 0;
  1139. if(doreset)
  1140. reset();
  1141. j = nrec;
  1142. saoopen();
  1143. starts = fromgreek(starts);
  1144. for(i=0; i<NName; i++)
  1145. if(equal(starts, name[i].name)){
  1146. grow();
  1147. if(name[i].sao){
  1148. rec[j].type = NamedSAO;
  1149. rec[j].index = name[i].sao;
  1150. }
  1151. if(name[i].ngc){
  1152. rec[j].type = NamedNGC;
  1153. rec[j].index = name[i].ngc;
  1154. }
  1155. if(name[i].abell){
  1156. rec[j].type = NamedAbell;
  1157. rec[j].index = name[i].abell;
  1158. }
  1159. strcpy(rec[j].named.name, name[i].name);
  1160. j++;
  1161. }
  1162. if(parsename(starts))
  1163. for(i=0; i<NBayer; i++)
  1164. if(bayer[i].name[0]==parsed[0] &&
  1165. (bayer[i].name[1]==parsed[1] || parsed[1]==0) &&
  1166. bayer[i].name[2]==parsed[2]){
  1167. grow();
  1168. rec[j].type = NamedSAO;
  1169. rec[j].index = bayer[i].sao;
  1170. strncpy(rec[j].named.name, starts, sizeof(rec[j].named.name));
  1171. j++;
  1172. }
  1173. if(j == 0){
  1174. *s = '"';
  1175. goto NotFound;
  1176. }
  1177. break;
  1178. case '0': case '1': case '2': case '3': case '4':
  1179. case '5': case '6': case '7': case '8': case '9':
  1180. strtoul(s, &t, 10);
  1181. if(*t != 'h'){
  1182. BadCoords:
  1183. fprint(2, "bad coordinates %s\n", inputline);
  1184. break;
  1185. }
  1186. ra = DEG(getra(s));
  1187. while(*s && *s!=' ' && *s!='\t')
  1188. s++;
  1189. rah = ra/15;
  1190. ra = ra-rah*15;
  1191. ram = ra*4;
  1192. deg = strtol(s, &t, 10);
  1193. if(t == s)
  1194. goto BadCoords;
  1195. /* degree sign etc. is optional */
  1196. if((uint8_t)*t == L'°')
  1197. deg = DEG(getra(s));
  1198. if(doreset)
  1199. reset();
  1200. if(abs(deg)>=90 || rah>=24)
  1201. goto BadCoords;
  1202. if(!loadpatch(patch(rah, ram, deg)))
  1203. goto NotFound;
  1204. break;
  1205. default:
  1206. fprint(2, "unknown command %s\n", inputline);
  1207. return;
  1208. }
  1209. Print:
  1210. if(nrec == 0)
  1211. Bprint(&bout, "empty\n");
  1212. else if(nrec <= 2)
  1213. for(i=0; i<nrec; i++)
  1214. prrec(rec+i);
  1215. else
  1216. Bprint(&bout, "%ld items\n", nrec);
  1217. return;
  1218. NotFound:
  1219. fprint(2, "%s not found\n", inputline);
  1220. return;
  1221. }
  1222. char *ngctypes[] =
  1223. {
  1224. [Galaxy] "Gx",
  1225. [PlanetaryN] "Pl",
  1226. [OpenCl] "OC",
  1227. [GlobularCl] "Gb",
  1228. [DiffuseN] "Nb",
  1229. [NebularCl] "C+N",
  1230. [Asterism] "Ast",
  1231. [Knot] "Kt",
  1232. [Triple] "***",
  1233. [Double] "D*",
  1234. [Single] "*",
  1235. [Uncertain] "?",
  1236. [Nonexistent] "-",
  1237. [Unknown] " ",
  1238. [PlateDefect] "PD",
  1239. };
  1240. char*
  1241. ngcstring(int d)
  1242. {
  1243. if(d<Galaxy || d>PlateDefect)
  1244. return "can't happen";
  1245. return ngctypes[d];
  1246. }
  1247. int16_t descindex[NINDEX];
  1248. void
  1249. printnames(Record *r)
  1250. {
  1251. int i, ok, done;
  1252. done = 0;
  1253. for(i=0; i<NName; i++){ /* stupid linear search! */
  1254. ok = 0;
  1255. if(r->type==SAO && r->index==name[i].sao)
  1256. ok = 1;
  1257. if(r->type==NGC && r->ngc.ngc==name[i].ngc)
  1258. ok = 1;
  1259. if(r->type==Abell && r->abell.abell==name[i].abell)
  1260. ok = 1;
  1261. if(ok){
  1262. if(done++ == 0)
  1263. Bprint(&bout, "\t");
  1264. Bprint(&bout, " \"%s\"", togreek(name[i].name));
  1265. }
  1266. }
  1267. if(done)
  1268. Bprint(&bout, "\n");
  1269. }
  1270. int
  1271. equal(char *s1, char *s2)
  1272. {
  1273. int c;
  1274. while(*s1){
  1275. if(*s1==' '){
  1276. while(*s1==' ')
  1277. s1++;
  1278. continue;
  1279. }
  1280. while(*s2==' ')
  1281. s2++;
  1282. c=*s2;
  1283. if('A'<=*s2 && *s2<='Z')
  1284. c^=' ';
  1285. if(*s1!=c)
  1286. return 0;
  1287. s1++, s2++;
  1288. }
  1289. return 1;
  1290. }
  1291. int
  1292. parsename(char *s)
  1293. {
  1294. char *blank;
  1295. int i;
  1296. blank = strchr(s, ' ');
  1297. if(blank==0 || strchr(blank+1, ' ') || strlen(blank+1)!=3)
  1298. return 0;
  1299. blank++;
  1300. parsed[0] = parsed[1] = parsed[2] = 0;
  1301. if('0'<=s[0] && s[0]<='9'){
  1302. i = atoi(s);
  1303. parsed[0] = i;
  1304. if(i > 100)
  1305. return 0;
  1306. }else{
  1307. for(i=1; i<=24; i++)
  1308. if(strncmp(greek[i], s, strlen(greek[i]))==0){
  1309. parsed[0]=100+i;
  1310. goto out;
  1311. }
  1312. return 0;
  1313. out:
  1314. if('0'<=s[strlen(greek[i])] && s[strlen(greek[i])]<='9')
  1315. parsed[1]=s[strlen(greek[i])]-'0';
  1316. }
  1317. for(i=1; i<=88; i++)
  1318. if(strcmp(constel[i], blank)==0){
  1319. parsed[2] = i;
  1320. return 1;
  1321. }
  1322. return 0;
  1323. }
  1324. char*
  1325. dist_grp(int dg)
  1326. {
  1327. switch(dg){
  1328. default:
  1329. return "unknown";
  1330. case 1:
  1331. return "13.3-14.0";
  1332. case 2:
  1333. return "14.1-14.8";
  1334. case 3:
  1335. return "14.9-15.6";
  1336. case 4:
  1337. return "15.7-16.4";
  1338. case 5:
  1339. return "16.5-17.2";
  1340. case 6:
  1341. return "17.3-18.0";
  1342. case 7:
  1343. return ">18.0";
  1344. }
  1345. }
  1346. char*
  1347. rich_grp(int dg)
  1348. {
  1349. switch(dg){
  1350. default:
  1351. return "unknown";
  1352. case 0:
  1353. return "30-40";
  1354. case 1:
  1355. return "50-79";
  1356. case 2:
  1357. return "80-129";
  1358. case 3:
  1359. return "130-199";
  1360. case 4:
  1361. return "200-299";
  1362. case 5:
  1363. return ">=300";
  1364. }
  1365. }
  1366. char*
  1367. nameof(Record *r)
  1368. {
  1369. NGCrec *n;
  1370. SAOrec *s;
  1371. Abellrec *a;
  1372. static char buf[128];
  1373. int i;
  1374. switch(r->type){
  1375. default:
  1376. return nil;
  1377. case SAO:
  1378. s = &r->sao;
  1379. if(s->name[0] == 0)
  1380. return nil;
  1381. if(s->name[0] >= 100){
  1382. i = snprint(buf, sizeof buf, "%C", greeklet[s->name[0]-100]);
  1383. if(s->name[1])
  1384. i += snprint(buf+i, sizeof buf-i, "%d", s->name[1]);
  1385. }else
  1386. i = snprint(buf, sizeof buf, " %d", s->name[0]);
  1387. snprint(buf+i, sizeof buf-i, " %s", constel[s->name[2]]);
  1388. break;
  1389. case NGC:
  1390. n = &r->ngc;
  1391. if(n->type >= Uncertain)
  1392. return nil;
  1393. if(n->ngc <= NNGC)
  1394. snprint(buf, sizeof buf, "NGC%4d ", n->ngc);
  1395. else
  1396. snprint(buf, sizeof buf, "IC%4d ", n->ngc-NNGC);
  1397. break;
  1398. case Abell:
  1399. a = &r->abell;
  1400. snprint(buf, sizeof buf, "Abell%4d", a->abell);
  1401. break;
  1402. }
  1403. return buf;
  1404. }
  1405. void
  1406. prrec(Record *r)
  1407. {
  1408. NGCrec *n;
  1409. SAOrec *s;
  1410. Abellrec *a;
  1411. Planetrec *p;
  1412. int i, rah, ram, dec, nn;
  1413. int32_t key;
  1414. if(r) switch(r->type){
  1415. default:
  1416. fprint(2, "can't prrec type %d\n", r->type);
  1417. exits("type");
  1418. case Planet:
  1419. p = &r->planet;
  1420. Bprint(&bout, "%s", p->name);
  1421. Bprint(&bout, "\t%s %s",
  1422. hms(angle(p->ra)),
  1423. dms(angle(p->dec)));
  1424. Bprint(&bout, " %3.2f° %3.2f°",
  1425. p->az/(double)MILLIARCSEC, p->alt/(double)MILLIARCSEC);
  1426. Bprint(&bout, " %s",
  1427. ms(angle(p->semidiam)));
  1428. if(r->index <= 1)
  1429. Bprint(&bout, " %g", p->phase);
  1430. Bprint(&bout, "\n");
  1431. break;
  1432. case NGC:
  1433. n = &r->ngc;
  1434. if(n->ngc <= NNGC)
  1435. Bprint(&bout, "NGC%4d ", n->ngc);
  1436. else
  1437. Bprint(&bout, "IC%4d ", n->ngc-NNGC);
  1438. Bprint(&bout, "%s ", ngcstring(n->type));
  1439. if(n->mag == UNKNOWNMAG)
  1440. Bprint(&bout, "----");
  1441. else
  1442. Bprint(&bout, "%.1f%c", n->mag/10.0, n->magtype);
  1443. Bprint(&bout, "\t%s %s\t%c%.1f'\n",
  1444. hm(angle(n->ra)),
  1445. dm(angle(n->dec)),
  1446. n->diamlim,
  1447. DEG(angle(n->diam))*60.);
  1448. prdesc(n->desc, desctab, descindex);
  1449. printnames(r);
  1450. break;
  1451. case Abell:
  1452. a = &r->abell;
  1453. Bprint(&bout, "Abell%4d %.1f %.2f° %dMpc", a->abell, a->mag10/10.0,
  1454. DEG(angle(a->rad)), a->dist);
  1455. Bprint(&bout, "\t%s %s\t%.2f %.2f\n",
  1456. hm(angle(a->ra)),
  1457. dm(angle(a->dec)),
  1458. DEG(angle(a->glat)),
  1459. DEG(angle(a->glong)));
  1460. Bprint(&bout, "\tdist grp: %s rich grp: %s %d galaxies/°²\n",
  1461. dist_grp(a->distgrp),
  1462. rich_grp(a->richgrp),
  1463. a->pop);
  1464. printnames(r);
  1465. break;
  1466. case SAO:
  1467. s = &r->sao;
  1468. Bprint(&bout, "SAO%6ld ", r->index);
  1469. if(s->mag==UNKNOWNMAG)
  1470. Bprint(&bout, "---");
  1471. else
  1472. Bprint(&bout, "%.1f", s->mag/10.0);
  1473. if(s->mpg==UNKNOWNMAG)
  1474. Bprint(&bout, ",---");
  1475. else
  1476. Bprint(&bout, ",%.1f", s->mpg/10.0);
  1477. Bprint(&bout, " %s %s %.4fs %.3f\"",
  1478. hms(angle(s->ra)),
  1479. dms(angle(s->dec)),
  1480. DEG(angle(s->dra))*(4*60),
  1481. DEG(angle(s->ddec))*(60*60));
  1482. Bprint(&bout, " %.3s %c %.2s %ld %d",
  1483. s->spec, s->code, s->compid, s->hd, s->hdcode);
  1484. if(s->name[0])
  1485. Bprint(&bout, " \"%s\"", nameof(r));
  1486. Bprint(&bout, "\n");
  1487. printnames(r);
  1488. break;
  1489. case Patch:
  1490. radec(r->index, &rah, &ram, &dec);
  1491. Bprint(&bout, "%dh%dm %d°", rah, ram, dec);
  1492. key = r->patch.key[0];
  1493. Bprint(&bout, " %s", constel[key&0xFF]);
  1494. if((key>>=8) & 0xFF)
  1495. Bprint(&bout, " %s", constel[key&0xFF]);
  1496. if((key>>=8) & 0xFF)
  1497. Bprint(&bout, " %s", constel[key&0xFF]);
  1498. if((key>>=8) & 0xFF)
  1499. Bprint(&bout, " %s", constel[key&0xFF]);
  1500. for(i=1; i<r->patch.nkey; i++){
  1501. key = r->patch.key[i];
  1502. switch(key&0x3F){
  1503. case SAO:
  1504. Bprint(&bout, " SAO%ld", (key>>8)&0xFFFFFF);
  1505. break;
  1506. case Abell:
  1507. Bprint(&bout, " Abell%ld", (key>>8)&0xFFFFFF);
  1508. break;
  1509. default: /* NGC */
  1510. nn = (key>>16)&0xFFFF;
  1511. if(nn > NNGC)
  1512. Bprint(&bout, " IC%d", nn-NNGC);
  1513. else
  1514. Bprint(&bout, " NGC%d", nn);
  1515. Bprint(&bout, "(%s)", ngcstring(key&0x3F));
  1516. break;
  1517. }
  1518. }
  1519. Bprint(&bout, "\n");
  1520. break;
  1521. case NGCN:
  1522. if(r->index <= NNGC)
  1523. Bprint(&bout, "NGC%ld\n", r->index);
  1524. else
  1525. Bprint(&bout, "IC%ld\n", r->index-NNGC);
  1526. break;
  1527. case NamedSAO:
  1528. Bprint(&bout, "SAO%ld \"%s\"\n", r->index, togreek(r->named.name));
  1529. break;
  1530. case NamedNGC:
  1531. if(r->index <= NNGC)
  1532. Bprint(&bout, "NGC%ld \"%s\"\n", r->index, togreek(r->named.name));
  1533. else
  1534. Bprint(&bout, "IC%ld \"%s\"\n", r->index-NNGC, togreek(r->named.name));
  1535. break;
  1536. case NamedAbell:
  1537. Bprint(&bout, "Abell%ld \"%s\"\n", r->index, togreek(r->named.name));
  1538. break;
  1539. case PatchC:
  1540. radec(r->index, &rah, &ram, &dec);
  1541. Bprint(&bout, "%dh%dm %d\n", rah, ram, dec);
  1542. break;
  1543. }
  1544. }