257   void add_chunk_to_free_list(TaskQueueEntryChunk* elem);

   257   void add_chunk_to_free_list(TaskQueueEntryChunk* elem);

   258 

   258 

   259   TaskQueueEntryChunk* remove_chunk_from_chunk_list();

   259   TaskQueueEntryChunk* remove_chunk_from_chunk_list();

   260   TaskQueueEntryChunk* remove_chunk_from_free_list();

   260   TaskQueueEntryChunk* remove_chunk_from_free_list();

   261 

   261 

   264   // Resizes the mark stack to the given new capacity. Releases any previous

   262   // Resizes the mark stack to the given new capacity. Releases any previous

   265   // memory if successful.

   263   // memory if successful.

   266   bool resize(size_t new_capacity);

   264   bool resize(size_t new_capacity);

   267 

   265 

   268  public:

   266  public:

   290   // Return whether the chunk list is empty. Racy due to unsynchronized access to

   288   // Return whether the chunk list is empty. Racy due to unsynchronized access to

   291   // _chunk_list.

   289   // _chunk_list.

   292   bool is_empty() const { return _chunk_list == NULL; }

   290   bool is_empty() const { return _chunk_list == NULL; }

   293 

   291 

   294   size_t capacity() const  { return _chunk_capacity; }

   292   size_t capacity() const  { return _chunk_capacity; }

   298 

   293 

   299   // Expand the stack, typically in response to an overflow condition

   294   // Expand the stack, typically in response to an overflow condition

   300   void expand();

   295   void expand();

   301 

   296 

   302   // Return the approximate number of oops on this mark stack. Racy due to

   297   // Return the approximate number of oops on this mark stack. Racy due to