Move internationalization macros to one header

[geda-pcb/gde.git] / src / djopt.c

/* $Id$ */

/*
 *                            COPYRIGHT
 *
 *  PCB, interactive printed circuit board design
 *  Copyright (C) 2003 DJ Delorie
 *
 *  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.
 *
 *  This program 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 this program; if not, write to the Free Software
 *  Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 *
 *  Contact addresses for paper mail and Email:
 *  DJ Delorie, 334 North Road, Deerfield NH 03037-1110, USA
 *  dj@delorie.com
 *
 */

#ifdef HAVE_CONFIG_H
#include "config.h"
#endif

#include "global.h"

#include <memory.h>
#include <limits.h>


#include "data.h"
#include "create.h"
#include "remove.h"
#include "move.h"
#include "draw.h"
#include "undo.h"
#include "strflags.h"
#include "find.h"

#ifdef HAVE_LIBDMALLOC
#include <dmalloc.h>
#endif

RCSID ("$Id$");

#ifndef HAVE_RINT
#define rint(x)  (ceil((x) - 0.5))
#endif

#define dprintf if(0)printf

#define selected(x) TEST_FLAG (SELECTEDFLAG, (x))
#define autorouted(x) TEST_FLAG (AUTOFLAG, (x))

#define SB (PCB->Bloat+1)

/* must be 2^N-1 */
#define INC 7

#define O_HORIZ         0x10
#define O_VERT          0x20
#define LEFT            0x11
#define RIGHT           0x12
#define UP              0x24
#define DOWN            0x28
#define DIAGONAL        0xf0
#define ORIENT(x) ((x) & 0xf0)
#define DIRECT(x) ((x) & 0x0f)

/* Manhattan length of the longest "freckle" */
#define LONGEST_FRECKLE 2

struct line_s;

typedef struct corner_s
{
  int layer;
  struct corner_s *next;
  int x, y;
  int net;
  PinType *via;
  PadType *pad;
  PinType *pin;
  int miter;
  int n_lines;
  struct line_s **lines;
} corner_s;

typedef struct line_s
{
  int layer;
  struct line_s *next;
  corner_s *s, *e;
  LineType *line;
} line_s;

typedef struct rect_s
{
  int x1, y1, x2, y2;
} rect_s;

#define DELETE(q) (q)->layer = 0xdeadbeef
#define DELETED(q) ((q)->layer == 0xdeadbeef)

static corner_s *corners, *next_corner = 0;
static line_s *lines;

static int layer_groupings[MAX_LAYER];
static char layer_type[MAX_LAYER];
#define LT_COMPONENT 1
#define LT_SOLDER 2

static int autorouted_only = 1;

static const char djopt_sao_syntax[] = "OptAutoOnly()";

static const char djopt_sao_help[] =
  "Toggles the optimize-only-autorouted flag.";

/* %start-doc actions OptAutoOnly

The original purpose of the trace optimizer was to clean up the traces
created by the various autorouters that have been used with PCB.  When
a board has a mix of autorouted and carefully hand-routed traces, you
don't normally want the optimizer to move your hand-routed traces.
But, sometimes you do.  By default, the optimizer only optimizes
autorouted traces.  This action toggles that setting, so that you can
optimize hand-routed traces also.

%end-doc */

int
djopt_set_auto_only (int argc, char **argv, int x, int y)
{
  autorouted_only = autorouted_only ? 0 : 1;
  return 0;
}

static int
djopt_get_auto_only (int dummy)
{
  return autorouted_only;
}

HID_Flag djopt_flag_list[] = {
  {"optautoonly", djopt_get_auto_only, 0}
};

REGISTER_FLAGS (djopt_flag_list)
#define line_is_pad(l) ((l)->line == (LineType *)(l)->s->pad)
     static char *element_name_for (corner_s * c)
{
  int i, p;
  ElementType *e;

  for (i = 0; i < PCB->Data->ElementN; i++)
    {
      e = PCB->Data->Element + i;
      for (p = 0; p < e->PinN; p++)
        if (e->Pin + p == c->pin)
          return e->Name[1].TextString;
      for (p = 0; p < e->PadN; p++)
        if (e->Pad + p == c->pad)
          return e->Name[1].TextString;
    }
  return "unknown";
}

static char *
corner_name (corner_s * c)
{
  static char buf[4][100];
  static int bn = 0;
  char *bp;
  bn = (bn + 1) % 4;

  if (c->net == 0xf1eef1ee)
    {
      sprintf (buf[bn], "\033[31m[%p freed corner]\033[0m", (void *) c);
      return buf[bn];
    }

  sprintf (buf[bn], "\033[%dm[%p ",
           (c->pin || c->pad || c->via) ? 33 : 34, (void *) c);
  bp = buf[bn] + strlen (buf[bn]);

  if (c->pin)
    sprintf (bp, "pin %s:%s at %d,%d", element_name_for (c), c->pin->Number,
             c->x, c->y);
  else if (c->via)
    sprintf (bp, "via at %d,%d", c->x, c->y);
  else if (c->pad)
    {
      sprintf (bp, "pad %s:%s at %d,%d (%d,%d-%d,%d)",
               element_name_for (c), c->pad->Number, c->x, c->y,
               c->pad->Point1.X, c->pad->Point1.Y,
               c->pad->Point2.X, c->pad->Point2.Y);
    }
  else
    sprintf (bp, "at %d,%d", c->x, c->y);
  sprintf (bp + strlen (bp), " n%d l%d]\033[0m", c->n_lines, c->layer);
  return buf[bn];
}

static int solder_layer, component_layer;

static void
dj_abort (char *msg, ...)
{
  va_list a;
  va_start (a, msg);
  vprintf (msg, a);
  va_end (a);
  fflush (stdout);
  abort ();
}

#if 1
#define check(c,l)
#else
#define check(c,l) check2(__LINE__,c,l)
static void
check2 (int srcline, corner_s * c, line_s * l)
{
  int saw_c = 0, saw_l = 0;
  corner_s *cc;
  line_s *ll;
  int i;

  for (cc = corners; cc; cc = cc->next)
    {
      if (DELETED (cc))
        continue;
      if (cc == c)
        saw_c = 1;
      for (i = 0; i < cc->n_lines; i++)
        if (cc->lines[i]->s != cc && cc->lines[i]->e != cc)
          dj_abort ("check:%d: cc has line without backref\n", srcline);
      if (cc->via && (cc->x != cc->via->X || cc->y != cc->via->Y))
        dj_abort ("check:%d: via not at corner\n", srcline);
      if (cc->pin && (cc->x != cc->pin->X || cc->y != cc->pin->Y))
        dj_abort ("check:%d: pin not at corner\n", srcline);
    }
  if (c && !saw_c)
    dj_abort ("check:%d: corner not in corners list\n", srcline);
  for (ll = lines; ll; ll = ll->next)
    {
      if (DELETED (ll))
        continue;
      if (ll == l)
        saw_l = 1;
      for (i = 0; i < ll->s->n_lines; i++)
        if (ll->s->lines[i] == ll)
          break;
      if (i == ll->s->n_lines)
        dj_abort ("check:%d: ll->s has no backref\n", srcline);
      for (i = 0; i < ll->e->n_lines; i++)
        if (ll->e->lines[i] == ll)
          break;
      if (i == ll->e->n_lines)
        dj_abort ("check:%d: ll->e has no backref\n", srcline);
      if (!line_is_pad (ll)
          && (ll->s->x != ll->line->Point1.X
              || ll->s->y != ll->line->Point1.Y
              || ll->e->x != ll->line->Point2.X
              || ll->e->y != ll->line->Point2.Y))
        {
          printf ("line: %d,%d to %d,%d  pcbline: %d,%d to %d,%d\n",
                  ll->s->x, ll->s->y,
                  ll->e->x, ll->e->y,
                  ll->line->Point1.X,
                  ll->line->Point1.Y, ll->line->Point2.X, ll->line->Point2.Y);
          dj_abort ("check:%d: line doesn't match pcbline\n", srcline);
        }
    }
  if (l && !saw_l)
    dj_abort ("check:%d: line not in lines list\n", srcline);
}

#endif

#define SWAP(a,b) { a^=b; b^=a; a^=b; }

static int
gridsnap (int n)
{
  if (n <= 0)
    return 0;
  return n - n % (int) (Settings.Grid);
}

/* Avoid commonly used names. */

static int
djabs (int x)
{
  return x > 0 ? x : -x;
}

static int
djmax (int x, int y)
{
  return x > y ? x : y;
}

static int
djmin (int x, int y)
{
  return x < y ? x : y;
}

/* 
 * Find distance between 2 points.  We use floating point math here
 * because we can fairly easily overflow a 32 bit integer here.  In
 * fact it only takes 0.46" to do so.
 */
static int
dist (int x1, int y1, int x2, int y2)
{
  double dx1, dy1, dx2, dy2, d;

  dx1 = (double) x1;
  dy1 = (double) y1;
  dx2 = (double) x2;
  dy2 = (double) y2;

  d = sqrt ((dx1 - dx2) * (dx1 - dx2) + (dy1 - dy2) * (dy1 - dy2));
  d = rint (d);

  return (int) d;
}

static int
line_length (line_s * l)
{
  if (l->s->x == l->e->x)
    return djabs (l->s->y - l->e->y);
  if (l->s->y == l->e->y)
    return djabs (l->s->x - l->e->x);
  return dist (l->s->x, l->s->y, l->e->x, l->e->y);
}

static int
dist_ltp2 (int dx, int y, int y1, int y2)
{
  if (y1 > y2)
    SWAP (y1, y2);
  if (y < y1)
    return dist (dx, y, 0, y1);
  if (y > y2)
    return dist (dx, y, 0, y2);
  return djabs (dx);
}

int
sqr (int a)
{
  return a * a;
}

static int
intersecting_layers (int l1, int l2)
{
  if (l1 == -1 || l2 == -1)
    return 1;
  if (l1 == l2)
    return 1;
  if (layer_groupings[l1] == layer_groupings[l2])
    return 1;
  return 0;
}

static int
dist_line_to_point (line_s * l, corner_s * c)
{
  double len, r, d;
  /* We can do this quickly if l is vertical or horizontal.  */
  if (l->s->x == l->e->x)
    return dist_ltp2 (l->s->x - c->x, c->y, l->s->y, l->e->y);
  if (l->s->y == l->e->y)
    return dist_ltp2 (l->s->y - c->y, c->x, l->s->x, l->e->x);

  /* Do it the hard way.  See comments for IsPointOnLine() in search.c */
  len = sqrt (sqr (l->s->x - l->e->x) + sqr (l->s->y - l->e->y));
  if (len == 0)
    return dist (l->s->x, l->s->y, c->x, c->y);
  r =
    (l->s->y - c->y) * (l->s->y - l->e->y) + (l->s->x - c->x) * (l->s->x -
                                                                 l->e->x);
  r /= len * len;
  if (r < 0)
    return dist (l->s->x, l->s->y, c->x, c->y);
  if (r > 1)
    return dist (l->e->x, l->e->y, c->x, c->y);
  d =
    (l->e->y - l->s->y) * (c->x * l->s->x) + (l->e->x - l->s->x) * (c->y -
                                                                    l->s->y);
  return (int) (d / len);
}

