| /src/external/gpl3/binutils/dist/libiberty/ |
| fibheap.c | 147 fibnode_t a_root, b_root, temp;
150 if ((a_root = heapa->root) == NULL)
162 a_root->left->right = b_root;
163 b_root->left->right = a_root;
164 temp = a_root->left;
165 a_root->left = b_root->left;
146 fibnode_t a_root, b_root, temp; local
|
| /src/external/gpl3/binutils.old/dist/libiberty/ |
| fibheap.c | 147 fibnode_t a_root, b_root, temp;
150 if ((a_root = heapa->root) == NULL)
162 a_root->left->right = b_root;
163 b_root->left->right = a_root;
164 temp = a_root->left;
165 a_root->left = b_root->left;
146 fibnode_t a_root, b_root, temp; local
|
| /src/external/gpl3/gcc/dist/libiberty/ |
| fibheap.c | 147 fibnode_t a_root, b_root, temp;
150 if ((a_root = heapa->root) == NULL)
162 a_root->left->right = b_root;
163 b_root->left->right = a_root;
164 temp = a_root->left;
165 a_root->left = b_root->left;
146 fibnode_t a_root, b_root, temp; local
|
| /src/external/gpl3/gcc.old/dist/libiberty/ |
| fibheap.c | 147 fibnode_t a_root, b_root, temp;
150 if ((a_root = heapa->root) == NULL)
162 a_root->left->right = b_root;
163 b_root->left->right = a_root;
164 temp = a_root->left;
165 a_root->left = b_root->left;
146 fibnode_t a_root, b_root, temp; local
|
| /src/external/gpl3/gdb.old/dist/libiberty/ |
| fibheap.c | 147 fibnode_t a_root, b_root, temp;
150 if ((a_root = heapa->root) == NULL)
162 a_root->left->right = b_root;
163 b_root->left->right = a_root;
164 temp = a_root->left;
165 a_root->left = b_root->left;
146 fibnode_t a_root, b_root, temp; local
|
| /src/external/gpl3/gdb/dist/libiberty/ |
| fibheap.c | 147 fibnode_t a_root, b_root, temp;
150 if ((a_root = heapa->root) == NULL)
162 a_root->left->right = b_root;
163 b_root->left->right = a_root;
164 temp = a_root->left;
165 a_root->left = b_root->left;
146 fibnode_t a_root, b_root, temp; local
|
| /src/external/gpl3/gcc/dist/gcc/ |
| fibonacci_heap.h | 503 fibonacci_node<K,V> *a_root, *b_root; local
509 if ((a_root = heapa->m_root) == NULL)
521 a_root->m_left->m_right = b_root;
522 b_root->m_left->m_right = a_root;
523 std::swap (a_root->m_left, b_root->m_left);
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| fibonacci_heap.h | 503 fibonacci_node<K,V> *a_root, *b_root; local
509 if ((a_root = heapa->m_root) == NULL)
521 a_root->m_left->m_right = b_root;
522 b_root->m_left->m_right = a_root;
523 std::swap (a_root->m_left, b_root->m_left);
|
| /src/external/bsd/jemalloc/dist/include/jemalloc/internal/ |
| rb.h | 142 #define rbtn_first(a_type, a_field, a_rbt, a_root, r_node) do { \
143 (r_node) = (a_root); \
152 #define rbtn_last(a_type, a_field, a_rbt, a_root, r_node) do { \
153 (r_node) = (a_root); \
|
| /src/external/bsd/jemalloc.old/dist/include/jemalloc/internal/ |
| rb.h | 142 #define rbtn_first(a_type, a_field, a_rbt, a_root, r_node) do { \
143 (r_node) = (a_root); \
152 #define rbtn_last(a_type, a_field, a_rbt, a_root, r_node) do { \
153 (r_node) = (a_root); \
|
| /src/external/bsd/jemalloc.old/include/jemalloc/internal/ |
| rb.h | 142 #define rbtn_first(a_type, a_field, a_rbt, a_root, r_node) do { \
143 (r_node) = (a_root); \
152 #define rbtn_last(a_type, a_field, a_rbt, a_root, r_node) do { \
153 (r_node) = (a_root); \
|
