Index: trunk/src/copy.c =================================================================== --- trunk/src/copy.c (revision 3394) +++ trunk/src/copy.c (revision 3395) @@ -99,7 +99,7 @@ } /* --------------------------------------------------------------------------- - * copies data from one element to another and creates the destination + * copies data from one element to another and creates the destination * if necessary */ ElementTypePtr @@ -159,7 +159,7 @@ } /* --------------------------------------------------------------------------- - * copies a via + * copies a via */ static void *CopyVia(PinTypePtr Via) { @@ -175,7 +175,7 @@ } /* --------------------------------------------------------------------------- - * copies a line + * copies a line */ static void *CopyLine(LayerTypePtr Layer, LineTypePtr Line) { @@ -212,7 +212,7 @@ } /* --------------------------------------------------------------------------- - * copies a text + * copies a text */ static void *CopyText(LayerTypePtr Layer, TextTypePtr Text) { @@ -226,7 +226,7 @@ } /* --------------------------------------------------------------------------- - * copies a polygon + * copies a polygon */ static void *CopyPolygon(LayerTypePtr Layer, PolygonTypePtr Polygon) { @@ -245,7 +245,7 @@ } /* --------------------------------------------------------------------------- - * copies an element onto the PCB. Then does a draw. + * copies an element onto the PCB. Then does a draw. */ static void *CopyElement(ElementTypePtr Element) { Index: trunk/src/crosshair.c =================================================================== --- trunk/src/crosshair.c (revision 3394) +++ trunk/src/crosshair.c (revision 3395) @@ -821,7 +821,7 @@ pcb_bool redraw = pcb_false; op_swap(crosshair); - + /* Do not truncate to 0 because that may free the array */ vtop_truncate(&crosshair->onpoint_objs, 1); crosshair->onpoint_objs.used = 0; Index: trunk/src/find.c =================================================================== --- trunk/src/find.c (revision 3394) +++ trunk/src/find.c (revision 3395) @@ -32,7 +32,7 @@ * Every object that has to be checked is added to its list. * Coarse searching is accomplished with the data rtrees. * - there's no 'speed-up' mechanism for polygons because they are not used - * as often as other objects + * as often as other objects * - the maximum distance between line and pin ... would depend on the angle * between them. To speed up computation the limit is set to one half * of the thickness of the objects (cause of square pins). Index: trunk/src/find_print.c =================================================================== --- trunk/src/find_print.c (revision 3394) +++ trunk/src/find_print.c (revision 3395) @@ -286,4 +286,3 @@ FreeConnectionLookupMemory(); Redraw(); } - Index: trunk/src/global_typedefs.h =================================================================== --- trunk/src/global_typedefs.h (revision 3394) +++ trunk/src/global_typedefs.h (revision 3395) @@ -3,7 +3,7 @@ * * PCB, interactive printed circuit board design * Copyright (C) 2016 Tibor 'Igor2' Palinkas - * + * * 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 @@ -49,4 +49,3 @@ #include "unit.h" #endif - Index: trunk/src/remove.c =================================================================== --- trunk/src/remove.c (revision 3394) +++ trunk/src/remove.c (revision 3395) @@ -118,7 +118,7 @@ } /* --------------------------------------------------------------------------- - * destroys a line from a layer + * destroys a line from a layer */ static void *DestroyLine(LayerTypePtr Layer, LineTypePtr Line) { @@ -130,7 +130,7 @@ } /* --------------------------------------------------------------------------- - * destroys an arc from a layer + * destroys an arc from a layer */ static void *DestroyArc(LayerTypePtr Layer, ArcTypePtr Arc) { @@ -329,7 +329,7 @@ } /* --------------------------------------------------------------------------- - * removes a line from a layer + * removes a line from a layer */ void *RemoveLine(LayerTypePtr Layer, LineTypePtr Line) { @@ -344,7 +344,7 @@ } /* --------------------------------------------------------------------------- - * removes an arc from a layer + * removes an arc from a layer */ void *RemoveArc(LayerTypePtr Layer, ArcTypePtr Arc) { Index: trunk/src/rubberband.c =================================================================== --- trunk/src/rubberband.c (revision 3394) +++ trunk/src/rubberband.c (revision 3395) @@ -74,7 +74,7 @@ return R_DIR_NOT_FOUND; if (line == i->line) return R_DIR_NOT_FOUND; - /* + /* * Check to see if the line touches a rectangular region. * To do this we need to look for the intersection of a circular * region and a rectangular region. @@ -86,7 +86,7 @@ && line->Point1.Y + t >= i->box.Y1 && line->Point1.Y - t <= i->box.Y2) { if (((i->box.X1 <= line->Point1.X) && (line->Point1.X <= i->box.X2)) || ((i->box.Y1 <= line->Point1.Y) && (line->Point1.Y <= i->box.Y2))) { - /* + /* * The circle is positioned such that the closest point * on the rectangular region boundary is not at a corner * of the rectangle. i.e. the shortest line from circle @@ -96,7 +96,7 @@ touches = 1; } else { - /* + /* * Now we must check the distance from the center of the * circle to the corners of the rectangle since the * closest part of the rectangular region is the corner. Index: trunk/src_plugins/autoroute/autoroute.c =================================================================== --- trunk/src_plugins/autoroute/autoroute.c (revision 3394) +++ trunk/src_plugins/autoroute/autoroute.c (revision 3395) @@ -1268,7 +1268,7 @@ } /* return the *minimum cost* from a point to a route box, including possible - * via costs if the route box is on a different layer. + * via costs if the route box is on a different layer. * assume routbox is bloated unless it is an expansion area */ static cost_t cost_to_routebox(const CheapPointType * p, Cardinal point_layer, const routebox_t * rb) @@ -1857,7 +1857,7 @@ if (rb->flags.touched) return R_DIR_NOT_FOUND; - /* The inflated box outer edges include its own + /* The inflated box outer edges include its own * track width plus its own clearance. * * To check for intersection, we need to expand @@ -1982,8 +1982,8 @@ * for touch against such an object. Usually the expanding edge * bumps into neighboring pins on the same device that require a * clearance, preventing seeing a target immediately. Rather than await - * another expansion to actually touch the target, the edge breaker code - * looks past the clearance to see these targets even though they + * another expansion to actually touch the target, the edge breaker code + * looks past the clearance to see these targets even though they * weren't actually touched in the expansion. */ struct E_result *Expand(rtree_t * rtree, edge_t * e, const BoxType * box) @@ -2125,8 +2125,8 @@ /* blocker_to_heap puts the blockers into a heap so they * can be retrieved in clockwise order. If a blocker * is also a target, it gets put into the vector too. - * It returns 1 for any fixed blocker that is not part - * of this net and zero otherwise. + * It returns 1 for any fixed blocker that is not part + * of this net and zero otherwise. */ static int blocker_to_heap(heap_t * heap, routebox_t * rb, BoxType * box, direction_t dir) { @@ -2612,7 +2612,7 @@ /* if the last one didn't become a corner, * we still want to expand it straight out * in the direction of the previous edge, - * which it belongs to. + * which it belongs to. */ BoxType db = previous_edge(last, dir, &rb->sbox); moveable_edge(edges, &db, (direction_t) (dir - 1), rb, NULL, e, targets, s, NULL, NULL); @@ -2659,7 +2659,7 @@ * (1) it hit the board edge or (2) was the source of our expansion * * for this case (of hitting nothing) we give up trying for corner - * expansions because it is likely that they're not possible anyway + * expansions because it is likely that they're not possible anyway */ if ((e->expand_dir == ALL ? e->rb->came_from : e->expand_dir) != ((dir + 2) % 4)) { /* ok, we are not going back on ourselves, and the whole edge seems free */ @@ -2935,7 +2935,7 @@ return; } /* Check if the lines concatenat. We only check the - * normal expected nextpoint=lastpoint condition + * normal expected nextpoint=lastpoint condition */ if (X1 == qX2 && Y1 == qY2 && qhthick == halfthick && qgroup == group) { if (qX1 == qX2 && X1 == X2) { /* everybody on the same X here */ @@ -3127,7 +3127,7 @@ /* the target was a plane, so we need to find a good spot for the via * now. It's logical to place it close to the source box which * is where we're utlimately headed on this path. However, it - * must reside in the plane as well as the via area too. + * must reside in the plane as well as the via area too. */ nextpoint.X = CENTER_X(path->sbox); nextpoint.Y = CENTER_Y(path->sbox); @@ -3765,7 +3765,7 @@ /* if there is already something here on this layer (like an * EXPANSION_AREA), then we don't want to expand from here * at least not inside the expansion area. A PLANE on the - * other hand may be a target, or not. + * other hand may be a target, or not. */ intersecting = FindOneInBox(rd->layergrouptree[e->rb->group], e->rb); @@ -4135,7 +4135,7 @@ int this_heap_size; int this_heap_item; - /* initialize heap for first pass; + /* initialize heap for first pass; * do smallest area first; that makes * the subsequent costs more representative */ this_pass = heap_create(); Index: trunk/src_plugins/gpmi/pcb-gpmi/gpmi_plugin/gpmi_pkg/layout/search.c =================================================================== --- trunk/src_plugins/gpmi/pcb-gpmi/gpmi_plugin/gpmi_pkg/layout/search.c (revision 3394) +++ trunk/src_plugins/gpmi/pcb-gpmi/gpmi_plugin/gpmi_pkg/layout/search.c (revision 3395) @@ -184,4 +184,3 @@ } return 2; } - Index: trunk/src_plugins/io_kicad_legacy/write.c =================================================================== --- trunk/src_plugins/io_kicad_legacy/write.c (revision 3394) +++ trunk/src_plugins/io_kicad_legacy/write.c (revision 3395) @@ -431,12 +431,12 @@ /* as far as can be determined from the Kicad documentation, http://en.wikibooks.org/wiki/Kicad/file_formats#Drawings - + the origin for rotation is the positive x direction, and going CW - + whereas in gEDA, the gEDA origin for rotation is the negative x axis, with rotation CCW, so we need to reverse delta angle - + deltaAngle is CW in Kicad in deci-degrees, and CCW in degrees in gEDA NB it is in degrees in the newer s-file kicad module/footprint format */ Index: trunk/src_plugins/io_lihata/read.c =================================================================== --- trunk/src_plugins/io_lihata/read.c (revision 3394) +++ trunk/src_plugins/io_lihata/read.c (revision 3395) @@ -88,7 +88,7 @@ if ((nd == NULL) || (nd->type != LHT_TEXT)) return -1; - + tmp = GetValueEx(nd->data.text.value, NULL, NULL, NULL, NULL, &success); if (!success) return -1; @@ -105,7 +105,7 @@ if ((nd == NULL) || (nd->type != LHT_TEXT)) return -1; - + tmp = GetValueEx(nd->data.text.value, NULL, NULL, NULL, NULL, &success); if (!success) return -1; @@ -143,7 +143,7 @@ if (nd == NULL) return -1; - + tmp = strtol(nd->name + prefix_len, &end, 10); if (*end != '\0') return -1; @@ -636,4 +636,3 @@ lht_dom_uninit(doc); return res; } -