static int
line_orient (line_s * l, corner_s * c)
{
  int x1, y1, x2, y2;
  if (c == l->s)
    {
      x1 = l->s->x;
      y1 = l->s->y;
      x2 = l->e->x;
      y2 = l->e->y;
    }
  else
    {
      x1 = l->e->x;
      y1 = l->e->y;
      x2 = l->s->x;
      y2 = l->s->y;
    }
  if (x1 == x2)
    {
      if (y1 < y2)
        return DOWN;
      return UP;
    }
  else if (y1 == y2)
    {
      if (x1 < x2)
        return RIGHT;
      return LEFT;
    }
  return DIAGONAL;
}

#if 0
/* Not used */
static corner_s *
common_corner (line_s * l1, line_s * l2)
{
  if (l1->s == l2->s || l1->s == l2->e)
    return l1->s;
  if (l1->e == l2->s || l1->e == l2->e)
    return l1->e;
  dj_abort ("common_corner: no common corner found\n");
  return NULL;
}
#endif

static corner_s *
other_corner (line_s * l, corner_s * c)
{
  if (l->s == c)
    return l->e;
  if (l->e == c)
    return l->s;
  dj_abort ("other_corner: neither corner passed\n");
  return NULL;
}

static corner_s *
find_corner_if (int x, int y, int l)
{
  corner_s *c;
  for (c = corners; c; c = c->next)
    {
      if (DELETED (c))
        continue;
      if (c->x != x || c->y != y)
        continue;
      if (!(c->layer == -1 || intersecting_layers (c->layer, l)))
        continue;
      return c;
    }
  return 0;
}

static corner_s *
find_corner (int x, int y, int l)
{
  corner_s *c;
  for (c = corners; c; c = c->next)
    {
      if (DELETED (c))
        continue;
      if (c->x != x || c->y != y)
        continue;
      if (!(c->layer == -1 || intersecting_layers (c->layer, l)))
        continue;
      return c;
    }
  c = (corner_s *) malloc (sizeof (corner_s));
  c->next = corners;
  corners = c;
  c->x = x;
  c->y = y;
  c->net = 0;
  c->via = 0;
  c->pad = 0;
  c->pin = 0;
  c->layer = l;
  c->n_lines = 0;
  c->lines = (line_s **) malloc (INC * sizeof (line_s *));
  return c;
}

static void
add_line_to_corner (line_s * l, corner_s * c)
{
  int n;
  n = (c->n_lines + 1 + INC) & ~INC;
  c->lines = (line_s **) realloc (c->lines, n * sizeof (line_s *));
  c->lines[c->n_lines] = l;
  c->n_lines++;
  dprintf ("add_line_to_corner %d %d\n", c->x, c->y);
}

static LineType *
create_pcb_line (int layer, int x1, int y1, int x2, int y2,
                 int thick, int clear, FlagType flags)
{
  char *from, *to;
  LineType *nl;
  LayerType *lyr = LAYER_PTR (layer);

  from = (char *) lyr->Line;
  nl = CreateNewLineOnLayer (PCB->Data->Layer + layer,
                             x1, y1, x2, y2, thick, clear, flags);
  AddObjectToCreateUndoList (LINE_TYPE, lyr, nl, nl);

  to = (char *) lyr->Line;
  if (from != to)
    {
      line_s *lp;
      for (lp = lines; lp; lp = lp->next)
        {
          if (DELETED (lp))
            continue;
          if ((char *) (lp->line) >= from
              && (char *) (lp->line) <= from + lyr->LineN * sizeof (LineType))
            lp->line = (LineType *) ((char *) (lp->line) + (to - from));
        }
    }
  return nl;
}

static void
new_line (corner_s * s, corner_s * e, int layer, LineType * example)
{
  line_s *ls;

  if (layer >= max_layer)
    dj_abort ("layer %d\n", layer);

  if (example == NULL)
    dj_abort ("NULL example passed to new_line()\n", layer);

  if (s->x == e->x && s->y == e->y)
    return;

  ls = (line_s *) malloc (sizeof (line_s));
  ls->next = lines;
  lines = ls;
  ls->s = s;
  ls->e = e;
  ls->layer = layer;
#if 0
  if ((example->Point1.X == s->x && example->Point1.Y == s->y
       && example->Point2.X == e->x && example->Point2.Y == e->y)
      || (example->Point2.X == s->x && example->Point2.Y == s->y
          && example->Point1.X == e->x && example->Point1.Y == e->y))
    {
      ls->line = example;
    }
  else
#endif
    {
      LineType *nl;
      dprintf
        ("New line \033[35m%d,%d to %d,%d from l%d t%d c%d f%s\033[0m\n",
         s->x, s->y, e->x, e->y, layer, example->Thickness,
         example->Clearance, flags_to_string (example->Flags, LINE_TYPE));
      nl =
        create_pcb_line (layer, s->x, s->y, e->x, e->y, example->Thickness,
                         example->Clearance, example->Flags);

      if (!nl)
        dj_abort ("can't create new line!");
      ls->line = nl;
    }
  add_line_to_corner (ls, s);
  add_line_to_corner (ls, e);
  check (s, ls);
  check (e, ls);
}

#if 0
/* Not used */
static int
c_orth_to (corner_s * c, line_s * l, int o)
{
  int i, o2;
  int rv = 0;
  for (i = 0; i < c->n_lines; i++)
    {
      if (c->lines[i] == l)
        continue;
      o2 = line_orient (c->lines[i], c);
      if (ORIENT (o) == ORIENT (o2) || o2 == DIAGONAL)
        return 0;
      rv++;
    }
  return rv;
}
#endif

static line_s *
other_line (corner_s * c, line_s * l)
{
  int i;
  line_s *rv = 0;
  if (c->pin || c->pad || c->via)
    return 0;
  for (i = 0; i < c->n_lines; i++)
    {
      if (c->lines[i] == l)
        continue;
      if (rv)
        return 0;
      rv = c->lines[i];
    }
  return rv;
}

static void
empty_rect (rect_s * rect)
{
  rect->x1 = rect->y1 = INT_MAX;
  rect->x2 = rect->y2 = INT_MIN;
}

static void
add_point_to_rect (rect_s * rect, int x, int y, int w)
{
  if (rect->x1 > x - w)
    rect->x1 = x - w;
  if (rect->x2 < x + w)
    rect->x2 = x + w;
  if (rect->y1 > y - w)
    rect->y1 = y - w;
  if (rect->y2 < y + w)
    rect->y2 = y + w;
}

static void
add_line_to_rect (rect_s * rect, line_s * l)
{
  add_point_to_rect (rect, l->s->x, l->s->y, 0);
  add_point_to_rect (rect, l->e->x, l->e->y, 0);
}

static int
pin_in_rect (rect_s * r, int x, int y, int w)
{
  if (x < r->x1 && x + w < r->x1)
    return 0;
  if (x > r->x2 && x - w > r->x2)
    return 0;
  if (y < r->y1 && y + w < r->y1)
    return 0;
  if (y > r->y2 && y - w > r->y2)
    return 0;
  return 1;
}

static int
line_in_rect (rect_s * r, line_s * l)
{
  rect_s lr;
  empty_rect (&lr);
  add_point_to_rect (&lr, l->s->x, l->s->y, l->line->Thickness / 2);
  add_point_to_rect (&lr, l->e->x, l->e->y, l->line->Thickness / 2);
  dprintf ("line_in_rect %d,%d-%d,%d vs %d,%d-%d,%d\n",
           r->x1, r->y1, r->x2, r->y2, lr.x1, lr.y1, lr.x2, lr.y2);
  /* simple intersection of rectangles */
  if (lr.x1 < r->x1)
    lr.x1 = r->x1;
  if (lr.x2 > r->x2)
    lr.x2 = r->x2;
  if (lr.y1 < r->y1)
    lr.y1 = r->y1;
  if (lr.y2 > r->y2)
    lr.y2 = r->y2;
  if (lr.x1 < lr.x2 && lr.y1 < lr.y2)
    return 1;
  return 0;
}

static int
corner_radius (corner_s * c)
{
  int diam = 0;
  int i;
  if (c->pin)
    diam = djmax (c->pin->Thickness, diam);
  if (c->via)
    diam = djmax (c->via->Thickness, diam);
  for (i = 0; i < c->n_lines; i++)
    if (c->lines[i]->line)
      diam = djmax (c->lines[i]->line->Thickness, diam);
  diam = (diam + 1) / 2;
  return diam;
}

#if 0
/* Not used */
static int
corner_layer (corner_s * c)
{
  if (c->pin || c->via)
    return -1;
  if (c->n_lines < 1)
    return -1;
  return c->lines[0]->layer;
}
#endif

static void
add_corner_to_rect_if (rect_s * rect, corner_s * c, rect_s * e)
{
  int diam = corner_radius (c);
  if (!pin_in_rect (e, c->x, c->y, diam))
    return;
  if (c->x < e->x1 && c->y < e->y1 && dist (c->x, c->y, e->x1, e->y1) > diam)
    return;
  if (c->x > e->x2 && c->y < e->y1 && dist (c->x, c->y, e->x2, e->y1) > diam)
    return;
  if (c->x < e->x1 && c->y > e->y2 && dist (c->x, c->y, e->x1, e->y2) > diam)
    return;
  if (c->x > e->x2 && c->y > e->y2 && dist (c->x, c->y, e->x2, e->y2) > diam)
    return;

  /*printf("add point %d,%d diam %d\n", c->x, c->y, diam); */
  add_point_to_rect (rect, c->x, c->y, diam);
}

static void
remove_line (line_s * l)
{
  int i, j;
  line_s *l2;
  LineType *from = 0, *to = 0;
  LayerType *layer = &(PCB->Data->Layer[l->layer]);

  check (0, 0);

  if (l->line)
    {
      /* compensate for having line pointers rearranged */
      from = &(layer->Line[layer->LineN - 1]);
      to = l->line;
      RemoveLine (layer, l->line);
    }

  DELETE (l);
  for (l2 = lines; l2; l2 = l2->next)
    {
      if (DELETED (l2))
        continue;
      if (l2->line == from)
        l2->line = to;
    }

  for (i = 0, j = 0; i < l->s->n_lines; i++)
    if (l->s->lines[i] != l)
      l->s->lines[j++] = l->s->lines[i];
  l->s->n_lines = j;

  for (i = 0, j = 0; i < l->e->n_lines; i++)
    if (l->e->lines[i] != l)
      l->e->lines[j++] = l->e->lines[i];
  l->e->n_lines = j;
  check (0, 0);
}

