1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371
|
/*
Quickplot - an interactive 2D plotter
Copyright (C) 1998-2011 Lance Arsenault
This file is part of Quickplot.
Quickplot is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published
by the Free Software Foundation, either version 3 of the License,
or (at your option) any later version.
Quickplot is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public License
along with Quickplot. If not, see <http://www.gnu.org/licenses/>.
*/
#include <stdint.h>
#include <gdk/gdkx.h>
#include "quickplot.h"
#include "config.h"
#include "debug.h"
#include "list.h"
#include "channel.h"
#include "channel_double.h"
#include "qp.h"
#include "plot.h"
#include "color_gen.h"
#ifdef DMALLOC
# include "dmalloc.h"
#endif
static inline
void free_x11_colors(struct qp_plot *p, struct qp_graph *gr)
{
ASSERT(gr->x11);
if(gr->x11)
{
if(!gr->x11->dsp)
gr->x11->dsp = gdk_x11_get_default_xdisplay();
XFreeColors(gr->x11->dsp, DefaultColormap(gr->x11->dsp,
DefaultScreen(gr->x11->dsp)), &p->l.x, 1, 0);
XFreeColors(gr->x11->dsp, DefaultColormap(gr->x11->dsp,
DefaultScreen(gr->x11->dsp)), &p->p.x, 1, 0);
}
}
void qp_plot_set_X11_color(struct qp_plot *p, struct qp_color *c)
{
XColor x;
x.pixel = 0;
x.red = 65535 * c->c.r;
x.green = 65535 * c->c.g;
x.blue = 65535 * c->c.b;
x.flags = 0;
XAllocColor(p->gr->x11->dsp, DefaultColormap(p->gr->x11->dsp,
DefaultScreen(p->gr->x11->dsp)), &x);
ASSERT(x.pixel);
c->x = x.pixel;
}
static inline
void make_x11_colors(struct qp_plot *p, struct qp_graph *gr)
{
ASSERT(gr->x11);
if(gr->x11)
{
/* Turn the cairo rgba colors into XColors */
if(!gr->x11->dsp)
gr->x11->dsp = gdk_x11_get_default_xdisplay();
qp_plot_set_X11_color(p, &p->l);
qp_plot_set_X11_color(p, &p->p);
}
}
void qp_plot_set_cairo_draw_mode(struct qp_plot *p, struct qp_graph *gr)
{
free_x11_colors(p, gr);
}
void qp_plot_set_x11_draw_mode(struct qp_plot *p, struct qp_graph *gr)
{
make_x11_colors(p, gr);
}
struct qp_plot *qp_plot_copy_create(struct qp_graph *gr, struct qp_plot *old_p)
{
struct qp_plot *p;
struct qp_graph_x11 *x11_save;
ASSERT(gr != old_p->gr);
x11_save = gr->x11;
if(x11_save)
/* We cannot let the X11 colors be allocated since
* they may change after the plot is made. */
gr->x11 = NULL;
p = qp_plot_create(gr, old_p->x, old_p->y, old_p->name, 1.0, -1.0, 1.0, -1.0);
/* Here we may be changing the colors
* to match the plot we are copying */
memcpy(&p->p,&old_p->p, sizeof(p->p));
memcpy(&p->l,&old_p->l, sizeof(p->l));
/* now that we have the colors set we can
* allocate the X11 colors. */
gr->x11 = x11_save;
if(gr->x11)
make_x11_colors(p, gr);
p->lines = old_p->lines;
p->points = old_p->points;
p->gaps = old_p->gaps;
p->xscale = old_p->xscale;
p->yscale = old_p->yscale;
p->xshift = old_p->xshift;
p->yshift = old_p->yshift;
p->xscale0 = old_p->xscale0;
p->yscale0 = old_p->yscale0;
p->xshift0 = old_p->xshift0;
p->yshift0 = old_p->yshift0;
p->line_width = old_p->line_width;
p->point_size = old_p->point_size;
return p;
}
qp_plot_t qp_plot_create(qp_graph_t gr,
qp_channel_t x, qp_channel_t y, const char *name,
double xmin, double xmax, double ymin, double ymax)
{
struct qp_plot *p;
size_t num_points = (size_t) -1;
ASSERT(gr);
ASSERT(x);
ASSERT(y);
ASSERT(name);
p = (struct qp_plot*) qp_malloc(sizeof(*p));
memset(p, 0, sizeof(*p));
p->plot_num = ++gr->plot_create_count;
qp_sllist_append(gr->plots, p);
p->name = qp_strdup(name);
p->gr = gr;
gr->current_plot = p;
p->gaps = gr->gaps;
p->x_entry = NULL;
p->y_entry = NULL;
p->x_picker = NULL;
p->y_picker = NULL;
/* get default point and line colors */
qp_color_gen_next(gr->color_gen, &p->p.c.r, &p->p.c.g, &p->p.c.b, -1);
qp_color_gen_next(gr->color_gen, &p->l.c.r, &p->l.c.g, &p->l.c.b, -1);
p->p.c.a = 0.95;
p->l.c.a = 0.85;
if(gr->x11)
make_x11_colors(p, gr);
switch(x->form)
{
case QP_CHANNEL_FORM_SERIES:
{
if(xmax < xmin)
{
xmin = x->series.min;
xmax = x->series.max;
}
p->x = qp_channel_series_create(x, 0);
p->x_is_reading = qp_channel_series_is_reading;
switch(x->value_type)
{
case QP_TYPE_DOUBLE:
/* now these functions will not be inlined, oh well */
p->channel_x_begin = qp_channel_series_double_begin;
p->channel_x_end = qp_channel_series_double_end;
p->channel_x_next = qp_channel_series_double_next;
p->channel_x_prev = qp_channel_series_double_prev;
p->channel_series_x_index = qp_channel_series_double_index;
p->channel_series_x_get_index = qp_channel_series_double_get_index;
break;
default:
VASSERT(0, "write more code here");
break;
}
}
break;
/* TODO: add more cases */
default:
VASSERT(0, "write more code here");
break;
}
switch(y->form)
{
case QP_CHANNEL_FORM_SERIES:
{
if(ymax < ymin)
{
ymin = y->series.min;
ymax = y->series.max;
}
p->y = qp_channel_series_create(y, 0);
p->y_is_reading = qp_channel_series_is_reading;
switch(y->value_type)
{
case QP_TYPE_DOUBLE:
/* now these functions will not be inlined, oh well */
p->channel_y_begin = qp_channel_series_double_begin;
p->channel_y_end = qp_channel_series_double_end;
p->channel_y_next = qp_channel_series_double_next;
p->channel_y_prev = qp_channel_series_double_prev;
p->channel_series_y_index = qp_channel_series_double_index;
break;
default:
VASSERT(0, "write more code here");
break;
}
}
break;
/* TODO: add more cases */
default:
VASSERT(0, "write more code here");
break;
}
/* find the number of points if we can */
if(p->x->form == QP_CHANNEL_FORM_SERIES)
num_points = qp_channel_series_length(p->x);
if(p->y->form == QP_CHANNEL_FORM_SERIES)
{
size_t len;
len = qp_channel_series_length(p->y);
if(len < num_points)
num_points = len;
}
if(gr->lines == -1)
{
if(num_points > 1000000)
p->lines = 0;
else
p->lines = 1;
}
else
p->lines = gr->lines;
p->points = gr->points;
DEBUG("line_width=%d\n", gr->line_width);
if(gr->line_width != -1)
p->line_width = gr->line_width;
else /* AUTO line_width */
{
if(num_points > 100000)
p->line_width = 2;
else if(num_points > 100)
p->line_width = 4;
else if(num_points > 10)
p->line_width = 6;
else
p->line_width = 8;
if((gr->grid_line_width%2))
++(p->line_width);
}
if(gr->point_size != -1)
p->point_size = gr->point_size;
else
{
if(num_points > 1000000)
p->point_size = 2;
else if(num_points > 10000)
p->point_size = 4;
else if(num_points > 100)
p->point_size = 6;
else if(num_points > 10)
p->point_size = 8;
else
p->point_size = 10;
if((gr->grid_line_width%2))
++(p->point_size);
}
p->xscale0 = 1.0/(xmax - xmin);
p->xshift0 = -xmin/(xmax - xmin);
p->yscale0 = 1.0/(ymax - ymin);
p->yshift0 = -ymin/(ymax - ymin);
p->xscale = 0.0;
p->xshift = 0.0;
p->yscale = 0.0;
p->yshift = 0.0;
p->sig_fig_x = 0;
p->sig_fig_y = 0;
return p;
}
void qp_plot_destroy(qp_plot_t plot, struct qp_graph *gr)
{
ASSERT(plot);
ASSERT(plot->name);
if(plot)
{
struct qp_plot *p;
struct qp_sllist *l;
l = qp_sllist_create(gr->plots);
for(p=qp_sllist_begin(l);p;p=qp_sllist_next(l))
if(p != plot)
gr->current_plot = p;
qp_sllist_destroy(l, 0);
/* if the channels are series we must free
* resources */
if(plot->x->form == QP_CHANNEL_FORM_SERIES)
qp_channel_destroy(plot->x);
if(plot->y->form == QP_CHANNEL_FORM_SERIES)
qp_channel_destroy(plot->y);
if(plot->x_picker && plot->x_picker->form == QP_CHANNEL_FORM_SERIES)
qp_channel_destroy(plot->x_picker);
if(plot->y_picker && plot->y_picker->form == QP_CHANNEL_FORM_SERIES)
qp_channel_destroy(plot->y_picker);
/* If using X11 to draw we need to free the X11 colors */
if(gr->x11)
free_x11_colors(plot, gr);
free(plot->name);
free(plot);
}
}
|