void
bkput(BKPT *bp, int install)
{
char buf[256];
ADDR loc;
int ret;
errstr(buf, sizeof buf);
if(machdata->bpfix)
loc = (*machdata->bpfix)(bp->loc);
else
loc = bp->loc;
if(install){
ret = get1(cormap, loc, bp->save, machdata->bpsize);
if (ret > 0)
ret = put1(cormap, loc, machdata->bpinst, machdata->bpsize);
}else
ret = put1(cormap, loc, bp->save, machdata->bpsize);
if(ret < 0){
sprint(buf, "can't set breakpoint at %#llux: %r", bp->loc);
print(buf);
read(0, buf, 100);
}
}
static int
cheader(Biobuf *bin, ZipHead *zh)
{
uint32_t v;
int flen, xlen, fclen;
v = get4(bin);
if(v != ZCHeader){
if(v == ZECHeader)
return 0;
sysfatal("bad magic number in file");
}
zh->madevers = get1(bin);
zh->madeos = get1(bin);
zh->extvers = get1(bin);
zh->extos = get1(bin);
zh->flags = get2(bin);
zh->meth = get2(bin);
zh->modtime = get2(bin);
zh->moddate = get2(bin);
zh->crc = get4(bin);
zh->csize = get4(bin);
zh->uncsize = get4(bin);
flen = get2(bin);
xlen = get2(bin);
fclen = get2(bin);
get2(bin); /* disk number start */
zh->iattr = get2(bin); /* 1 == is-text-file */
zh->eattr = get4(bin); /* 1 == readonly-file */
zh->off = get4(bin);
zh->file = getname(bin, flen);
while(xlen-- > 0)
get1(bin);
while(fclen-- > 0)
get1(bin);
return 1;
}
static int
cheader(Biobuf *bin, ZipHead *zh)
{
ulong v;
int flen, xlen, fclen;
v = get4(bin);
if(v != ZCHeader){
if(v == ZECHeader)
return 0;
error("bad magic number %lux", v);
}
zh->madevers = get1(bin);
zh->madeos = get1(bin);
zh->extvers = get1(bin);
zh->extos = get1(bin);
zh->flags = get2(bin);
zh->meth = get2(bin);
zh->modtime = get2(bin);
zh->moddate = get2(bin);
zh->crc = get4(bin);
zh->csize = get4(bin);
zh->uncsize = get4(bin);
flen = get2(bin);
xlen = get2(bin);
fclen = get2(bin);
get2(bin); /* disk number start */
zh->iattr = get2(bin);
zh->eattr = get4(bin);
zh->off = get4(bin);
zh->file = getname(bin, flen);
while(xlen-- > 0)
get1(bin);
while(fclen-- > 0)
get1(bin);
return 1;
}
/*
* arc_receive - receive data from the serial interface
*/
static void
arc_receive(
struct recvbuf *rbufp
)
{
register struct arcunit *up;
struct refclockproc *pp;
struct peer *peer;
char c;
int i, n, wday, month, flags, status;
int arc_last_offset;
static int quality_average = 0;
static int quality_sum = 0;
static int quality_polls = 0;
/*
* Initialize pointers and read the timecode and timestamp
*/
peer = (struct peer *)rbufp->recv_srcclock;
pp = peer->procptr;
up = (struct arcunit *)pp->unitptr;
/*
If the command buffer is empty, and we are resyncing, insert a
g\r quality request into it to poll for signal quality again.
*/
if((up->resyncing) && (space_left(up) == CMDQUEUELEN)) {
#ifdef DEBUG
if(debug > 1) { printf("arc: inserting signal-quality poll.\n"); }
#endif
send_slow(up, pp->io.fd, "g\r");
}
/*
The `arc_last_offset' is the offset in lastcode[] of the last byte
received, and which we assume actually received the input
timestamp.
(When we get round to using tty_clk and it is available, we
assume that we will receive the whole timecode with the
trailing \r, and that that \r will be timestamped. But this
assumption also works if receive the characters one-by-one.)
*/
arc_last_offset = pp->lencode+rbufp->recv_length - 1;
/*
We catch a timestamp iff:
* The command code is `o' for a timestamp.
* If ARCRON_MULTIPLE_SAMPLES is undefined then we must have
exactly char in the buffer (the command code) so that we
only sample the first character of the timecode as our
`on-time' character.
* The first character in the buffer is not the echoed `\r'
from the `o` command (so if we are to timestamp an `\r' it
must not be first in the receive buffer with lencode==1.
(Even if we had other characters following it, we probably
would have a premature timestamp on the '\r'.)
* We have received at least one character (I cannot imagine
how it could be otherwise, but anyway...).
*/
c = rbufp->recv_buffer[0];
if((pp->a_lastcode[0] == 'o') &&
#ifndef ARCRON_MULTIPLE_SAMPLES
(pp->lencode == 1) &&
#endif
((pp->lencode != 1) || (c != '\r')) &&
(arc_last_offset >= 1)) {
/* Note that the timestamp should be corrected if >1 char rcvd. */
l_fp timestamp;
timestamp = rbufp->recv_time;
#ifdef DEBUG
if(debug) { /* Show \r as `R', other non-printing char as `?'. */
printf("arc: stamp -->%c<-- (%d chars rcvd)\n",
((c == '\r') ? 'R' : (isgraph((int)c) ? c : '?')),
rbufp->recv_length);
}
#endif
/*
Now correct timestamp by offset of last byte received---we
subtract from the receive time the delay implied by the
extra characters received.
Reject the input if the resulting code is too long, but
allow for the trailing \r, normally not used but a good
handle for tty_clk or somesuch kernel timestamper.
*/
if(arc_last_offset > LENARC) {
#ifdef DEBUG
if(debug) {
printf("arc: input code too long (%d cf %d); rejected.\n",
arc_last_offset, LENARC);
}
#endif
pp->lencode = 0;
refclock_report(peer, CEVNT_BADREPLY);
return;
}
L_SUBUF(×tamp, charoffsets[arc_last_offset]);
#ifdef DEBUG
if(debug > 1) {
printf(
"arc: %s%d char(s) rcvd, the last for lastcode[%d]; -%sms offset applied.\n",
((rbufp->recv_length > 1) ? "*** " : ""),
rbufp->recv_length,
arc_last_offset,
mfptoms((unsigned long)0,
charoffsets[arc_last_offset],
1));
}
#endif
#ifdef ARCRON_MULTIPLE_SAMPLES
/*
If taking multiple samples, capture the current adjusted
sample iff:
* No timestamp has yet been captured (it is zero), OR
* This adjusted timestamp is earlier than the one already
captured, on the grounds that this one suffered less
delay in being delivered to us and is more accurate.
*/
if(L_ISZERO(&(up->lastrec)) ||
L_ISGEQ(&(up->lastrec), ×tamp))
#endif
{
#ifdef DEBUG
if(debug > 1) {
printf("arc: system timestamp captured.\n");
#ifdef ARCRON_MULTIPLE_SAMPLES
if(!L_ISZERO(&(up->lastrec))) {
l_fp diff;
diff = up->lastrec;
L_SUB(&diff, ×tamp);
printf("arc: adjusted timestamp by -%sms.\n",
mfptoms(diff.l_i, diff.l_f, 3));
}
#endif
}
#endif
up->lastrec = timestamp;
}
}
/* Just in case we still have lots of rubbish in the buffer... */
/* ...and to avoid the same timestamp being reused by mistake, */
/* eg on receipt of the \r coming in on its own after the */
/* timecode. */
if(pp->lencode >= LENARC) {
#ifdef DEBUG
if(debug && (rbufp->recv_buffer[0] != '\r'))
{ printf("arc: rubbish in pp->a_lastcode[].\n"); }
#endif
pp->lencode = 0;
return;
}
/* Append input to code buffer, avoiding overflow. */
for(i = 0; i < rbufp->recv_length; i++) {
if(pp->lencode >= LENARC) { break; } /* Avoid overflow... */
c = rbufp->recv_buffer[i];
/* Drop trailing '\r's and drop `h' command echo totally. */
if(c != '\r' && c != 'h') { pp->a_lastcode[pp->lencode++] = c; }
/*
If we've just put an `o' in the lastcode[0], clear the
timestamp in anticipation of a timecode arriving soon.
We would expect to get to process this before any of the
timecode arrives.
*/
if((c == 'o') && (pp->lencode == 1)) {
L_CLR(&(up->lastrec));
#ifdef DEBUG
if(debug > 1) { printf("arc: clearing timestamp.\n"); }
#endif
}
}
if (pp->lencode == 0) return;
/* Handle a quality message. */
if(pp->a_lastcode[0] == 'g') {
int r, q;
if(pp->lencode < 3) { return; } /* Need more data... */
r = (pp->a_lastcode[1] & 0x7f); /* Strip parity. */
q = (pp->a_lastcode[2] & 0x7f); /* Strip parity. */
if(((q & 0x70) != 0x30) || ((q & 0xf) > MAX_CLOCK_QUALITY) ||
((r & 0x70) != 0x30)) {
/* Badly formatted response. */
#ifdef DEBUG
if(debug) { printf("arc: bad `g' response %2x %2x.\n", r, q); }
#endif
return;
}
if(r == '3') { /* Only use quality value whilst sync in progress. */
if (up->quality_stamp < current_time) {
struct calendar cal;
l_fp new_stamp;
get_systime (&new_stamp);
caljulian (new_stamp.l_ui, &cal);
up->quality_stamp =
current_time + 60 - cal.second + 5;
quality_sum = 0;
quality_polls = 0;
}
quality_sum += (q & 0xf);
quality_polls++;
quality_average = (quality_sum / quality_polls);
#ifdef DEBUG
if(debug) { printf("arc: signal quality %d (%d).\n", quality_average, (q & 0xf)); }
#endif
} else if( /* (r == '2') && */ up->resyncing) {
up->quality = quality_average;
#ifdef DEBUG
if(debug)
{
printf("arc: sync finished, signal quality %d: %s\n",
up->quality,
quality_action(up->quality));
}
#endif
msyslog(LOG_NOTICE,
"ARCRON: sync finished, signal quality %d: %s",
up->quality,
quality_action(up->quality));
up->resyncing = 0; /* Resync is over. */
quality_average = 0;
quality_sum = 0;
quality_polls = 0;
#ifdef ARCRON_KEEN
/* Clock quality dubious; resync earlier than usual. */
if((up->quality == QUALITY_UNKNOWN) ||
(up->quality < MIN_CLOCK_QUALITY_OK))
{ up->next_resync = current_time + RETRY_RESYNC_TIME; }
#endif
}
pp->lencode = 0;
return;
}
/* Stop now if this is not a timecode message. */
if(pp->a_lastcode[0] != 'o') {
pp->lencode = 0;
refclock_report(peer, CEVNT_BADREPLY);
return;
}
/* If we don't have enough data, wait for more... */
if(pp->lencode < LENARC) { return; }
/* WE HAVE NOW COLLECTED ONE TIMESTAMP (phew)... */
#ifdef DEBUG
if(debug > 1) { printf("arc: NOW HAVE TIMESTAMP...\n"); }
#endif
/* But check that we actually captured a system timestamp on it. */
if(L_ISZERO(&(up->lastrec))) {
#ifdef DEBUG
if(debug) { printf("arc: FAILED TO GET SYSTEM TIMESTAMP\n"); }
#endif
pp->lencode = 0;
refclock_report(peer, CEVNT_BADREPLY);
return;
}
/*
Append a mark of the clock's received signal quality for the
benefit of Derek Mulcahy's Tcl/Tk utility (we map the `unknown'
quality value to `6' for his s/w) and terminate the string for
sure. This should not go off the buffer end.
*/
pp->a_lastcode[pp->lencode] = ((up->quality == QUALITY_UNKNOWN) ?
'6' : ('0' + up->quality));
pp->a_lastcode[pp->lencode + 1] = '\0'; /* Terminate for printf(). */
#ifdef PRE_NTP420
/* We don't use the micro-/milli- second part... */
pp->usec = 0;
pp->msec = 0;
#else
/* We don't use the nano-second part... */
pp->nsec = 0;
#endif
/* Validate format and numbers. */
if (pp->a_lastcode[0] != 'o'
|| !get2(pp->a_lastcode + 1, &pp->hour)
|| !get2(pp->a_lastcode + 3, &pp->minute)
|| !get2(pp->a_lastcode + 5, &pp->second)
|| !get1(pp->a_lastcode + 7, &wday)
|| !get2(pp->a_lastcode + 8, &pp->day)
|| !get2(pp->a_lastcode + 10, &month)
|| !get2(pp->a_lastcode + 12, &pp->year)) {
#ifdef DEBUG
/* Would expect to have caught major problems already... */
if(debug) { printf("arc: badly formatted data.\n"); }
#endif
pp->lencode = 0;
refclock_report(peer, CEVNT_BADREPLY);
return;
}
flags = pp->a_lastcode[14];
status = pp->a_lastcode[15];
#ifdef DEBUG
if(debug) { printf("arc: status 0x%.2x flags 0x%.2x\n", flags, status); }
#endif
n = 9;
/*
Validate received values at least enough to prevent internal
array-bounds problems, etc.
*/
if((pp->hour < 0) || (pp->hour > 23) ||
(pp->minute < 0) || (pp->minute > 59) ||
(pp->second < 0) || (pp->second > 60) /*Allow for leap seconds.*/ ||
(wday < 1) || (wday > 7) ||
(pp->day < 1) || (pp->day > 31) ||
(month < 1) || (month > 12) ||
(pp->year < 0) || (pp->year > 99)) {
/* Data out of range. */
pp->lencode = 0;
refclock_report(peer, CEVNT_BADREPLY);
return;
}
if(peer->MODE == 0) { /* compatiblity to original version */
int bst = flags;
/* Check that BST/UTC bits are the complement of one another. */
if(!(bst & 2) == !(bst & 4)) {
pp->lencode = 0;
refclock_report(peer, CEVNT_BADREPLY);
return;
}
}
if(status & 0x8) { msyslog(LOG_NOTICE, "ARCRON: battery low"); }
/* Year-2000 alert! */
/* Attempt to wrap 2-digit date into sensible window. */
if(pp->year < YEAR_PIVOT) { pp->year += 100; } /* Y2KFixes */
pp->year += 1900; /* use full four-digit year */ /* Y2KFixes */
/*
Attempt to do the right thing by screaming that the code will
soon break when we get to the end of its useful life. What a
hero I am... PLEASE FIX LEAP-YEAR AND WRAP CODE IN 209X!
*/
if(pp->year >= YEAR_PIVOT+2000-2 ) { /* Y2KFixes */
/*This should get attention B^> */
msyslog(LOG_NOTICE,
"ARCRON: fix me! EITHER YOUR DATE IS BADLY WRONG or else I will break soon!");
}
#ifdef DEBUG
if(debug) {
printf("arc: n=%d %02d:%02d:%02d %02d/%02d/%04d %1d %1d\n",
n,
pp->hour, pp->minute, pp->second,
pp->day, month, pp->year, flags, status);
}
#endif
/*
The status value tested for is not strictly supported by the
clock spec since the value of bit 2 (0x4) is claimed to be
undefined for MSF, yet does seem to indicate if the last resync
was successful or not.
*/
pp->leap = LEAP_NOWARNING;
status &= 0x7;
if(status == 0x3) {
if(status != up->status)
{ msyslog(LOG_NOTICE, "ARCRON: signal acquired"); }
} else {
if(status != up->status) {
msyslog(LOG_NOTICE, "ARCRON: signal lost");
pp->leap = LEAP_NOTINSYNC; /* MSF clock is free-running. */
up->status = status;
pp->lencode = 0;
refclock_report(peer, CEVNT_FAULT);
return;
}
}
up->status = status;
if (peer->MODE == 0) { /* compatiblity to original version */
int bst = flags;
pp->day += moff[month - 1];
if(isleap_4(pp->year) && month > 2) { pp->day++; }/* Y2KFixes */
/* Convert to UTC if required */
if(bst & 2) {
pp->hour--;
if (pp->hour < 0) {
pp->hour = 23;
pp->day--;
/* If we try to wrap round the year
* (BST on 1st Jan), reject.*/
if(pp->day < 0) {
pp->lencode = 0;
refclock_report(peer, CEVNT_BADTIME);
return;
}
}
}
}
if(peer->MODE > 0) {
if(pp->sloppyclockflag & CLK_FLAG1) {
struct tm local;
struct tm *gmtp;
time_t unixtime;
/*
* Convert to GMT for sites that distribute localtime.
* This means we have to do Y2K conversion on the
* 2-digit year; otherwise, we get the time wrong.
*/
memset(&local, 0, sizeof(local));
local.tm_year = pp->year-1900;
local.tm_mon = month-1;
local.tm_mday = pp->day;
local.tm_hour = pp->hour;
local.tm_min = pp->minute;
local.tm_sec = pp->second;
switch (peer->MODE) {
case 1:
local.tm_isdst = (flags & 2);
break;
case 2:
local.tm_isdst = (flags & 2);
break;
case 3:
switch (flags & 3) {
case 0: /* It is unclear exactly when the
Arcron changes from DST->ST and
ST->DST. Testing has shown this
to be irregular. For the time
being, let the OS decide. */
local.tm_isdst = 0;
#ifdef DEBUG
if (debug)
printf ("arc: DST = 00 (0)\n");
#endif
break;
case 1: /* dst->st time */
local.tm_isdst = -1;
#ifdef DEBUG
if (debug)
printf ("arc: DST = 01 (1)\n");
#endif
break;
case 2: /* st->dst time */
local.tm_isdst = -1;
#ifdef DEBUG
if (debug)
printf ("arc: DST = 10 (2)\n");
#endif
break;
case 3: /* dst time */
local.tm_isdst = 1;
#ifdef DEBUG
if (debug)
printf ("arc: DST = 11 (3)\n");
#endif
break;
}
break;
default:
msyslog(LOG_NOTICE, "ARCRON: Invalid mode %d",
peer->MODE);
return;
break;
}
unixtime = mktime (&local);
if ((gmtp = gmtime (&unixtime)) == NULL)
{
pp->lencode = 0;
refclock_report (peer, CEVNT_FAULT);
return;
}
pp->year = gmtp->tm_year+1900;
month = gmtp->tm_mon+1;
pp->day = ymd2yd(pp->year,month,gmtp->tm_mday);
/* pp->day = gmtp->tm_yday; */
pp->hour = gmtp->tm_hour;
pp->minute = gmtp->tm_min;
pp->second = gmtp->tm_sec;
#ifdef DEBUG
if (debug)
{
printf ("arc: time is %04d/%02d/%02d %02d:%02d:%02d UTC\n",
pp->year,month,gmtp->tm_mday,pp->hour,pp->minute,
pp->second);
}
#endif
} else
{
/*
* For more rational sites distributing UTC
*/
pp->day = ymd2yd(pp->year,month,pp->day);
}
}
if (peer->MODE == 0) { /* compatiblity to original version */
/* If clock signal quality is
* unknown, revert to default PRECISION...*/
if(up->quality == QUALITY_UNKNOWN) {
peer->precision = PRECISION;
} else { /* ...else improve precision if flag3 is set... */
peer->precision = ((pp->sloppyclockflag & CLK_FLAG3) ?
HIGHPRECISION : PRECISION);
}
} else {
if ((status == 0x3) && (pp->sloppyclockflag & CLK_FLAG2)) {
peer->precision = ((pp->sloppyclockflag & CLK_FLAG3) ?
HIGHPRECISION : PRECISION);
} else if (up->quality == QUALITY_UNKNOWN) {
peer->precision = PRECISION;
} else {
peer->precision = ((pp->sloppyclockflag & CLK_FLAG3) ?
HIGHPRECISION : PRECISION);
}
}
/* Notice and log any change (eg from initial defaults) for flags. */
if(up->saved_flags != pp->sloppyclockflag) {
#ifdef DEBUG
msyslog(LOG_NOTICE, "ARCRON: flags enabled: %s%s%s%s",
((pp->sloppyclockflag & CLK_FLAG1) ? "1" : "."),
((pp->sloppyclockflag & CLK_FLAG2) ? "2" : "."),
((pp->sloppyclockflag & CLK_FLAG3) ? "3" : "."),
((pp->sloppyclockflag & CLK_FLAG4) ? "4" : "."));
/* Note effects of flags changing... */
if(debug) {
printf("arc: PRECISION = %d.\n", peer->precision);
}
#endif
up->saved_flags = pp->sloppyclockflag;
}
/* Note time of last believable timestamp. */
pp->lastrec = up->lastrec;
#ifdef ARCRON_LEAPSECOND_KEEN
/* Find out if a leap-second might just have happened...
(ie is this the first hour of the first day of Jan or Jul?)
*/
if((pp->hour == 0) &&
(pp->day == 1) &&
((month == 1) || (month == 7))) {
if(possible_leap >= 0) {
/* A leap may have happened, and no resync has started yet...*/
possible_leap = 1;
}
} else {
/* Definitely not leap-second territory... */
possible_leap = 0;
}
#endif
if (!refclock_process(pp)) {
pp->lencode = 0;
refclock_report(peer, CEVNT_BADTIME);
return;
}
record_clock_stats(&peer->srcadr, pp->a_lastcode);
refclock_receive(peer);
}
void _grid2_thread(int *num_threads, int *cur_thread, Array<complex<T> > &data, Array<T> &coords, Array<T> &weight, Array<complex<T> > &out, Array<T> &kernel_table, T dx, T dy)
{
int imin, imax, jmin, jmax, i, j;
int width = out.dimensions(0); // assume isotropic dims
int width_div2 = width / 2;
uint64_t arms = 1;
uint64_t points_in_arm = 1;
uint64_t arms_times_coils = 1;
uint64_t coils = 1;
uint64_t coil, arm, point;
uint64_t width_times_coil = width;
T x, y, ix, jy;
T kernelRadius = DEFAULT_RADIUS_FOV_PRODUCT / width;
T kernelRadius_sqr = kernelRadius * kernelRadius;
T width_inv = 1.0 / width;
T dist_multiplier = (kernel_table.dimensions(0) - 1)/kernelRadius_sqr;
out = complex<T>(0.0);
if (coords.ndim() == 3)
{
points_in_arm = coords.dimensions(1);
arms = coords.dimensions(2);
}
if (out.ndim() == 3)
{
coils = out.dimensions(2);
}
arms_times_coils = arms * coils;
width_times_coil = width * coils;
/* split threads up by even chunks of data_out memory */
uint64_t numSections = coils / *num_threads;
uint64_t coil_start = *cur_thread * numSections;
uint64_t coil_end = (*cur_thread+1) * numSections;
/* loop over output data points */
for (coil=coil_start; coil<coil_end; coil++)
{
for (arm=0; arm<arms; arm++)
{
for (point=0; point<points_in_arm; point++)
{
complex<T> d = data(point,arm,coil) * weight(point,arm);
/* get the coordinates of the datapoint to grid
* these vary between -.5 -- +.5 */
x = coords(0,point,arm);
y = coords(1,point,arm);
/* add shift phase */
d *= exp( complex<T>(0, -2.*M_PI*(x*dx+y*dy)) );
/* set the boundaries of final dataset for gridding this point */
ix = x * width + width_div2;
set_minmax(ix, &imin, &imax, width, (T) DEFAULT_RADIUS_FOV_PRODUCT);
jy = y * width + width_div2;
set_minmax(jy, &jmin, &jmax, width, (T) DEFAULT_RADIUS_FOV_PRODUCT);
/* grid this point onto the neighboring cartesian points */
for (j=jmin; j<=jmax; ++j)
{
jy = (j - width_div2) * width_inv;
for (i=imin; i<=imax; ++i)
{
ix = (i - width_div2) * width_inv;
T dist_sqr = dist2(ix - x, jy - y);
if (dist_sqr < kernelRadius_sqr)
{
T ker = get1(kernel_table, (int) rint(dist_sqr * dist_multiplier));
out(i,j,coil) += ker * d;
}
}// x
}// y
}//point in arms
} //arms
} //coil
}
static void
header(Biobuf *bin, GZHead *h)
{
char *s;
int i, c, flag, ns, nsa;
if(get1(bin) != GZMAGIC1 || get1(bin) != GZMAGIC2)
error("bad gzip file magic");
if(get1(bin) != GZDEFLATE)
error("unknown compression type");
flag = get1(bin);
if(flag & ~(GZFTEXT|GZFEXTRA|GZFNAME|GZFCOMMENT|GZFHCRC))
fprint(2, "gunzip: reserved flags set, data may not be decompressed correctly\n");
/* mod time */
h->mtime = get4(bin);
/* extra flags */
get1(bin);
/* OS type */
get1(bin);
if(flag & GZFEXTRA)
for(i=get1(bin); i>0; i--)
get1(bin);
/* name */
if(flag & GZFNAME){
nsa = 32;
ns = 0;
s = malloc(nsa);
if(s == nil)
error("out of memory");
while((c = get1(bin)) != 0){
s[ns++] = c;
if(ns >= nsa){
nsa += 32;
s = realloc(s, nsa);
if(s == nil)
error("out of memory");
}
}
s[ns] = '\0';
h->file = s;
}else
h->file = strdup("<unnamed file>");
/* comment */
if(flag & GZFCOMMENT)
while(get1(bin) != 0)
;
/* crc16 */
if(flag & GZFHCRC){
get1(bin);
get1(bin);
}
}
BYTE GetTimestampExt() { return get1(data,7); }
BYTE GetMedia() { return get1(data,4); }
bool is_same9(const uint8_t *p, const uint8_t *q) { return (get8(p) ^ get8(q)) | (get1(p + 8) ^ get1(q + 8)); }
bool is_same1(const uint8_t *p, const uint8_t *q) { return get1(p) ^ get1(q); }
uint64_t get5(const uint8_t *p)
{
return get4(p) | (get1(p + 4) << 32);
}
uint64_t get3(const uint8_t *p)
{
return get2(p) | (get1(p + 2) << 16);
}
int priority() const {return get0()+get1();} // For hash replacement
// of a variable declared by a block scope extern declaration
// have linkage. If there is a visible declaration of an entity
// with linkage having the same name and type, ignoring entities
// declared outside the innermost enclosing namespace scope, the
// block scope declaration declares that same entity and
// receives the linkage of the previous declaration.
extern int same_entity;
constexpr int *get1() {
int same_entity = 0; // not the same entity
{
extern int same_entity;
return &same_entity;
}
}
static_assert(get1() == &same_entity, "failed to find previous decl");
static int same_entity_2[3];
constexpr int *get2() {
// This is a redeclaration of the same entity, even though it doesn't
// inherit the type of the prior declaration.
extern int same_entity_2[];
return same_entity_2;
}
static_assert(get2() == same_entity_2, "failed to find previous decl");
static int different_entities;
constexpr int *get3() {
int different_entities = 0;
{
// FIXME: This is not a redeclaration of the prior entity, because
int get(int key) {
return get1(root, key);
}
BYTE GetVersion() { return get1(data,3); }
int
main(int argc, char **argv)
{
int i;
int n1, n2;
off_t top2 = 0, bot2;
char *arg = 0, *x;
progname = basename(argv[0]);
setlocale(LC_COLLATE, "");
setlocale(LC_CTYPE, "");
mb_cur_max = MB_CUR_MAX;
while (argc > 1 && argv[1][0] == '-') {
if (argv[1][1] == '\0')
break;
switch (argv[1][1]) {
case 'a':
if (argv[1][2])
arg = &argv[1][2];
else if (argv[2]) {
arg = argv[2];
argv++, argc--;
} else
arg = "3";
switch(*arg) {
case '1':
aflg |= 1;
break;
case '2':
aflg |= 2;
break;
default:
aflg |= 3;
}
break;
case 'e':
if (argv[1][2])
null = &argv[1][2];
else if (argv[2]) {
null = argv[2];
argv++;
argc--;
} else
usage();
break;
case 't':
if (argv[1][2]) {
int n;
next(sep1, &argv[1][2], n);
sep2 = sep1;
} else if (argv[2]) {
int n;
next(sep1, argv[2], n);
sep2 = sep1;
argv++, argc--;
} else
usage();
break;
case 'o':
if (argv[2] == NULL)
usage();
arg = argv[1][2] ? &argv[1][2] : argv[2];
for (no = 0;
olist = srealloc(olist, (no+1)*sizeof *olist),
olistf = srealloc(olistf,(no+1)*sizeof *olistf),
olist[no] = 0, olistf[no] = 0,
arg; no++) {
if (arg[0] == '1' && arg[1] == '.') {
olistf[no] = F1;
olist[no] = strtol(&arg[2], &x, 10);
} else if (arg[0] == '2' && arg[1] == '.') {
olist[no] = strtol(&arg[2], &x, 10);
olistf[no] = F2;
} else if (arg[0] == '0') {
olistf[no] = JF;
x = &arg[1];
} else
break;
while (*x == ' ' || *x == ',')
x++;
if (*x)
arg = x;
else {
argc--;
argv++;
arg = argv[2];
}
}
if (no == 0) {
fprintf(stderr, "%s: invalid file number (%s) "
"for -o\n", progname, arg);
exit(2);
}
break;
case 'j':
if (argv[2] == NULL)
usage();
if (argv[1][2] == '1')
j1 = atoi(argv[2]);
else if (argv[1][2] == '2')
j2 = atoi(argv[2]);
else
j1 = j2 = atoi(argv[2]);
argc--;
argv++;
break;
case '1':
if (argv[1][2])
arg = &argv[1][2];
else if (argv[2]) {
arg = argv[2];
argv++, argc--;
} else
usage();
j1 = atoi(arg);
break;
case '2':
if (argv[1][2])
arg = &argv[1][2];
else if (argv[2]) {
arg = argv[2];
argv++, argc--;
} else
usage();
j2 = atoi(arg);
break;
case 'v':
if (argv[1][2])
arg = &argv[1][2];
else if (argv[2]) {
arg = argv[2];
argv++, argc--;
} else
usage();
if (*arg == '1')
vflg |= 1;
else if (*arg == '2')
vflg |= 2;
break;
}
argc--;
argv++;
}
for (i = 0; i < no; i++)
olist[i]--; /* 0 origin */
if (argc != 3)
usage();
j1--;
j2--; /* everyone else believes in 0 origin */
s1 = ppi(F1, j1);
s2 = ppi(F2, j2);
if (argv[1][0] == '-' && argv[1][1] == '\0')
f[F1] = ib_alloc(0, 0);
else if ((f[F1] = ib_open(argv[1], 0)) == NULL)
error("can't open ", argv[1]);
if (argv[2][0] == '-' && argv[2][1] == '\0')
f[F2] = ib_alloc(0, 0);
else if ((f[F2] = ib_open(argv[2], 0)) == NULL)
error("can't open ", argv[2]);
#define get1() n1=input(F1)
#define get2() n2=input(F2)
get1();
bot2 = ib_seek(f[F2], 0, SEEK_CUR);
get2();
while(n1>=0 && n2>=0 || (aflg|vflg)!=0 && (n1>=0||n2>=0)) {
if(n1>=0 && n2>=0 && comp()>0 || n1<0) {
if(aflg&2||vflg&2) output(0, n2);
bot2 = ib_seek(f[F2], 0, SEEK_CUR);
get2();
} else if(n1>=0 && n2>=0 && comp()<0 || n2<0) {
if(aflg&1||vflg&1) output(n1, 0);
get1();
} else { /*(n1>=0 && n2>=0 && comp()==0)*/
while(n2>=0 && comp()==0) {
if(vflg==0) output(n1, n2);
top2 = ib_seek(f[F2], 0, SEEK_CUR);
get2();
}
ib_seek(f[F2], bot2, SEEK_SET);
get2();
get1();
for(;;) {
if(n1>=0 && n2>=0 && comp()==0) {
if(vflg==0) output(n1, n2);
get2();
} else if(n1>=0 && n2>=0 && comp()<0 || n2<0) {
ib_seek(f[F2], bot2, SEEK_SET);
get2();
get1();
} else { /*(n1>=0 && n2>=0 && comp()>0 || n1<0)*/
ib_seek(f[F2], top2, SEEK_SET);
bot2 = top2;
get2();
break;
}
}
}
}
return(0);
}
BYTE GetType() { return get1(data,0); }
void dopage()
{
while ((opcode = (int) get1()) != EOP) { /* process page until eop */
if (opcode <= LASTCHAR)
dochar((char) opcode);
else if ((opcode >= FONT_00) && (opcode <= FONT_63))
setfont(opcode - FONT_00);
else if (opcode > POST_POST)
errorexit(illop);
else
switch (opcode) {
case SET1 : setchar(get1()); break;
case SET2 : setchar(get2()); break;
case SET3 : setchar(get3()); break;
case SET4 : setchar(get4()); break;
case SET_RULE : { long height = sget4();
rule(MOVE, sget4(), height); break;
}
case PUT1 : putcharacter(get1()); break;
case PUT2 : putcharacter(get2()); break;
case PUT3 : putcharacter(get3()); break;
case PUT4 : putcharacter(get4()); break;
case PUT_RULE : { long height = sget4();
rule(STAY, sget4(), height); break;
}
case NOP : break; /* no-op */
case BOP : errorexit(bdbop); break;
/* case EOP : break; strange place to have EOP */
case PUSH : if (sptr >= stackmax) /* push */
errorexit(stkof);
stack[sptr].hh = h;
stack[sptr].vv = v;
stack[sptr].ww = w;
stack[sptr].xx = x;
stack[sptr].yy = y;
stack[sptr].zz = z;
sptr++;
break;
case POP : if (sptr == 0) /* pop */
errorexit(stkuf);
sptr--;
h = stack[sptr].hh;
v = stack[sptr].vv;
w = stack[sptr].ww;
x = stack[sptr].xx;
y = stack[sptr].yy;
z = stack[sptr].zz;
break;
case RIGHT1 : (void) horizontalmove(sget1()); break;
case RIGHT2 : (void) horizontalmove(sget2()); break;
case RIGHT3 : (void) horizontalmove(sget3()); break;
case RIGHT4 : (void) horizontalmove(sget4()); break;
case W0 : h += w; break;
case W1 : w = horizontalmove(sget1()); break;
case W2 : w = horizontalmove(sget2()); break;
case W3 : w = horizontalmove(sget3()); break;
case W4 : w = horizontalmove(sget4()); break;
case X0 : h += x; break;
case X1 : x = horizontalmove(sget1()); break;
case X2 : x = horizontalmove(sget2()); break;
case X3 : x = horizontalmove(sget3()); break;
case X4 : x = horizontalmove(sget4()); break;
case DOWN1 : v += sget1(); break;
case DOWN2 : v += sget2(); break;
case DOWN3 : v += sget3(); break;
case DOWN4 : v += sget4(); break;
case Y0 : v += y; break;
case Y1 : y = sget1(); v += y; break;
case Y2 : y = sget2(); v += y; break;
case Y3 : y = sget3(); v += y; break;
case Y4 : y = sget4(); v += y; break;
case Z0 : v += z; break;
case Z1 : z = sget1(); v += z; break;
case Z2 : z = sget2(); v += z; break;
case Z3 : z = sget3(); v += z; break;
case Z4 : z = sget4(); v += z; break;
case FNT1 :
case FNT2 :
case FNT3 :
case FNT4 : setfont(num(opcode - FNT1 + 1));
break;
case XXX1 : mseek(DVIfile, get1(), relative); break;
case XXX2 : mseek(DVIfile, get2(), relative); break;
case XXX3 : mseek(DVIfile, get3(), relative); break;
case XXX4 : mseek(DVIfile, get4(), relative); break;
case FNT_DEF1 :
case FNT_DEF2 :
case FNT_DEF3 :
case FNT_DEF4 : fontdef(opcode - FNT_DEF1 + 1);
break;
case PRE : errorexit(bdpre); break;
case POST : errorexit(bdpst); break;
case POST_POST: errorexit(bdpp); break;
}
}
} /* dopage */
int test1() {
int result = get1();
return suspiciously_read + result;
}
void skippage() /* skip past one page */
{
register int opcode;
while ((opcode = (int) get1()) != EOP) {
if (opcode > POST_POST)
errorexit(illop);
else
switch (opcode) {
case SET1 :
case PUT1 :
case RIGHT1 :
case W1 :
case X1 :
case DOWN1 :
case Y1 :
case Z1 : /* assume FNT change can also be skipped */
case FNT1 : mseek(DVIfile, 1L, relative); break;
case SET2 :
case PUT2 :
case RIGHT2 :
case W2 :
case X2 :
case DOWN2 :
case Y2 :
case Z2 :
case FNT2 : mseek(DVIfile, 2L, relative); break;
case SET3 :
case PUT3 :
case RIGHT3 :
case W3 :
case X3 :
case DOWN3 :
case Y3 :
case Z3 :
case FNT3 : mseek(DVIfile, 3L, relative); break;
case SET4 :
case PUT4 :
case RIGHT4 :
case W4 :
case X4 :
case DOWN4 :
case Y4 :
case Z4 :
case FNT4 : mseek(DVIfile, 4L, relative); break;
case SET_RULE :
case PUT_RULE : mseek(DVIfile, 8L, relative); break;
case BOP : errorexit(bdbop); break;
case XXX1 : mseek(DVIfile, get1(), relative); break;
case XXX2 : mseek(DVIfile, get2(), relative); break;
case XXX3 : mseek(DVIfile, get3(), relative); break;
case XXX4 : mseek(DVIfile, get4(), relative); break;
case FNT_DEF1 :
case FNT_DEF2 :
case FNT_DEF3 :
case FNT_DEF4 : fontdef(opcode - FNT_DEF1 + 1); break;
case PRE : errorexit(bdpre); break;
case POST : errorexit(bdpst); break;
case POST_POST: errorexit(bdpp); break;
}
}
} /* skippage */