static void
move_line_to_layer (line_s * l, int layer)
{
  line_s *l2;
  LayerType *ls, *ld;
  LineType *from = 0, *to = 0;
  LineType *oldbase = 0, *newbase = 0, *oldend;
  LineType *newline;

  ls = LAYER_PTR (l->layer);
  from = &(ls->Line[ls->LineN - 1]);
  to = l->line;

  ld = LAYER_PTR (layer);
  oldbase = ld->Line;
  oldend = oldbase + ld->LineN;

  newline = (LineType *) MoveObjectToLayer (LINE_TYPE, ls, l->line, 0, ld, 0);
  newbase = ld->Line;

  for (l2 = lines; l2; l2 = l2->next)
    {
      if (DELETED (l2))
        continue;
      if (l2->line == from)
        l2->line = to;
      if (l2->line >= oldbase && l2->line < oldend)
        l2->line += newbase - oldbase;
    }

  l->line = newline;
  l->layer = layer;
}

static void
remove_via_at (corner_s * c)
{
  corner_s *cc;
  PinType *from = PCB->Data->Via + PCB->Data->ViaN - 1;
  PinType *to = c->via;
  RemoveObject (VIA_TYPE, c->via, 0, 0);
  c->via = 0;
  for (cc = corners; cc; cc = cc->next)
    {
      if (DELETED (cc))
        continue;
      if (cc->via == from)
        cc->via = to;
    }
}

static void
remove_corner (corner_s * c2)
{
  corner_s *c;
  dprintf ("remove corner %s\n", corner_name (c2));
  if (corners == c2)
    corners = c2->next;
  for (c = corners; c; c = c->next)
    {
      if (DELETED (c))
        continue;
      if (c->next == c2)
        c->next = c2->next;
    }
  if (next_corner == c2)
    next_corner = c2->next;
  free (c2->lines);
  c2->lines = 0;
  DELETE (c2);
}

static void
merge_corners (corner_s * c1, corner_s * c2)
{
  int i;
  if (c1 == c2)
    abort ();
  dprintf ("merge corners %s %s\n", corner_name (c1), corner_name (c2));
  for (i = 0; i < c2->n_lines; i++)
    {
      add_line_to_corner (c2->lines[i], c1);
      if (c2->lines[i]->s == c2)
        c2->lines[i]->s = c1;
      if (c2->lines[i]->e == c2)
        c2->lines[i]->e = c1;
    }
  if (c1->via && c2->via)
    remove_via_at (c2);
  else if (c2->via)
    c1->via = c2->via;
  if (c2->pad)
    c1->pad = c2->pad;
  if (c2->pin)
    c1->pin = c2->pin;
  if (c2->layer != c1->layer)
    c1->layer = -1;

  remove_corner (c2);
}

static void
move_corner (corner_s * c, int x, int y)
{
  PinType *via;
  int i;
  corner_s *pad;

  check (c, 0);
  if (c->pad || c->pin)
    dj_abort ("move_corner: has pin or pad\n");
  dprintf ("move_corner %p from %d,%d to %d,%d\n", (void *) c, c->x, c->y, x,
           y);
  pad = find_corner_if (x, y, c->layer);
  c->x = x;
  c->y = y;
  via = c->via;
  if (via)
    {
      MoveObject (VIA_TYPE, via, via, via, x - via->X, y - via->Y);
      dprintf ("via move %d,%d to %d,%d\n", via->X, via->Y, x, y);
    }
  for (i = 0; i < c->n_lines; i++)
    {
      LineTypePtr tl = c->lines[i]->line;
      if (tl)
        {
          if (c->lines[i]->s == c)
            {
              MoveObject (LINEPOINT_TYPE, LAYER_PTR (c->lines[i]->layer), tl,
                          &tl->Point1, x - (tl->Point1.X),
                          y - (tl->Point1.Y));
            }
          else
            {
              MoveObject (LINEPOINT_TYPE, LAYER_PTR (c->lines[i]->layer), tl,
                          &tl->Point2, x - (tl->Point2.X),
                          y - (tl->Point2.Y));
            }
          dprintf ("Line %p moved to %d,%d %d,%d\n", (void *) tl,
                   tl->Point1.X, tl->Point1.Y, tl->Point2.X, tl->Point2.Y);
        }
    }
  if (pad && pad != c)
    merge_corners (c, pad);
  else
    for (i = 0; i < c->n_lines; i++)
      {
        if (c->lines[i]->s->x == c->lines[i]->e->x
            && c->lines[i]->s->y == c->lines[i]->e->y)
          {
            corner_s *c2 = other_corner (c->lines[i], c);
            dprintf ("move_corner: removing line %d,%d %d,%d %p %p\n",
                     c->x, c->y, c2->x, c2->y, (void *) c, (void *) c2);

            remove_line (c->lines[i]);
            if (c != c2)
              merge_corners (c, c2);
            check (c, 0);
            i--;
            break;
          }
      }
  gui->progress (0, 0, 0);
  check (c, 0);
}

static int
any_line_selected ()
{
  line_s *l;
  for (l = lines; l; l = l->next)
    {
      if (DELETED (l))
        continue;
      if (l->line && selected (l->line))
        return 1;
    }
  return 0;
}

static int
trim_step (int s, int l1, int l2)
{
  dprintf ("trim %d %d %d\n", s, l1, l2);
  if (s > l1)
    s = l1;
  if (s > l2)
    s = l2;
  if (s != l1 && s != l2)
    s = gridsnap (s);
  return s;
}

static int canonicalize_line (line_s * l);

static int
split_line (line_s * l, corner_s * c)
{
  int i;
  LayerType *layer;
  LineType *pcbline;
  line_s *ls;

  if (!intersecting_layers (l->layer, c->layer))
    return 0;
  if (line_is_pad (l))
    return 0;
  if (c->pad)
    {
      dprintf ("split on pad!\n");
      if (l->s->pad == c->pad || l->e->pad == c->pad)
        return 0;
      dprintf ("splitting...\n");
    }

  check (c, l);
  layer = PCB->Data->Layer + l->layer;
  pcbline = create_pcb_line (l->layer,
                             c->x, c->y, l->e->x, l->e->y,
                             l->line->Thickness, l->line->Clearance,
                             l->line->Flags);
  if (pcbline == 0)
    return 0;                   /* already a line there */

  check (c, l);

  dprintf ("split line from %d,%d to %d,%d at %d,%d\n",
           l->s->x, l->s->y, l->e->x, l->e->y, c->x, c->y);
  ls = (line_s *) malloc (sizeof (line_s));

  ls->next = lines;
  lines = ls;
  ls->s = c;
  ls->e = l->e;
  ls->line = pcbline;
  ls->layer = l->layer;
  for (i = 0; i < l->e->n_lines; i++)
    if (l->e->lines[i] == l)
      l->e->lines[i] = ls;
  l->e = c;
  add_line_to_corner (l, c);
  add_line_to_corner (ls, c);

  MoveObject (LINEPOINT_TYPE, LAYER_PTR (l->layer), l->line, &l->line->Point2,
              c->x - (l->line->Point2.X), c->y - (l->line->Point2.Y));

  return 1;
}

static int
canonicalize_line (line_s * l)
{
  /* This could be faster */
  corner_s *c;
  if (l->s->x == l->e->x)
    {
      int y1 = l->s->y;
      int y2 = l->e->y;
      int x1 = l->s->x - l->line->Thickness / 2;
      int x2 = l->s->x + l->line->Thickness / 2;
      if (y1 > y2)
        {
          int t = y1;
          y1 = y2;
          y2 = t;
        }
      for (c = corners; c; c = c->next)
        {
          if (DELETED (c))
            continue;
          if ((y1 < c->y && c->y < y2)
              && intersecting_layers (l->layer, c->layer))
            {
              if (c->x != l->s->x
                  && c->x < x2 && c->x > x1 && !(c->pad || c->pin))
                {
                  move_corner (c, l->s->x, c->y);
                }
              if (c->x == l->s->x)
                {
                  /* FIXME: if the line is split, we have to re-canonicalize
                     both segments. */
                  return split_line (l, c);
                }
            }
        }
    }
  else if (l->s->y == l->e->y)
    {
      int x1 = l->s->x;
      int x2 = l->e->x;
      int y1 = l->s->y - l->line->Thickness / 2;
      int y2 = l->s->y + l->line->Thickness / 2;
      if (x1 > x2)
        {
          int t = x1;
          x1 = x2;
          x2 = t;
        }
      for (c = corners; c; c = c->next)
        {
          if (DELETED (c))
            continue;
          if ((x1 < c->x && c->x < x2)
              && intersecting_layers (l->layer, c->layer))
            {
              if (c->y != l->s->y
                  && c->y < y2 && c->y > y1 && !(c->pad || c->pin))
                {
                  move_corner (c, c->x, l->s->y);
                }
              if (c->y == l->s->y)
                {
                  /* FIXME: Likewise.  */
                  return split_line (l, c);
                }
            }
        }
    }
  else
    {
      /* diagonal lines.  Let's try to split them at pins/vias
         anyway.  */
      int x1 = l->s->x;
      int x2 = l->e->x;
      int y1 = l->s->y;
      int y2 = l->e->y;
      if (x1 > x2)
        {
          int t = x1;
          x1 = x2;
          x2 = t;
        }
      if (y1 > y2)
        {
          int t = y1;
          y1 = y2;
          y2 = t;
        }
      for (c = corners; c; c = c->next)
        {
          if (DELETED (c))
            continue;
          if (!c->via && !c->pin)
            continue;
          if ((x1 < c->x && c->x < x2)
              && (y1 < c->y && c->y < y2)
              && intersecting_layers (l->layer, c->layer))
            {
              int th = c->pin ? c->pin->Thickness : c->via->Thickness;
              th /= 2;
              if (dist (l->s->x, l->s->y, c->x, c->y) > th
                  && dist (l->e->x, l->e->y, c->x, c->y) > th
                  && PinLineIntersect (c->pin ? c->pin : c->via, l->line))
                {
                  return split_line (l, c);
                }
            }
        }
    }
  return 0;
}

/* Make sure all vias are at line end points */
static int
canonicalize_lines ()
{
  int changes = 0;
  int count;
  line_s *l;
  while (1)
    {
      count = 0;
      for (l = lines; l; l = l->next)
        {
          if (DELETED (l))
            continue;
          count += canonicalize_line (l);
        }
      changes += count;
      if (count == 0)
        break;
    }
  return changes;
}

