7 * Contains interface to the topology data.
9 * @xrefitem bom "File Content Label" "Release Content"
11 * @e sub-project: HyperTransport
12 * @e \$Revision: 44324 $ @e \$Date: 2010-12-22 02:16:51 -0700 (Wed, 22 Dec 2010) $
16 *****************************************************************************
18 * Copyright (C) 2012 Advanced Micro Devices, Inc.
19 * All rights reserved.
21 * Redistribution and use in source and binary forms, with or without
22 * modification, are permitted provided that the following conditions are met:
23 * * Redistributions of source code must retain the above copyright
24 * notice, this list of conditions and the following disclaimer.
25 * * Redistributions in binary form must reproduce the above copyright
26 * notice, this list of conditions and the following disclaimer in the
27 * documentation and/or other materials provided with the distribution.
28 * * Neither the name of Advanced Micro Devices, Inc. nor the names of
29 * its contributors may be used to endorse or promote products derived
30 * from this software without specific prior written permission.
32 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
33 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
34 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
35 * DISCLAIMED. IN NO EVENT SHALL ADVANCED MICRO DEVICES, INC. BE LIABLE FOR ANY
36 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
37 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
38 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
39 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
40 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
41 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
43 * ***************************************************************************
51 * @page htgraphdesign Graph Support routines
53 * These routines provide support for dealing with the graph representation
54 * of the topologies, along with the routing table information for that topology.
55 * The routing information is compressed and these routines currently decompress
56 * 'on the fly'. A graph is represented as a set of routes. All the edges in the
57 * graph are routes; a direct route from Node i to Node j exists in the graph IFF
58 * there is an edge directly connecting Node i to Node j. All other routes designate
59 * the edge which the route to that Node initially takes, by designating a Node
60 * to which a direct connection exists. That is, the route to non-adjacent Node j
61 * from Node i specifies Node k where Node i directly connects to Node k.
64 * pseudo definition of compressed graph:
68 * UINT8 broadcast[8]:1; // that is, 8 1-bit values
70 * UINT8 requestRoute:4; // [3:0]
71 * UINT8 responseRoute:4; // [7:4]
76 * sRoute graph[size][size];
81 /*----------------------------------------------------------------------------
82 * Mixed (DEFINITIONS AND MACROS / TYPEDEFS, STRUCTURES, ENUMS)
84 *----------------------------------------------------------------------------
87 /*-----------------------------------------------------------------------------
88 * DEFINITIONS AND MACROS
90 *-----------------------------------------------------------------------------
93 /*----------------------------------------------------------------------------
94 * TYPEDEFS, STRUCTURES, ENUMS
96 *----------------------------------------------------------------------------
100 /*----------------------------------------------------------------------------
101 * FUNCTIONS PROTOTYPE
103 *----------------------------------------------------------------------------
143 #endif /* _HT_GRAPH_H_ */