real norm = n, norm1[3], norm2[3], norm11[3], norm22[3];
real pi, pj;
real start = clock();
- FILE *fp;
+ FILE *fp = NULL;
if (Verbose){
fprintf(stderr,"saving timing vs antiband data to timing_greedy\n");
char buf[256];
char dflt[256];
Agsym_t *sym;
- Agsym_t *psym;
+ Agsym_t *psym = NULL;
double dist, oldmax;
double maxdist = 0.0; /* maximum "finite" distance */
int type;
#endif
{
- reg Dtlink_t *t, *r, *p;
+ reg Dtlink_t *t, *r = NULL, *p;
reg Void_t *k, *key;
reg uint hsh;
reg int lk, sz, ky;
reg Dtcompar_f cmpf;
reg Dtdisc_t* disc;
- reg Dtlink_t **s, **ends;
+ reg Dtlink_t **s = NULL, **ends;
UNFLATTEN(dt);
Dtlink_t *root, *t;
int cmp, lk, sz, ky;
Void_t *o, *k, *key;
- Dtlink_t *l, *r, *me, link;
+ Dtlink_t *l, *r, *me = NULL, link;
int n, minp, turn[DT_MINP];
Dtcompar_f cmpf;
Dtdisc_t* disc;
static void attrstmt(int tkind, char *macroname)
{
item *aptr;
- int kind;
+ int kind = 0;
Agsym_t* sym;
/* creating a macro def */
{
block_t *child;
double childAngle, childRadius, incidentAngle;
- double mindistAngle, rotateAngle, midAngle;
+ double mindistAngle, rotateAngle, midAngle = 0.0;
int midChild, cnt = 0;
double snRadius = stp->subtreeR; /* max subtree radius */
double firstAngle = stp->firstAngle;
char* id;
graph_t* root = job->gvc->g;
char* gid = GD_drawing(root)->id;
- long idnum;
- char* pfx;
+ long idnum = 0;
+ char* pfx = NULL;
char buf[64]; /* large enough for a decimal 64-bit int */
layerPagePrefix (job, xb);
int i, rv;
colorsegs_t* segs;
colorseg_t* s;
- char* endcolor;
+ char* endcolor = NULL;
double left;
int first; /* first segment with t > 0 */
boxf bb = GD_bb(g);
xdot* xd = (xdot*)GD_drawing(g)->xdots;
textfont_t tf, null_tf = {NULL,NULL,NULL,0.0,0,0};
- int fontflags;
+ int fontflags = 0;
if (!xd) return bb;
edge_t *e;
pointf ptf;
int dim3 = (GD_odim(g) >= 3);
- Agsym_t* bbsym;
- Agsym_t* lpsym;
- Agsym_t* lwsym;
- Agsym_t* lhsym;
+ Agsym_t* bbsym = NULL;
+ Agsym_t* lpsym = NULL;
+ Agsym_t* lwsym = NULL;
+ Agsym_t* lhsym = NULL;
gv_fixLocale (1);
e_arrows = s_arrows = 0;
object_t* objp;
xlabel_t* xlp;
Agsym_t* force;
- Agsym_t* edge_xlab_prior;
- Agsym_t* node_xlab_prior;
- Agsym_t* hd_edge_xlab_prior;
- Agsym_t* tl_edge_xlab_prior;
+ Agsym_t* edge_xlab_prior = NULL;
+ Agsym_t* node_xlab_prior = NULL;
+ Agsym_t* hd_edge_xlab_prior = NULL;
+ Agsym_t* tl_edge_xlab_prior = NULL;
int* priorities = NULL;
int et = EDGE_TYPE(gp);
xlabel_state xlabs;
static void reduceMaxWidth2(graph_t * g)
{
int i;
- int maxLayerIndex;
- double nextMaxWidth;
+ int maxLayerIndex = 0;
+ double nextMaxWidth = 0.0;
double w = 0;
double targetWidth;
int fst;
node_t *n;
Agedgeinfo_t fwdedgeai, fwdedgebi;
Agedgepair_t fwdedgea, fwdedgeb;
- edge_t *e, *e0, *e1, *ea, *eb, *le0, *le1, **edges;
- path *P;
+ edge_t *e, *e0, *e1, *ea, *eb, *le0, *le1, **edges = NULL;
+ path *P = NULL;
spline_info_t sd;
int et = EDGE_TYPE(g);
fwdedgea.out.base.data = (Agrec_t*)&fwdedgeai;
static void balanceNodes(graph_t * g, int r, node_t * v, node_t * w)
{
node_t *s; /* separator node */
- int sepIndex;
+ int sepIndex = 0;
int nullType; /* type of null nodes */
int cntDummy = 0, cntOri = 0;
int k = 0, m = 0, k1 = 0, m1 = 0, i = 0;
{
int c, v;
node_t *n;
- node_t* leader;
+ node_t* leader = NULL;
/* Do child clusters */
for (c = 1; c <= GD_n_cluster(g); c++)
register Extype_t** t;
register int n;
Extype_t v;
- Extype_t r;
+ Extype_t r = {0};
Extype_t i;
char* e;
Exnode_t tmp;
{
int b;
int n;
- int pc;
+ int pc = 0;
int po;
int t;
Extype_t
exzero(int type)
{
- Extype_t v;
+ Extype_t v = {0};
switch (type)
{
*/
int sfioWrite(Agraph_t * g, Sfio_t* fp, Agiodisc_t* dfltDisc)
{
- Agiodisc_t* saveio;
+ Agiodisc_t* saveio = NULL;
int rv;
if (g->clos->disc.io != dfltDisc) {
*/
char *colorx (Expr_t* ex, char* incolor, char* fmt, Sfio_t* fp)
{
- gvcolor_t color;
+ gvcolor_t color = {0};
color_type_t type;
int rc;
int alpha;
{
register Rect_t *r;
register int i, growth0, growth1, diff, biggestDiff;
- register int group, chosen, betterGroup;
+ register int group, chosen = 0, betterGroup = 0;
InitPVars(rtp);
PickSeeds(rtp);
{
register int i, j;
unsigned int waste, worst;
- int seed0, seed1;
+ int seed0 = 0, seed1 = 0;
unsigned int area[NODECARD + 1];
for (i = 0; i < NODECARD + 1; i++)
int i;
real tol = 0.001;
int k;
- real step0 = 0.1, start;
+ real step0 = 0.1, start = 0.0;
int maxit = 10;
int flag;
field_t *fld;
epsf_t *desc;
int isPoly;
- pointf* verts;
+ pointf* verts = NULL;
pointf vs[4];
pointf p;
pointf margin;
{
Site *newsite, *bot, *top, *temp, *p;
Site *v;
- Point newintstar;
+ Point newintstar = {0};
char pm;
Halfedge *lbnd, *rbnd, *llbnd, *rrbnd, *bisector;
Edge *e;
segment seg;
double fix, b1, b2;
int l1, l2;
- pointf bp1, bp2, prevbp; /* bend points */
+ pointf bp1, bp2, prevbp = {0.0,0.0}; /* bend points */
/* count no. of nodes in shortest path */
for (ptr = fst; ptr; ptr = N_DAD(ptr)) sz++;
#include <intset.h>
static char* bendToStr (bend b)
{
- char* s;
+ char* s = NULL;
switch (b) {
case B_NODE :
s = "B_NODE";
vertexchain_t *vp0, *vp1;
register int i;
double angle, temp;
- int tp, tq;
+ int tp = 0, tq = 0;
vp0 = &vert[v0];
vp1 = &vert[v1];
{
segment_t s;
int tu, tl, sk, tfirst, tlast;
- int tfirstr, tlastr, tfirstl, tlastl;
+ int tfirstr = 0, tlastr = 0, tfirstl = 0, tlastl = 0;
int i1, i2, t, tn;
pointf tpt;
int tritop = 0, tribot = 0, is_swapped;
char c;
int i, rk = 1;
double* ranks = N_NEW(maxrank+1, double);
- double xf = 0, delx, d;
+ double xf = 0.0, delx = 0.0, d;
if ((p = late_string(g, agfindgraphattr(g->root, "ranksep"), NULL))) {
while ((rk <= maxrank) && ((d = strtod (p, &endp)) > 0)) {