static int
simple_optimize_corner (corner_s * c)
{
  int i;
  int rv = 0;

  check (c, 0);
  if (c->via)
    {
      /* see if no via is needed */
      if (selected (c->via))
        dprintf ("via check: line[0] layer %d at %d,%d nl %d\n",
                 c->lines[0]->layer, c->x, c->y, c->n_lines);
      /* We can't delete vias that connect to power planes, or vias
         that aren't tented (assume they're test points).  */
      if (!TEST_ANY_THERMS (c->via)
          && c->via->Mask == 0)
        {
          for (i = 1; i < c->n_lines; i++)
            {
              if (selected (c->via))
                dprintf ("           line[%d] layer %d %d,%d to %d,%d\n",
                         i, c->lines[i]->layer,
                         c->lines[i]->s->x, c->lines[i]->s->y,
                         c->lines[i]->e->x, c->lines[i]->e->y);
              if (c->lines[i]->layer != c->lines[0]->layer)
                break;
            }
          if (i == c->n_lines)
            {
              if (selected (c->via))
                dprintf ("           remove it\n");
              remove_via_at (c);
              rv++;
            }
        }
    }

  check (c, 0);
  if (c->n_lines == 2 && !c->via)
    {
      /* see if it is an unneeded corner */
      int o = line_orient (c->lines[0], c);
      corner_s *c2 = other_corner (c->lines[1], c);
      corner_s *c0 = other_corner (c->lines[0], c);
      if (o == line_orient (c->lines[1], c2) && o != DIAGONAL)
        {
          dprintf ("straight %d,%d to %d,%d to %d,%d\n",
                   c0->x, c0->y, c->x, c->y, c2->x, c2->y);
          if (selected (c->lines[0]->line))
            SET_FLAG (SELECTEDFLAG, c->lines[1]->line);
          if (selected (c->lines[1]->line))
            SET_FLAG (SELECTEDFLAG, c->lines[0]->line);
          move_corner (c, c2->x, c2->y);
        }
    }
  check (c, 0);
  if (c->n_lines == 1 && !c->via)
    {
      corner_s *c0 = other_corner (c->lines[0], c);
      if (abs(c->x - c0->x) + abs(c->y - c0->y) <= LONGEST_FRECKLE)
        {
          /*
           * Remove this line, as it is a "freckle".  A freckle is an extremely
           * short line (around 0.01 thou) that is unconnected at one end.
           * Freckles are almost insignificantly small, but are annoying as
           * they prevent the mitering optimiser from working.
           * Freckles sometimes arise because of a bug in the autorouter that
           * causes it to create small overshoots (typically 0.01 thou) at the
           * intersections of vertical and horizontal lines. These overshoots
           * are converted to freckles as a side effect of canonicalize_line().
           * Note that canonicalize_line() is not at fault, the bug is in the
           * autorouter creating overshoots.
           * The autorouter bug arose some time between the 20080202 and 20091103
           * releases.
           * This code is probably worth keeping even when the autorouter bug is
           * fixed, as "freckles" could conceivably arise in other ways.
           */
          dprintf ("freckle %d,%d to %d,%d\n",
                   c->x, c->y, c0->x, c0->y);
          move_corner (c, c0->x, c0->y);
        }
    }
  check (c, 0);
  return rv;
}

/* We always run these */
static int
simple_optimizations ()
{
  corner_s *c;
  int rv = 0;

  /* Look for corners that aren't */
  for (c = corners; c; c = c->next)
    {
      if (DELETED (c))
        continue;
      if (c->pad || c->pin)
        continue;
      rv += simple_optimize_corner (c);
    }
  return rv;
}

static int
is_hole (corner_s * c)
{
  return c->pin || c->pad || c->via;
}

static int
orthopull_1 (corner_s * c, int fdir, int rdir, int any_sel)
{
  static corner_s **cs = 0;
  static int cm = 0;
  static line_s **ls = 0;
  static int lm = 0;
  int i, li, ln, cn, snap;
  line_s *l = 0;
  corner_s *c2, *cb;
  int adir = 0, sdir = 0, pull;
  int saw_sel = 0, saw_auto = 0;
  int max, len = 0, r1 = 0, r2;
  rect_s rr;
  int edir = 0, done;

  if (cs == 0)
    {
      cs = (corner_s **) malloc (10 * sizeof (corner_s));
      cm = 10;
      ls = (line_s **) malloc (10 * sizeof (line_s));
      lm = 10;
    }

  for (i = 0; i < c->n_lines; i++)
    {
      int o = line_orient (c->lines[i], c);
      if (o == rdir)
        return 0;
    }

  switch (fdir)
    {
    case RIGHT:
      adir = DOWN;
      sdir = UP;
      break;
    case DOWN:
      adir = RIGHT;
      sdir = LEFT;
      break;
    default:
      dj_abort ("fdir not right or down\n");
    }

  c2 = c;
  cn = 0;
  ln = 0;
  pull = 0;
  while (c2)
    {
      if (c2->pad || c2->pin || c2->n_lines < 2)
        return 0;
      if (cn >= cm)
        {
          cm = cn + 10;
          cs = (corner_s **) realloc (cs, cm * sizeof (corner_s));
        }
      cs[cn++] = c2;
      r2 = corner_radius (c2);
      if (r1 < r2)
        r1 = r2;
      l = 0;
      for (i = 0; i < c2->n_lines; i++)
        {
          int o = line_orient (c2->lines[i], c2);
          if (o == DIAGONAL)
            return 0;
          if (o == fdir)
            {
              if (l)
                return 0;       /* we don't support overlapping lines yet */
              l = c2->lines[i];
            }
          if (o == rdir && c2->lines[i] != ls[ln - 1])
            return 0;           /* likewise */
          if (o == adir)
            pull++;
          if (o == sdir)
            pull--;
        }
      if (!l)
        break;
      if (selected (l->line))
        saw_sel = 1;
      if (autorouted (l->line))
        saw_auto = 1;
      if (ln >= lm)
        {
          lm = ln + 10;
          ls = (line_s **) realloc (ls, lm * sizeof (line_s));
        }
      ls[ln++] = l;
      c2 = other_corner (l, c2);
    }
  if (cn < 2 || pull == 0)
    return 0;
  if (any_sel && !saw_sel)
    return 0;
  if (!any_sel && autorouted_only && !saw_auto)
    return 0;

  /* Ok, now look for other blockages. */

  empty_rect (&rr);
  add_point_to_rect (&rr, c->x, c->y, corner_radius (c));
  add_point_to_rect (&rr, c2->x, c2->y, corner_radius (c2));

  if (fdir == RIGHT && pull < 0)
    edir = UP;
  else if (fdir == RIGHT && pull > 0)
    edir = DOWN;
  else if (fdir == DOWN && pull < 0)
    edir = LEFT;
  else if (fdir == DOWN && pull > 0)
    edir = RIGHT;

  max = -1;
  for (i = 0; i < cn; i++)
    for (li = 0; li < cs[i]->n_lines; li++)
      {
        if (line_orient (cs[i]->lines[li], cs[i]) != edir)
          continue;
        len = line_length (cs[i]->lines[li]);
        if (max > len || max == -1)
          max = len;
      }
  dprintf ("c %s %4d %4d  cn %d pull %3d  max %4d\n",
           fdir == RIGHT ? "right" : "down ", c->x, c->y, cn, pull, max);

  switch (edir)
    {
    case UP:
      rr.y1 = c->y - r1 - max;
      break;
    case DOWN:
      rr.y2 = c->y + r1 + max;
      break;
    case LEFT:
      rr.x1 = c->x - r1 - max;
      break;
    case RIGHT:
      rr.x2 = c->x + r1 + max;
      break;
    }
  rr.x1 -= SB + 1;
  rr.x2 += SB + 1;
  rr.y1 -= SB + 1;
  rr.y2 += SB + 1;

  snap = 0;
  for (cb = corners; cb; cb = cb->next)
    {
      int sep;
      if (DELETED (cb))
        continue;
      r1 = corner_radius (cb);
      if (cb->net == c->net && !cb->pad)
        continue;
      if (!pin_in_rect (&rr, cb->x, cb->y, r1))
        continue;
      switch (edir)
        {
#define ECHK(X,Y,LT) \
          for (i=0; i<cn; i++) \
            { \
              if (!intersecting_layers(cs[i]->layer, cb->layer)) \
                continue; \
              r2 = corner_radius(cs[i]); \
              if (cb->X + r1 <= cs[i]->X - r2 - SB - 1) \
                continue; \
              if (cb->X - r1 >= cs[i]->X + r2 + SB + 1) \
                continue; \
              if (cb->Y LT cs[i]->Y) \
                continue; \
              sep = djabs(cb->Y - cs[i]->Y) - r1 - r2 - SB - 1; \
              if (max > sep) \
                { max = sep; snap = 1; }\
            } \
          for (i=0; i<ln; i++) \
            { \
              if (!intersecting_layers(ls[i]->layer, cb->layer)) \
                continue; \
              if (cb->X <= cs[i]->X || cb->X >= cs[i+1]->X) \
                continue; \
              sep = (djabs(cb->Y - cs[i]->Y) - ls[i]->line->Thickness/2 \
                     - r1 - SB - 1); \
              if (max > sep) \
                { max = sep; snap = 1; }\
            }
        case UP:
          ECHK (x, y, >=);
          break;
        case DOWN:
          ECHK (x, y, <=);
          break;
        case LEFT:
          ECHK (y, x, >=);
          break;
        case RIGHT:
          ECHK (y, x, <=);
          break;
        }
    }

  /* We must now check every line segment against our corners.  */
  for (l = lines; l; l = l->next)
    {
      int o, x1, x2, y1, y2;
      if (DELETED (l))
        continue;
      dprintf ("check line %d,%d to %d,%d\n", l->s->x, l->s->y, l->e->x,
               l->e->y);
      if (l->s->net == c->net)
        {
          dprintf ("  same net\n");
          continue;
        }
      o = line_orient (l, 0);
      /* We don't need to check perpendicular lines, because their
         corners already take care of it.  */
      if ((fdir == RIGHT && (o == UP || o == DOWN))
          || (fdir == DOWN && (o == RIGHT || o == LEFT)))
        {
          dprintf ("  perpendicular\n");
          continue;
        }

      /* Choose so that x1,y1 is closest to corner C */
      if ((fdir == RIGHT && l->s->x < l->e->x)
          || (fdir == DOWN && l->s->y < l->e->y))
        {
          x1 = l->s->x;
          y1 = l->s->y;
          x2 = l->e->x;
          y2 = l->e->y;
        }
      else
        {
          x1 = l->e->x;
          y1 = l->e->y;
          x2 = l->s->x;
          y2 = l->s->y;
        }

      /* Eliminate all lines outside our range */
      if ((fdir == RIGHT && (x2 < c->x || x1 > c2->x))
          || (fdir == DOWN && (y2 < c->y || y1 > c2->y)))
        {
          dprintf ("  outside our range\n");
          continue;
        }

      /* Eliminate all lines on the wrong side of us */
      if ((edir == UP && y1 > c->y && y2 > c->y)
          || (edir == DOWN && y1 < c->y && y2 < c->y)
          || (edir == LEFT && x1 > c->x && x2 > c->x)
          || (edir == RIGHT && x1 < c->x && x2 < c->x))
        {
          dprintf ("  wrong side\n");
          continue;
        }

      /* For now, cheat on diagonals */
      switch (edir)
        {
        case RIGHT:
          if (x1 > x2)
            x1 = x2;
          break;
        case LEFT:
          if (x1 < x2)
            x1 = x2;
          break;
        case DOWN:
          if (y1 > y2)
            y1 = y2;
          break;
        case UP:
          if (y1 < y2)
            y1 = y2;
          break;
        }

      /* Ok, now see how far we can get for each of our corners. */
      for (i = 0; i < cn; i++)
        {
          int r = l->line->Thickness + SB + corner_radius (cs[i]) + 1;
          int len = 0;
          if ((fdir == RIGHT && (x2 < cs[i]->x || x1 > cs[i]->x))
              || (fdir == DOWN && (y2 < cs[i]->y || y1 > cs[i]->y)))
            continue;
          if (!intersecting_layers (cs[i]->layer, l->layer))
            continue;
          switch (edir)
            {
            case RIGHT:
              len = x1 - c->x;
              break;
            case LEFT:
              len = c->x - x1;
              break;
            case DOWN:
              len = y1 - c->y;
              break;
            case UP:
              len = c->y - y1;
              break;
            }
          len -= r;
          dprintf ("  len is %d vs corner at %d,%d\n", len, cs[i]->x,
                   cs[i]->y);
          if (len <= 0)
            return 0;
          if (max > len)
            max = len;
        }

    }

  /* We must make sure that if a segment isn't being completely
     removed, that any vias and/or pads don't overlap.  */
  done = 0;
  while (!done)
    {
      done = 1;
      for (i = 0; i < cn; i++)
        for (li = 0; li < cs[i]->n_lines; li++)
          {
            line_s *l = cs[i]->lines[li];
            corner_s *oc = other_corner (l, cs[i]);
            if (line_orient (l, cs[i]) != edir)
              continue;
            len = line_length (l);
            if (!oc->pad || !cs[i]->via)
              {
                if (!is_hole (l->s) || !is_hole (l->e))
                  continue;
                if (len == max)
                  continue;
              }
            len -= corner_radius (l->s);
            len -= corner_radius (l->e);
            len -= SB + 1;
            if (max > len)
              {
                max = len;
                done = 0;
              }
          }
    }

  if (max <= 0)
    return 0;
  switch (edir)
    {
    case UP:
      len = c->y - max;
      break;
    case DOWN:
      len = c->y + max;
      break;
    case LEFT:
      len = c->x - max;
      break;
    case RIGHT:
      len = c->x + max;
      break;
    }
  if (snap && max > Settings.Grid)
    {
      if (pull < 0)
        len += Settings.Grid - 1;
      len -= len % (int) (Settings.Grid);
    }
  if ((fdir == RIGHT && len == cs[0]->y) || (fdir == DOWN && len == cs[0]->x))
    return 0;
  for (i = 0; i < cn; i++)
    {
      if (fdir == RIGHT)
        {
          max = len - cs[i]->y;
          move_corner (cs[i], cs[i]->x, len);
        }
      else
        {
          max = len - cs[i]->x;
          move_corner (cs[i], len, cs[i]->y);
        }
    }
  return max * pull;
}

