static int branch_drtom(glp_tree *T, int *_next)
{ glp_prob *mip = T->mip;
int m = mip->m;
int n = mip->n;
char *non_int = T->non_int;
int j, jj, k, t, next, kase, len, stat, *ind;
double x, dk, alfa, delta_j, delta_k, delta_z, dz_dn, dz_up,
dd_dn, dd_up, degrad, *val;
/* basic solution of LP relaxation must be optimal */
xassert(glp_get_status(mip) == GLP_OPT);
/* allocate working arrays */
ind = xcalloc(1+n, sizeof(int));
val = xcalloc(1+n, sizeof(double));
/* nothing has been chosen so far */
jj = 0, degrad = -1.0;
/* walk through the list of columns (structural variables) */
for (j = 1; j <= n; j++)
{ /* if j-th column is not marked as fractional, skip it */
if (!non_int[j]) continue;
/* obtain (fractional) value of j-th column in basic solution
of LP relaxation */
x = glp_get_col_prim(mip, j);
/* since the value of j-th column is fractional, the column is
basic; compute corresponding row of the simplex table */
len = glp_eval_tab_row(mip, m+j, ind, val);
/* the following fragment computes a change in the objective
function: delta Z = new Z - old Z, where old Z is the
objective value in the current optimal basis, and new Z is
the objective value in the adjacent basis, for two cases:
1) if new upper bound ub' = floor(x[j]) is introduced for
j-th column (down branch);
2) if new lower bound lb' = ceil(x[j]) is introduced for
j-th column (up branch);
since in both cases the solution remaining dual feasible
becomes primal infeasible, one implicit simplex iteration
is performed to determine the change delta Z;
it is obvious that new Z, which is never better than old Z,
is a lower (minimization) or upper (maximization) bound of
the objective function for down- and up-branches. */
for (kase = -1; kase <= +1; kase += 2)
{ /* if kase < 0, the new upper bound of x[j] is introduced;
in this case x[j] should decrease in order to leave the
basis and go to its new upper bound */
/* if kase > 0, the new lower bound of x[j] is introduced;
in this case x[j] should increase in order to leave the
basis and go to its new lower bound */
/* apply the dual ratio test in order to determine which
auxiliary or structural variable should enter the basis
to keep dual feasibility */
k = glp_dual_rtest(mip, len, ind, val, kase, 1e-9);
if (k != 0) k = ind[k];
/* if no non-basic variable has been chosen, LP relaxation
of corresponding branch being primal infeasible and dual
unbounded has no primal feasible solution; in this case
the change delta Z is formally set to infinity */
if (k == 0)
{ delta_z =
(T->mip->dir == GLP_MIN ? +DBL_MAX : -DBL_MAX);
goto skip;
}
/* row of the simplex table that corresponds to non-basic
variable x[k] choosen by the dual ratio test is:
x[j] = ... + alfa * x[k] + ...
where alfa is the influence coefficient (an element of
the simplex table row) */
/* determine the coefficient alfa */
for (t = 1; t <= len; t++) if (ind[t] == k) break;
xassert(1 <= t && t <= len);
alfa = val[t];
/* since in the adjacent basis the variable x[j] becomes
non-basic, knowing its value in the current basis we can
determine its change delta x[j] = new x[j] - old x[j] */
delta_j = (kase < 0 ? floor(x) : ceil(x)) - x;
/* and knowing the coefficient alfa we can determine the
corresponding change delta x[k] = new x[k] - old x[k],
where old x[k] is a value of x[k] in the current basis,
and new x[k] is a value of x[k] in the adjacent basis */
delta_k = delta_j / alfa;
/* Tomlin noticed that if the variable x[k] is of integer
kind, its change cannot be less (eventually) than one in
the magnitude */
if (k > m && glp_get_col_kind(mip, k-m) != GLP_CV)
{ /* x[k] is structural integer variable */
if (fabs(delta_k - floor(delta_k + 0.5)) > 1e-3)
{ if (delta_k > 0.0)
delta_k = ceil(delta_k); /* +3.14 -> +4 */
else
delta_k = floor(delta_k); /* -3.14 -> -4 */
}
}
/* now determine the status and reduced cost of x[k] in the
current basis */
if (k <= m)
{ stat = glp_get_row_stat(mip, k);
dk = glp_get_row_dual(mip, k);
}
else
{ stat = glp_get_col_stat(mip, k-m);
dk = glp_get_col_dual(mip, k-m);
}
/* if the current basis is dual degenerate, some reduced
costs which are close to zero may have wrong sign due to
round-off errors, so correct the sign of d[k] */
switch (T->mip->dir)
{ case GLP_MIN:
if (stat == GLP_NL && dk < 0.0 ||
stat == GLP_NU && dk > 0.0 ||
stat == GLP_NF) dk = 0.0;
break;
case GLP_MAX:
if (stat == GLP_NL && dk > 0.0 ||
stat == GLP_NU && dk < 0.0 ||
stat == GLP_NF) dk = 0.0;
break;
default:
xassert(T != T);
}
/* now knowing the change of x[k] and its reduced cost d[k]
we can compute the corresponding change in the objective
function delta Z = new Z - old Z = d[k] * delta x[k];
note that due to Tomlin's modification new Z can be even
worse than in the adjacent basis */
delta_z = dk * delta_k;
skip: /* new Z is never better than old Z, therefore the change
delta Z is always non-negative (in case of minimization)
or non-positive (in case of maximization) */
switch (T->mip->dir)
{ case GLP_MIN: xassert(delta_z >= 0.0); break;
case GLP_MAX: xassert(delta_z <= 0.0); break;
default: xassert(T != T);
}
/* save the change in the objective fnction for down- and
up-branches, respectively */
if (kase < 0) dz_dn = delta_z; else dz_up = delta_z;
}
/* thus, in down-branch no integer feasible solution can be
better than Z + dz_dn, and in up-branch no integer feasible
solution can be better than Z + dz_up, where Z is value of
the objective function in the current basis */
/* following the heuristic by Driebeck and Tomlin we choose a
column (i.e. structural variable) which provides largest
degradation of the objective function in some of branches;
besides, we select the branch with smaller degradation to
be solved next and keep other branch with larger degradation
in the active list hoping to minimize the number of further
backtrackings */
if (degrad < fabs(dz_dn) || degrad < fabs(dz_up))
{ jj = j;
if (fabs(dz_dn) < fabs(dz_up))
{ /* select down branch to be solved next */
next = GLP_DN_BRNCH;
degrad = fabs(dz_up);
}
else
{ /* select up branch to be solved next */
next = GLP_UP_BRNCH;
degrad = fabs(dz_dn);
}
/* save the objective changes for printing */
dd_dn = dz_dn, dd_up = dz_up;
/* if down- or up-branch has no feasible solution, we does
not need to consider other candidates (in principle, the
corresponding branch could be pruned right now) */
if (degrad == DBL_MAX) break;
}
}
/* free working arrays */
xfree(ind);
xfree(val);
/* something must be chosen */
xassert(1 <= jj && jj <= n);
#if 1 /* 02/XI-2009 */
if (degrad < 1e-6 * (1.0 + 0.001 * fabs(mip->obj_val)))
{ jj = branch_mostf(T, &next);
goto done;
}
#endif
if (T->parm->msg_lev >= GLP_MSG_DBG)
{ xprintf("branch_drtom: column %d chosen to branch on\n", jj);
if (fabs(dd_dn) == DBL_MAX)
xprintf("branch_drtom: down-branch is infeasible\n");
else
xprintf("branch_drtom: down-branch bound is %.9e\n",
lpx_get_obj_val(mip) + dd_dn);
if (fabs(dd_up) == DBL_MAX)
xprintf("branch_drtom: up-branch is infeasible\n");
else
xprintf("branch_drtom: up-branch bound is %.9e\n",
lpx_get_obj_val(mip) + dd_up);
}
done: *_next = next;
return jj;
}
/* --------------------------------------------------------------------------
Name: bcm6352_enet_write
Purpose: Sends a data buffer.
-------------------------------------------------------------------------- */
static int bcm6352_enet_write(cfe_devctx_t *ctx,iocb_buffer_t *buffer)
{
int copycount;
unsigned int srclen;
unsigned char *dstptr;
unsigned char *srcptr;
bcm6352enet_softc *softc = (bcm6352enet_softc *) ctx->dev_softc;
volatile DmaChannel *txDma = softc->txDma;
/* ============================= ASSERTIONS ============================= */
if( ctx == NULL ) {
xprintf( "No context\n" );
return -1;
}
if( buffer == NULL ) {
xprintf( "No dst buffer\n" );
return -1;
}
if( buffer->buf_length > ENET_MAX_BUF_SIZE ) {
xprintf( "src buffer too large.\n" );
xprintf( "size is %d\n", buffer->buf_length );
return -1;
}
if( softc == NULL ) {
xprintf( "softc has not been initialized.\n" );
return -1;
}
/* ====================================================================== */
/******** Convert header to Broadcom's special header format. ********/
dstptr = softc->txBufPtr;
srcptr = buffer->buf_ptr;
srclen = buffer->buf_length;
memcpy( dstptr, srcptr, ETH_ALEN * 2 );
dstptr += ETH_ALEN * 2;
srcptr += ETH_ALEN * 2;
*((uint16_t *)dstptr) = BRCM_TYPE;
dstptr += 2;
if( srclen < 60 - 6 - 8 ) {
*((uint16_t *)dstptr) = (uint16_t)60;
} else {
*((uint16_t *)dstptr) = (uint16_t)(srclen + 6 + 8);
}
dstptr += 2;
*((uint16_t *)dstptr) = (uint16_t)MANAGEMENT_PORT;
dstptr += 2;
copycount = srclen - ETH_ALEN * 2;
memcpy( dstptr, srcptr, copycount );
if( srclen < 60 ) {
dstptr += copycount;
memset( dstptr, 0, 60 - srclen );
txDma->length = 66;
} else {
txDma->length = srclen + 6;
}
/* Set status of DMA buffer to be transmitted. */
txDma->bufStat = DMA_SOP | DMA_EOP | DMA_APPEND_CRC | DMA_OWN;
/* Enable DMA for this channel. */
softc->txDma->cfg |= DMA_ENABLE;
/* poll the dma status until done. */
while( (txDma->bufStat & DMA_OWN) == 0 )
;
txDma->bufStat = 0;
return 0;
}
void main() {
int n;
xprintf("a\n%d\n%d\n%10d\n%010d\n%u\n%x\n%c\n%s\n%n", 42, -10, 1, 5, 1234,
0xabcdef5, 'c', "Hello", &n);
xprintf("%d\n", n);
}
int main(void)
{
int LogOn = 0;
int ComOn = 0;
int dT;
int16_t data[32];
uint32_t x;
UINT cnt;
InitSystemTick();
InitGPIO();
InitTimer();
STM_EVAL_LEDOn(LED4);
InitUART(115200);
InitPressureSensor();
InitFlowMeter();
InitAccAndMag();
InitGyro();
STM_EVAL_LEDOn(LED7); // zapnem LED7 - zelena
Delta_us();
while(1)
{
// sample period is time elapsed since previous sampling of sensors
sampleSensors(a,m,g);
// update timebase for next time
dT = Delta_us();
samplePeriod = 0.000001f * dT;
// convert gyro deg/s to rad/s
imuDegToRadV3(g);
// update AHRS
MadgwickFullAHRSUpdate(g, a, m, samplePeriod, quaternion);
if (LogOn) {
sprintf(text, "%5d%6d%6d%6d%7d%7d%7d%5d%5d%5d\r\n",
dT,
aRawData[0], aRawData[1], aRawData[2],
gRawData[0], gRawData[1], gRawData[2],
mRawData[0], mRawData[1], mRawData[2]);
f_write(&File, text, strlen(text), &cnt);
}
if(STM_EVAL_PBGetState(BUTTON_USER)) { // zmena rezimu vystupu
if (LogOn) {
// Stop logdata
LogOn = 0;
STM_EVAL_LEDOff(LED5); // zapnem LED7 - zelena
if (f_close(&File) == 0)
xprintf("Stop login data.\n\r");
else
xprintf("Error write datafile.\n\r");
} else {
// Start logdata
if (newFile() == 0)
xprintf("Start login data.\n\r");
else
xprintf("Error create datafile.\n\r");
STM_EVAL_LEDOn(LED5); // zapnem LED7 - zelena
LogOn = 1;
}
}
if (ComOn) {
data[0] = dT;
data[1] = aRawData[0];
data[2] = aRawData[1];
data[3] = aRawData[2];
data[4] = gRawData[0];
data[5] = gRawData[1];
data[6] = gRawData[2];
data[7] = mRawData[0];
data[8] = mRawData[1];
data[9] = mRawData[2];
data[10] = 0x8080;
SendDataUART((uint8_t*) data, 22);
}
if (IsReceiveUART()) {
if (ReadByteUART() == 's') {
STM_EVAL_LEDOn(LED10); // zapnem LED7 - zelena
ComOn = 1;
} else {
STM_EVAL_LEDOff(LED10); // zapnem LED7 - zelena
ComOn = 0;
}
}
/*
if (x = GetFlowMeter()) {
printf("Flow: %d\n\r", x);
}
*/
}
}
void app_hit10() { // 10秒あてゲーム
for (;;) {
playMML("L8ER8EG16E16");
ux_btn();
for (;;) {
FILL("afeaaa0067252577"); // title
FLUSH();
if (ux_btn())
break;
}
playMML("C");
FILL(PTN_3);
FLUSH();
WAIT(1000);
playMML("C");
FILL(PTN_2);
FLUSH();
WAIT(1000);
playMML("C");
FILL(PTN_1);
FLUSH();
WAIT(1000);
playMML("G2");
FILL(PTN_GO);
FLUSH();
WAIT(1000);
CLS(1);
systick = 0;
int cnt = 0;
int bkbtn = 0;
for (;;) {
int btn = ux_btn();
if (btn && !bkbtn) {
playMML("A4");
CLS(0);
break;
}
bkbtn = btn;
setMatrix2(buf);
wait(10);
}
unsigned int score = (10 * 100000 - systick) / 1000;
if (score < 0)
score = -score;
playMML("L8CEG");
FILL("00c9aaacacaaaa69"); // ok
xprintf("%d\n", systick);
xprintf("%d\n", score);
/*
for (int i = 0;; i++) {
int n = time % 10;
time /= 10;
if (time == 0)
break;
FILL(PTN_NUM[n]);
FLUSH();
WAIT(500);
}
*/
FILL(PTN_NUM[score / 10]);
PSET(6, 6);
FLUSH();
WAIT(1000);
FILL(PTN_NUM[score % 10]);
FLUSH();
WAIT(1000);
FLUSH();
WAIT(1000);
}
}
bool command_extra(uint8_t code)
{
uint32_t t;
uint16_t b;
switch (code) {
case KC_H:
case KC_SLASH: /* ? */
print("\n\n----- Bluetooth RN-42 Help -----\n");
print("i: RN-42 info\n");
print("b: battery voltage\n");
print("Del: enter/exit RN-42 config mode\n");
print("Slck: RN-42 initialize\n");
#if 0
print("1-4: restore link\n");
print("F1-F4: store link\n");
#endif
print("p: pairing\n");
if (config_mode) {
return true;
} else {
print("u: toggle Force USB mode\n");
return false; // to display default command help
}
case KC_P:
pairing();
return true;
#if 0
/* Store link address to EEPROM */
case KC_F1:
store_link(RN42_LINK0);
return true;
case KC_F2:
store_link(RN42_LINK1);
return true;
case KC_F3:
store_link(RN42_LINK2);
return true;
case KC_F4:
store_link(RN42_LINK3);
return true;
/* Restore link address to EEPROM */
case KC_1:
restore_link(RN42_LINK0);
return true;
case KC_2:
restore_link(RN42_LINK1);
return true;
case KC_3:
restore_link(RN42_LINK2);
return true;
case KC_4:
restore_link(RN42_LINK3);
return true;
#endif
case KC_I:
print("\n----- RN-42 info -----\n");
xprintf("protocol: %s\n", (host_get_driver() == &rn42_driver) ? "RN-42" : "LUFA");
xprintf("force_usb: %X\n", force_usb);
xprintf("rn42: %s\n", rn42_rts() ? "OFF" : (rn42_linked() ? "CONN" : "ON"));
xprintf("rn42_autoconnecting(): %X\n", rn42_autoconnecting());
xprintf("config_mode: %X\n", config_mode);
xprintf("USB State: %s\n",
(USB_DeviceState == DEVICE_STATE_Unattached) ? "Unattached" :
(USB_DeviceState == DEVICE_STATE_Powered) ? "Powered" :
(USB_DeviceState == DEVICE_STATE_Default) ? "Default" :
(USB_DeviceState == DEVICE_STATE_Addressed) ? "Addressed" :
(USB_DeviceState == DEVICE_STATE_Configured) ? "Configured" :
(USB_DeviceState == DEVICE_STATE_Suspended) ? "Suspended" : "?");
xprintf("battery: ");
switch (battery_status()) {
case FULL_CHARGED: xprintf("FULL"); break;
case CHARGING: xprintf("CHARG"); break;
case DISCHARGING: xprintf("DISCHG"); break;
case LOW_VOLTAGE: xprintf("LOW"); break;
default: xprintf("?"); break;
};
xprintf("\n");
xprintf("RemoteWakeupEnabled: %X\n", USB_Device_RemoteWakeupEnabled);
xprintf("VBUS: %X\n", USBSTA&(1<<VBUS));
t = timer_read32()/1000;
uint8_t d = t/3600/24;
uint8_t h = t/3600;
uint8_t m = t%3600/60;
uint8_t s = t%60;
xprintf("uptime: %02u %02u:%02u:%02u\n", d, h, m, s);
#if 0
xprintf("LINK0: %s\r\n", get_link(RN42_LINK0));
xprintf("LINK1: %s\r\n", get_link(RN42_LINK1));
xprintf("LINK2: %s\r\n", get_link(RN42_LINK2));
xprintf("LINK3: %s\r\n", get_link(RN42_LINK3));
#endif
return true;
case KC_B:
// battery monitor
t = timer_read32()/1000;
b = battery_voltage();
xprintf("BAT: %umV\t", b);
xprintf("%02u:", t/3600);
xprintf("%02u:", t%3600/60);
xprintf("%02u\n", t%60);
return true;
case KC_U:
if (config_mode) return false;
if (force_usb) {
print("Auto mode\n");
force_usb = false;
} else {
print("USB mode\n");
force_usb = true;
clear_keyboard();
host_set_driver(&lufa_driver);
}
return true;
case KC_DELETE:
/* RN-42 Command mode */
if (rn42_autoconnecting()) {
enter_command_mode();
command_state = CONSOLE;
config_mode = true;
} else {
exit_command_mode();
command_state = ONESHOT;
config_mode = false;
}
return true;
case KC_SCROLLLOCK:
init_rn42();
return true;
default:
if (config_mode)
return true;
else
return false; // yield to default command
}
return true;
}
// install installs the library, package, or binary associated with dir,
// which is relative to $GOROOT/src.
static void
install(char *dir)
{
char *name, *p, *elem, *prefix, *exe;
bool islib, ispkg, isgo, stale;
Buf b, b1, path;
Vec compile, files, link, go, missing, clean, lib, extra;
Time ttarg, t;
int i, j, k, n, doclean, targ;
if(vflag) {
if(!streq(goos, gohostos) || !streq(goarch, gohostarch))
xprintf("%s (%s/%s)\n", dir, goos, goarch);
else
xprintf("%s\n", dir);
}
binit(&b);
binit(&b1);
binit(&path);
vinit(&compile);
vinit(&files);
vinit(&link);
vinit(&go);
vinit(&missing);
vinit(&clean);
vinit(&lib);
vinit(&extra);
// path = full path to dir.
bpathf(&path, "%s/src/%s", goroot, dir);
name = lastelem(dir);
// For misc/prof, copy into the tool directory and we're done.
if(hasprefix(dir, "misc/")) {
copy(bpathf(&b, "%s/%s", tooldir, name),
bpathf(&b1, "%s/misc/%s", goroot, name), 1);
goto out;
}
// For release, cmd/prof and cmd/cov are not included.
if((streq(dir, "cmd/cov") || streq(dir, "cmd/prof")) && !isdir(bstr(&path))) {
if(vflag > 1)
xprintf("skipping %s - does not exist\n", dir);
goto out;
}
// set up gcc command line on first run.
if(gccargs.len == 0) {
xgetenv(&b, "CC");
if(b.len == 0)
bprintf(&b, "gcc");
splitfields(&gccargs, bstr(&b));
for(i=0; i<nelem(proto_gccargs); i++)
vadd(&gccargs, proto_gccargs[i]);
if(xstrstr(bstr(&b), "clang") != nil) {
vadd(&gccargs, "-Wno-dangling-else");
vadd(&gccargs, "-Wno-unused-value");
}
}
islib = hasprefix(dir, "lib") || streq(dir, "cmd/cc") || streq(dir, "cmd/gc");
ispkg = hasprefix(dir, "pkg");
isgo = ispkg || streq(dir, "cmd/go") || streq(dir, "cmd/cgo");
exe = "";
if(streq(gohostos, "windows"))
exe = ".exe";
// Start final link command line.
// Note: code below knows that link.p[targ] is the target.
if(islib) {
// C library.
vadd(&link, "ar");
vadd(&link, "rsc");
prefix = "";
if(!hasprefix(name, "lib"))
prefix = "lib";
targ = link.len;
vadd(&link, bpathf(&b, "%s/pkg/obj/%s_%s/%s%s.a", goroot, gohostos, gohostarch, prefix, name));
} else if(ispkg) {
// Go library (package).
vadd(&link, bpathf(&b, "%s/pack", tooldir));
vadd(&link, "grc");
p = bprintf(&b, "%s/pkg/%s_%s/%s", goroot, goos, goarch, dir+4);
*xstrrchr(p, '/') = '\0';
xmkdirall(p);
targ = link.len;
vadd(&link, bpathf(&b, "%s/pkg/%s_%s/%s.a", goroot, goos, goarch, dir+4));
} else if(streq(dir, "cmd/go") || streq(dir, "cmd/cgo")) {
// Go command.
vadd(&link, bpathf(&b, "%s/%sl", tooldir, gochar));
vadd(&link, "-o");
elem = name;
if(streq(elem, "go"))
elem = "go_bootstrap";
targ = link.len;
vadd(&link, bpathf(&b, "%s/%s%s", tooldir, elem, exe));
} else {
// C command. Use gccargs.
vcopy(&link, gccargs.p, gccargs.len);
vadd(&link, "-o");
targ = link.len;
vadd(&link, bpathf(&b, "%s/%s%s", tooldir, name, exe));
if(streq(gohostarch, "amd64"))
vadd(&link, "-m64");
else if(streq(gohostarch, "386"))
vadd(&link, "-m32");
}
ttarg = mtime(link.p[targ]);
// Gather files that are sources for this target.
// Everything in that directory, and any target-specific
// additions.
xreaddir(&files, bstr(&path));
// Remove files beginning with . or _,
// which are likely to be editor temporary files.
// This is the same heuristic build.ScanDir uses.
// There do exist real C files beginning with _,
// so limit that check to just Go files.
n = 0;
for(i=0; i<files.len; i++) {
p = files.p[i];
if(hasprefix(p, ".") || (hasprefix(p, "_") && hassuffix(p, ".go")))
xfree(p);
else
files.p[n++] = p;
}
files.len = n;
for(i=0; i<nelem(deptab); i++) {
if(hasprefix(dir, deptab[i].prefix)) {
for(j=0; (p=deptab[i].dep[j])!=nil; j++) {
breset(&b1);
bwritestr(&b1, p);
bsubst(&b1, "$GOROOT", goroot);
bsubst(&b1, "$GOOS", goos);
bsubst(&b1, "$GOARCH", goarch);
p = bstr(&b1);
if(hassuffix(p, ".a")) {
vadd(&lib, bpathf(&b, "%s", p));
continue;
}
if(hassuffix(p, "/*")) {
bpathf(&b, "%s/%s", bstr(&path), p);
b.len -= 2;
xreaddir(&extra, bstr(&b));
bprintf(&b, "%s", p);
b.len -= 2;
for(k=0; k<extra.len; k++)
vadd(&files, bpathf(&b1, "%s/%s", bstr(&b), extra.p[k]));
continue;
}
if(hasprefix(p, "-")) {
p++;
n = 0;
for(k=0; k<files.len; k++) {
if(hasprefix(files.p[k], p))
xfree(files.p[k]);
else
files.p[n++] = files.p[k];
}
files.len = n;
continue;
}
vadd(&files, p);
}
}
}
vuniq(&files);
// Convert to absolute paths.
for(i=0; i<files.len; i++) {
if(!isabs(files.p[i])) {
bpathf(&b, "%s/%s", bstr(&path), files.p[i]);
xfree(files.p[i]);
files.p[i] = btake(&b);
}
}
// Is the target up-to-date?
stale = rebuildall;
n = 0;
for(i=0; i<files.len; i++) {
p = files.p[i];
for(j=0; j<nelem(depsuffix); j++)
if(hassuffix(p, depsuffix[j]))
goto ok;
xfree(files.p[i]);
continue;
ok:
t = mtime(p);
if(t != 0 && !hassuffix(p, ".a") && !shouldbuild(p, dir)) {
xfree(files.p[i]);
continue;
}
if(hassuffix(p, ".go"))
vadd(&go, p);
if(t > ttarg)
stale = 1;
if(t == 0) {
vadd(&missing, p);
files.p[n++] = files.p[i];
continue;
}
files.p[n++] = files.p[i];
}
files.len = n;
for(i=0; i<lib.len && !stale; i++)
if(mtime(lib.p[i]) > ttarg)
stale = 1;
if(!stale)
goto out;
// For package runtime, copy some files into the work space.
if(streq(dir, "pkg/runtime")) {
copy(bpathf(&b, "%s/arch_GOARCH.h", workdir),
bpathf(&b1, "%s/arch_%s.h", bstr(&path), goarch), 0);
copy(bpathf(&b, "%s/defs_GOOS_GOARCH.h", workdir),
bpathf(&b1, "%s/defs_%s_%s.h", bstr(&path), goos, goarch), 0);
copy(bpathf(&b, "%s/os_GOOS.h", workdir),
bpathf(&b1, "%s/os_%s.h", bstr(&path), goos), 0);
copy(bpathf(&b, "%s/signals_GOOS.h", workdir),
bpathf(&b1, "%s/signals_%s.h", bstr(&path), goos), 0);
}
// Generate any missing files; regenerate existing ones.
for(i=0; i<files.len; i++) {
p = files.p[i];
elem = lastelem(p);
for(j=0; j<nelem(gentab); j++) {
if(hasprefix(elem, gentab[j].nameprefix)) {
if(vflag > 1)
xprintf("generate %s\n", p);
gentab[j].gen(bstr(&path), p);
// Do not add generated file to clean list.
// In pkg/runtime, we want to be able to
// build the package with the go tool,
// and it assumes these generated files already
// exist (it does not know how to build them).
// The 'clean' command can remove
// the generated files.
goto built;
}
}
// Did not rebuild p.
if(find(p, missing.p, missing.len) >= 0)
fatal("missing file %s", p);
built:;
}
// One more copy for package runtime.
// The last batch was required for the generators.
// This one is generated.
if(streq(dir, "pkg/runtime")) {
copy(bpathf(&b, "%s/zasm_GOOS_GOARCH.h", workdir),
bpathf(&b1, "%s/zasm_%s_%s.h", bstr(&path), goos, goarch), 0);
}
// Generate .c files from .goc files.
if(streq(dir, "pkg/runtime")) {
for(i=0; i<files.len; i++) {
p = files.p[i];
if(!hassuffix(p, ".goc"))
continue;
// b = path/zp but with _goarch.c instead of .goc
bprintf(&b, "%s%sz%s", bstr(&path), slash, lastelem(p));
b.len -= 4;
bwritef(&b, "_%s.c", goarch);
goc2c(p, bstr(&b));
vadd(&files, bstr(&b));
}
vuniq(&files);
}
if((!streq(goos, gohostos) || !streq(goarch, gohostarch)) && isgo) {
// We've generated the right files; the go command can do the build.
if(vflag > 1)
xprintf("skip build for cross-compile %s\n", dir);
goto nobuild;
}
// Compile the files.
for(i=0; i<files.len; i++) {
if(!hassuffix(files.p[i], ".c") && !hassuffix(files.p[i], ".s"))
continue;
name = lastelem(files.p[i]);
vreset(&compile);
if(!isgo) {
// C library or tool.
vcopy(&compile, gccargs.p, gccargs.len);
vadd(&compile, "-c");
if(streq(gohostarch, "amd64"))
vadd(&compile, "-m64");
else if(streq(gohostarch, "386"))
vadd(&compile, "-m32");
if(streq(dir, "lib9"))
vadd(&compile, "-DPLAN9PORT");
vadd(&compile, "-I");
vadd(&compile, bpathf(&b, "%s/include", goroot));
vadd(&compile, "-I");
vadd(&compile, bstr(&path));
// lib9/goos.c gets the default constants hard-coded.
if(streq(name, "goos.c")) {
vadd(&compile, bprintf(&b, "-DGOOS=\"%s\"", goos));
vadd(&compile, bprintf(&b, "-DGOARCH=\"%s\"", goarch));
bprintf(&b1, "%s", goroot_final);
bsubst(&b1, "\\", "\\\\"); // turn into C string
vadd(&compile, bprintf(&b, "-DGOROOT=\"%s\"", bstr(&b1)));
vadd(&compile, bprintf(&b, "-DGOVERSION=\"%s\"", goversion));
}
// gc/lex.c records the GOEXPERIMENT setting used during the build.
if(streq(name, "lex.c")) {
xgetenv(&b, "GOEXPERIMENT");
vadd(&compile, bprintf(&b1, "-DGOEXPERIMENT=\"%s\"", bstr(&b)));
}
} else {
// Supporting files for a Go package.
if(hassuffix(files.p[i], ".s"))
vadd(&compile, bpathf(&b, "%s/%sa", tooldir, gochar));
else {
vadd(&compile, bpathf(&b, "%s/%sc", tooldir, gochar));
vadd(&compile, "-FVw");
}
vadd(&compile, "-I");
vadd(&compile, workdir);
vadd(&compile, bprintf(&b, "-DGOOS_%s", goos));
vadd(&compile, bprintf(&b, "-DGOARCH_%s", goarch));
}
bpathf(&b, "%s/%s", workdir, lastelem(files.p[i]));
doclean = 1;
if(!isgo && streq(gohostos, "darwin")) {
// To debug C programs on OS X, it is not enough to say -ggdb
// on the command line. You have to leave the object files
// lying around too. Leave them in pkg/obj/, which does not
// get removed when this tool exits.
bpathf(&b1, "%s/pkg/obj/%s", goroot, dir);
xmkdirall(bstr(&b1));
bpathf(&b, "%s/%s", bstr(&b1), lastelem(files.p[i]));
doclean = 0;
}
b.p[b.len-1] = 'o'; // was c or s
vadd(&compile, "-o");
vadd(&compile, bstr(&b));
vadd(&compile, files.p[i]);
bgrunv(bstr(&path), CheckExit, &compile);
vadd(&link, bstr(&b));
if(doclean)
vadd(&clean, bstr(&b));
}
bgwait();
if(isgo) {
// The last loop was compiling individual files.
// Hand the Go files to the compiler en masse.
vreset(&compile);
vadd(&compile, bpathf(&b, "%s/%sg", tooldir, gochar));
bpathf(&b, "%s/_go_.%s", workdir, gochar);
vadd(&compile, "-o");
vadd(&compile, bstr(&b));
vadd(&clean, bstr(&b));
vadd(&link, bstr(&b));
vadd(&compile, "-p");
if(hasprefix(dir, "pkg/"))
vadd(&compile, dir+4);
else
vadd(&compile, "main");
if(streq(dir, "pkg/runtime"))
vadd(&compile, "-+");
vcopy(&compile, go.p, go.len);
runv(nil, bstr(&path), CheckExit, &compile);
}
if(!islib && !isgo) {
// C binaries need the libraries explicitly, and -lm.
vcopy(&link, lib.p, lib.len);
vadd(&link, "-lm");
}
// Remove target before writing it.
xremove(link.p[targ]);
runv(nil, nil, CheckExit, &link);
nobuild:
// In package runtime, we install runtime.h and cgocall.h too,
// for use by cgo compilation.
if(streq(dir, "pkg/runtime")) {
copy(bpathf(&b, "%s/pkg/%s_%s/cgocall.h", goroot, goos, goarch),
bpathf(&b1, "%s/src/pkg/runtime/cgocall.h", goroot), 0);
copy(bpathf(&b, "%s/pkg/%s_%s/runtime.h", goroot, goos, goarch),
bpathf(&b1, "%s/src/pkg/runtime/runtime.h", goroot), 0);
}
out:
for(i=0; i<clean.len; i++)
xremove(clean.p[i]);
bfree(&b);
bfree(&b1);
bfree(&path);
vfree(&compile);
vfree(&files);
vfree(&link);
vfree(&go);
vfree(&missing);
vfree(&clean);
vfree(&lib);
vfree(&extra);
}
void xml_attr(const char *name, const char *val)
{
xprintf(" %s=\"", name);
xqputs(val);
xputs("\"");
}
void xml_attr_int(const char *name, largest_int val)
{
xprintf(" %s=\"%lld\"", name, val);
}
void xml_qtag(const char *tag)
{
xprintf("<%s/>", tag);
}
void xml_pop(void)
{
xprintf("</%s>", pop_tag());
}
void xml_tag_start(const char *tag)
{
push_tag(tag);
xprintf("<%s", tag);
}
static bool doc_end(struct urf_context *ctx)
{
return xprintf(ctx, "%%%%EOF\n");
}
void xmpp_iq_sponsor_info_updated_cb(const char *msg_id,
const char *msg,
void *args)
{
/* Answer:
<iq from='masterserver@warface/xxx' type='get'>
<query xmlns='urn:cryonline:k01'>
<sponsor_info_updated sponsor_id='0' sponsor_points='864'
total_sponsor_points='2064' next_unlock_item='smg07_shop'>
<unlocked_items>
<item name='xxx' .../>
</unlocked_items>
</sponsor_info_updated>
</query>
</iq>
*/
char *data = wf_get_query_content(msg);
if (data == NULL)
return;
unsigned sponsor_id = get_info_int(data, "sponsor_id='", "'", NULL);
unsigned points = get_info_int(data, "sponsor_points='", "'", NULL);
unsigned total = get_info_int(data, "total_sponsor_points='", "'", NULL);
char *next_item = get_info(data, "next_unlock_item='", "'", NULL);
char *unlocked_items =
get_info(data, "<unlocked_items>", "</unlocked_items>", NULL);
if (unlocked_items != NULL)
{
const char *m = unlocked_items;
while ((m = strstr(m, "<item")) != NULL)
{
char *item = get_info(m, "<item", "/>", NULL);
char *item_name = get_info(item, "name='", "'", NULL);
xprintf("%s: %s",
LANG(notif_unlock_item),
item_name);
free(item_name);
free(item);
++m;
}
}
const char *sponsor = NULL;
switch (sponsor_id)
{
case 0:
sponsor = LANG(console_sponsor_weapon);
break;
case 1:
sponsor = LANG(console_sponsor_outfit);
break;
case 2:
sponsor = LANG(console_sponsor_equipment);
break;
default:
break;
}
if (sponsor != NULL && sponsor[0])
{
xprintf("%s: %u (+%u) - %s %s",
sponsor,
total,
points,
LANG(notif_unlocking),
next_item);
}
else
{
xprintf("%s: %u (+%u) - %s",
sponsor,
total,
points,
LANG(notif_unlocking_done));
}
free(unlocked_items);
free(next_item);
free(data);
}
void mc_init(void)
{
xprintf("[%02u]: mc_init\n", corenum());
}
void xml_attr_ptr(const char *name, void *val)
{
xprintf(" %s=\"%p\"", name, val);
}
// The env command prints the default environment.
void
cmdenv(int argc, char **argv)
{
bool pflag;
char *sep;
Buf b, b1;
char *format;
binit(&b);
binit(&b1);
format = "%s=\"%s\"\n";
pflag = 0;
ARGBEGIN{
case '9':
format = "%s='%s'\n";
break;
case 'p':
pflag = 1;
break;
case 'v':
vflag++;
break;
case 'w':
format = "set %s=%s\r\n";
break;
default:
usage();
}ARGEND
if(argc > 0)
usage();
xprintf(format, "CC", defaultcc);
xprintf(format, "CC_FOR_TARGET", defaultcctarget);
xprintf(format, "GOROOT", goroot);
xprintf(format, "GOBIN", gobin);
xprintf(format, "GOARCH", goarch);
xprintf(format, "GOOS", goos);
xprintf(format, "GOHOSTARCH", gohostarch);
xprintf(format, "GOHOSTOS", gohostos);
xprintf(format, "GOTOOLDIR", tooldir);
xprintf(format, "GOCHAR", gochar);
if(streq(goarch, "arm"))
xprintf(format, "GOARM", goarm);
if(streq(goarch, "386"))
xprintf(format, "GO386", go386);
if(pflag) {
sep = ":";
if(streq(gohostos, "windows"))
sep = ";";
xgetenv(&b, "PATH");
bprintf(&b1, "%s%s%s", gobin, sep, bstr(&b));
xprintf(format, "PATH", bstr(&b1));
}
bfree(&b);
bfree(&b1);
}
void xml_attr_noval(const char *name)
{
xprintf(" %s=\"\"", name);
}
void rn42_task(void)
{
int16_t c;
// Raw mode: interpret output report of LED state
while ((c = rn42_getc()) != -1) {
// LED Out report: 0xFE, 0x02, 0x01, <leds>
// To get the report over UART set bit3 with SH, command.
static enum {LED_INIT, LED_FE, LED_02, LED_01} state = LED_INIT;
switch (state) {
case LED_INIT:
if (c == 0xFE) state = LED_FE;
else {
if (0x0 <= c && c <= 0x7f) xprintf("%c", c);
else xprintf(" %02X", c);
}
break;
case LED_FE:
if (c == 0x02) state = LED_02;
else state = LED_INIT;
break;
case LED_02:
if (c == 0x01) state = LED_01;
else state = LED_INIT;
break;
case LED_01:
dprintf("LED status: %02X\n", c);
rn42_set_leds(c);
state = LED_INIT;
break;
default:
state = LED_INIT;
}
}
/* Bluetooth mode when ready */
if (!config_mode && !force_usb) {
if (!rn42_rts() && host_get_driver() != &rn42_driver) {
clear_keyboard();
host_set_driver(&rn42_driver);
} else if (rn42_rts() && host_get_driver() != &lufa_driver) {
clear_keyboard();
host_set_driver(&lufa_driver);
}
}
static uint16_t prev_timer = 0;
uint16_t e = timer_elapsed(prev_timer);
if (e > 1000) {
/* every second */
prev_timer += e/1000*1000;
/* Low voltage alert */
uint8_t bs = battery_status();
if (bs == LOW_VOLTAGE) {
battery_led(LED_ON);
} else {
battery_led(LED_CHARGER);
}
/* every minute */
uint32_t t = timer_read32()/1000;
if (t%60 == 0) {
uint16_t v = battery_voltage();
uint8_t h = t/3600;
uint8_t m = t%3600/60;
uint8_t s = t%60;
dprintf("%02u:%02u:%02u\t%umV\n", h, m, s, v);
/* TODO: xprintf doesn't work for this.
xprintf("%02u:%02u:%02u\t%umV\n", (t/3600), (t%3600/60), (t%60), v);
*/
}
}
/* Connection monitor */
if (!rn42_rts() && rn42_linked()) {
status_led(true);
} else {
status_led(false);
}
}
TSP *tsp_read_data(char *fname)
{ struct dsa _dsa, *dsa = &_dsa;
TSP *tsp = NULL;
dsa->fname = fname;
xprintf("tsp_read_data: reading TSP data from `%s'...\n",
dsa->fname);
dsa->fp = fopen(dsa->fname, "r");
if (dsa->fp == NULL)
{ xprintf("tsp_read_data: unable to open `%s' - %s\n",
dsa->fname, strerror(errno));
goto fail;
}
tsp = xmalloc(sizeof(TSP));
tsp->name = NULL;
tsp->type = TSP_UNDEF;
tsp->comment = NULL;
tsp->dimension = 0;
tsp->edge_weight_type = TSP_UNDEF;
tsp->edge_weight_format = TSP_UNDEF;
tsp->display_data_type = TSP_UNDEF;
tsp->node_x_coord = NULL;
tsp->node_y_coord = NULL;
tsp->dply_x_coord = NULL;
tsp->dply_y_coord = NULL;
tsp->tour = NULL;
tsp->edge_weight = NULL;
dsa->seqn = 1;
if (get_char(dsa)) goto fail;
loop: if (scan_keyword(dsa)) goto fail;
if (strcmp(dsa->token, "NAME") == 0)
{ if (tsp->name != NULL)
{ xprintf("%s:%d: NAME entry multiply defined\n", dsa->fname,
dsa->seqn);
goto fail;
}
if (check_colon(dsa)) goto fail;
if (scan_token(dsa, 0)) goto fail;
if (strlen(dsa->token) == 0)
{ xprintf("%s:%d: NAME entry incomplete\n", dsa->fname,
dsa->seqn);
goto fail;
}
tsp->name = xmalloc(strlen(dsa->token) + 1);
strcpy(tsp->name, dsa->token);
xprintf("tsp_read_data: NAME: %s\n", tsp->name);
if (check_newline(dsa)) goto fail;
}
else if (strcmp(dsa->token, "TYPE") == 0)
{ if (tsp->type != TSP_UNDEF)
{ xprintf("%s:%d: TYPE entry multiply defined\n", dsa->fname,
dsa->seqn);
goto fail;
}
if (check_colon(dsa)) goto fail;
if (scan_keyword(dsa)) goto fail;
if (strcmp(dsa->token, "TSP") == 0)
tsp->type = TSP_TSP;
else if (strcmp(dsa->token, "ATSP") == 0)
tsp->type = TSP_ATSP;
else if (strcmp(dsa->token, "TOUR") == 0)
tsp->type = TSP_TOUR;
else
{ xprintf("%s:%d: data type `%s' not recognized\n",
dsa->fname, dsa->seqn, dsa->token);
goto fail;
}
xprintf("tsp_read_data: TYPE: %s\n", dsa->token);
if (check_newline(dsa)) goto fail;
}
else if (strcmp(dsa->token, "COMMENT") == 0)
{ if (tsp->comment != NULL)
{ xprintf("%s:%d: COMMENT entry multiply defined\n",
dsa->fname, dsa->seqn);
goto fail;
}
if (check_colon(dsa)) goto fail;
if (scan_comment(dsa)) goto fail;
tsp->comment = xmalloc(strlen(dsa->token) + 1);
strcpy(tsp->comment, dsa->token);
xprintf("tsp_read_data: COMMENT: %s\n", tsp->comment);
if (check_newline(dsa)) goto fail;
}
else if (strcmp(dsa->token, "DIMENSION") == 0)
{ if (tsp->dimension != 0)
{ xprintf("%s:%d: DIMENSION entry multiply defined\n",
dsa->fname, dsa->seqn);
goto fail;
}
if (check_colon(dsa)) goto fail;
if (scan_integer(dsa, 0, &tsp->dimension)) goto fail;
if (tsp->dimension < 1)
{ xprintf("%s:%d: invalid dimension\n", dsa->fname,
dsa->seqn);
goto fail;
}
xprintf("tsp_read_data: DIMENSION: %d\n", tsp->dimension);
if (check_newline(dsa)) goto fail;
}
else if (strcmp(dsa->token, "EDGE_WEIGHT_TYPE") == 0)
{ if (tsp->edge_weight_type != TSP_UNDEF)
{ xprintf("%s:%d: EDGE_WEIGHT_TYPE entry multiply defined\n",
dsa->fname, dsa->seqn);
goto fail;
}
if (check_colon(dsa)) goto fail;
if (scan_keyword(dsa)) goto fail;
if (strcmp(dsa->token, "GEO") == 0)
tsp->edge_weight_type = TSP_GEO;
else if (strcmp(dsa->token, "EUC_2D") == 0)
tsp->edge_weight_type = TSP_EUC_2D;
else if (strcmp(dsa->token, "ATT") == 0)
tsp->edge_weight_type = TSP_ATT;
else if (strcmp(dsa->token, "EXPLICIT") == 0)
tsp->edge_weight_type = TSP_EXPLICIT;
else if (strcmp(dsa->token, "CEIL_2D") == 0)
tsp->edge_weight_type = TSP_CEIL_2D;
else
{ xprintf("%s:%d: edge weight type `%s' not recognized\n",
dsa->fname, dsa->seqn, dsa->token);
goto fail;
}
xprintf("tsp_read_data: EDGE_WEIGHT_TYPE: %s\n", dsa->token);
if (check_newline(dsa)) goto fail;
}
else if (strcmp(dsa->token, "EDGE_WEIGHT_FORMAT") == 0)
{ if (tsp->edge_weight_format != TSP_UNDEF)
{ xprintf(
"%s:%d: EDGE_WEIGHT_FORMAT entry multiply defined\n",
dsa->fname, dsa->seqn);
goto fail;
}
if (check_colon(dsa)) goto fail;
if (scan_keyword(dsa)) goto fail;
if (strcmp(dsa->token, "UPPER_ROW") == 0)
tsp->edge_weight_format = TSP_UPPER_ROW;
else if (strcmp(dsa->token, "FULL_MATRIX") == 0)
tsp->edge_weight_format = TSP_FULL_MATRIX;
else if (strcmp(dsa->token, "FUNCTION") == 0)
tsp->edge_weight_format = TSP_FUNCTION;
else if (strcmp(dsa->token, "LOWER_DIAG_ROW") == 0)
tsp->edge_weight_format = TSP_LOWER_DIAG_ROW;
else
{ xprintf("%s:%d: edge weight format `%s' not recognized\n",
dsa->fname, dsa->seqn, dsa->token);
goto fail;
}
xprintf("tsp_read_data: EDGE_WEIGHT_FORMAT: %s\n", dsa->token);
if (check_newline(dsa)) goto fail;
}
else if (strcmp(dsa->token, "DISPLAY_DATA_TYPE") == 0)
{ if (tsp->display_data_type != TSP_UNDEF)
{ xprintf("%s:%d: DISPLAY_DATA_TYPE entry multiply defined\n",
dsa->fname, dsa->seqn);
goto fail;
}
if (check_colon(dsa)) goto fail;
if (scan_keyword(dsa)) goto fail;
if (strcmp(dsa->token, "COORD_DISPLAY") == 0)
tsp->display_data_type = TSP_COORD_DISPLAY;
else if (strcmp(dsa->token, "TWOD_DISPLAY") == 0)
tsp->display_data_type = TSP_TWOD_DISPLAY;
else
{ xprintf("%s:%d: display data type `%s' not recognized\n",
dsa->fname, dsa->seqn, dsa->token);
goto fail;
}
xprintf("tsp_read_data: DISPLAY_DATA_TYPE: %s\n", dsa->token);
if (check_newline(dsa)) goto fail;
}
else if (strcmp(dsa->token, "NODE_COORD_SECTION") == 0)
{ int n = tsp->dimension, k, node;
if (n == 0)
{ xprintf("%s:%d: DIMENSION entry not specified\n",
dsa->fname, dsa->seqn);
goto fail;
}
if (tsp->node_x_coord != NULL)
{ xprintf("%s:%d: NODE_COORD_SECTION multiply specified\n",
dsa->fname, dsa->seqn);
goto fail;
}
if (check_newline(dsa)) goto fail;
tsp->node_x_coord = xcalloc(1+n, sizeof(double));
tsp->node_y_coord = xcalloc(1+n, sizeof(double));
for (node = 1; node <= n; node++)
tsp->node_x_coord[node] = tsp->node_y_coord[node] = DBL_MAX;
for (k = 1; k <= n; k++)
{ if (scan_integer(dsa, 0, &node)) goto fail;
if (!(1 <= node && node <= n))
{ xprintf("%s:%d: invalid node number %d\n", dsa->fname,
dsa->seqn, node);
goto fail;
}
if (tsp->node_x_coord[node] != DBL_MAX)
{ xprintf("%s:%d: node number %d multiply specified\n",
dsa->fname, dsa->seqn, node);
goto fail;
}
if (scan_number(dsa, 0, &tsp->node_x_coord[node]))
goto fail;
if (scan_number(dsa, 0, &tsp->node_y_coord[node]))
goto fail;
if (check_newline(dsa)) goto fail;
}
}
else if (strcmp(dsa->token, "DISPLAY_DATA_SECTION") == 0)
{ int n = tsp->dimension, k, node;
if (n == 0)
{ xprintf("%s:%d: DIMENSION entry not specified\n",
dsa->fname, dsa->seqn);
goto fail;
}
if (tsp->dply_x_coord != NULL)
{ xprintf("%s:%d: DISPLAY_DATA_SECTION multiply specified\n",
dsa->fname, dsa->seqn);
goto fail;
}
if (check_newline(dsa)) goto fail;
tsp->dply_x_coord = xcalloc(1+n, sizeof(double));
tsp->dply_y_coord = xcalloc(1+n, sizeof(double));
for (node = 1; node <= n; node++)
tsp->dply_x_coord[node] = tsp->dply_y_coord[node] = DBL_MAX;
for (k = 1; k <= n; k++)
{ if (scan_integer(dsa, 0, &node)) goto fail;
if (!(1 <= node && node <= n))
{ xprintf("%s:%d: invalid node number %d\n", dsa->fname,
dsa->seqn, node);
goto fail;
}
if (tsp->dply_x_coord[node] != DBL_MAX)
{ xprintf("%s:%d: node number %d multiply specified\n",
dsa->fname, dsa->seqn, node);
goto fail;
}
if (scan_number(dsa, 0, &tsp->dply_x_coord[node]))
goto fail;
if (scan_number(dsa, 0, &tsp->dply_y_coord[node]))
goto fail;
if (check_newline(dsa)) goto fail;
}
}
else if (strcmp(dsa->token, "TOUR_SECTION") == 0)
{ int n = tsp->dimension, k, node;
if (n == 0)
{ xprintf("%s:%d: DIMENSION entry not specified\n",
dsa->fname, dsa->seqn);
goto fail;
}
if (tsp->tour != NULL)
{ xprintf("%s:%d: TOUR_SECTION multiply specified\n",
dsa->fname, dsa->seqn);
goto fail;
}
if (check_newline(dsa)) goto fail;
tsp->tour = xcalloc(1+n, sizeof(int));
for (k = 1; k <= n; k++)
{ if (scan_integer(dsa, 1, &node)) goto fail;
if (!(1 <= node && node <= n))
{ xprintf("%s:%d: invalid node number %d\n", dsa->fname,
dsa->seqn, node);
goto fail;
}
tsp->tour[k] = node;
}
if (scan_integer(dsa, 1, &node)) goto fail;
if (node != -1)
{ xprintf("%s:%d: extra node(s) detected\n", dsa->fname,
dsa->seqn);
goto fail;
}
if (check_newline(dsa)) goto fail;
}
else if (strcmp(dsa->token, "EDGE_WEIGHT_SECTION") == 0)
{ int n = tsp->dimension, i, j, temp;
if (n == 0)
{ xprintf("%s:%d: DIMENSION entry not specified\n",
dsa->fname, dsa->seqn);
goto fail;
}
if (tsp->edge_weight_format == TSP_UNDEF)
{ xprintf("%s:%d: EDGE_WEIGHT_FORMAT entry not specified\n",
dsa->fname, dsa->seqn);
goto fail;
}
if (tsp->edge_weight != NULL)
{ xprintf("%s:%d: EDGE_WEIGHT_SECTION multiply specified\n",
dsa->fname, dsa->seqn);
goto fail;
}
if (check_newline(dsa)) goto fail;
tsp->edge_weight = xcalloc(1+n*n, sizeof(int));
switch (tsp->edge_weight_format)
{ case TSP_FULL_MATRIX:
for (i = 1; i <= n; i++)
{ for (j = 1; j <= n; j++)
{ if (scan_integer(dsa, 1, &temp)) goto fail;
tsp->edge_weight[(i - 1) * n + j] = temp;
}
}
break;
case TSP_UPPER_ROW:
for (i = 1; i <= n; i++)
{ tsp->edge_weight[(i - 1) * n + i] = 0;
for (j = i + 1; j <= n; j++)
{ if (scan_integer(dsa, 1, &temp)) goto fail;
tsp->edge_weight[(i - 1) * n + j] = temp;
tsp->edge_weight[(j - 1) * n + i] = temp;
}
}
break;
case TSP_LOWER_DIAG_ROW:
for (i = 1; i <= n; i++)
{ for (j = 1; j <= i; j++)
{ if (scan_integer(dsa, 1, &temp)) goto fail;
tsp->edge_weight[(i - 1) * n + j] = temp;
tsp->edge_weight[(j - 1) * n + i] = temp;
}
}
break;
default:
goto fail;
}
if (check_newline(dsa)) goto fail;
}
else if (strcmp(dsa->token, "EOF") == 0)
{ if (check_newline(dsa)) goto fail;
goto done;
}
else
{ xprintf("%s:%d: keyword `%s' not recognized\n", dsa->fname,
dsa->seqn, dsa->token);
goto fail;
}
goto loop;
done: xprintf("tsp_read_data: %d lines were read\n", dsa->seqn-1);
fclose(dsa->fp);
return tsp;
fail: if (tsp != NULL)
{ if (tsp->name != NULL) xfree(tsp->name);
if (tsp->comment != NULL) xfree(tsp->comment);
if (tsp->node_x_coord != NULL) xfree(tsp->node_x_coord);
if (tsp->node_y_coord != NULL) xfree(tsp->node_y_coord);
if (tsp->dply_x_coord != NULL) xfree(tsp->dply_x_coord);
if (tsp->dply_y_coord != NULL) xfree(tsp->dply_y_coord);
if (tsp->tour != NULL) xfree(tsp->tour);
if (tsp->edge_weight != NULL) xfree(tsp->edge_weight);
xfree(tsp);
}
if (dsa->fp != NULL) fclose(dsa->fp);
return NULL;
}
static int print_term(FILE* fp, ei_x_buff* x,
const char* buf, int* index)
{
int i, doquote, n, m, ty;
char a[MAXATOMLEN+1], *p;
int ch_written = 0; /* counter of written chars */
erlang_pid pid;
erlang_port port;
erlang_ref ref;
double d;
long l;
//unsigned long u;
if (fp == NULL && x == NULL) return -1;
doquote = 0;
ei_get_type_internal(buf, index, &ty, &n);
switch (ty) {
case ERL_ATOM_EXT:
if (ei_decode_atom(buf, index, a) < 0)
goto err;
doquote = !islower((int)a[0]);
for (p = a; !doquote && *p != '\0'; ++p)
doquote = !(isalnum((int)*p) || *p == '_' || *p == '@');
if (doquote) {
xputc('\'', fp, x); ++ch_written;
}
xputs(a, fp, x); ch_written += strlen(a);
if (doquote) {
xputc('\'', fp, x); ++ch_written;
}
break;
case ERL_PID_EXT:
if (ei_decode_pid(buf, index, &pid) < 0) goto err;
ch_written += xprintf(fp, x, "<%s.%d.%d>", pid.node,
pid.num, pid.serial);
break;
case ERL_PORT_EXT:
if (ei_decode_port(buf, index, &port) < 0) goto err;
ch_written += xprintf(fp, x, "#Port<%d.%d>", port.id, port.creation);
break;
case ERL_NEW_REFERENCE_EXT:
case ERL_REFERENCE_EXT:
if (ei_decode_ref(buf, index, &ref) < 0) goto err;
ch_written += xprintf(fp, x, "#Ref<");
for (i = 0; i < ref.len; ++i) {
ch_written += xprintf(fp, x, "%d", ref.n[i]);
if (i < ref.len - 1) {
xputc('.', fp, x); ++ch_written;
}
}
xputc('>', fp, x); ++ch_written;
break;
case ERL_NIL_EXT:
if (ei_decode_list_header(buf, index, &n) < 0) goto err;
ch_written += xprintf(fp, x, "[]");
break;
case ERL_LIST_EXT:
if (ei_decode_list_header(buf, index, &n) < 0) goto err;
xputc('[', fp, x); ch_written++;
for (i = 0; i < n; ++i) {
ch_written += print_term(fp, x, buf, index);
if (i < n - 1) {
xputs(", ", fp, x); ch_written += 2;
}
}
if (ei_get_type_internal(buf, index, &ty, &n) < 0) goto err;
if (ty != ERL_NIL_EXT) {
xputs(" | ", fp, x); ch_written += 3;
ch_written += print_term(fp, x, buf, index);
} else {
if (ei_decode_list_header(buf, index, &n) < 0) goto err;
}
xputc(']', fp, x); ch_written++;
break;
case ERL_STRING_EXT:
p = ei_malloc(n+1);
if (p == NULL) goto err;
if (ei_decode_string(buf, index, p) < 0) {
ei_free(p);
goto err;
}
ch_written += print_string(fp, x, p, n);
ei_free(p);
break;
case ERL_SMALL_TUPLE_EXT:
case ERL_LARGE_TUPLE_EXT:
if (ei_decode_tuple_header(buf, index, &n) < 0) goto err;
xputc('{', fp, x); ch_written++;
for (i = 0; i < n; ++i) {
ch_written += print_term(fp, x, buf, index);
if (i < n-1) {
xputs(", ", fp, x); ch_written += 2;
}
}
xputc('}', fp, x); ch_written++;
break;
case ERL_BINARY_EXT:
p = ei_malloc(n);
if (p == NULL) goto err;
if (ei_decode_binary(buf, index, p, &l) < 0) {
ei_free(p);
goto err;
}
ch_written += xprintf(fp, x, "#Bin<");
if (l > BINPRINTSIZE)
m = BINPRINTSIZE;
else
m = l;
--m;
for (i = 0; i < m; ++i) {
ch_written += xprintf(fp, x, "%d,", p[i]);
}
ch_written += xprintf(fp, x, "%d", p[i]);
if (l > BINPRINTSIZE)
ch_written += xprintf(fp, x, ",...");
xputc('>', fp, x); ++ch_written;
ei_free(p);
break;
case ERL_SMALL_INTEGER_EXT:
case ERL_INTEGER_EXT:
if (ei_decode_long(buf, index, &l) < 0) goto err;
ch_written += xprintf(fp, x, "%ld", l);
break;
case ERL_SMALL_BIG_EXT:
case ERL_LARGE_BIG_EXT:
{
erlang_big *b;
char *ds;
b = ei_alloc_big(n);
if (ei_decode_big(buf, index, b) < 0) {
ei_free_big(b);
goto err;
}
if ( (ds = ei_big_to_str(b)) == NULL ) {
ei_free_big(b);
goto err;
}
ch_written += xprintf(fp, x, ds);
free(ds);
ei_free_big(b);
}
break;
case ERL_FLOAT_EXT:
if (ei_decode_double(buf, index, &d) < 0) goto err;
ch_written += xprintf(fp, x, "%f", d);
break;
default:
goto err;
}
return ch_written;
err:
return -1;
}
int main() {
uint8_t i, change;
uint8_t hand;
uint32_t timeout = 0;
uart_init();
xdev_out(uart_putchar);
// Determine which hand this is from PE2
// Left is hand 0, right is hand 1
PORTE = (1 << 2);
DDRE = 0;
hand = (PINE & 0x04) ? 0 : 1;
xprintf("\r\nHand %d\r\n", hand);
// Initialise NRF24
// Set the last byte of the address to the hand ID
rx_address[4] = hand;
nrf24_init();
nrf24_config(CHANNEL, sizeof msg);
nrf24_tx_address(tx_address);
nrf24_rx_address(rx_address);
matrix_init();
msg[0] = hand & 0x01;
msg[1] = 0;
msg[2] = 0;
// Set up LED and flash it briefly
DDRE |= 1<<6;
PORTE = 1<<6;
_delay_ms(500);
PORTE = 0;
get_voltage();
check_voltage();
// Scan the matrix and detect any changes.
// Modified rows are sent to the receiver.
while (1) {
timeout++;
matrix_scan();
for (i=0; i<ROWS; i++) {
change = matrix_prev[i] ^ matrix[i];
// If this row has changed, send the row number and its current state
if (change) {
if (DEBUG) xprintf("%d %08b -> %08b %ld\r\n", i, matrix_prev[i], matrix[i], timeout);
msg[1] = i;
msg[2] = matrix[i];
nrf24_send(msg);
while (nrf24_isSending());
timeout = 0;
}
matrix_prev[i] = matrix[i];
}
// Sleep if there has been no activity for a while
if (timeout > SLEEP_TIMEOUT) {
timeout = 0;
enter_sleep_mode();
}
}
}
void app_renda() { // 連打ゲーム
for (;;) {
playMML("L8EGG");
ux_btn();
for (;;) {
FILL("8aa2cc006595f010"); // title
// FILL("8aa2cc006a953060"); // title
FLUSH();
if (ux_btn())
break;
}
systick = 0;
for (;;) {
WAIT(10);
if (!ux_state())
break;
if (systick > 10000)
return;
}
playMML("C");
FILL(PTN_3);
FLUSH();
WAIT(1000);
playMML("C");
FILL(PTN_2);
FLUSH();
WAIT(1000);
playMML("C");
FILL(PTN_1);
FLUSH();
WAIT(1000);
playMML("G2");
FILL(PTN_GO);
FLUSH();
WAIT(1000);
CLS(1);
FLUSH();
systick = 0;
int cnt = 0;
int bkbtn = 0;
ux_btn();
for (;;) {
int btn = ux_btn();
if (btn) {
playMML("A16");
PRESET(cnt % 8, cnt / 8);
FLUSH();
cnt++;
if (cnt == 64)
break;
}
// bkbtn = btn;
}
playMML("L8CEG");
FILL("00c9aaacacaaaa69"); // ok
xprintf("%d\n", systick);
unsigned int score = 100000 / (systick / 64);
xprintf("%d\n", score);
/*
for (int i = 0;; i++) {
int n = time % 10;
time /= 10;
if (time == 0)
break;
FILL(PTN_NUM[n]);
FLUSH();
WAIT(500);
}
*/
if (score > 250)
score = 250;
FILL(PTN_NUM[score / 10]);
PSET(6, 6);
FLUSH();
WAIT(1000);
FILL(PTN_NUM[score % 10]);
FLUSH();
WAIT(1000);
FLUSH();
WAIT(1000);
}
}
/*VARARGS 1*/
void
execute(struct command *t, volatile int wanttty, int *pipein, int *pipeout,
int do_glob)
{
int forked = 0;
const struct biltins * volatile bifunc;
pid_t pid = 0;
int pv[2];
sigset_t set;
static sigset_t csigset;
#ifdef VFORK
static int onosigchld = 0;
#endif /* VFORK */
static int nosigchld = 0;
(void) &wanttty;
(void) &forked;
(void) &bifunc;
if (t == 0)
return;
#ifdef WINNT_NATIVE
{
if ((varval(STRNTslowexec) == STRNULL) &&
!t->t_dcdr && !t->t_dcar && !t->t_dflg && !didfds &&
(intty || intact) && (t->t_dtyp == NODE_COMMAND) &&
!isbfunc(t)) {
if ((t->t_dcom[0][0] & (QUOTE | TRIM)) == QUOTE)
(void) Strcpy(t->t_dcom[0], t->t_dcom[0] + 1);
Dfix(t);
if (nt_try_fast_exec(t) == 0)
return;
}
}
#endif /* WINNT_NATIVE */
/*
* Ed [email protected] & Dominic [email protected]
* Sat Feb 25 03:13:11 PST 1995
* try implicit cd if we have a 1 word command
*/
if (implicit_cd && (intty || intact) && t->t_dcom && t->t_dcom[0] &&
t->t_dcom[0][0] && (blklen(t->t_dcom) == 1) && !noexec) {
Char *sCName;
struct stat stbuf;
char *pathname;
sCName = dollar(t->t_dcom[0]);
if (sCName != NULL && sCName[0] == '~') {
struct Strbuf buf = Strbuf_INIT;
const Char *name_end;
for (name_end = sCName + 1; *name_end != '\0' && *name_end != '/';
name_end++)
continue;
if (name_end != sCName + 1) {
Char *name, *home;
name = Strnsave(sCName + 1, name_end - (sCName + 1));
home = gethdir(name);
if (home != NULL) {
Strbuf_append(&buf, home);
xfree(home);
} else
Strbuf_append(&buf, name);
xfree(name);
} else
Strbuf_append(&buf, varval(STRhome));
Strbuf_append(&buf, name_end);
xfree(sCName);
sCName = Strbuf_finish(&buf);
}
pathname = short2str(sCName);
xfree(sCName);
/* if this is a dir, tack a "cd" on as the first arg */
if (pathname != NULL &&
((stat(pathname, &stbuf) != -1 && S_ISDIR(stbuf.st_mode))
#ifdef WINNT_NATIVE
|| (pathname[0] && pathname[1] == ':' && pathname[2] == '\0')
#endif /* WINNT_NATIVE */
)) {
Char *vCD[2];
Char **ot_dcom = t->t_dcom;
vCD[0] = Strsave(STRcd);
vCD[1] = NULL;
t->t_dcom = blkspl(vCD, ot_dcom);
xfree(ot_dcom);
if (implicit_cd > 1) {
blkpr(t->t_dcom);
xputchar( '\n' );
}
}
}
/*
* From: Michael Schroeder <*****@*****.**>
* Don't check for wantty > 0...
*/
if (t->t_dflg & F_AMPERSAND)
wanttty = 0;
switch (t->t_dtyp) {
case NODE_COMMAND:
if ((t->t_dcom[0][0] & (QUOTE | TRIM)) == QUOTE)
memmove(t->t_dcom[0], t->t_dcom[0] + 1,
(Strlen(t->t_dcom[0] + 1) + 1) * sizeof (*t->t_dcom[0]));
if ((t->t_dflg & F_REPEAT) == 0)
Dfix(t); /* $ " ' \ */
if (t->t_dcom[0] == 0) {
return;
}
/*FALLTHROUGH*/
case NODE_PAREN:
#ifdef BACKPIPE
if (t->t_dflg & F_PIPEIN)
mypipe(pipein);
#else /* !BACKPIPE */
if (t->t_dflg & F_PIPEOUT)
mypipe(pipeout);
#endif /* BACKPIPE */
/*
* Must do << early so parent will know where input pointer should be.
* If noexec then this is all we do.
*/
if (t->t_dflg & F_READ) {
xclose(0);
heredoc(t->t_dlef);
if (noexec)
xclose(0);
}
setcopy(STRstatus, STR0, VAR_READWRITE);
/*
* This mess is the necessary kludge to handle the prefix builtins:
* nice, nohup, time. These commands can also be used by themselves,
* and this is not handled here. This will also work when loops are
* parsed.
*/
while (t->t_dtyp == NODE_COMMAND)
if (eq(t->t_dcom[0], STRnice)) {
if (t->t_dcom[1]) {
if (strchr("+-", t->t_dcom[1][0])) {
if (t->t_dcom[2]) {
setname("nice");
t->t_nice =
getn(t->t_dcom[1]);
lshift(t->t_dcom, 2);
t->t_dflg |= F_NICE;
}
else
break;
}
else {
t->t_nice = 4;
lshift(t->t_dcom, 1);
t->t_dflg |= F_NICE;
}
}
else
break;
}
else if (eq(t->t_dcom[0], STRnohup)) {
if (t->t_dcom[1]) {
t->t_dflg |= F_NOHUP;
lshift(t->t_dcom, 1);
}
else
break;
}
else if (eq(t->t_dcom[0], STRhup)) {
if (t->t_dcom[1]) {
t->t_dflg |= F_HUP;
lshift(t->t_dcom, 1);
}
else
break;
}
else if (eq(t->t_dcom[0], STRtime)) {
if (t->t_dcom[1]) {
t->t_dflg |= F_TIME;
lshift(t->t_dcom, 1);
}
else
break;
}
#ifdef F_VER
else if (eq(t->t_dcom[0], STRver))
if (t->t_dcom[1] && t->t_dcom[2]) {
setname("ver");
t->t_systype = getv(t->t_dcom[1]);
lshift(t->t_dcom, 2);
t->t_dflg |= F_VER;
}
else
break;
#endif /* F_VER */
else
break;
/* is it a command */
if (t->t_dtyp == NODE_COMMAND) {
/*
* Check if we have a builtin function and remember which one.
*/
bifunc = isbfunc(t);
if (noexec) {
/*
* Continue for builtins that are part of the scripting language
*/
if (bifunc == NULL)
break;
if (bifunc->bfunct != (bfunc_t)dobreak &&
bifunc->bfunct != (bfunc_t)docontin &&
bifunc->bfunct != (bfunc_t)doelse &&
bifunc->bfunct != (bfunc_t)doend &&
bifunc->bfunct != (bfunc_t)doforeach&&
bifunc->bfunct != (bfunc_t)dogoto &&
bifunc->bfunct != (bfunc_t)doif &&
bifunc->bfunct != (bfunc_t)dorepeat &&
bifunc->bfunct != (bfunc_t)doswbrk &&
bifunc->bfunct != (bfunc_t)doswitch &&
bifunc->bfunct != (bfunc_t)dowhile &&
bifunc->bfunct != (bfunc_t)dozip)
break;
}
}
else { /* not a command */
bifunc = NULL;
if (noexec)
break;
}
/*
* GrP Executing a command - run jobcmd hook
* Don't run for builtins
* Don't run if we're not in a tty
* Don't run if we're not really executing
*/
/*
* CR - Charles Ross Aug 2005
* added "isoutatty".
* The new behavior is that the jobcmd won't be executed
* if stdout (SHOUT) isnt attached to a tty.. IE when
* redirecting, or using backquotes etc..
*/
if (t->t_dtyp == NODE_COMMAND && !bifunc && !noexec && intty && isoutatty) {
Char *cmd = unparse(t);
cleanup_push(cmd, xfree);
job_cmd(cmd);
cleanup_until(cmd);
}
/*
* We fork only if we are timed, or are not the end of a parenthesized
* list and not a simple builtin function. Simple meaning one that is
* not pipedout, niced, nohupped, or &'d. It would be nice(?) to not
* fork in some of these cases.
*/
/*
* Prevent forking cd, pushd, popd, chdir cause this will cause the
* shell not to change dir!
*/
#ifdef BACKPIPE
/*
* Can't have NOFORK for the tail of a pipe - because it is not the
* last command spawned (even if it is at the end of a parenthesised
* list).
*/
if (t->t_dflg & F_PIPEIN)
t->t_dflg &= ~(F_NOFORK);
#endif /* BACKPIPE */
if (bifunc && (bifunc->bfunct == (bfunc_t)dochngd ||
bifunc->bfunct == (bfunc_t)dopushd ||
bifunc->bfunct == (bfunc_t)dopopd))
t->t_dflg &= ~(F_NICE);
if (((t->t_dflg & F_TIME) || ((t->t_dflg & F_NOFORK) == 0 &&
(!bifunc || t->t_dflg &
(F_PIPEOUT | F_AMPERSAND | F_NICE | F_NOHUP | F_HUP)))) ||
/*
* We have to fork for eval too.
*/
(bifunc && (t->t_dflg & F_PIPEIN) != 0 &&
bifunc->bfunct == (bfunc_t)doeval)) {
#ifdef VFORK
if (t->t_dtyp == NODE_PAREN ||
t->t_dflg & (F_REPEAT | F_AMPERSAND) || bifunc)
#endif /* VFORK */
{
forked++;
/*
* We need to block SIGCHLD here, so that if the process does
* not die before we can set the process group
*/
if (wanttty >= 0 && !nosigchld) {
sigemptyset(&set);
sigaddset(&set, SIGCHLD);
(void)sigprocmask(SIG_BLOCK, &set, &csigset);
nosigchld = 1;
}
pid = pfork(t, wanttty);
if (pid == 0 && nosigchld) {
sigprocmask(SIG_SETMASK, &csigset, NULL);
nosigchld = 0;
}
else if (pid != 0 && (t->t_dflg & F_AMPERSAND))
backpid = pid;
}
#ifdef VFORK
else {
int ochild, osetintr, ohaderr, odidfds;
int oSHIN, oSHOUT, oSHDIAG, oOLDSTD, otpgrp;
int oisoutatty, oisdiagatty;
sigset_t oset, ocsigset;
# ifndef CLOSE_ON_EXEC
int odidcch;
# endif /* !CLOSE_ON_EXEC */
/*
* Prepare for the vfork by saving everything that the child
* corrupts before it exec's. Note that in some signal
* implementations which keep the signal info in user space
* (e.g. Sun's) it will also be necessary to save and restore
* the current sigvec's for the signals the child touches
* before it exec's.
*/
/*
* Sooooo true... If this is a Sun, save the sigvec's. (Skip
* Gilbrech - 11/22/87)
*/
# ifdef SAVESIGVEC
struct sigaction savesv[NSIGSAVED];
sigset_t savesm;
# endif /* SAVESIGVEC */
if (wanttty >= 0 && !nosigchld && !noexec) {
sigemptyset(&set);
sigaddset(&set, SIGCHLD);
(void)sigprocmask(SIG_BLOCK, &set, &csigset);
nosigchld = 1;
}
sigemptyset(&set);
sigaddset(&set, SIGCHLD);
sigaddset(&set, SIGINT);
(void)sigprocmask(SIG_BLOCK, &set, &oset);
ochild = child;
osetintr = setintr;
ohaderr = haderr;
odidfds = didfds;
# ifndef CLOSE_ON_EXEC
odidcch = didcch;
# endif /* !CLOSE_ON_EXEC */
oSHIN = SHIN;
oSHOUT = SHOUT;
oSHDIAG = SHDIAG;
oOLDSTD = OLDSTD;
otpgrp = tpgrp;
oisoutatty = isoutatty;
oisdiagatty = isdiagatty;
ocsigset = csigset;
onosigchld = nosigchld;
Vsav = Vdp = 0;
Vexpath = 0;
Vt = 0;
# ifdef SAVESIGVEC
savesigvec(savesv, savesm);
# endif /* SAVESIGVEC */
if (use_fork)
pid = fork();
else
pid = vfork();
if (pid < 0) {
# ifdef SAVESIGVEC
restoresigvec(savesv, savesm);
# endif /* SAVESIGVEC */
sigprocmask(SIG_SETMASK, &oset, NULL);
stderror(ERR_NOPROC);
}
forked++;
if (pid) { /* parent */
# ifdef SAVESIGVEC
restoresigvec(savesv, savesm);
# endif /* SAVESIGVEC */
child = ochild;
setintr = osetintr;
haderr = ohaderr;
didfds = odidfds;
SHIN = oSHIN;
# ifndef CLOSE_ON_EXEC
didcch = odidcch;
# endif /* !CLOSE_ON_EXEC */
SHOUT = oSHOUT;
SHDIAG = oSHDIAG;
OLDSTD = oOLDSTD;
tpgrp = otpgrp;
isoutatty = oisoutatty;
isdiagatty = oisdiagatty;
csigset = ocsigset;
nosigchld = onosigchld;
xfree(Vsav);
Vsav = 0;
xfree(Vdp);
Vdp = 0;
xfree(Vexpath);
Vexpath = 0;
blk_cleanup(Vt);
Vt = 0;
/* this is from pfork() */
palloc(pid, t);
sigprocmask(SIG_SETMASK, &oset, NULL);
}
else { /* child */
/* this is from pfork() */
pid_t pgrp;
int ignint = 0;
if (nosigchld) {
sigprocmask(SIG_SETMASK, &csigset, NULL);
nosigchld = 0;
}
if (setintr)
ignint = (tpgrp == -1 && (t->t_dflg & F_NOINTERRUPT))
|| (gointr && eq(gointr, STRminus));
pgrp = pcurrjob ? pcurrjob->p_jobid : getpid();
child++;
if (setintr) {
setintr = 0;
/*
* casts made right for SunOS 4.0 by Douglas C. Schmidt
* <*****@*****.**>
* (thanks! -- PWP)
*
* ignint ifs cleaned by Johan Widen <[email protected]>
* (thanks again)
*/
if (ignint) {
(void) signal(SIGINT, SIG_IGN);
(void) signal(SIGQUIT, SIG_IGN);
}
else {
(void) signal(SIGINT, vffree);
(void) signal(SIGQUIT, SIG_DFL);
}
# ifdef BSDJOBS
if (wanttty >= 0) {
(void) signal(SIGTSTP, SIG_DFL);
(void) signal(SIGTTIN, SIG_DFL);
(void) signal(SIGTTOU, SIG_DFL);
}
# endif /* BSDJOBS */
sigaction(SIGTERM, &parterm, NULL);
}
else if (tpgrp == -1 &&
(t->t_dflg & F_NOINTERRUPT)) {
(void) signal(SIGINT, SIG_IGN);
(void) signal(SIGQUIT, SIG_IGN);
}
pgetty(wanttty, pgrp);
if (t->t_dflg & F_NOHUP)
(void) signal(SIGHUP, SIG_IGN);
if (t->t_dflg & F_HUP)
(void) signal(SIGHUP, SIG_DFL);
if (t->t_dflg & F_NICE) {
int nval = SIGN_EXTEND_CHAR(t->t_nice);
# ifdef HAVE_SETPRIORITY
if (setpriority(PRIO_PROCESS, 0, nval) == -1 && errno)
stderror(ERR_SYSTEM, "setpriority",
strerror(errno));
# else /* !HAVE_SETPRIORITY */
(void) nice(nval);
# endif /* HAVE_SETPRIORITY */
}
# ifdef F_VER
if (t->t_dflg & F_VER) {
tsetenv(STRSYSTYPE, t->t_systype ? STRbsd43 : STRsys53);
dohash(NULL, NULL);
}
# endif /* F_VER */
}
}
#endif /* VFORK */
}
if (pid != 0) {
/*
* It would be better if we could wait for the whole job when we
* knew the last process had been started. Pwait, in fact, does
* wait for the whole job anyway, but this test doesn't really
* express our intentions.
*/
#ifdef BACKPIPE
if (didfds == 0 && t->t_dflg & F_PIPEOUT) {
xclose(pipeout[0]);
xclose(pipeout[1]);
}
if ((t->t_dflg & F_PIPEIN) != 0)
break;
#else /* !BACKPIPE */
if (didfds == 0 && t->t_dflg & F_PIPEIN) {
xclose(pipein[0]);
xclose(pipein[1]);
}
if ((t->t_dflg & F_PIPEOUT) != 0)
break;
#endif /* BACKPIPE */
if (nosigchld) {
sigprocmask(SIG_SETMASK, &csigset, NULL);
nosigchld = 0;
}
if ((t->t_dflg & F_AMPERSAND) == 0)
pwait();
break;
}
doio(t, pipein, pipeout);
#ifdef BACKPIPE
if (t->t_dflg & F_PIPEIN) {
xclose(pipein[0]);
xclose(pipein[1]);
}
#else /* !BACKPIPE */
if (t->t_dflg & F_PIPEOUT) {
xclose(pipeout[0]);
xclose(pipeout[1]);
}
#endif /* BACKPIPE */
/*
* Perform a builtin function. If we are not forked, arrange for
* possible stopping
*/
if (bifunc) {
func(t, bifunc);
if (forked)
exitstat();
else {
if (adrof(STRprintexitvalue)) {
int rv = getn(varval(STRstatus));
if (rv != 0)
xprintf(CGETS(17, 2, "Exit %d\n"), rv);
}
}
break;
}
if (t->t_dtyp != NODE_PAREN) {
doexec(t, do_glob);
/* NOTREACHED */
}
/*
* For () commands must put new 0,1,2 in FSH* and recurse
*/
(void)close_on_exec(OLDSTD = dcopy(0, FOLDSTD), 1);
(void)close_on_exec(SHOUT = dcopy(1, FSHOUT), 1);
isoutatty = isatty(SHOUT);
(void)close_on_exec(SHDIAG = dcopy(2, FSHDIAG), 1);
isdiagatty = isatty(SHDIAG);
xclose(SHIN);
SHIN = -1;
#ifndef CLOSE_ON_EXEC
didcch = 0;
#else
(void) close_on_exec(FSHOUT, 1);
(void) close_on_exec(FSHDIAG, 1);
(void) close_on_exec(FOLDSTD, 1);
#endif /* !CLOSE_ON_EXEC */
didfds = 0;
wanttty = -1;
t->t_dspr->t_dflg |= t->t_dflg & F_NOINTERRUPT;
execute(t->t_dspr, wanttty, NULL, NULL, do_glob);
exitstat();
case NODE_PIPE:
#ifdef BACKPIPE
t->t_dcdr->t_dflg |= F_PIPEIN | (t->t_dflg &
(F_PIPEOUT | F_AMPERSAND | F_NOFORK | F_NOINTERRUPT));
execute(t->t_dcdr, wanttty, pv, pipeout, do_glob);
t->t_dcar->t_dflg |= F_PIPEOUT |
(t->t_dflg & (F_PIPEIN | F_AMPERSAND | F_STDERR | F_NOINTERRUPT));
execute(t->t_dcar, wanttty, pipein, pv, do_glob);
#else /* !BACKPIPE */
t->t_dcar->t_dflg |= F_PIPEOUT |
(t->t_dflg & (F_PIPEIN | F_AMPERSAND | F_STDERR | F_NOINTERRUPT));
execute(t->t_dcar, wanttty, pipein, pv, do_glob);
t->t_dcdr->t_dflg |= F_PIPEIN | (t->t_dflg &
(F_PIPEOUT | F_AMPERSAND | F_NOFORK | F_NOINTERRUPT));
execute(t->t_dcdr, wanttty, pv, pipeout, do_glob);
#endif /* BACKPIPE */
break;
case NODE_LIST:
if (t->t_dcar) {
t->t_dcar->t_dflg |= t->t_dflg & F_NOINTERRUPT;
execute(t->t_dcar, wanttty, NULL, NULL, do_glob);
/*
* In strange case of A&B make a new job after A
*/
if (t->t_dcar->t_dflg & F_AMPERSAND && t->t_dcdr &&
(t->t_dcdr->t_dflg & F_AMPERSAND) == 0)
pendjob();
}
if (t->t_dcdr) {
t->t_dcdr->t_dflg |= t->t_dflg &
(F_NOFORK | F_NOINTERRUPT);
execute(t->t_dcdr, wanttty, NULL, NULL, do_glob);
}
break;
case NODE_OR:
case NODE_AND:
if (t->t_dcar) {
t->t_dcar->t_dflg |= t->t_dflg & F_NOINTERRUPT;
execute(t->t_dcar, wanttty, NULL, NULL, do_glob);
if ((getn(varval(STRstatus)) == 0) !=
(t->t_dtyp == NODE_AND)) {
return;
}
}
if (t->t_dcdr) {
t->t_dcdr->t_dflg |= t->t_dflg &
(F_NOFORK | F_NOINTERRUPT);
execute(t->t_dcdr, wanttty, NULL, NULL, do_glob);
}
break;
default:
break;
}
/*
* Fall through for all breaks from switch
*
* If there will be no more executions of this command, flush all file
* descriptors. Places that turn on the F_REPEAT bit are responsible for
* doing donefds after the last re-execution
*/
if (didfds && !(t->t_dflg & F_REPEAT))
donefds();
}
/* --------------------------------------------------------------------------
Name: bcm6352_enet_read
Purpose: Returns a recevied data buffer.
-------------------------------------------------------------------------- */
static int bcm6352_enet_read( cfe_devctx_t *ctx, iocb_buffer_t *buffer )
{
uint32_t rxEvents;
unsigned char *dstptr;
unsigned char *srcptr;
volatile DmaDesc *CurrentBdPtr;
bcm6352enet_softc *softc = (bcm6352enet_softc *) ctx->dev_softc;
/* ============================= ASSERTIONS ============================= */
if( ctx == NULL ) {
xprintf( "No context\n" );
return -1;
}
if( buffer == NULL ) {
xprintf( "No dst buffer\n" );
return -1;
}
if( buffer->buf_length != ENET_MAX_BUF_SIZE ) {
xprintf( "dst buffer too small.\n" );
xprintf( "actual size is %d\n", buffer->buf_length );
return -1;
}
if( softc == NULL ) {
xprintf( "softc has not been initialized.\n" );
return -1;
}
/* ====================================================================== */
dstptr = buffer->buf_ptr;
CurrentBdPtr = softc->rxBdReadPtr;
if( (CurrentBdPtr->status & DMA_OWN) == 1 )
return -1;
srcptr = (unsigned char *)( PHYS_TO_K1(CurrentBdPtr->address) );
memcpy( dstptr, srcptr, ETH_ALEN * 2 );
dstptr += ETH_ALEN * 2;
memcpy( dstptr, srcptr + HEDR_LEN, CurrentBdPtr->length - HEDR_LEN - 8 );
/* length - header difference - 2 CRCs */
buffer->buf_retlen = CurrentBdPtr->length - 6 - 8;
CurrentBdPtr->length = ENET_MAX_MTU_SIZE;
CurrentBdPtr->status &= DMA_WRAP;
CurrentBdPtr->status |= DMA_OWN;
IncRxBDptr(CurrentBdPtr, softc);
softc->rxBdReadPtr = CurrentBdPtr;
rxEvents = softc->rxDma->intStat;
softc->rxDma->intStat = rxEvents;
softc->rxDma->cfg = DMA_ENABLE | DMA_CHAINING | DMA_WRAP_EN;
return 0;
}
int main(void) {
xprintf("Chapter %d Exercise %d Test % %j", 26, 2);
puts("");
return 0;
}
void adv_basis(glp_prob *lp)
{ int m = lpx_get_num_rows(lp);
int n = lpx_get_num_cols(lp);
int i, j, jj, k, size;
int *rn, *cn, *rn_inv, *cn_inv;
int typx, *tagx = xcalloc(1+m+n, sizeof(int));
double lb, ub;
xprintf("Crashing...\n");
if (m == 0)
xerror("glp_adv_basis: problem has no rows\n");
if (n == 0)
xerror("glp_adv_basis: problem has no columns\n");
/* use the routine triang (see above) to find maximal triangular
part of the augmented constraint matrix A~ = (I|-A); in order
to prevent columns of fixed variables to be included in the
triangular part, such columns are implictly removed from the
matrix A~ by the routine adv_mat */
rn = xcalloc(1+m, sizeof(int));
cn = xcalloc(1+m+n, sizeof(int));
size = triang(m, m+n, lp, mat, rn, cn);
if (lpx_get_int_parm(lp, LPX_K_MSGLEV) >= 3)
xprintf("Size of triangular part = %d\n", size);
/* the first size rows and columns of the matrix P*A~*Q (where
P and Q are permutation matrices defined by the arrays rn and
cn) form a lower triangular matrix; build the arrays (rn_inv
and cn_inv), which define the matrices inv(P) and inv(Q) */
rn_inv = xcalloc(1+m, sizeof(int));
cn_inv = xcalloc(1+m+n, sizeof(int));
for (i = 1; i <= m; i++) rn_inv[rn[i]] = i;
for (j = 1; j <= m+n; j++) cn_inv[cn[j]] = j;
/* include the columns of the matrix A~, which correspond to the
first size columns of the matrix P*A~*Q, in the basis */
for (k = 1; k <= m+n; k++) tagx[k] = -1;
for (jj = 1; jj <= size; jj++)
{ j = cn_inv[jj];
/* the j-th column of A~ is the jj-th column of P*A~*Q */
tagx[j] = LPX_BS;
}
/* if size < m, we need to add appropriate columns of auxiliary
variables to the basis */
for (jj = size + 1; jj <= m; jj++)
{ /* the jj-th column of P*A~*Q should be replaced by the column
of the auxiliary variable, for which the only unity element
is placed in the position [jj,jj] */
i = rn_inv[jj];
/* the jj-th row of P*A~*Q is the i-th row of A~, but in the
i-th row of A~ the unity element belongs to the i-th column
of A~; therefore the disired column corresponds to the i-th
auxiliary variable (note that this column doesn't belong to
the triangular part found by the routine triang) */
xassert(1 <= i && i <= m);
xassert(cn[i] > size);
tagx[i] = LPX_BS;
}
/* free working arrays */
xfree(rn);
xfree(cn);
xfree(rn_inv);
xfree(cn_inv);
/* build tags of non-basic variables */
for (k = 1; k <= m+n; k++)
{ if (tagx[k] != LPX_BS)
{ if (k <= m)
lpx_get_row_bnds(lp, k, &typx, &lb, &ub);
else
lpx_get_col_bnds(lp, k-m, &typx, &lb, &ub);
switch (typx)
{ case LPX_FR:
tagx[k] = LPX_NF; break;
case LPX_LO:
tagx[k] = LPX_NL; break;
case LPX_UP:
tagx[k] = LPX_NU; break;
case LPX_DB:
tagx[k] =
(fabs(lb) <= fabs(ub) ? LPX_NL : LPX_NU);
break;
case LPX_FX:
tagx[k] = LPX_NS; break;
default:
xassert(typx != typx);
}
}
}
for (k = 1; k <= m+n; k++)
{ if (k <= m)
lpx_set_row_stat(lp, k, tagx[k]);
else
lpx_set_col_stat(lp, k-m, tagx[k]);
}
xfree(tagx);
return;
}
/*
* Opens the SDL audio device and sets channel_layout, channels, sample_rate
* and sample_fmt output information that we use for the resample section
* in the decoder.
* This function should be called after openfile, because we need its
* channel, channel_layout, and sample_rate information.
*
* On error it returns -1, on success 0;
*/
static int
openaudio(void)
{
AVCodecContext *codec;
SDL_AudioSpec *desired, *obtained, *hwspec;
if (avfmt == NULL) {
xprintf("(%s:%d) AVFormatContext was not set",
__FILE__, __LINE__);
return -1;
}
desired = xmalloc(sizeof(SDL_AudioSpec));
obtained = xmalloc(sizeof(SDL_AudioSpec));
codec = avfmt->streams[sti]->codec;
if (!codec->channel_layout) {
codec->channel_layout = av_get_default_channel_layout(
codec->channels);
}
if (!codec->channel_layout) {
xprintf("(%s:%d) Unable to guess channel layout",
__FILE__, __LINE__);
goto error;
}
desired->callback = sdl_audio_callback;
if (codec->channels == 1)
desired->channels = 1; /* mono */
else
desired->channels = 2; /* stereo */
desired->format = AUDIO_S16SYS;
desired->freq = codec->sample_rate;
desired->samples = SDL_AUDIO_BUFFER_SIZE;
desired->silence = 0;
desired->userdata = NULL;
if (SDL_OpenAudio(desired, obtained) < 0) {
xprintf("(%s:%d) SDL_OpenAudio: %s", __FILE__, __LINE__,
SDL_GetError());
goto error;
}
if (obtained == NULL)
hwspec = desired;
else
hwspec = obtained;
if (hwspec->channels == 1)
out_channel_layout = AV_CH_LAYOUT_MONO;
else
out_channel_layout = AV_CH_LAYOUT_STEREO;
out_channels = hwspec->channels;
out_sample_rate = hwspec->freq;
out_sample_fmt = AV_SAMPLE_FMT_S16;
free(desired);
free(obtained);
return 0;
error:
free(desired);
free(obtained);
return -1;
}
static int solve_mip(glp_prob *P, const glp_iocp *parm,
glp_prob *P0 /* problem passed to glp_intopt */,
NPP *npp /* preprocessor workspace or NULL */)
#endif
{ /* solve MIP directly without using the preprocessor */
glp_tree *T;
int ret;
/* optimal basis to LP relaxation must be provided */
if (glp_get_status(P) != GLP_OPT)
{ if (parm->msg_lev >= GLP_MSG_ERR)
xprintf("glp_intopt: optimal basis to initial LP relaxation"
" not provided\n");
ret = GLP_EROOT;
goto done;
}
/* it seems all is ok */
if (parm->msg_lev >= GLP_MSG_ALL)
xprintf("Integer optimization begins...\n");
/* create the branch-and-bound tree */
T = ios_create_tree(P, parm);
#if 1 /* 11/VII-2013 */
T->P = P0;
T->npp = npp;
#endif
/* solve the problem instance */
ret = ios_driver(T);
/* delete the branch-and-bound tree */
ios_delete_tree(T);
/* analyze exit code reported by the mip driver */
if (ret == 0)
{ if (P->mip_stat == GLP_FEAS)
{ if (parm->msg_lev >= GLP_MSG_ALL)
xprintf("INTEGER OPTIMAL SOLUTION FOUND\n");
P->mip_stat = GLP_OPT;
}
else
{ if (parm->msg_lev >= GLP_MSG_ALL)
xprintf("PROBLEM HAS NO INTEGER FEASIBLE SOLUTION\n");
P->mip_stat = GLP_NOFEAS;
}
}
else if (ret == GLP_EMIPGAP)
{ if (parm->msg_lev >= GLP_MSG_ALL)
xprintf("RELATIVE MIP GAP TOLERANCE REACHED; SEARCH TERMINA"
"TED\n");
}
else if (ret == GLP_ETMLIM)
{ if (parm->msg_lev >= GLP_MSG_ALL)
xprintf("TIME LIMIT EXCEEDED; SEARCH TERMINATED\n");
}
else if (ret == GLP_EFAIL)
{ if (parm->msg_lev >= GLP_MSG_ERR)
xprintf("glp_intopt: cannot solve current LP relaxation\n");
}
else if (ret == GLP_ESTOP)
{ if (parm->msg_lev >= GLP_MSG_ALL)
xprintf("SEARCH TERMINATED BY APPLICATION\n");
}
else
xassert(ret != ret);
done: return ret;
}
int glp_intopt(glp_prob *P, const glp_iocp *parm)
{ /* solve MIP problem with the branch-and-bound method */
glp_iocp _parm;
int i, j, ret;
/* check problem object */
if (P == NULL || P->magic != GLP_PROB_MAGIC)
xerror("glp_intopt: P = %p; invalid problem object\n", P);
if (P->tree != NULL)
xerror("glp_intopt: operation not allowed\n");
/* check control parameters */
if (parm == NULL)
parm = &_parm, glp_init_iocp((glp_iocp *)parm);
if (!(parm->msg_lev == GLP_MSG_OFF ||
parm->msg_lev == GLP_MSG_ERR ||
parm->msg_lev == GLP_MSG_ON ||
parm->msg_lev == GLP_MSG_ALL ||
parm->msg_lev == GLP_MSG_DBG))
xerror("glp_intopt: msg_lev = %d; invalid parameter\n",
parm->msg_lev);
if (!(parm->br_tech == GLP_BR_FFV ||
parm->br_tech == GLP_BR_LFV ||
parm->br_tech == GLP_BR_MFV ||
parm->br_tech == GLP_BR_DTH ||
parm->br_tech == GLP_BR_PCH))
xerror("glp_intopt: br_tech = %d; invalid parameter\n",
parm->br_tech);
if (!(parm->bt_tech == GLP_BT_DFS ||
parm->bt_tech == GLP_BT_BFS ||
parm->bt_tech == GLP_BT_BLB ||
parm->bt_tech == GLP_BT_BPH))
xerror("glp_intopt: bt_tech = %d; invalid parameter\n",
parm->bt_tech);
if (!(0.0 < parm->tol_int && parm->tol_int < 1.0))
xerror("glp_intopt: tol_int = %g; invalid parameter\n",
parm->tol_int);
if (!(0.0 < parm->tol_obj && parm->tol_obj < 1.0))
xerror("glp_intopt: tol_obj = %g; invalid parameter\n",
parm->tol_obj);
if (parm->tm_lim < 0)
xerror("glp_intopt: tm_lim = %d; invalid parameter\n",
parm->tm_lim);
if (parm->out_frq < 0)
xerror("glp_intopt: out_frq = %d; invalid parameter\n",
parm->out_frq);
if (parm->out_dly < 0)
xerror("glp_intopt: out_dly = %d; invalid parameter\n",
parm->out_dly);
if (!(0 <= parm->cb_size && parm->cb_size <= 256))
xerror("glp_intopt: cb_size = %d; invalid parameter\n",
parm->cb_size);
if (!(parm->pp_tech == GLP_PP_NONE ||
parm->pp_tech == GLP_PP_ROOT ||
parm->pp_tech == GLP_PP_ALL))
xerror("glp_intopt: pp_tech = %d; invalid parameter\n",
parm->pp_tech);
if (parm->mip_gap < 0.0)
xerror("glp_intopt: mip_gap = %g; invalid parameter\n",
parm->mip_gap);
if (!(parm->mir_cuts == GLP_ON || parm->mir_cuts == GLP_OFF))
xerror("glp_intopt: mir_cuts = %d; invalid parameter\n",
parm->mir_cuts);
if (!(parm->gmi_cuts == GLP_ON || parm->gmi_cuts == GLP_OFF))
xerror("glp_intopt: gmi_cuts = %d; invalid parameter\n",
parm->gmi_cuts);
if (!(parm->cov_cuts == GLP_ON || parm->cov_cuts == GLP_OFF))
xerror("glp_intopt: cov_cuts = %d; invalid parameter\n",
parm->cov_cuts);
if (!(parm->clq_cuts == GLP_ON || parm->clq_cuts == GLP_OFF))
xerror("glp_intopt: clq_cuts = %d; invalid parameter\n",
parm->clq_cuts);
if (!(parm->presolve == GLP_ON || parm->presolve == GLP_OFF))
xerror("glp_intopt: presolve = %d; invalid parameter\n",
parm->presolve);
if (!(parm->binarize == GLP_ON || parm->binarize == GLP_OFF))
xerror("glp_intopt: binarize = %d; invalid parameter\n",
parm->binarize);
if (!(parm->fp_heur == GLP_ON || parm->fp_heur == GLP_OFF))
xerror("glp_intopt: fp_heur = %d; invalid parameter\n",
parm->fp_heur);
#if 1 /* 28/V-2010 */
if (!(parm->alien == GLP_ON || parm->alien == GLP_OFF))
xerror("glp_intopt: alien = %d; invalid parameter\n",
parm->alien);
#endif
/* integer solution is currently undefined */
P->mip_stat = GLP_UNDEF;
P->mip_obj = 0.0;
/* check bounds of double-bounded variables */
for (i = 1; i <= P->m; i++)
{ GLPROW *row = P->row[i];
if (row->type == GLP_DB && row->lb >= row->ub)
{ if (parm->msg_lev >= GLP_MSG_ERR)
xprintf("glp_intopt: row %d: lb = %g, ub = %g; incorrect"
" bounds\n", i, row->lb, row->ub);
ret = GLP_EBOUND;
goto done;
}
}
for (j = 1; j <= P->n; j++)
{ GLPCOL *col = P->col[j];
if (col->type == GLP_DB && col->lb >= col->ub)
{ if (parm->msg_lev >= GLP_MSG_ERR)
xprintf("glp_intopt: column %d: lb = %g, ub = %g; incorr"
"ect bounds\n", j, col->lb, col->ub);
ret = GLP_EBOUND;
goto done;
}
}
/* bounds of all integer variables must be integral */
for (j = 1; j <= P->n; j++)
{ GLPCOL *col = P->col[j];
if (col->kind != GLP_IV) continue;
if (col->type == GLP_LO || col->type == GLP_DB)
{ if (col->lb != floor(col->lb))
{ if (parm->msg_lev >= GLP_MSG_ERR)
xprintf("glp_intopt: integer column %d has non-intege"
"r lower bound %g\n", j, col->lb);
ret = GLP_EBOUND;
goto done;
}
}
if (col->type == GLP_UP || col->type == GLP_DB)
{ if (col->ub != floor(col->ub))
{ if (parm->msg_lev >= GLP_MSG_ERR)
xprintf("glp_intopt: integer column %d has non-intege"
"r upper bound %g\n", j, col->ub);
ret = GLP_EBOUND;
goto done;
}
}
if (col->type == GLP_FX)
{ if (col->lb != floor(col->lb))
{ if (parm->msg_lev >= GLP_MSG_ERR)
xprintf("glp_intopt: integer column %d has non-intege"
"r fixed value %g\n", j, col->lb);
ret = GLP_EBOUND;
goto done;
}
}
}
/* solve MIP problem */
if (parm->msg_lev >= GLP_MSG_ALL)
{ int ni = glp_get_num_int(P);
int nb = glp_get_num_bin(P);
char s[50];
xprintf("GLPK Integer Optimizer, v%s\n", glp_version());
xprintf("%d row%s, %d column%s, %d non-zero%s\n",
P->m, P->m == 1 ? "" : "s", P->n, P->n == 1 ? "" : "s",
P->nnz, P->nnz == 1 ? "" : "s");
if (nb == 0)
strcpy(s, "none of");
else if (ni == 1 && nb == 1)
strcpy(s, "");
else if (nb == 1)
strcpy(s, "one of");
else if (nb == ni)
strcpy(s, "all of");
else
sprintf(s, "%d of", nb);
xprintf("%d integer variable%s, %s which %s binary\n",
ni, ni == 1 ? "" : "s", s, nb == 1 ? "is" : "are");
}
#if 1 /* 28/V-2010 */
if (parm->alien)
{ /* use alien integer optimizer */
ret = _glp_intopt1(P, parm);
goto done;
}
#endif
if (!parm->presolve)
ret = solve_mip(P, parm);
else
ret = preprocess_and_solve_mip(P, parm);
done: /* return to the application program */
return ret;
}