OLD | NEW |
1 // Copyright (c) 2008, Google Inc. | 1 // Copyright (c) 2008, Google Inc. |
2 // All rights reserved. | 2 // All rights reserved. |
3 // | 3 // |
4 // Redistribution and use in source and binary forms, with or without | 4 // Redistribution and use in source and binary forms, with or without |
5 // modification, are permitted provided that the following conditions are | 5 // modification, are permitted provided that the following conditions are |
6 // met: | 6 // met: |
7 // | 7 // |
8 // * Redistributions of source code must retain the above copyright | 8 // * Redistributions of source code must retain the above copyright |
9 // notice, this list of conditions and the following disclaimer. | 9 // notice, this list of conditions and the following disclaimer. |
10 // * Redistributions in binary form must reproduce the above | 10 // * Redistributions in binary form must reproduce the above |
(...skipping 78 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
89 inline bool DLL_IsEmpty(const Span* list) { | 89 inline bool DLL_IsEmpty(const Span* list) { |
90 return list->next == list; | 90 return list->next == list; |
91 } | 91 } |
92 | 92 |
93 // Add span to the front of list. | 93 // Add span to the front of list. |
94 void DLL_Prepend(Span* list, Span* span); | 94 void DLL_Prepend(Span* list, Span* span); |
95 | 95 |
96 // Return the length of the linked list. O(n) | 96 // Return the length of the linked list. O(n) |
97 int DLL_Length(const Span* list); | 97 int DLL_Length(const Span* list); |
98 | 98 |
| 99 // Print the contents of the list to stderr. |
| 100 #if 0 // This isn't used. |
| 101 void DLL_Print(const char* label, const Span* list); |
| 102 #endif |
| 103 |
99 } // namespace tcmalloc | 104 } // namespace tcmalloc |
100 | 105 |
101 #endif // TCMALLOC_SPAN_H_ | 106 #endif // TCMALLOC_SPAN_H_ |
OLD | NEW |