static int
orthopull ()
{
  /* Look for straight runs which could be moved to reduce total trace
     length.  */
  int any_sel = any_line_selected ();
  corner_s *c;
  int rv = 0;

  for (c = corners; c;)
    {
      if (DELETED (c))
        continue;
      if (c->pin || c->pad)
        {
          c = c->next;
          continue;
        }
      next_corner = c;
      rv += orthopull_1 (c, RIGHT, LEFT, any_sel);
      if (c != next_corner)
        {
          c = next_corner;
          continue;
        }
      rv += orthopull_1 (c, DOWN, UP, any_sel);
      if (c != next_corner)
        {
          c = next_corner;
          continue;
        }
      c = c->next;
    }
  if (rv)
    printf ("orthopull: %d mils saved\n", rv / 100);
  return rv;
}

static int
debumpify ()
{
  /* Look for "U" shaped traces we can shorten (or eliminate) */
  int rv = 0;
  int any_selected = any_line_selected ();
  line_s *l, *l1, *l2;
  corner_s *c, *c1, *c2;
  rect_s rr, rp;
  int o, o1, o2, step, w;
  for (l = lines; l; l = l->next)
    {
      if (DELETED (l))
        continue;
      if (!l->line)
        continue;
      if (any_selected && !selected (l->line))
        continue;
      if (!any_selected && autorouted_only && !autorouted (l->line))
        continue;
      if (l->s->pin || l->s->pad || l->e->pin || l->e->pad)
        continue;
      o = line_orient (l, 0);
      if (o == DIAGONAL)
        continue;
      l1 = other_line (l->s, l);
      if (!l1)
        continue;
      o1 = line_orient (l1, l->s);
      l2 = other_line (l->e, l);
      if (!l2)
        continue;
      o2 = line_orient (l2, l->e);
      if (ORIENT (o) == ORIENT (o1) || o1 != o2 || o1 == DIAGONAL)
        continue;

      dprintf ("\nline: %d,%d to %d,%d\n", l->s->x, l->s->y, l->e->x,
               l->e->y);
      w = l->line->Thickness / 2 + SB + 1;
      empty_rect (&rr);
      add_line_to_rect (&rr, l1);
      add_line_to_rect (&rr, l2);
      if (rr.x1 != l->s->x && rr.x1 != l->e->x)
        rr.x1 -= w;
      if (rr.x2 != l->s->x && rr.x2 != l->e->x)
        rr.x2 += w;
      if (rr.y1 != l->s->y && rr.y1 != l->e->y)
        rr.y1 -= w;
      if (rr.y2 != l->s->y && rr.y2 != l->e->y)
        rr.y2 += w;
      dprintf ("range: x %d..%d y %d..%d\n", rr.x1, rr.x2, rr.y1, rr.y2);

      c1 = other_corner (l1, l->s);
      c2 = other_corner (l2, l->e);

      empty_rect (&rp);
      for (c = corners; c; c = c->next)
        {
          if (DELETED (c))
            continue;
          if (c->net != l->s->net
              && intersecting_layers (c->layer, l->s->layer))
            add_corner_to_rect_if (&rp, c, &rr);
        }
      if (rp.x1 == INT_MAX)
        {
          rp.x1 = rr.x2;
          rp.x2 = rr.x1;
          rp.y1 = rr.y2;
          rp.y2 = rr.y1;
        }
      dprintf ("pin r: x %d..%d y %d..%d\n", rp.x1, rp.x2, rp.y1, rp.y2);

      switch (o1)
        {
        case LEFT:
          step = l->s->x - rp.x2 - w;
          step = gridsnap (step);
          if (step > l->s->x - c1->x)
            step = l->s->x - c1->x;
          if (step > l->s->x - c2->x)
            step = l->s->x - c2->x;
          if (step > 0)
            {
              dprintf ("left step %d at %d,%d\n", step, l->s->x, l->s->y);
              move_corner (l->s, l->s->x - step, l->s->y);
              move_corner (l->e, l->e->x - step, l->e->y);
              rv += step;
            }
          break;
        case RIGHT:
          step = rp.x1 - l->s->x - w;
          step = gridsnap (step);
          if (step > c1->x - l->s->x)
            step = c1->x - l->s->x;
          if (step > c2->x - l->s->x)
            step = c2->x - l->s->x;
          if (step > 0)
            {
              dprintf ("right step %d at %d,%d\n", step, l->s->x, l->s->y);
              move_corner (l->s, l->s->x + step, l->s->y);
              move_corner (l->e, l->e->x + step, l->e->y);
              rv += step;
            }
          break;
        case UP:
          if (rp.y2 == INT_MIN)
            rp.y2 = rr.y1;
          step = trim_step (l->s->y - rp.y2 - w,
                            l->s->y - c1->y, l->s->y - c2->y);
          if (step > 0)
            {
              dprintf ("up step %d at %d,%d\n", step, l->s->x, l->s->y);
              move_corner (l->s, l->s->x, l->s->y - step);
              move_corner (l->e, l->e->x, l->e->y - step);
              rv += step;
            }
          break;
        case DOWN:
          step = rp.y1 - l->s->y - w;
          step = gridsnap (step);
          if (step > c1->y - l->s->y)
            step = c1->y - l->s->y;
          if (step > c2->y - l->s->y)
            step = c2->y - l->s->y;
          if (step > 0)
            {
              dprintf ("down step %d at %d,%d\n", step, l->s->x, l->s->y);
              move_corner (l->s, l->s->x, l->s->y + step);
              move_corner (l->e, l->e->x, l->e->y + step);
              rv += step;
            }
          break;
        }
      check (0, l);
    }

  rv += simple_optimizations ();
  if (rv)
    printf ("debumpify: %d mils saved\n", rv / 50);
  return rv;
}

static int
simple_corner (corner_s * c)
{
  int o1, o2;
  if (c->pad || c->pin || c->via)
    return 0;
  if (c->n_lines != 2)
    return 0;
  o1 = line_orient (c->lines[0], c);
  o2 = line_orient (c->lines[1], c);
  if (ORIENT (o1) == ORIENT (o2))
    return 0;
  if (ORIENT (o1) == DIAGONAL || ORIENT (o2) == DIAGONAL)
    return 0;
  return 1;
}

static int
unjaggy_once ()
{
  /* Look for sequences of simple corners we can reduce. */
  int rv = 0;
  corner_s *c, *c0, *c1, *cc;
  int l, w, sel = any_line_selected ();
  int o0, o1, s0, s1;
  rect_s rr, rp;
  for (c = corners; c; c = c->next)
    {
      if (DELETED (c))
        continue;
      if (!simple_corner (c))
        continue;
      if (!c->lines[0]->line || !c->lines[1]->line)
        continue;
      if (sel && !(selected (c->lines[0]->line)
                   || selected (c->lines[1]->line)))
        continue;
      if (!sel && autorouted_only
          && !(autorouted (c->lines[0]->line)
               || autorouted (c->lines[1]->line)))
        continue;
      dprintf ("simple at %d,%d\n", c->x, c->y);

      c0 = other_corner (c->lines[0], c);
      o0 = line_orient (c->lines[0], c);
      s0 = simple_corner (c0);

      c1 = other_corner (c->lines[1], c);
      o1 = line_orient (c->lines[1], c);
      s1 = simple_corner (c1);

      if (!s0 && !s1)
        continue;
      dprintf ("simples at %d,%d\n", c->x, c->y);

      w = 1;
      for (l = 0; l < c0->n_lines; l++)
        if (c0->lines[l] != c->lines[0]
            && c0->lines[l]->layer == c->lines[0]->layer)
          {
            int o = line_orient (c0->lines[l], c0);
            if (o == o1)
              w = 0;
          }
      for (l = 0; l < c1->n_lines; l++)
        if (c1->lines[l] != c->lines[0]
            && c1->lines[l]->layer == c->lines[0]->layer)
          {
            int o = line_orient (c1->lines[l], c1);
            if (o == o0)
              w = 0;
          }
      if (!w)
        continue;
      dprintf ("orient ok\n");

      w = c->lines[0]->line->Thickness / 2 + SB + 1;
      empty_rect (&rr);
      add_line_to_rect (&rr, c->lines[0]);
      add_line_to_rect (&rr, c->lines[1]);
      if (c->x != rr.x1)
        rr.x1 -= w;
      else
        rr.x2 += w;
      if (c->y != rr.y1)
        rr.y1 -= w;
      else
        rr.y2 += w;

      empty_rect (&rp);
      for (cc = corners; cc; cc = cc->next)
        {
          if (DELETED (cc))
            continue;
          if (cc->net != c->net && intersecting_layers (cc->layer, c->layer))
            add_corner_to_rect_if (&rp, cc, &rr);
        }
      dprintf ("rp x %d..%d  y %d..%d\n", rp.x1, rp.x2, rp.y1, rp.y2);
      if (rp.x1 <= rp.x2)       /* something triggered */
        continue;

      dprintf ("unjaggy at %d,%d layer %d\n", c->x, c->y, c->layer);
      if (c->x == c0->x)
        move_corner (c, c1->x, c0->y);
      else
        move_corner (c, c0->x, c1->y);
      rv++;
      check (c, 0);
    }
  rv += simple_optimizations ();
  check (c, 0);
  return rv;
}

