{
struct map_rect_priv *mr=priv_data;
struct tile *t=mr->t,*tn,new;
- int extend,offset,delta,move_len;
+ int offset,delta,move_len;
int write_offset,move_offset,naoffset,coffset,oattr_len;
int nattr_size,nattr_len,pad;
int *data;
nattr_size=0;
nattr_len=0;
pad=0;
- extend=0;
break;
case change_mode_modify:
case change_mode_prepend:
{
struct route_graph_point *p_min;
struct route_graph_segment *s=NULL;
- int min,new,old,val;
+ int min,new,val;
struct fibheap *heap; /* This heap will hold all points with "temporarily" calculated costs */
heap = fh_makekeyheap();
if (debug_route)
printf("end %d len %d vs %d (0x%x,0x%x)\n",new,val,s->start->value,s->start->c.x, s->start->c.y);
if (new < s->start->value) {
- old=s->start->value;
s->start->value=new;
s->start->seg=s;
if (! s->start->el) {
static struct route_path *
route_path_new(struct route_graph *this, struct route_path *oldpath, struct route_info *pos, struct route_info *dst, struct vehicleprofile *profile)
{
- struct route_graph_segment *first,*s=NULL,*s1=NULL,*s2=NULL;
+ struct route_graph_segment *s=NULL,*s1=NULL,*s2=NULL;
struct route_graph_point *start;
struct route_info *posinfo, *dstinfo;
int segs=0;
ret->path_hash=item_hash_new();
dstinfo=NULL;
posinfo=pos;
- first=s;
while (s && !dstinfo) { /* following start->seg, which indicates the least costly way to reach our destination */
segs++;
#if 0