int startree_get_radec(startree_t* s, int starid, double* ra, double* dec) {
double xyz[3];
int rtn;
rtn = startree_get(s, starid, xyz);
if (rtn)
return rtn;
xyzarr2radecdeg(xyz, ra, dec);
return rtn;
}
int hpquads(startree_t* starkd,
codefile_t* codes,
quadfile_t* quads,
int Nside,
double scale_min_arcmin,
double scale_max_arcmin,
int dimquads,
int passes,
int Nreuses,
int Nloosen,
int id,
anbool scanoccupied,
void* sort_data,
int (*sort_func)(const void*, const void*),
int sort_size,
char** args, int argc) {
hpquads_t myhpquads;
hpquads_t* me = &myhpquads;
int i;
int pass;
anbool circle = TRUE;
double radius2;
il* hptotry;
int Nhptotry = 0;
int nquads;
double hprad;
double quadscale;
int skhp, sknside;
qfits_header* qhdr;
qfits_header* chdr;
int N;
int dimcodes;
int quadsize;
int NHP;
memset(me, 0, sizeof(hpquads_t));
if (Nside > HP_MAX_INT_NSIDE) {
ERROR("Error: maximum healpix Nside = %i", HP_MAX_INT_NSIDE);
return -1;
}
if (Nreuses > 255) {
ERROR("Error, reuse (-r) must be less than 256");
return -1;
}
me->Nside = Nside;
me->dimquads = dimquads;
NHP = 12 * Nside * Nside;
dimcodes = dimquad2dimcode(dimquads);
quadsize = sizeof(unsigned int) * dimquads;
logmsg("Nside=%i. Nside^2=%i. Number of healpixes=%i. Healpix side length ~ %g arcmin.\n",
me->Nside, me->Nside*me->Nside, NHP, healpix_side_length_arcmin(me->Nside));
me->sort_data = sort_data;
me->sort_func = sort_func;
me->sort_size = sort_size;
tic();
me->starkd = starkd;
N = startree_N(me->starkd);
logmsg("Star tree contains %i objects.\n", N);
// get the "HEALPIX" header from the skdt...
skhp = qfits_header_getint(startree_header(me->starkd), "HEALPIX", -1);
if (skhp == -1) {
if (!qfits_header_getboolean(startree_header(me->starkd), "ALLSKY", FALSE)) {
logmsg("Warning: skdt does not contain \"HEALPIX\" header. Code and quad files will not contain this header either.\n");
}
}
// likewise "HPNSIDE"
sknside = qfits_header_getint(startree_header(me->starkd), "HPNSIDE", 1);
if (sknside && Nside % sknside) {
logerr("Error: Nside (-n) must be a multiple of the star kdtree healpixelisation: %i\n", sknside);
return -1;
}
if (!scanoccupied && (N*(skhp == -1 ? 1 : sknside*sknside*12) < NHP)) {
logmsg("\n\n");
logmsg("NOTE, your star kdtree is sparse (has only a fraction of the stars expected)\n");
logmsg(" so you probably will get much faster results by setting the \"-E\" command-line\n");
logmsg(" flag.\n");
logmsg("\n\n");
}
quads->dimquads = me->dimquads;
codes->dimcodes = dimcodes;
quads->healpix = skhp;
codes->healpix = skhp;
quads->hpnside = sknside;
codes->hpnside = sknside;
if (id) {
quads->indexid = id;
codes->indexid = id;
}
qhdr = quadfile_get_header(quads);
chdr = codefile_get_header(codes);
add_headers(qhdr, args, argc, startree_header(me->starkd), circle, passes);
add_headers(chdr, args, argc, startree_header(me->starkd), circle, passes);
if (quadfile_write_header(quads)) {
ERROR("Couldn't write headers to quad file");
return -1;
}
if (codefile_write_header(codes)) {
ERROR("Couldn't write headers to code file");
return -1;
}
quads->numstars = codes->numstars = N;
me->quad_dist2_upper = arcmin2distsq(scale_max_arcmin);
me->quad_dist2_lower = arcmin2distsq(scale_min_arcmin);
codes->index_scale_upper = quads->index_scale_upper = distsq2rad(me->quad_dist2_upper);
codes->index_scale_lower = quads->index_scale_lower = distsq2rad(me->quad_dist2_lower);
me->nuses = calloc(N, sizeof(unsigned char));
// hprad = sqrt(2) * (healpix side length / 2.)
hprad = arcmin2dist(healpix_side_length_arcmin(Nside)) * M_SQRT1_2;
quadscale = 0.5 * sqrt(me->quad_dist2_upper);
// 1.01 for a bit of safety. we'll look at a few extra stars.
radius2 = square(1.01 * (hprad + quadscale));
me->radius2 = radius2;
logmsg("Healpix radius %g arcsec, quad scale %g arcsec, total %g arcsec\n",
distsq2arcsec(hprad*hprad),
distsq2arcsec(quadscale*quadscale),
distsq2arcsec(radius2));
hptotry = il_new(1024);
if (scanoccupied) {
logmsg("Scanning %i input stars...\n", N);
for (i=0; i<N; i++) {
double xyz[3];
int j;
if (startree_get(me->starkd, i, xyz)) {
ERROR("Failed to get star %i", i);
return -1;
}
j = xyzarrtohealpix(xyz, Nside);
il_insert_unique_ascending(hptotry, j);
if (log_get_level() > LOG_VERB) {
double ra,dec;
if (startree_get_radec(me->starkd, i, &ra, &dec)) {
ERROR("Failed to get RA,Dec for star %i\n", i);
return -1;
}
logdebug("star %i: RA,Dec %g,%g; xyz %g,%g,%g; hp %i\n",
i, ra, dec, xyz[0], xyz[1], xyz[2], j);
}
}
logmsg("Will check %zu healpixes.\n", il_size(hptotry));
if (log_get_level() > LOG_VERB) {
logdebug("Checking healpixes: [ ");
for (i=0; i<il_size(hptotry); i++)
logdebug("%i ", il_get(hptotry, i));
logdebug("]\n");
}
} else {
if (skhp == -1) {
// Try all healpixes.
il_free(hptotry);
hptotry = NULL;
Nhptotry = NHP;
} else {
// The star kdtree may itself be healpixed
int starhp, starx, stary;
// In that case, the healpixes we are interested in form a rectangle
// within a big healpix. These are the coords (in [0, Nside)) of
// that rectangle.
int x0, x1, y0, y1;
int x, y;
healpix_decompose_xy(skhp, &starhp, &starx, &stary, sknside);
x0 = starx * (Nside / sknside);
x1 = (starx+1) * (Nside / sknside);
y0 = stary * (Nside / sknside);
y1 = (stary+1) * (Nside / sknside);
for (y=y0; y<y1; y++) {
for (x=x0; x<x1; x++) {
int j = healpix_compose_xy(starhp, x, y, Nside);
il_append(hptotry, j);
}
}
assert(il_size(hptotry) == (Nside/sknside) * (Nside/sknside));
}
}
if (hptotry)
Nhptotry = il_size(hptotry);
me->quadlist = bl_new(65536, quadsize);
if (Nloosen)
me->retryhps = il_new(1024);
for (pass=0; pass<passes; pass++) {
char key[64];
int nthispass;
logmsg("Pass %i of %i.\n", pass+1, passes);
logmsg("Trying %i healpixes.\n", Nhptotry);
nthispass = build_quads(me, Nhptotry, hptotry, Nreuses);
logmsg("Made %i quads (out of %i healpixes) this pass.\n", nthispass, Nhptotry);
logmsg("Made %i quads so far.\n", (me->bigquadlist ? bt_size(me->bigquadlist) : 0) + (int)bl_size(me->quadlist));
sprintf(key, "PASS%i", pass+1);
fits_header_mod_int(chdr, key, nthispass, "quads created in this pass");
fits_header_mod_int(qhdr, key, nthispass, "quads created in this pass");
logmsg("Merging quads...\n");
if (!me->bigquadlist)
me->bigquadlist = bt_new(quadsize, 256);
for (i=0; i<bl_size(me->quadlist); i++) {
void* q = bl_access(me->quadlist, i);
bt_insert2(me->bigquadlist, q, FALSE, compare_quads, &me->dimquads);
}
bl_remove_all(me->quadlist);
}
il_free(hptotry);
hptotry = NULL;
if (Nloosen) {
int R;
for (R=Nreuses+1; R<=Nloosen; R++) {
il* trylist;
int nthispass;
logmsg("Loosening reuse maximum to %i...\n", R);
logmsg("Trying %zu healpixes.\n", il_size(me->retryhps));
if (!il_size(me->retryhps))
break;
trylist = me->retryhps;
me->retryhps = il_new(1024);
nthispass = build_quads(me, il_size(trylist), trylist, R);
logmsg("Made %i quads (out of %zu healpixes) this pass.\n", nthispass, il_size(trylist));
il_free(trylist);
for (i=0; i<bl_size(me->quadlist); i++) {
void* q = bl_access(me->quadlist, i);
bt_insert2(me->bigquadlist, q, FALSE, compare_quads, &me->dimquads);
}
bl_remove_all(me->quadlist);
}
}
if (me->retryhps)
il_free(me->retryhps);
kdtree_free_query(me->res);
me->res = NULL;
me->inds = NULL;
me->stars = NULL;
free(me->nuses);
me->nuses = NULL;
logmsg("Writing quads...\n");
// add the quads from the big-quadlist
nquads = bt_size(me->bigquadlist);
for (i=0; i<nquads; i++) {
unsigned int* q = bt_access(me->bigquadlist, i);
quad_write(codes, quads, q, me->starkd, me->dimquads, dimcodes);
}
// add the quads that were made during the final round.
for (i=0; i<bl_size(me->quadlist); i++) {
unsigned int* q = bl_access(me->quadlist, i);
quad_write(codes, quads, q, me->starkd, me->dimquads, dimcodes);
}
// fix output file headers.
if (quadfile_fix_header(quads)) {
ERROR("Failed to fix quadfile headers");
return -1;
}
if (codefile_fix_header(codes)) {
ERROR("Failed to fix codefile headers");
return -1;
}
bl_free(me->quadlist);
bt_free(me->bigquadlist);
toc();
logmsg("Done.\n");
return 0;
}
int main(int argc, char** args) {
int argchar;
char* outfn = NULL;
char* fn;
rdlist_t* rdls;
startree_t* skdt = NULL;
int i;
int loglvl = LOG_MSG;
while ((argchar = getopt (argc, args, OPTIONS)) != -1)
switch (argchar) {
case 'v':
loglvl++;
break;
case 'r':
outfn = optarg;
break;
case 'h':
print_help(args[0]);
exit(0);
}
log_init(loglvl);
if (!outfn || (optind == argc)) {
print_help(args[0]);
exit(-1);
}
rdls = rdlist_open_for_writing(outfn);
if (!rdls) {
ERROR("Failed to open RDLS file %s for output", outfn);
exit(-1);
}
if (rdlist_write_primary_header(rdls)) {
ERROR("Failed to write RDLS header");
exit(-1);
}
for (; optind<argc; optind++) {
int Nstars;
fn = args[optind];
logmsg("Opening star kdtree %s...\n", fn);
skdt = startree_open(fn);
if (!skdt) {
ERROR("Failed to read star kdtree %s", fn);
exit(-1);
}
Nstars = startree_N(skdt);
if (rdlist_write_header(rdls)) {
ERROR("Failed to write new RDLS field header");
exit(-1);
}
logmsg("Reading stars...\n");
for (i=0; i<Nstars; i++) {
double xyz[3];
double radec[2];
if (!(i % 200000)) {
printf(".");
fflush(stdout);
}
startree_get(skdt, i, xyz);
xyzarr2radecdegarr(xyz, radec);
if (rdlist_write_one_radec(rdls, radec[0], radec[1])) {
ERROR("Failed to write a RA,Dec entry");
exit(-1);
}
}
printf("\n");
startree_close(skdt);
if (rdlist_fix_header(rdls)) {
ERROR("Failed to fix RDLS field header");
exit(-1);
}
}
if (rdlist_fix_primary_header(rdls) ||
rdlist_close(rdls)) {
ERROR("Failed to close RDLS file");
exit(-1);
}
return 0;
}
int main(int argc, char** args) {
int argchar;
char* basename;
char* outfn = NULL;
index_t* index;
quadfile* qf;
rdlist_t* rdls;
startree_t* skdt = NULL;
anbool addradius = FALSE;
int i;
int radcolumn = -1;
while ((argchar = getopt (argc, args, OPTIONS)) != -1)
switch (argchar) {
case 'R':
addradius = TRUE;
break;
case 'r':
outfn = optarg;
break;
case 'h':
print_help(args[0]);
exit(0);
}
if (!outfn || (optind == argc)) {
print_help(args[0]);
exit(-1);
}
rdls = rdlist_open_for_writing(outfn);
if (!rdls) {
fprintf(stderr, "Failed to open RDLS file %s for output.\n", outfn);
exit(-1);
}
if (rdlist_write_primary_header(rdls)) {
fprintf(stderr, "Failed to write RDLS header.\n");
exit(-1);
}
if (addradius) {
radcolumn = rdlist_add_tagalong_column(rdls, fitscolumn_double_type(),
1, fitscolumn_double_type(),
"QUADRADIUS", "deg");
}
for (; optind<argc; optind++) {
//int Nstars;
int dimquads;
basename = args[optind];
printf("Reading files with basename %s\n", basename);
index = index_load(basename, 0, NULL);
if (!index) {
fprintf(stderr, "Failed to read index with base name \"%s\"\n", basename);
exit(-1);
}
qf = index->quads;
skdt = index->starkd;
//Nstars = startree_N(skdt);
if (rdlist_write_header(rdls)) {
fprintf(stderr, "Failed to write new RDLS field header.\n");
exit(-1);
}
dimquads = quadfile_dimquads(qf);
printf("Reading quads...\n");
for (i=0; i<qf->numquads; i++) {
unsigned int stars[dimquads];
double axyz[3], bxyz[3];
double midab[3];
double radec[2];
if (!(i % 200000)) {
printf(".");
fflush(stdout);
}
quadfile_get_stars(qf, i, stars);
startree_get(skdt, stars[0], axyz);
startree_get(skdt, stars[1], bxyz);
star_midpoint(midab, axyz, bxyz);
xyzarr2radecdegarr(midab, radec);
if (rdlist_write_one_radec(rdls, radec[0], radec[1])) {
fprintf(stderr, "Failed to write a RA,Dec entry.\n");
exit(-1);
}
if (addradius) {
double rad = arcsec2deg(distsq2arcsec(distsq(midab, axyz, 3)));
if (rdlist_write_tagalong_column(rdls, radcolumn, i, 1, &rad, 0)) {
fprintf(stderr, "Failed to write quad radius.\n");
exit(-1);
}
}
}
printf("\n");
index_close(index);
if (rdlist_fix_header(rdls)) {
fprintf(stderr, "Failed to fix RDLS field header.\n");
exit(-1);
}
rdlist_next_field(rdls);
}
if (rdlist_fix_primary_header(rdls) ||
rdlist_close(rdls)) {
fprintf(stderr, "Failed to close RDLS file.\n");
exit(-1);
}
return 0;
}
int allquads_create_quads(allquads_t* aq) {
quadbuilder_t* qb;
int i, N;
double* xyz;
qb = quadbuilder_init();
qb->quadd2_high = aq->quad_d2_upper;
qb->quadd2_low = aq->quad_d2_lower;
qb->check_scale_high = aq->use_d2_upper;
qb->check_scale_low = aq->use_d2_lower;
qb->dimquads = aq->dimquads;
qb->add_quad = add_quad;
qb->add_quad_token = aq;
N = startree_N(aq->starkd);
if (!qb->check_scale_high) {
int* inds;
inds = malloc(N * sizeof(int));
for (i=0; i<N; i++)
inds[i] = i;
xyz = malloc(3 * N * sizeof(double));
kdtree_copy_data_double(aq->starkd->tree, 0, N, xyz);
qb->starxyz = xyz;
qb->starinds = inds;
qb->Nstars = N;
quadbuilder_create(qb);
free(xyz);
free(inds);
} else {
int nq;
int lastgrass = 0;
/*
xyz = malloc(3 * N * sizeof(double));
kdtree_copy_data_double(aq->starkd->tree, 0, N, xyz);
*/
// star A = i
nq = aq->quads->numquads;
for (i=0; i<N; i++) {
double xyzA[3];
int* inds;
int NR;
int grass = (i*80 / N);
if (grass != lastgrass) {
printf(".");
fflush(stdout);
lastgrass = grass;
}
startree_get(aq->starkd, i, xyzA);
startree_search_for(aq->starkd, xyzA, aq->quad_d2_upper,
&xyz, NULL, &inds, &NR);
/*
startree_search_for(aq->starkd, xyzA, aq->quad_d2_upper,
NULL, NULL, &inds, &NR);
*/
logverb("Star %i of %i: found %i stars in range\n", i+1, N, NR);
aq->starA = i;
qb->starxyz = xyz;
qb->starinds = inds;
qb->Nstars = NR;
qb->check_AB_stars = check_AB;
qb->check_AB_stars_token = aq;
//qb->check_full_quad = check_full_quad;
//qb->check_full_quad_token = aq;
quadbuilder_create(qb);
logverb("Star %i of %i: wrote %i quads for this star, total %i so far.\n", i+1, N, aq->quads->numquads - nq, aq->quads->numquads);
free(inds);
free(xyz);
}
//
//free(xyz);
printf("\n");
}
quadbuilder_free(qb);
return 0;
}
int main(int argc, char *argv[]) {
int argchar;
char* progname = argv[0];
index_t* index;
fitstable_t* table;
char* indexfn = NULL;
char* outfn = NULL;
int i, D, N;
while ((argchar = getopt (argc, argv, OPTIONS)) != -1) {
switch (argchar) {
case 'i':
indexfn = optarg;
break;
case 'o':
outfn = optarg;
break;
default:
case 'h':
printHelp(progname);
exit(0);
}
}
if (!(indexfn && outfn)) {
printHelp(progname);
exit(-1);
}
index = index_load(indexfn, 0, NULL);
if (!index) {
ERROR("Failed to open index");
exit(-1);
}
table = fitstable_open_for_writing(outfn);
if (!table) {
ERROR("Failed to open output file for writing");
exit(-1);
}
D = index_get_quad_dim(index);
fitstable_add_write_column_array(table, fitscolumn_i32_type(), D,
"quads", "");
if (fitstable_write_primary_header(table) ||
fitstable_write_header(table)) {
ERROR("Failed to write headers");
exit(-1);
}
N = index_nquads(index);
for (i=0; i<N; i++) {
unsigned int quad[D];
quadfile_get_stars(index->quads, i, quad);
if (fitstable_write_row(table, quad)) {
ERROR("Failed to write quad %i", i);
exit(-1);
}
}
if (fitstable_fix_header(table)) {
ERROR("Failed to fix quad header");
exit(-1);
}
fitstable_next_extension(table);
fitstable_clear_table(table);
// write star RA,Dec s.
fitstable_add_write_column(table, fitscolumn_double_type(), "RA", "deg");
fitstable_add_write_column(table, fitscolumn_double_type(), "Dec", "deg");
if (fitstable_write_header(table)) {
ERROR("Failed to write star header");
exit(-1);
}
N = index_nstars(index);
for (i=0; i<N; i++) {
double xyz[3];
double ra, dec;
startree_get(index->starkd, i, xyz);
xyzarr2radecdeg(xyz, &ra, &dec);
if (fitstable_write_row(table, &ra, &dec)) {
ERROR("Failed to write star %i", i);
exit(-1);
}
}
if (fitstable_fix_header(table) ||
fitstable_close(table)) {
ERROR("Failed to fix star header and close");
exit(-1);
}
index_close(index);
return 0;
}