static int
unjaggy ()
{
  int i, r = 0, j;
  for (i = 0; i < 100; i++)
    {
      j = unjaggy_once ();
      if (j == 0)
        break;
      r += j;
    }
  if (r)
    printf ("%d unjagg%s    \n", r, r == 1 ? "y" : "ies");
  return r;
}

static int
vianudge ()
{
  /* Look for vias with all lines leaving the same way, try to nudge
     via to eliminate one or more of them. */
  int rv = 0;
  corner_s *c, *c2, *c3;
  line_s *l;
  unsigned char directions[MAX_LAYER];
  unsigned char counts[MAX_LAYER];

  memset (directions, 0, sizeof (directions));
  memset (counts, 0, sizeof (counts));

  for (c = corners; c; c = c->next)
    {
      int o, i, vr, cr, oboth;
      int len = 0, saved = 0;

      if (DELETED (c))
        continue;

      if (!c->via)
        continue;

      memset (directions, 0, sizeof (directions));
      memset (counts, 0, sizeof (counts));

      for (i = 0; i < c->n_lines; i++)
        {
          o = line_orient (c->lines[i], c);
          counts[c->lines[i]->layer]++;
          directions[c->lines[i]->layer] |= o;
        }
      for (o = 0, i = 0; i < max_layer; i++)
        if (counts[i] == 1)
          {
            o = directions[i];
            break;
          }
      switch (o)
        {
        case LEFT:
        case RIGHT:
          oboth = LEFT | RIGHT;
          break;
        case UP:
        case DOWN:
          oboth = UP | DOWN;
          break;
        default:
          continue;
        }
      for (i = 0; i < max_layer; i++)
        if (counts[i] && directions[i] != o && directions[i] != oboth)
          goto vianudge_continue;

      c2 = 0;
      for (i = 0; i < c->n_lines; i++)
        {
          int ll = line_length (c->lines[i]);
          if (line_orient (c->lines[i], c) != o)
            {
              saved--;
              continue;
            }
          saved++;
          if (c2 == 0 || len > ll)
            {
              len = ll;
              c2 = other_corner (c->lines[i], c);
            }
        }
      if (c2->pad || c2->pin || c2->via)
        continue;

      /* Now look for clearance in the new position */
      vr = c->via->Thickness / 2 + SB + 1;
      for (c3 = corners; c3; c3 = c3->next)
        {
          if (DELETED (c3))
            continue;
          if ((c3->net != c->net && (c3->pin || c3->via)) || c3->pad)
            {
              cr = corner_radius (c3);
              if (dist (c2->x, c2->y, c3->x, c3->y) < vr + cr)
                goto vianudge_continue;
            }
        }
      for (l = lines; l; l = l->next)
        {
          if (DELETED (l))
            continue;
          if (l->s->net != c->net)
            {
              int ld = dist_line_to_point (l, c2);
              if (ld < l->line->Thickness / 2 + vr)
                goto vianudge_continue;
            }
        }

      /* at this point, we know we can move it */

      dprintf ("vianudge: nudging via at %d,%d by %d mils saving %d\n",
               c->x, c->y, len / 100, saved / 100);
      rv += len * saved;
      move_corner (c, c2->x, c2->y);

      check (c, 0);

    vianudge_continue:
      continue;
    }

  if (rv)
    printf ("vianudge: %d mils saved\n", rv / 100);
  return rv;
}

static int
viatrim ()
{
  /* Look for traces that can be moved to the other side of the board,
     to reduce the number of vias needed.  For now, we look for simple
     lines, not multi-segmented lines.  */
  line_s *l, *l2;
  int i, rv = 0, vrm = 0;
  int any_sel = any_line_selected ();

  for (l = lines; l; l = l->next)
    {
      rect_s r;
      int my_layer, other_layer;

      if (DELETED (l))
        continue;
      if (!l->s->via)
        continue;
      if (!l->e->via)
        continue;
      if (any_sel && !selected (l->line))
        continue;
      if (!any_sel && autorouted_only && !autorouted (l->line))
        continue;

      my_layer = l->layer;
      other_layer = -1;
      dprintf ("line %p on layer %d from %d,%d to %d,%d\n", (void *) l,
               l->layer, l->s->x, l->s->y, l->e->x, l->e->y);
      for (i = 0; i < l->s->n_lines; i++)
        if (l->s->lines[i] != l)
          {
            if (other_layer == -1)
              {
                other_layer = l->s->lines[i]->layer;
                dprintf ("noting other line %p on layer %d\n",
                         (void *) (l->s->lines[i]), my_layer);
              }
            else if (l->s->lines[i]->layer != other_layer)
              {
                dprintf ("saw other line %p on layer %d (not %d)\n",
                         (void *) (l->s->lines[i]), l->s->lines[i]->layer,
                         my_layer);
                other_layer = -1;
                goto viatrim_other_corner;
              }
          }
    viatrim_other_corner:
      if (other_layer == -1)
        for (i = 0; i < l->e->n_lines; i++)
          if (l->e->lines[i] != l)
            {
              if (other_layer == -1)
                {
                  other_layer = l->s->lines[i]->layer;
                  dprintf ("noting other line %p on layer %d\n",
                           (void *) (l->s->lines[i]), my_layer);
                }
              else if (l->e->lines[i]->layer != other_layer)
                {
                  dprintf ("saw end line on layer %d (not %d)\n",
                           l->e->lines[i]->layer, other_layer);
                  goto viatrim_continue;
                }
            }

      /* Now see if any other line intersects us.  We don't need to
         check corners, because they'd either be pins/vias and
         already conflict, or pads, which we'll check here anyway.  */
      empty_rect (&r);
      add_point_to_rect (&r, l->s->x, l->s->y, l->line->Thickness);
      add_point_to_rect (&r, l->e->x, l->e->y, l->line->Thickness);

      for (l2 = lines; l2; l2 = l2->next)
        {
          if (DELETED (l2))
            continue;
          if (l2->s->net != l->s->net && l2->layer == other_layer)
            {
              dprintf ("checking other line %d,%d to %d,%d\n", l2->s->x,
                       l2->s->y, l2->e->x, l2->e->y);
              if (line_in_rect (&r, l2))
                {
                  dprintf ("line from %d,%d to %d,%d in the way\n",
                           l2->s->x, l2->s->y, l2->e->x, l2->e->y);
                  goto viatrim_continue;
                }
            }
        }

      if (l->layer == other_layer)
        continue;
      move_line_to_layer (l, other_layer);
      rv++;

    viatrim_continue:
      continue;
    }
  vrm = simple_optimizations ();
  if (rv > 0)
    printf ("viatrim: %d traces moved, %d vias removed\n", rv, vrm);
  return rv + vrm;
}

static int
automagic ()
{
  int more = 1, oldmore = 0;
  int toomany = 100;
  while (more != oldmore && --toomany)
    {
      oldmore = more;
      more += debumpify ();
      more += unjaggy ();
      more += orthopull ();
      more += vianudge ();
      more += viatrim ();
    }
  return more - 1;
}

static int
miter ()
{
  corner_s *c;
  int done, progress;
  int sel = any_line_selected ();
  int saved = 0;

  for (c = corners; c; c = c->next)
    {
      if (DELETED (c))
        continue;
      c->miter = 0;
      if (c->n_lines == 2 && !c->via && !c->pin && !c->via)
        {
          int o1 = line_orient (c->lines[0], c);
          int o2 = line_orient (c->lines[1], c);
          if (ORIENT (o1) != ORIENT (o2)
              && o1 != DIAGONAL && o2 != DIAGONAL
              && c->lines[0]->line->Thickness == c->lines[1]->line->Thickness)
            c->miter = -1;
        }
    }

  done = 0;
  progress = 1;
  while (!done && progress)
    {
      done = 1;
      progress = 0;
      for (c = corners; c; c = c->next)
        {
          if (DELETED (c))
            continue;
          if (c->miter == -1)
            {
              int max = line_length (c->lines[0]);
              int len = line_length (c->lines[1]);
              int bloat;
              int ref, dist;
              corner_s *closest_corner = 0, *c2, *oc1, *oc2;
              int mx = 0, my = 0, x, y;
              int o1 = line_orient (c->lines[0], c);
              int o2 = line_orient (c->lines[1], c);

              if (c->pad || c->pin || c->via)
                {
                  c->miter = 0;
                  progress = 1;
                  continue;
                }

              oc1 = other_corner (c->lines[0], c);
              oc2 = other_corner (c->lines[1], c);
#if 0
              if (oc1->pad)
                oc1 = 0;
              if (oc2->pad)
                oc2 = 0;
#endif

              if ((sel && !(selected (c->lines[0]->line)
                            || selected (c->lines[1]->line)))
                  || (!sel && autorouted_only
                      && !(autorouted (c->lines[0]->line)
                           || autorouted (c->lines[1]->line))))
                {
                  c->miter = 0;
                  progress = 1;
                  continue;
                }

              if (max > len)
                max = len;
              switch (o1)
                {
                case LEFT:
                  mx = -1;
                  break;
                case RIGHT:
                  mx = 1;
                  break;
                case UP:
                  my = -1;
                  break;
                case DOWN:
                  my = 1;
                  break;
                }
              switch (o2)
                {
                case LEFT:
                  mx = -1;
                  break;
                case RIGHT:
                  mx = 1;
                  break;
                case UP:
                  my = -1;
                  break;
                case DOWN:
                  my = 1;
                  break;
                }
              ref = c->x * mx + c->y * my;
              dist = max;

              bloat = (c->lines[0]->line->Thickness / 2 + SB + 1) * 3 / 2;

              for (c2 = corners; c2; c2 = c2->next)
                {
                  if (DELETED (c2))
                    continue;
                  if (c2 != c && c2 != oc1 && c2 != oc2
                      && c->x * mx <= c2->x * mx
                      && c->y * my <= c2->y * my
                      && c->net != c2->net
                      && intersecting_layers (c->layer, c2->layer))
                    {
                      int cr = corner_radius (c2);
                      len = c2->x * mx + c2->y * my - ref - cr - bloat;
                      if (c->x != c2->x && c->y != c2->y)
                        len -= cr;
                      if (len < dist || (len == dist && c->miter != -1))
                        {
                          dist = len;
                          closest_corner = c2;
                        }
                    }
                }

              if (closest_corner && closest_corner->miter == -1)
                {
                  done = 0;
                  continue;
                }

#if 0
              if (dist < Settings.Grid)
                {
                  c->miter = 0;
                  progress = 1;
                  continue;
                }

              dist -= dist % Settings.Grid;
#endif
              if (dist <= 0)
                {
                  c->miter = 0;
                  progress = 1;
                  continue;
                }

              x = c->x;
              y = c->y;
              switch (o1)
                {
                case LEFT:
                  x -= dist;
                  break;
                case RIGHT:
                  x += dist;
                  break;
                case UP:
                  y -= dist;
                  break;
                case DOWN:
                  y += dist;
                  break;
                }
              c2 = find_corner (x, y, c->layer);
              if (c2 != other_corner (c->lines[0], c))
                split_line (c->lines[0], c2);
              x = c->x;
              y = c->y;
              switch (o2)
                {
                case LEFT:
                  x -= dist;
                  break;
                case RIGHT:
                  x += dist;
                  break;
                case UP:
                  y -= dist;
                  break;
                case DOWN:
                  y += dist;
                  break;
                }
              move_corner (c, x, y);
              c->miter = 0;
              c2->miter = 0;
              progress = 1;
              saved++;
            }
        }
    }
  return saved;
}

