1
0
mirror of git://projects.qi-hardware.com/fped.git synced 2024-09-30 09:07:37 +03:00
fped/obj.h
werner c9af8cd0fe The mechanism for selecting points for measurements reaches its limits when
using frames to encapsulate building blocks, e.g., like macros or functions in
a programming language. Since measurements only know about the frame containing
a vector but not the frames containing that frame, invocations of this frame
from different places can only be distinguished within the min/next/max scheme.
(See the example in README.)

To eliminate this limitation, one needs a way to tell fped to consider a point
only if it has been instantiated through a certain path, e.g., by requiring
some other frames to be visited in its instantiation. This increases the number
of distinct points available for measurements.

The mechanism chosen is to qualify a measurement point with frames that lead to
it. This list of outer frames does not have to include all frames. Without
qualifying, the old behaviour results.

Note that this doesn't cover all possible ways in which a point can appear in
different roles. Multiple frame references can also result from repeating the
same frame reference in the same parent frame. The current qualification
mechanism does not allow such paths to be distinguished. However, one can 
always introduce intermediate frames for this purpose.

Furthermore, repetitions create multiple instances of a point, although in what
should be considered the same role.

- fpd.l: make scanner support free-format a little better by switching back to
  keyword mode after frame braces. This way, one can write a simple frame in a
  single line, which is useful for regression tests.
- fpd.l, fpd.y, README, test/dbg_meas: added %meas directive to print the 
  result of a measurement
- fpd.y, README: measurements can now be labeled. Note that, due to limitations
  of the grammar, the first measurement cannot be labeled.
- error.h, error.c (yywarn): new function for non-fatal diagnostics that always
  get reported to standard error
- bitset.h, bitset.c: functions to manipulate variable-size bit sets
- meas.h, fpd.y, README, test/meas_qual: added the means to specify qualifiers
  for points used in measurements
- dump.c (print_meas_base, print_meas): dump qualifiers
- delete.c (delete_references, test/del_frame): delete measurements that
  reference a frame being deleted in their qualifiers
- obj.h, obj.c (enumerate_frames, instantiate): enumerate all frames so that we
  have an index into the bit vector of visited frames
- meas.h, meas.c (reset_samples, meas_post), obj.c (generate_vecs,
  generate_frame, instantiate): record the set of frames visited for each
  sample
- meas.c (meas_post): only treat two instances of a point as equivalent if the
  set of frames visited of one of them is a superset of set of the other. In
  this case, keep the union of the two sets.
- meas.h, meas.c (meas_find_min, meas_find_next, meas_find_max),
  test/meas_qual: instantiate_meas_pkg only select points for which all frames
  in the qualification have been visited
- gui_meas.c (is_min, is_next, is_max, is_a_next): updated for above change
- inst.h, inst.c (curr_frame, propagate_bbox, add_inst, inst_begin_frame,
  inst_end_frame, inst_start): renamed curr_frame to frame_instantiating to
  avoid clash with curr_frame in fpd.y
- inst.h, inst.c (find_meas_hint): make global
- test/structure, test/del_vec, test/del_frame: fped now warns if a measurement
  is in an unlinked frame. Changed regressions tests to avoid this warning.
- test/Common: new function expect_grep to compare only part of the output



git-svn-id: http://svn.openmoko.org/trunk/eda/fped@5967 99fdad57-331a-0410-800a-d7fa5415bdb3
2010-05-29 21:13:48 +00:00

271 lines
5.7 KiB
C

