static void end_channels() { int k; FILE *fd; for (k = 1; k < TOTALCH; k++) { fd = fds[k]; if (fd != NULL) { print_dummy(k); print_size(k, 1); fprintf(fd, "%.3f %g %g 0 0 1\n", seqTime, chY[k], chY[k]); } } }
static int open_fds() { int k, retVal; char **labels; FILE *fd; if (imageType) labels = image_labels; else labels = channel_label; retVal = 1; rfchan[ACQDEV] = 1; for (k = 1; k < TOTALCH; k++) { fds[k] = NULL; items[k] = 0; lines[k] = 0; // phaseFds[k] = NULL; if (rfchan[k] && visibleCh[k]) { sprintf(tmpStr, "%s/.dpsChannel%d", curexpdir, k); unixPathToWin(tmpStr, tmpPath, MAXPATH); fd = fopen(tmpPath, "w"); if (fd == NULL) retVal = 0; fds[k] = fd; fprintf(fd, "#channel %d\n", k); fprintf(fd, "#name %s\n", labels[k]); fprintf(fd, "#seqtime %g\n", seqTime); fprintf(fd, "#columns 6\n"); fprintf(fd, "#debug %d\n", debug); // fprintf(fd, "#columns %d\n", channel_columns[k]); print_dummy(k); print_size(k, 1); fprintf(fd, "0.0 0.0 0.0 0 0 1\n"); } } if (retVal == 0) close_fds(); return (retVal); }
static void update_height(SRC_NODE *node) { int dev; double v; FILE *fd; while (node != NULL) { dev = node->device; fd = fds[dev]; if (fd == NULL) return; print_dummy(dev); print_size(dev, 2); fprintf(fd, "%.3f %g %g 0 0 1\n", node->xstime, chY[dev], chY[dev]); v = adjust_height(node); fprintf(fd, "%.3f %g %g 0 0 1\n", node->xstime, v, v); chY[dev] = v; chX[dev] = node->xstime; node = node->bnode; } }
int main(void) { struct hash_entry *e; int key = 5; char key2 = 'd'; struct dummy d1, d2, d3, d4, d5; mtrace(); d1.i = 1; d1.c = 'a'; strcpy(d1.str, "d1"); d2.i = 2; d2.c = 'b'; strcpy(d2.str, "d2"); d3.i = 3; d3.c = 'c'; strcpy(d3.str, "d3"); d4.i = 4; d4.c = 'd'; strcpy(d4.str, "d4"); d5.i = 5; d5.c = 'e'; strcpy(d5.str, "d5"); /* initialization */ init_hash_table_INT(); init_hash_table_CHR(); init_hash_group(&h, 2, &hash_table_INT, &hash_table_CHR); /* adding entries */ add_entry_hash_group(h, &d1); add_entry_hash_group(h, &d2); add_entry_hash_group(h, &d3); add_entry_hash_group(h, &d4); add_entry_hash_group(h, &d5); print_hash_group(h, print_dummy); /* lookup */ e = lookup_hash_group_INT(h, &key); printf("\n+++\n"); print_dummy(e->data); printf("\n---\n"); /* delete entry */ del_entry_hash_group(h, e); print_hash_group(h, print_dummy); /* lookup */ e = lookup_hash_group_CHR(h, &key2); printf("\n§§§\n"); print_dummy(e->data); printf("\n$$$\n"); /* delete entry */ del_entry_hash_group(h, e); print_hash_group(h, print_dummy); /* clean up the whole crap */ cleanup_hash_group(h, NULL); muntrace(); return 0; }