static void
classify_corner (corner_s * c, int this_net)
{
  int i;
  if (c->net == this_net)
    return;
  c->net = this_net;
  for (i = 0; i < c->n_lines; i++)
    classify_corner (other_corner (c->lines[i], c), this_net);
}

static void
classify_nets ()
{
  static int this_net = 1;
  corner_s *c;

  for (c = corners; c; c = c->next)
    {
      if (DELETED (c))
        continue;
      if (c->net)
        continue;
      classify_corner (c, this_net);
      this_net++;
    }
}

#if 0
/* Not used */
static void
dump_all ()
{
  corner_s *c;
  line_s *l;
  for (c = corners; c; c = c->next)
    {
      if (DELETED (c))
        continue;
      printf ("%p corner %d,%d layer %d net %d\n",
              (void *) c, c->x, c->y, c->layer, c->net);
    }
  for (l = lines; l; l = l->next)
    {
      if (DELETED (l))
        continue;
      printf ("%p line %p to %p layer %d\n",
              (void *) l, (void *) (l->s), (void *) (l->e), l->layer);
    }
}
#endif

static void
nudge_corner (corner_s * c, int dx, int dy, corner_s * prev_corner)
{
  int ox = c->x;
  int oy = c->y;
  int l;
  if (prev_corner && (c->pin || c->pad))
    return;
  move_corner (c, ox + dx, oy + dy);
  for (l = 0; l < c->n_lines; l++)
    {
      corner_s *oc = other_corner (c->lines[l], c);
      if (oc == prev_corner)
        continue;
      if (dx && oc->x == ox)
        nudge_corner (oc, dx, 0, c);
      if (dy && oc->y == oy)
        nudge_corner (oc, 0, dy, c);
    }
}

static line_s *
choose_example_line (corner_s * c1, corner_s * c2)
{
  int ci, li;
  corner_s *c[2];
  c[0] = c1;
  c[1] = c2;
  dprintf ("choose_example_line\n");
  for (ci = 0; ci < 2; ci++)
    for (li = 0; li < c[ci]->n_lines; li++)
      {
        dprintf ("  try[%d,%d] \033[36m<%d,%d-%d,%d t%d c%d f%s>\033[0m\n",
                 ci, li,
                 c[ci]->lines[li]->s->x, c[ci]->lines[li]->s->y,
                 c[ci]->lines[li]->e->x, c[ci]->lines[li]->e->y,
                 c[ci]->lines[li]->line->Thickness,
                 c[ci]->lines[li]->line->Clearance,
                 flags_to_string (c[ci]->lines[li]->line->Flags, LINE_TYPE));
        /* Pads are disqualified, as we want to mimic a trace line. */
        if (c[ci]->lines[li]->line == (LineTypePtr) c[ci]->pad)
          {
            dprintf ("  bad, pad\n");
            continue;
          }
        /* Lines on layers that don't connect to the other pad are bad too.  */
        if (!intersecting_layers (c[ci]->lines[li]->layer, c[1 - ci]->layer))
          {
            dprintf ("  bad, layers\n");
            continue;
          }
        dprintf ("  good\n");
        return c[ci]->lines[li];
      }
  dprintf ("choose_example_line: none found!\n");
  return 0;
}

static int
connect_corners (corner_s * c1, corner_s * c2)
{
  int layer;
  line_s *ex = choose_example_line (c1, c2);
  LineType *example = ex->line;

  dprintf
    ("connect_corners \033[32m%d,%d to %d,%d, example line %d,%d to %d,%d l%d\033[0m\n",
     c1->x, c1->y, c2->x, c2->y, ex->s->x, ex->s->y, ex->e->x, ex->e->y,
     ex->layer);

  layer = ex->layer;

  /* Assume c1 is the moveable one.  */
  if (!(c1->pin || c1->pad || c1->via) && c1->n_lines == 1)
    {
      int nx, ny;
      /* Extend the line */
      if (c1->lines[0]->s->x == c1->lines[0]->e->x)
        nx = c1->x, ny = c2->y;
      else
        nx = c2->x, ny = c1->y;
      if (nx != c2->x || ny != c2->y)
        {
          move_corner (c1, nx, ny);
          new_line (c1, c2, layer, example);
          return 1;
        }
      else
        {
          move_corner (c1, nx, ny);
          return 1;
        }
    }
  else
    {
      corner_s *nc = find_corner (c1->x, c2->y, layer);
      new_line (c1, nc, layer, example);
      new_line (nc, c2, layer, example);
      return 0;
    }
}

static void
pinsnap ()
{
  corner_s *c;
  int best_dist[MAX_LAYER + 1];
  corner_s *best_c[MAX_LAYER + 1];
  int l, got_one;
  int left = 0, right = 0, top = 0, bottom = 0;
  PinType *pin;
  int again = 1;

  corner_s *prev_c;
  int close = 0;
  corner_s *c2;

  /* Look for pins that have no connections.  See if there's a corner
     close by that should be connected to it.  This usually happens
     when the MUCS router needs to route to an off-grid pin.  */
  while (again)
    {
      again = 0;
      for (c = corners; c; c = c->next)
        {
          if (DELETED (c))
            continue;
          if (!(c->pin || c->via || c->pad))
            continue;

          prev_c = c;
          pin = 0;

          dprintf ("\ncorner %s\n", corner_name (c));
          if (c->pin || c->via)
            {
              pin = c->pin ? c->pin : c->via;
              close = pin->Thickness / 2;
              left = c->x - close;
              right = c->x + close;
              bottom = c->y - close;
              top = c->y + close;
            }
          else if (c->pad)
            {
              close = c->pad->Thickness / 2 + 1;
              left = djmin (c->pad->Point1.X, c->pad->Point2.X) - close;
              right = djmax (c->pad->Point1.X, c->pad->Point2.X) + close;
              bottom = djmin (c->pad->Point1.Y, c->pad->Point2.Y) - close;
              top = djmax (c->pad->Point1.Y, c->pad->Point2.Y) + close;
              if (c->pad->Point1.X == c->pad->Point2.X)
                {
                  int hy = (c->pad->Point1.Y + c->pad->Point2.Y) / 2;
                  dprintf ("pad y %d %d hy %d c %d\n", c->pad->Point1.Y,
                           c->pad->Point2.Y, hy, c->y);
                  if (c->y < hy)
                    top = hy;
                  else
                    bottom = hy + 1;
                }
              else
                {
                  int hx = (c->pad->Point1.X + c->pad->Point2.X) / 2;
                  dprintf ("pad x %d %d hx %d c %d\n", c->pad->Point1.X,
                           c->pad->Point2.X, hx, c->x);
                  if (c->x < hx)
                    right = hx;
                  else
                    left = hx + 1;
                }
            }

          dprintf ("%s x %d-%d y %d-%d\n", corner_name (c), left, right,
                   bottom, top);
          for (l = 0; l <= max_layer; l++)
            {
              best_dist[l] = close * 2;
              best_c[l] = 0;
            }
          got_one = 0;
          for (c2 = corners; c2; c2 = c2->next)
            {
              int lt;

              if (DELETED (c2))
                continue;
              lt = corner_radius (c2);
              if (c2->n_lines
                  && c2 != c
                  && !(c2->pin || c2->pad || c2->via)
                  && intersecting_layers (c->layer, c2->layer)
                  && c2->x >= left - lt
                  && c2->x <= right + lt
                  && c2->y >= bottom - lt && c2->y <= top + lt)
                {
                  int d = dist (c->x, c->y, c2->x, c2->y);
                  if (pin && d > pin->Thickness / 2 + lt)
                    continue;
                  if (c2->n_lines == 1)
                    {
                      got_one++;
                      dprintf ("found orphan %s vs %s\n", corner_name (c2),
                               corner_name (c));
                      connect_corners (c, c2);
                      again = 1;
                      continue;
                    }
                  if (best_c[c2->layer] == 0
                      || c2->n_lines < best_c[c2->layer]->n_lines
                      || (d < best_dist[c2->layer]
                          && c2->n_lines <= best_c[c2->layer]->n_lines))
                    {
                      best_dist[c2->layer] = d;
                      best_c[c2->layer] = c2;
                      dprintf ("layer %d best now %s\n", c2->layer,
                               corner_name (c2));
                    }
                }
              if (!got_one && c->n_lines == (c->pad ? 1 : 0))
                {
                  for (l = 0; l <= max_layer; l++)
                    if (best_c[l])
                      dprintf ("best[%d] = %s\n", l, corner_name (best_c[l]));
                  for (l = 0; l <= max_layer; l++)
                    if (best_c[l])
                      {
                        dprintf ("move %s to %s\n", corner_name (best_c[l]),
                                 corner_name (c));
                        connect_corners (best_c[l], c);
                        again = 1;
                        continue;
                      }
                }
            }
        }
    }

  /* Now look for line ends that don't connect, see if they need to be
     extended to intersect another line.  */
  for (c = corners; c; c = c->next)
    {
      line_s *l, *t;
      int lo;

      if (DELETED (c))
        continue;
      if (c->pin || c->via || c->pad)
        continue;
      if (c->n_lines != 1)
        continue;

      l = c->lines[0];
      lo = line_orient (l, c);
      dprintf ("line end %d,%d orient %d\n", c->x, c->y, lo);

      for (t = lines; t; t = t->next)
        {
          if (DELETED (t))
            continue;
          if (t->layer != c->lines[0]->layer)
            continue;
          switch (lo)           /* remember, orient is for the line relative to the corner */
            {
            case LEFT:
              if (t->s->x == t->e->x
                  && c->x < t->s->x
                  && t->s->x <
                  c->x + (l->line->Thickness + t->line->Thickness) / 2
                  && ((t->s->y < c->y && c->y < t->e->y)
                      || (t->e->y < c->y && c->y < t->s->y)))
                {
                  dprintf ("found %d,%d - %d,%d\n", t->s->x, t->s->y, t->e->x,
                           t->e->y);
                  move_corner (c, t->s->x, c->y);
                }
              break;
            case RIGHT:
              if (t->s->x == t->e->x
                  && c->x > t->s->x
                  && t->s->x >
                  c->x - (l->line->Thickness + t->line->Thickness) / 2
                  && ((t->s->y < c->y && c->y < t->e->y)
                      || (t->e->y < c->y && c->y < t->s->y)))
                {
                  dprintf ("found %d,%d - %d,%d\n", t->s->x, t->s->y, t->e->x,
                           t->e->y);
                  move_corner (c, t->s->x, c->y);
                }
              break;
            case UP:
              if (t->s->y == t->e->y
                  && c->y < t->s->y
                  && t->s->y <
                  c->y + (l->line->Thickness + t->line->Thickness) / 2
                  && ((t->s->x < c->x && c->x < t->e->x)
                      || (t->e->x < c->x && c->x < t->s->x)))
                {
                  dprintf ("found %d,%d - %d,%d\n", t->s->x, t->s->y, t->e->x,
                           t->e->y);
                  move_corner (c, c->x, t->s->y);
                }
              break;
            case DOWN:
              if (t->s->y == t->e->y
                  && c->y > t->s->y
                  && t->s->y >
                  c->y - (l->line->Thickness + t->line->Thickness) / 2
                  && ((t->s->x < c->x && c->x < t->e->x)
                      || (t->e->x < c->x && c->x < t->s->x)))
                {
                  dprintf ("found %d,%d - %d,%d\n", t->s->x, t->s->y, t->e->x,
                           t->e->y);
                  move_corner (c, c->x, t->s->y);
                }
              break;
            }
        }
    }
}

