Skip to content

Router Heap documentation update #2634

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 1 addition & 3 deletions doc/src/api/vprinternals/router_heap.rst
Original file line number Diff line number Diff line change
Expand Up @@ -24,10 +24,8 @@ KAryHeap
----------
.. doxygenclass:: KAryHeap
:project: vpr
:members:

FourAryHeap
----------
.. doxygenclass:: FourAryHeap
:project: vpr
:members:
:project: vpr
14 changes: 7 additions & 7 deletions vpr/src/route/heap_type.h
Original file line number Diff line number Diff line change
Expand Up @@ -27,21 +27,21 @@ struct t_heap {
t_heap_path* path_data;

/**
* @brief Get <i>u.next</i>.
* @brief Get the next t_heap item in the linked list.
*/
t_heap* next_heap_item() const {
return u.next;
}

/**
* @brief Set <i>u.next</i>.
* @brief Set the next t_heap item in the linked list.
*/
void set_next_heap_item(t_heap* next) {
u.next = next;
}

/**
* @brief Get <i>u.prev_edge</i>.
* @brief Get the edge from the previous node used to reach the current node.
*
* @note
* Be careful: will return 0 (a valid id!) if uninitialized.
Expand All @@ -52,7 +52,7 @@ struct t_heap {
}

/**
* @brief Set <i>u.prev_edge</i>.
* @brief Set the edge from the previous node used to reach the current node..
*/
inline void set_prev_edge(RREdgeId edge) {
static_assert(sizeof(uint32_t) == sizeof(RREdgeId));
Expand All @@ -61,7 +61,7 @@ struct t_heap {

private:
union {
///@brief Pointer to the next s_heap structure in the free linked list.
///@brief Pointer to the next t_heap structure in the free linked list.
t_heap* next = nullptr;

/**
Expand Down Expand Up @@ -121,7 +121,7 @@ class HeapStorage {
* As a general rule, any t_heap objects returned from this interface,
* **must** be HeapInterface::free'd before destroying the HeapInterface
* instance. This ensure that no leaks are present in the users of the heap.
* Violating this assumption may result in a assertion violation.
* Violating this assumption may result in an assertion violation.
*/
class HeapInterface {
public:
Expand Down Expand Up @@ -160,7 +160,7 @@ class HeapInterface {
* - empty_heap<BR>
* - build_heap<BR>
*
* @param grid
* @param grid The FPGA device grid
*/
virtual void init_heap(const DeviceGrid& grid) = 0;

Expand Down
Loading