123456789101112131415161718192021222324252627282930313233343536373839404142434445 |
- //===- llvm/ADT/SmallVector.cpp - 'Normally small' vectors ----------------===//
- //
- // The LLVM Compiler Infrastructure
- //
- // This file is distributed under the University of Illinois Open Source
- // License. See LICENSE.TXT for details.
- //
- //===----------------------------------------------------------------------===//
- //
- // This file implements the SmallVector class.
- //
- //===----------------------------------------------------------------------===//
- #include "llvm/ADT/SmallVector.h"
- using namespace llvm;
- /// grow_pod - This is an implementation of the grow() method which only works
- /// on POD-like datatypes and is out of line to reduce code duplication.
- void SmallVectorBase::grow_pod(void *FirstEl, size_t MinSizeInBytes,
- size_t TSize) {
- size_t CurSizeBytes = size_in_bytes();
- size_t NewCapacityInBytes = 2 * capacity_in_bytes() + TSize; // Always grow.
- if (NewCapacityInBytes < MinSizeInBytes)
- NewCapacityInBytes = MinSizeInBytes;
- void *NewElts;
- if (BeginX == FirstEl) {
- NewElts = new char[NewCapacityInBytes]; // HLSL Change: Use overridable operator new
- // Copy the elements over. No need to run dtors on PODs.
- memcpy(NewElts, this->BeginX, CurSizeBytes);
- } else {
- // If this wasn't grown from the inline copy, grow the allocated space.
- // HLSL Change Begins: Use overridable operator new
- NewElts = new char[NewCapacityInBytes];
- memcpy(NewElts, this->BeginX, CurSizeBytes);
- delete[] (char*)this->BeginX;
- // HLSL Change Ends
- }
- assert(NewElts && "Out of memory");
- this->EndX = (char*)NewElts+CurSizeBytes;
- this->BeginX = NewElts;
- this->CapacityX = (char*)this->BeginX + NewCapacityInBytes;
- }
|