static int
pad_orient (PadType * p)
{
  if (p->Point1.X == p->Point2.X)
    return O_VERT;
  if (p->Point1.Y == p->Point2.Y)
    return O_HORIZ;
  return DIAGONAL;
}

static void
padcleaner ()
{
  line_s *l, *nextl;
  int close;
  rect_s r;
  int ei, pi;

  dprintf ("\ndj: padcleaner\n");
  for (l = lines; l; l = nextl)
    {
      nextl = l->next;

      if (DELETED (l))
        continue;

      dprintf ("dj: line %p\n", (void *) l);
      check (0, l);

      if (l->s->pad && l->s->pad == l->e->pad)
        continue;

      for (ei = 0; ei < PCB->Data->ElementN; ei++)
        {
          ElementType *e = &(PCB->Data->Element[ei]);
          for (pi = 0; pi < e->PadN; pi++)
            {
              PadType *p = e->Pad + pi;
              int layerflag =
                TEST_FLAG (ONSOLDERFLAG, e) ? LT_SOLDER : LT_COMPONENT;

              if (layer_type[l->layer] != layerflag)
                continue;

              empty_rect (&r);
              close = p->Thickness / 2 + 1;
              add_point_to_rect (&r, p->Point1.X, p->Point1.Y,
                                 close - SB / 2);
              add_point_to_rect (&r, p->Point2.X, p->Point2.Y,
                                 close - SB / 2);
              if (pin_in_rect (&r, l->s->x, l->s->y, 0)
                  && pin_in_rect (&r, l->e->x, l->e->y, 0)
                  && ORIENT (line_orient (l, 0)) == pad_orient (p))
                {
                  dprintf
                    ("padcleaner %d,%d-%d,%d %d vs line %d,%d-%d,%d %d\n",
                     p->Point1.X, p->Point1.Y, p->Point2.X, p->Point2.Y,
                     p->Thickness, l->s->x, l->s->y, l->e->x, l->e->y,
                     l->line->Thickness);
                  remove_line (l);
                  goto next_line;
                }
            }
        }
    next_line:;
    }
}

static void
grok_layer_groups ()
{
  int i, j, f;
  LayerGroupType *l = &(PCB->LayerGroups);

  solder_layer = component_layer = -1;
  for (i = 0; i < max_layer; i++)
    {
      layer_type[i] = 0;
      layer_groupings[i] = 0;
    }
  for (i = 0; i < max_layer; i++)
    {
      f = 0;
      for (j = 0; j < l->Number[i]; j++)
        {
          if (l->Entries[i][j] == max_layer + SOLDER_LAYER)
            f |= LT_SOLDER;
          if (l->Entries[i][j] == max_layer + COMPONENT_LAYER)
            f |= LT_COMPONENT;
        }
      for (j = 0; j < l->Number[i]; j++)
        {
          if (l->Entries[i][j] >= 0 && l->Entries[i][j] < max_layer)
            {
              layer_type[l->Entries[i][j]] |= f;
              layer_groupings[l->Entries[i][j]] = i;
              if (solder_layer == -1 && f == LT_SOLDER)
                solder_layer = l->Entries[i][j];
              if (component_layer == -1 && f == LT_COMPONENT)
                component_layer = l->Entries[i][j];
            }
        }
    }
}

static const char djopt_syntax[] =
  "djopt(debumpify|unjaggy|simple|vianudge|viatrim|orthopull)\n"
  "djopt(auto) - all of the above\n" "djopt(miter)";

static const char djopt_help[] =
  "Perform various optimizations on the current board";

/* %start-doc actions djopt

The different types of optimizations change your board in order to
reduce the total trace length and via count.

@table @code

@item debumpify
Looks for U-shaped traces that can be shortened or eliminated.

@item unjaggy
Looks for corners which could be flipped to eliminate one or more
corners (i.e. jaggy lines become simpler).

@item simple
Removing uneeded vias, replacing two or more trace segments in a row
with a single segment.  This is usually performed automatically after
other optimizations.

@item vianudge
Looks for vias where all traces leave in the same direction.  Tries to
move via in that direction to eliminate one of the traces (and thus a
corner).

@item viatrim
Looks for traces that go from via to via, where moving that trace to a
different layer eliminates one or both vias.

@item orthopull
Looks for chains of traces all going in one direction, with more
traces orthogonal on one side than on the other.  Moves the chain in
that direction, causing a net reduction in trace length, possibly
eliminating traces and/or corners.

@item splitlines
Looks for lines that pass through vias, pins, or pads, and splits them
into separate lines so they can be managed separately.

@item auto
Performs the above options, repeating until no further optimizations
can be made.

@item miter
Replaces 90 degree corners with a pair of 45 degree corners, to reduce
RF losses and trace length.

@end table

%end-doc */

static int
ActionDJopt (int argc, char **argv, int x, int y)
{
  char *arg = argc > 0 ? argv[0] : 0;
  int layn, saved = 0;
  corner_s *c;

#ifdef ENDIF
  SwitchDrawingWindow (PCB->Zoom, Output.drawing_area->window,
                       Settings.ShowSolderSide, False);
#endif

  hid_action("Busy");

  lines = 0;
  corners = 0;

  grok_layer_groups ();

  ELEMENT_LOOP (PCB->Data);
  PIN_LOOP (element);
  {
    c = find_corner (pin->X, pin->Y, -1);
    c->pin = pin;
  }
  END_LOOP;
  PAD_LOOP (element);
  {
    int layern =
      TEST_FLAG (ONSOLDERFLAG, pad) ? solder_layer : component_layer;
    line_s *ls = (line_s *) malloc (sizeof (line_s));
    ls->next = lines;
    lines = ls;
    ls->s = find_corner (pad->Point1.X, pad->Point1.Y, layern);
    ls->s->pad = pad;
    ls->e = find_corner (pad->Point2.X, pad->Point2.Y, layern);
    ls->e->pad = pad;
    ls->layer = layern;
    ls->line = (LineTypePtr) pad;
    add_line_to_corner (ls, ls->s);
    ls->layer = layern;
    ls->line = (LineTypePtr) pad;
    add_line_to_corner (ls, ls->s);
    add_line_to_corner (ls, ls->e);

  }
  END_LOOP;
  END_LOOP;
  VIA_LOOP (PCB->Data);
  /* hace don't mess with vias that have thermals */
  /* but then again don't bump into them
     if (!TEST_FLAG(ALLTHERMFLAGS, via))
   */
  {
    c = find_corner (via->X, via->Y, -1);
    c->via = via;
  }
  END_LOOP;
  check (0, 0);

  if (NSTRCMP (arg, "splitlines") == 0)
    {
      if (canonicalize_lines ())
        IncrementUndoSerialNumber ();
      return 0;
    }

  for (layn = 0; layn < max_layer; layn++)
    {
      LayerType *layer = LAYER_PTR (layn);
      int ln;
      for (ln = 0; ln < layer->LineN; ln++)
        {
          LineType *l = &(layer->Line[ln]);
          line_s *ls;

          /* don't mess with thermals */
          if (TEST_FLAG (USETHERMALFLAG, l))
            continue;

          if (l->Point1.X == l->Point2.X && l->Point1.Y == l->Point2.Y)
            {
              RemoveLine (layer, l);
              ln--;
              continue;
            }

          ls = (line_s *) malloc (sizeof (line_s));
          ls->next = lines;
          lines = ls;
          ls->s = find_corner (l->Point1.X, l->Point1.Y, layn);
          ls->e = find_corner (l->Point2.X, l->Point2.Y, layn);
          ls->line = l;
          add_line_to_corner (ls, ls->s);
          add_line_to_corner (ls, ls->e);
          ls->layer = layn;
        }
    }


  check (0, 0);
  pinsnap ();
  canonicalize_lines ();
  check (0, 0);
  classify_nets ();
  /*dump_all(); */
  check (0, 0);

  if (NSTRCMP (arg, "debumpify") == 0)
    saved += debumpify ();
  else if (NSTRCMP (arg, "unjaggy") == 0)
    saved += unjaggy ();
  else if (NSTRCMP (arg, "simple") == 0)
    saved += simple_optimizations ();
  else if (NSTRCMP (arg, "vianudge") == 0)
    saved += vianudge ();
  else if (NSTRCMP (arg, "viatrim") == 0)
    saved += viatrim ();
  else if (NSTRCMP (arg, "orthopull") == 0)
    saved += orthopull ();
  else if (NSTRCMP (arg, "auto") == 0)
    saved += automagic ();
  else if (NSTRCMP (arg, "miter") == 0)
    saved += miter ();
  else
    {
      printf ("unknown command: %s\n", arg);
      return 1;
    }

  padcleaner ();

  check (0, 0);
  if (saved)
    IncrementUndoSerialNumber ();
  return 0;
}

HID_Action djopt_action_list[] = {
  {"djopt", 0, ActionDJopt,
   djopt_help, djopt_syntax}
  ,
  {"OptAutoOnly", 0, djopt_set_auto_only,
   djopt_sao_help, djopt_sao_syntax}
};

REGISTER_ACTIONS (djopt_action_list)