55 lines
2.4 KiB
C
55 lines
2.4 KiB
C
/*
|
|
* Copyright (c) 2006, Swedish Institute of Computer Science.
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. Neither the name of the Institute nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* This file is part of the Contiki operating system.
|
|
*
|
|
* $Id: node-id.c,v 1.1 2007/06/28 12:49:57 nvt-se Exp $
|
|
*/
|
|
|
|
#include "node-id.h"
|
|
#include "contiki-conf.h"
|
|
#include "dev/infomem.h"
|
|
|
|
unsigned short node_id = 0;
|
|
/*---------------------------------------------------------------------------*/
|
|
void
|
|
node_id_restore(void)
|
|
{
|
|
unsigned short newid[2];
|
|
|
|
infomem_read(newid, INFOMEM_NODE_ID, 2 * sizeof(node_id));
|
|
node_id = ( newid[0] == 0xdead ) ? newid[1] : newid[0];
|
|
}
|
|
/*---------------------------------------------------------------------------*/
|
|
void
|
|
node_id_burn(unsigned short id)
|
|
{
|
|
unsigned short buffer[2] = { 0xdead, id };
|
|
infomem_write(INFOMEM_NODE_ID, 1, buffer, 2 * sizeof(node_id));
|
|
}
|
|
/*---------------------------------------------------------------------------*/
|