/// <param name="subnodeBTree">Note: We use ref, this way we are able to create a new subnode BTree and update the subnodeBTree the caller provided</param>
/// <param name="heapOrNodeID">Existing HeapOrNodeID</param>
public static HeapOrNodeID StoreExternalProperty(PSTFile file, HeapOnNode heap, ref SubnodeBTree subnodeBTree, HeapOrNodeID heapOrNodeID, byte[] propertyBytes)
{
// We should avoid storing items with length of 0, because those are consideref freed, and could be repurposed
if (propertyBytes.Length == 0)
{
RemoveExternalProperty(heap, subnodeBTree, heapOrNodeID);
return(new HeapOrNodeID(HeapID.EmptyHeapID));
}
if (heapOrNodeID.IsHeapID) // if HeapOrNodeID is empty then IsHeapID == true
{
if (propertyBytes.Length <= HeapOnNode.MaximumAllocationLength)
{
if (heapOrNodeID.IsEmpty)
{
return(new HeapOrNodeID(heap.AddItemToHeap(propertyBytes)));
}
else
{
return(new HeapOrNodeID(heap.ReplaceHeapItem(heapOrNodeID.HeapID, propertyBytes)));
}
}
else // old data (if exist) is stored on heap, but new data needs a subnode
{
if (!heapOrNodeID.IsEmpty)
{
heap.RemoveItemFromHeap(heapOrNodeID.HeapID);
}
if (subnodeBTree == null)
{
subnodeBTree = new SubnodeBTree(file);
}
DataTree dataTree = new DataTree(file);
dataTree.AppendData(propertyBytes);
dataTree.SaveChanges();
NodeID subnodeID = file.Header.AllocateNextNodeID(NodeTypeName.NID_TYPE_LTP);
subnodeBTree.InsertSubnodeEntry(subnodeID, dataTree, null);
return(new HeapOrNodeID(subnodeID));
}
}
else // old data is stored in a subnode
{
Subnode subnode = subnodeBTree.GetSubnode(heapOrNodeID.NodeID);
if (subnode.DataTree != null)
{
subnode.DataTree.Delete();
}
subnode.DataTree = new DataTree(subnodeBTree.File);
subnode.DataTree.AppendData(propertyBytes);
subnode.SaveChanges(subnodeBTree);
return(new HeapOrNodeID(heapOrNodeID.NodeID));
}
}
public static void RemoveExternalProperty(HeapOnNode heap, SubnodeBTree subnodeBTree, HeapOrNodeID heapOrNodeID)
{
if (!heapOrNodeID.IsEmpty)
{
if (heapOrNodeID.IsHeapID)
{
heap.RemoveItemFromHeap(heapOrNodeID.HeapID);
}
else
{
DataTree dataTree = subnodeBTree.GetSubnode(heapOrNodeID.NodeID).DataTree;
dataTree.Delete();
subnodeBTree.DeleteSubnodeEntry(heapOrNodeID.NodeID);
}
}
}
/// <summary>
/// Add column to an empty table context.
/// If this is a Contents Table, the caller should call UpdateMessage() afterwards.
/// Similarly, for attachment table, the caller should call UpdateAttachment().
/// </summary>
public void AddPropertyColumn(PropertyID propertyID, PropertyTypeName propertyType)
{
TableColumnDescriptor newColumnDescriptor = new TableColumnDescriptor();
newColumnDescriptor.PropertyID = propertyID;
newColumnDescriptor.PropertyType = propertyType;
newColumnDescriptor.iBit = (byte)m_tcInfo.ColumnCount;
newColumnDescriptor.cbData = (byte)GetPropertyDataLength(propertyType);
// Set the ibData:
// http://social.msdn.microsoft.com/Forums/en-US/os_binaryfile/thread/a5f9c653-40f5-4638-85d3-00c54607d984/
// PidTagLtpRowId and PidTagLtpRowVer must not be relocated
if (newColumnDescriptor.DataLengthGroup == TableContextInfo.TCI_4b)
{
newColumnDescriptor.ibData = m_tcInfo.rgib[TableContextInfo.TCI_4b];
}
else if (newColumnDescriptor.DataLengthGroup == TableContextInfo.TCI_2b)
{
newColumnDescriptor.ibData = m_tcInfo.rgib[TableContextInfo.TCI_2b];
}
else
{
newColumnDescriptor.ibData = m_tcInfo.rgib[TableContextInfo.TCI_1b];
}
// We call GetRedistributedRows() before adding the new column:
List <byte[]> rows = GetRedistributedRows(newColumnDescriptor.ibData, newColumnDescriptor.cbData);
// add the new column
m_tcInfo.rgTCOLDESC.Add(newColumnDescriptor);
// redistribute column descriptions
ushort offset = (ushort)(newColumnDescriptor.ibData + newColumnDescriptor.cbData);
for (int groupIndex = newColumnDescriptor.DataLengthGroup + 1; groupIndex < 3; groupIndex++)
{
for (int index = 0; index < m_tcInfo.rgTCOLDESC.Count; index++)
{
TableColumnDescriptor descriptor = m_tcInfo.rgTCOLDESC[index];
if (groupIndex == descriptor.DataLengthGroup)
{
// changes to descriptor will be saved when calling UpdateTableContextInfo()
descriptor.ibData = offset;
offset += descriptor.cbData;
}
}
}
// update the group ending offset
m_tcInfo.UpdateDataLayout();
m_rowsPerBlock = (int)Math.Floor((double)DataBlock.MaximumDataLength / RowLength);
// Update the rows data
if (!m_tcInfo.hnidRows.IsEmpty)
{
if (m_tcInfo.hnidRows.IsHeapID)
{
m_heap.RemoveItemFromHeap(m_tcInfo.hnidRows.HeapID);
CreateSubnodeForRows();
}
else
{
if (m_subnodeRows == null)
{
m_subnodeRows = m_subnodeBTree.GetSubnode(m_tcInfo.hnidRows.NodeID);
}
m_subnodeRows.Delete(); // this will set the subnode data-tree to null
// New data tree will be created when the first row will be added
m_subnodeBTree.UpdateSubnodeEntry(m_tcInfo.hnidRows.NodeID, null, null);
}
for (int index = 0; index < rows.Count; index++)
{
AddRowToSubnode(index, rows[index]);
}
}
UpdateTableContextInfo();
}
public void RemoveItemFromHeap(HeapID heapID)
{
m_heap.RemoveItemFromHeap(heapID);
}