| 1 |
145 |
lanttu |
/*
|
| 2 |
|
|
* Copyright (c) 2010, Mentor Graphics Corporation
|
| 3 |
|
|
* All rights reserved.
|
| 4 |
|
|
*
|
| 5 |
|
|
* Redistribution and use in source and binary forms, with or without
|
| 6 |
|
|
* modification, are permitted provided that the following conditions are met:
|
| 7 |
|
|
*
|
| 8 |
|
|
* 1. Redistributions of source code must retain the above copyright notice,
|
| 9 |
|
|
* this list of conditions and the following disclaimer.
|
| 10 |
|
|
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
| 11 |
|
|
* this list of conditions and the following disclaimer in the documentation
|
| 12 |
|
|
* and/or other materials provided with the distribution.
|
| 13 |
|
|
* 3. Neither the name of the <ORGANIZATION> nor the names of its contributors
|
| 14 |
|
|
* may be used to endorse or promote products derived from this software
|
| 15 |
|
|
* without specific prior written permission.
|
| 16 |
|
|
*
|
| 17 |
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
| 18 |
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
| 19 |
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
| 20 |
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
|
| 21 |
|
|
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
| 22 |
|
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
| 23 |
|
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
| 24 |
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
| 25 |
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
| 26 |
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
| 27 |
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
| 28 |
|
|
*/
|
| 29 |
|
|
|
| 30 |
|
|
|
| 31 |
|
|
|
| 32 |
|
|
#include <openmcapi.h>
|
| 33 |
|
|
|
| 34 |
|
|
/*************************************************************************
|
| 35 |
|
|
*
|
| 36 |
|
|
* FUNCTION
|
| 37 |
|
|
*
|
| 38 |
|
|
* mcapi_find_node
|
| 39 |
|
|
*
|
| 40 |
|
|
* DESCRIPTION
|
| 41 |
|
|
*
|
| 42 |
|
|
* Finds a specific node in a list of nodes.
|
| 43 |
|
|
*
|
| 44 |
|
|
* INPUTS
|
| 45 |
|
|
*
|
| 46 |
|
|
* target_id The node ID of the target node.
|
| 47 |
|
|
* *node_data A pointer to the global node list.
|
| 48 |
|
|
*
|
| 49 |
|
|
* OUTPUTS
|
| 50 |
|
|
*
|
| 51 |
|
|
* Index into the global data structure of the respective node or
|
| 52 |
|
|
* -1 if the node does not exist.
|
| 53 |
|
|
*
|
| 54 |
|
|
*************************************************************************/
|
| 55 |
|
|
int mcapi_find_node(mcapi_node_t target_id, MCAPI_GLOBAL_DATA *node_data)
|
| 56 |
|
|
{
|
| 57 |
|
|
int i;
|
| 58 |
|
|
|
| 59 |
|
|
/* Find a matching entry in the list of nodes. */
|
| 60 |
|
|
for (i = 0; i < MCAPI_NODE_COUNT; i++)
|
| 61 |
|
|
{
|
| 62 |
|
|
/* If the Node ID matches the target ID. */
|
| 63 |
|
|
if ( (node_data->mcapi_node_list[i].mcapi_state != MCAPI_NODE_UNUSED) &&
|
| 64 |
|
|
(node_data->mcapi_node_list[i].mcapi_node_id == target_id) )
|
| 65 |
|
|
break;
|
| 66 |
|
|
}
|
| 67 |
|
|
|
| 68 |
|
|
if (i != MCAPI_NODE_COUNT)
|
| 69 |
|
|
return (i);
|
| 70 |
|
|
else
|
| 71 |
|
|
return (-1);
|
| 72 |
|
|
|
| 73 |
|
|
}
|
| 74 |
|
|
|
