|
|
1.1 root 1: #include "draw_dag.h"
2:
3:
4: /*
5: Miscellaneous routines
6: */
7:
8: int longedge(register int v, register int w)
9: {
10: register int t = Level[v]-Level[w];
11: return (t > 1 || t < -1) ? 1 : 0;
12: }
13:
14: void deledges(int n_nodes, edge_t **edges)
15: {
16: for(int v = 0; v < n_nodes; ++v)
17: {
18: edge_t *e, *enext;
19: for(e = edges[v]; e; e = enext)
20: {
21: enext = e->next;
22: delete e;
23: }
24: }
25: delete edges;
26: }
27:
28: void panic(char *s)
29: {
30: fprintf(stderr,"draw_dag: %s\n",s);
31: (void) abort();
32: }
33:
34: void * operator new(long nbytes)
35: {
36: if (!nbytes) return (void*)0;
37: char *rv = malloc(nbytes);
38: if(!rv)
39: panic("out of memory");
40: memset(rv,0,nbytes);
41: return (void*)rv;
42: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.