Address comments

Signed-off-by: Sergey Semenov <[email protected]>

Author: sergey-semenov

sycl/include/CL/sycl/detail/circular_buffer.hpp

@@ -85,6 +85,10 @@ template <typename T> class CircularBuffer {
   void clear() { MValues.clear(); }
 
 private:
+  // Deque is used as the underlying container for double-ended push/pop
+  // operations and built-in iterator support. Frequent memory allocations
+  // and deallocations are a concern, switching to an array/vector might be a
+  // worthwhile optimization.
   std::deque<T> MValues;
   const size_t MCapacity;
 };

sycl/source/detail/scheduler/graph_builder.cpp

@@ -156,6 +156,7 @@ void Scheduler::GraphBuilder::AddNodeToLeaves(MemObjRecord *Record,
                                         : Record->MWriteLeaves};
   if (Leaves.full()) {
     Command *OldLeaf = Leaves.front();
+    // TODO this is a workaround for duplicate leaves, remove once fixed
     if (OldLeaf == Cmd)
       return;
     // Add the old leaf as a dependency for the new one by duplicating one of