/*
* obj.h - Object definition model
*
* Written 2009, 2010 by Werner Almesberger
* Copyright 2009, 2010 by Werner Almesberger
*
* This program 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 2 of the License, or
* (at your option) any later version.
*/
#ifndef OBJ_H
#define OBJ_H
#include <assert.h>
#include <gtk/gtk.h>
#include "expr.h"
#include "coord.h"
#include "meas.h"
#include "layer.h"
/*
* Objects contain various fields that help to select instances under various
* conditions. They are "current", "active", and "found":
*
* - current: the path taken while instantiating. E.g., we may make one frame
* reference the "current" reference of this frame and then recurse into it.
* "Current" is reset to a null value after instantiation is complete, to
* allow other functions (such as expression evaluation) to distinguish
* between instantiation and editing.
*
* - active: the path selected by the user, through the GUI. This allows the
* user to reach any instance, similar to how instantiation visits all
* instances. The difference to "current" is that "active" is persistent
* across instantiation while "current" iterates through all possible values
* during instantiation.
*
* - found: then clicking on an unselected instance, fped will try to activate
* this instance. In order to do so, it needs to determine which choices need
* to be activated to reach the instance. "Found" records this information.
* At the end of the search, all "found" choices become "active".
*
* If, during the search, an instance can be reached with the "found" choice
* being equal to the choice active at that time, "found" will not be set to
* any other value. This prevents searches from affecting choices that play
* no role in the selection of the instance.
*/
struct var {
const char *name;
struct var *next;
/* back reference */
struct frame *frame;
struct table *table; /* NULL if loop */
/* for the GUI */
GtkWidget *widget;
/* for evaluation */
int visited;
};
struct value {
struct expr *expr;
struct value *next;
/* back reference, NULL if loop */
struct row *row;
/* for the GUI */
GtkWidget *widget;
};
struct row {
struct value *values;
struct row *next;
/* back reference */
struct table *table;
};
struct table {
struct var *vars;
struct row *rows;
struct table *next;
/* used during generation and when editing */
struct row *curr_row;
/* GUI use */
struct row *active_row;
/* For searching */
struct row *found_row; /* NULL if not found yet */
};
struct loop {
struct var var;
struct value from;
struct value to;
struct loop *next;
/* used during generation */
double curr_value;
/* GUI use */
int active; /* n-th iteration is active, 0 based */
double n; /* start value when it was active */
int iterations; /* iterations when it was active */
/* For searching */
int found; /* -1 if not found yet */
/* for evaluation */
int initialized;
};
struct sample;
struct vec {
const char *name; /* NULL if anonymous */
struct expr *x;
struct expr *y;
struct vec *base; /* NULL if frame */
struct vec *next;
/* used during generation */
struct coord pos;
/* used when editing */
struct frame *frame;
/* index into table of samples */
int n;
/* for re-ordering after a move */
int mark;
/* for dumping */
int dumped;
/* for the GUI */
GtkWidget *list_widget; /* NULL if items aren't shown */
};
struct frame {
const char *name; /* NULL if top-level */
struct table *tables;
struct loop *loops;
struct vec *vecs;
struct obj *objs;
struct frame *next;
/* used during generation */
const struct frame *curr_parent;
/* generating and editing */
struct obj *active_ref;
/* for searching */
struct obj *found_ref; /* NULL if not found yet */
/* index into bit vector in samples */
int n;
/* for dumping */
int dumped;
/* for the GUI */
GtkWidget *label;
};
enum obj_type {
ot_frame,
ot_rect,
ot_pad,
ot_hole,
ot_line,
ot_arc,
ot_meas,
};
struct frame_ref {
struct frame *ref;
int lineno;
};
struct rect {
struct vec *other; /* NULL if frame origin */
struct expr *width;
};
struct pad {
char *name;
struct vec *other; /* NULL if frame origin */
int rounded;
enum pad_type type;
};
struct hole {
struct vec *other; /* NULL if frame origin */
};
struct arc {
struct vec *start; /* NULL if frame origin */
struct vec *end; /* NULL if this is a circle */
struct expr *width;
};
struct obj {
enum obj_type type;
const char *name; /* NULL if anonymous */
union {
struct frame_ref frame;
struct rect rect;
struct rect line;
struct pad pad;
struct hole hole;
struct arc arc;
struct meas meas;
} u;
struct frame *frame;
struct vec *base;
struct obj *next;
int lineno;
/* for dumping */
int dumped;
/* for the GUI */
GtkWidget *list_widget; /* NULL if items are not shown */
};
extern char *pkg_name; /* anonymous common package first */
extern struct frame *frames; /* root frame first */
extern struct frame *active_frame;
extern void *instantiation_error;
struct inst;
/*
* Search callback from inst, invoked after the instance has been populated.
*/
void find_inst(const struct inst *inst);
/*
* If invoking search_inst before calling "instantiate", loop and tables are
* adjusted such that an instance matching the one passed to search_inst will
* become active. Note that this doesn't necessarily succeed, in which case no
* change is made. Also, if multiple matches are encountered, the result is
* arbitrary.
*/
void search_inst(const struct inst *inst);
int obj_anchors(struct obj *obj, struct vec ***anchors);
int instantiate(void);
void obj_cleanup(void);
#endif /* !OBJ_H */