deac/osd-contiki
1
0
Fork 0
Code Issues Pull requests Releases Wiki Activity

Remove unguarded printf()

Browse source
This commit is contained in:
adamdunkels 2008-11-09 12:16:05 +00:00
parent a53bce4236
commit 8851a6359a
2 changed files with 5 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
core/net/rime/rudolph2.c
View file

@ -39,7 +39,7 @@
* *
* This file is part of the Contiki operating system. * This file is part of the Contiki operating system.
* *
* $Id: rudolph2.c,v 1.5 2008/02/24 22:05:27 adamdunkels Exp $ * $Id: rudolph2.c,v 1.6 2008/11/09 12:16:33 adamdunkels Exp $
*/ */
/** /**
@ -393,7 +393,7 @@ rudolph2_send(struct rudolph2_conn *c, clock_time_t send_interval)
len = read_data(c, rimebuf_dataptr(), c->rcv_nxt); len = read_data(c, rimebuf_dataptr(), c->rcv_nxt);
} }
c->flags = FLAG_LAST_RECEIVED; c->flags = FLAG_LAST_RECEIVED;
printf("Highest chunk %d\n", c->rcv_nxt); /* printf("Highest chunk %d\n", c->rcv_nxt);*/
send_data(c, SEND_INTERVAL); send_data(c, SEND_INTERVAL);
ctimer_set(&c->t, SEND_INTERVAL, timed_send, c); ctimer_set(&c->t, SEND_INTERVAL, timed_send, c);
} }

6
core/net/uip-neighbor.c
View file

@ -28,7 +28,7 @@
* *
* This file is part of the Contiki operating system. * This file is part of the Contiki operating system.
* *
* $Id: uip-neighbor.c,v 1.2 2006/08/09 16:13:40 bg- Exp $ * $Id: uip-neighbor.c,v 1.3 2008/11/09 12:16:05 adamdunkels Exp $
*/ */
/** /**
@ -88,9 +88,9 @@ uip_neighbor_add(uip_ipaddr_t *ipaddr, struct uip_neighbor_addr *addr)
int i, oldest; int i, oldest;
u8_t oldest_time; u8_t oldest_time;
printf("Adding neighbor with link address %02x:%02x:%02x:%02x:%02x:%02x\n", /* printf("Adding neighbor with link address %02x:%02x:%02x:%02x:%02x:%02x\n",
addr->addr.addr[0], addr->addr.addr[1], addr->addr.addr[2], addr->addr.addr[3], addr->addr.addr[0], addr->addr.addr[1], addr->addr.addr[2], addr->addr.addr[3],
addr->addr.addr[4], addr->addr.addr[5]); addr->addr.addr[4], addr->addr.addr[5]);*/
/* Find the first unused entry or the oldest used entry. */ /* Find the first unused entry or the oldest used entry. */
oldest_time = 0; oldest_time = 0;