The Tor Browser: editor/libeditor/base/nsSelectionState.cpp@129ffea94266 (annotated)

editor/libeditor/base/nsSelectionState.cpp@129ffea94266 (annotated)

editor/libeditor/base/nsSelectionState.cpp

Sat, 03 Jan 2015 20:18:00 +0100

author: Michael Schloh von Bennewitz <michael@schloh.com>
date: Sat, 03 Jan 2015 20:18:00 +0100
branch: TOR_BUG_3246
changeset 7: 129ffea94266
permissions: -rw-r--r--

Conditionally enable double key logic according to:
private browsing mode or privacy.thirdparty.isolate preference and
implement in GetCookieStringCommon and FindCookie where it counts...
With some reservations of how to convince FindCookie users to test
condition and pass a nullptr when disabling double key logic.

 /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
 /* This Source Code Form is subject to the terms of the Mozilla Public
  * License, v. 2.0. If a copy of the MPL was not distributed with this
  * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
 #include "mozilla/Assertions.h"         // for MOZ_ASSERT, etc
 #include "mozilla/dom/Selection.h"      // for Selection
 #include "nsAString.h"                  // for nsAString_internal::Length
 #include "nsAutoPtr.h"                  // for nsRefPtr, getter_AddRefs, etc
 #include "nsCycleCollectionParticipant.h"
 #include "nsDebug.h"                    // for NS_ENSURE_TRUE, etc
 #include "nsEditor.h"                   // for nsEditor
 #include "nsEditorUtils.h"              // for nsEditorUtils
 #include "nsError.h"                    // for NS_OK, etc
 #include "nsIDOMCharacterData.h"        // for nsIDOMCharacterData
 #include "nsIDOMNode.h"                 // for nsIDOMNode
 #include "nsIDOMRange.h"                // for nsIDOMRange, etc
 #include "nsISelection.h"               // for nsISelection
 #include "nsISupportsImpl.h"            // for nsRange::Release
 #include "nsRange.h"                    // for nsRange
 #include "nsSelectionState.h"
 using namespace mozilla;
 using namespace mozilla::dom;
 /***************************************************************************
  * class for recording selection info.  stores selection as collection of
  * { {startnode, startoffset} , {endnode, endoffset} } tuples.  Can't store
  * ranges since dom gravity will possibly change the ranges.
  */
 nsSelectionState::nsSelectionState() : mArray(){}
 nsSelectionState::~nsSelectionState()
 {
   MakeEmpty();
 }
 void
 nsSelectionState::DoTraverse(nsCycleCollectionTraversalCallback &cb)
 {
   for (uint32_t i = 0, iEnd = mArray.Length(); i < iEnd; ++i)
   {
     nsRangeStore* item = mArray[i];
     NS_CYCLE_COLLECTION_NOTE_EDGE_NAME(cb,
                                        "selection state mArray[i].startNode");
     cb.NoteXPCOMChild(item->startNode);
     NS_CYCLE_COLLECTION_NOTE_EDGE_NAME(cb,
                                        "selection state mArray[i].endNode");
     cb.NoteXPCOMChild(item->endNode);
   }
 }
 void
 nsSelectionState::SaveSelection(Selection* aSel)
 {
   MOZ_ASSERT(aSel);
   int32_t arrayCount = mArray.Length();
   int32_t rangeCount = aSel->GetRangeCount();
   // if we need more items in the array, new them
   if (arrayCount < rangeCount) {
     for (int32_t i = arrayCount; i < rangeCount; i++) {
       mArray.AppendElement();
       mArray[i] = new nsRangeStore();
     }
   } else if (arrayCount > rangeCount) {
     // else if we have too many, delete them
     for (int32_t i = arrayCount - 1; i >= rangeCount; i--) {
       mArray.RemoveElementAt(i);
     }
   }
   // now store the selection ranges
   for (int32_t i = 0; i < rangeCount; i++) {
     mArray[i]->StoreRange(aSel->GetRangeAt(i));
   }
 }
 nsresult
 nsSelectionState::RestoreSelection(nsISelection *aSel)
 {
   NS_ENSURE_TRUE(aSel, NS_ERROR_NULL_POINTER);
   nsresult res;
   uint32_t i, arrayCount = mArray.Length();
   // clear out selection
   aSel->RemoveAllRanges();
   // set the selection ranges anew
   for (i=0; i<arrayCount; i++)
   {
     nsRefPtr<nsRange> range;
     mArray[i]->GetRange(getter_AddRefs(range));
     NS_ENSURE_TRUE(range, NS_ERROR_UNEXPECTED);
     res = aSel->AddRange(range);
     if(NS_FAILED(res)) return res;
   }
   return NS_OK;
 }
 bool
 nsSelectionState::IsCollapsed()
 {
   if (1 != mArray.Length()) return false;
   nsRefPtr<nsRange> range;
   mArray[0]->GetRange(getter_AddRefs(range));
   NS_ENSURE_TRUE(range, false);
   bool bIsCollapsed = false;
   range->GetCollapsed(&bIsCollapsed);
   return bIsCollapsed;
 }
 bool
 nsSelectionState::IsEqual(nsSelectionState *aSelState)
 {
   NS_ENSURE_TRUE(aSelState, false);
   uint32_t i, myCount = mArray.Length(), itsCount = aSelState->mArray.Length();
   if (myCount != itsCount) return false;
   if (myCount < 1) return false;
   for (i=0; i<myCount; i++)
   {
     nsRefPtr<nsRange> myRange, itsRange;
     mArray[i]->GetRange(getter_AddRefs(myRange));
     aSelState->mArray[i]->GetRange(getter_AddRefs(itsRange));
     NS_ENSURE_TRUE(myRange && itsRange, false);
     int16_t compResult;
     nsresult rv;
     rv = myRange->CompareBoundaryPoints(nsIDOMRange::START_TO_START, itsRange, &compResult);
     if (NS_FAILED(rv) || compResult) return false;
     rv = myRange->CompareBoundaryPoints(nsIDOMRange::END_TO_END, itsRange, &compResult);
     if (NS_FAILED(rv) || compResult) return false;
   }
   // if we got here, they are equal
   return true;
 }
 void
 nsSelectionState::MakeEmpty()
 {
   // free any items in the array
   mArray.Clear();
 }
 bool
 nsSelectionState::IsEmpty()
 {
   return mArray.IsEmpty();
 }
 /***************************************************************************
  * nsRangeUpdater:  class for updating nsIDOMRanges in response to editor actions.
  */
 nsRangeUpdater::nsRangeUpdater() : mArray(), mLock(false) {}
 nsRangeUpdater::~nsRangeUpdater()
 {
   // nothing to do, we don't own the items in our array.
 }
 void
 nsRangeUpdater::RegisterRangeItem(nsRangeStore *aRangeItem)
 {
   if (!aRangeItem) return;
   if (mArray.Contains(aRangeItem))
   {
     NS_ERROR("tried to register an already registered range");
     return;  // don't register it again.  It would get doubly adjusted.
   }
   mArray.AppendElement(aRangeItem);
 }
 void
 nsRangeUpdater::DropRangeItem(nsRangeStore *aRangeItem)
 {
   if (!aRangeItem) return;
   mArray.RemoveElement(aRangeItem);
 }
 nsresult
 nsRangeUpdater::RegisterSelectionState(nsSelectionState &aSelState)
 {
   uint32_t i, theCount = aSelState.mArray.Length();
   if (theCount < 1) return NS_ERROR_FAILURE;
   for (i=0; i<theCount; i++)
   {
     RegisterRangeItem(aSelState.mArray[i]);
   }
   return NS_OK;
 }
 nsresult
 nsRangeUpdater::DropSelectionState(nsSelectionState &aSelState)
 {
   uint32_t i, theCount = aSelState.mArray.Length();
   if (theCount < 1) return NS_ERROR_FAILURE;
   for (i=0; i<theCount; i++)
   {
     DropRangeItem(aSelState.mArray[i]);
   }
   return NS_OK;
 }
 // gravity methods:
 nsresult
 nsRangeUpdater::SelAdjCreateNode(nsIDOMNode *aParent, int32_t aPosition)
 {
   if (mLock) return NS_OK;  // lock set by Will/DidReplaceParent, etc...
   NS_ENSURE_TRUE(aParent, NS_ERROR_NULL_POINTER);
   uint32_t i, count = mArray.Length();
   if (!count) {
     return NS_OK;
   }
   nsRangeStore *item;
   for (i=0; i<count; i++)
   {
     item = mArray[i];
     NS_ENSURE_TRUE(item, NS_ERROR_NULL_POINTER);
     if ((item->startNode.get() == aParent) && (item->startOffset > aPosition))
       item->startOffset++;
     if ((item->endNode.get() == aParent) && (item->endOffset > aPosition))
       item->endOffset++;
   }
   return NS_OK;
 }
 nsresult
 nsRangeUpdater::SelAdjInsertNode(nsIDOMNode *aParent, int32_t aPosition)
 {
   return SelAdjCreateNode(aParent, aPosition);
 }
 void
 nsRangeUpdater::SelAdjDeleteNode(nsIDOMNode *aNode)
 {
   if (mLock) {
     // lock set by Will/DidReplaceParent, etc...
     return;
   }
   MOZ_ASSERT(aNode);
   uint32_t i, count = mArray.Length();
   if (!count) {
     return;
   }
   int32_t offset = 0;
   nsCOMPtr<nsIDOMNode> parent = nsEditor::GetNodeLocation(aNode, &offset);
   // check for range endpoints that are after aNode and in the same parent
   nsRangeStore *item;
   for (i=0; i<count; i++)
   {
     item = mArray[i];
     MOZ_ASSERT(item);
     if ((item->startNode.get() == parent) && (item->startOffset > offset))
       item->startOffset--;
     if ((item->endNode.get() == parent) && (item->endOffset > offset))
       item->endOffset--;
     // check for range endpoints that are in aNode
     if (item->startNode == aNode)
     {
       item->startNode   = parent;
       item->startOffset = offset;
     }
     if (item->endNode == aNode)
     {
       item->endNode   = parent;
       item->endOffset = offset;
     }
     // check for range endpoints that are in descendants of aNode
     nsCOMPtr<nsIDOMNode> oldStart;
     if (nsEditorUtils::IsDescendantOf(item->startNode, aNode))
     {
       oldStart = item->startNode;  // save for efficiency hack below.
       item->startNode   = parent;
       item->startOffset = offset;
     }
     // avoid having to call IsDescendantOf() for common case of range startnode == range endnode.
     if ((item->endNode == oldStart) || nsEditorUtils::IsDescendantOf(item->endNode, aNode))
     {
       item->endNode   = parent;
       item->endOffset = offset;
     }
   }
 }
 nsresult
 nsRangeUpdater::SelAdjSplitNode(nsIDOMNode *aOldRightNode, int32_t aOffset, nsIDOMNode *aNewLeftNode)
 {
   if (mLock) return NS_OK;  // lock set by Will/DidReplaceParent, etc...
   NS_ENSURE_TRUE(aOldRightNode && aNewLeftNode, NS_ERROR_NULL_POINTER);
   uint32_t i, count = mArray.Length();
   if (!count) {
     return NS_OK;
   }
   int32_t offset;
   nsCOMPtr<nsIDOMNode> parent = nsEditor::GetNodeLocation(aOldRightNode, &offset);
   // first part is same as inserting aNewLeftnode
   nsresult result = SelAdjInsertNode(parent,offset-1);
   NS_ENSURE_SUCCESS(result, result);
   // next step is to check for range enpoints inside aOldRightNode
   nsRangeStore *item;
   for (i=0; i<count; i++)
   {
     item = mArray[i];
     NS_ENSURE_TRUE(item, NS_ERROR_NULL_POINTER);
     if (item->startNode.get() == aOldRightNode)
     {
       if (item->startOffset > aOffset)
       {
         item->startOffset -= aOffset;
       }
       else
       {
         item->startNode = aNewLeftNode;
       }
     }
     if (item->endNode.get() == aOldRightNode)
     {
       if (item->endOffset > aOffset)
       {
         item->endOffset -= aOffset;
       }
       else
       {
         item->endNode = aNewLeftNode;
       }
     }
   }
   return NS_OK;
 }
 nsresult
 nsRangeUpdater::SelAdjJoinNodes(nsIDOMNode *aLeftNode,
                                   nsIDOMNode *aRightNode,
                                   nsIDOMNode *aParent,
                                   int32_t aOffset,
                                   int32_t aOldLeftNodeLength)
 {
   if (mLock) return NS_OK;  // lock set by Will/DidReplaceParent, etc...
   NS_ENSURE_TRUE(aLeftNode && aRightNode && aParent, NS_ERROR_NULL_POINTER);
   uint32_t i, count = mArray.Length();
   if (!count) {
     return NS_OK;
   }
   nsRangeStore *item;
   for (i=0; i<count; i++)
   {
     item = mArray[i];
     NS_ENSURE_TRUE(item, NS_ERROR_NULL_POINTER);
     if (item->startNode.get() == aParent)
     {
       // adjust start point in aParent
       if (item->startOffset > aOffset)
       {
         item->startOffset--;
       }
       else if (item->startOffset == aOffset)
       {
         // join keeps right hand node
         item->startNode = aRightNode;
         item->startOffset = aOldLeftNodeLength;
       }
     }
     else if (item->startNode.get() == aRightNode)
     {
       // adjust start point in aRightNode
       item->startOffset += aOldLeftNodeLength;
     }
     else if (item->startNode.get() == aLeftNode)
     {
       // adjust start point in aLeftNode
       item->startNode = aRightNode;
     }
     if (item->endNode.get() == aParent)
     {
       // adjust end point in aParent
       if (item->endOffset > aOffset)
       {
         item->endOffset--;
       }
       else if (item->endOffset == aOffset)
       {
         // join keeps right hand node
         item->endNode = aRightNode;
         item->endOffset = aOldLeftNodeLength;
       }
     }
     else if (item->endNode.get() == aRightNode)
     {
       // adjust end point in aRightNode
        item->endOffset += aOldLeftNodeLength;
     }
     else if (item->endNode.get() == aLeftNode)
     {
       // adjust end point in aLeftNode
       item->endNode = aRightNode;
     }
   }
   return NS_OK;
 }
 nsresult
 nsRangeUpdater::SelAdjInsertText(nsIDOMCharacterData *aTextNode, int32_t aOffset, const nsAString &aString)
 {
   if (mLock) return NS_OK;  // lock set by Will/DidReplaceParent, etc...
   uint32_t count = mArray.Length();
   if (!count) {
     return NS_OK;
   }
   nsCOMPtr<nsIDOMNode> node(do_QueryInterface(aTextNode));
   NS_ENSURE_TRUE(node, NS_ERROR_NULL_POINTER);
   uint32_t len=aString.Length(), i;
   nsRangeStore *item;
   for (i=0; i<count; i++)
   {
     item = mArray[i];
     NS_ENSURE_TRUE(item, NS_ERROR_NULL_POINTER);
     if ((item->startNode.get() == node) && (item->startOffset > aOffset))
       item->startOffset += len;
     if ((item->endNode.get() == node) && (item->endOffset > aOffset))
       item->endOffset += len;
   }
   return NS_OK;
 }
 nsresult
 nsRangeUpdater::SelAdjDeleteText(nsIDOMCharacterData *aTextNode, int32_t aOffset, int32_t aLength)
 {
   if (mLock) return NS_OK;  // lock set by Will/DidReplaceParent, etc...
   uint32_t i, count = mArray.Length();
   if (!count) {
     return NS_OK;
   }
   nsRangeStore *item;
   nsCOMPtr<nsIDOMNode> node(do_QueryInterface(aTextNode));
   NS_ENSURE_TRUE(node, NS_ERROR_NULL_POINTER);
   for (i=0; i<count; i++)
   {
     item = mArray[i];
     NS_ENSURE_TRUE(item, NS_ERROR_NULL_POINTER);
     if ((item->startNode.get() == node) && (item->startOffset > aOffset))
     {
       item->startOffset -= aLength;
       if (item->startOffset < 0) item->startOffset = 0;
     }
     if ((item->endNode.get() == node) && (item->endOffset > aOffset))
     {
       item->endOffset -= aLength;
       if (item->endOffset < 0) item->endOffset = 0;
     }
   }
   return NS_OK;
 }
 nsresult
 nsRangeUpdater::WillReplaceContainer()
 {
   if (mLock) return NS_ERROR_UNEXPECTED;
   mLock = true;
   return NS_OK;
 }
 nsresult
 nsRangeUpdater::DidReplaceContainer(nsIDOMNode *aOriginalNode, nsIDOMNode *aNewNode)
 {
   NS_ENSURE_TRUE(mLock, NS_ERROR_UNEXPECTED);
   mLock = false;
   NS_ENSURE_TRUE(aOriginalNode && aNewNode, NS_ERROR_NULL_POINTER);
   uint32_t i, count = mArray.Length();
   if (!count) {
     return NS_OK;
   }
   nsRangeStore *item;
   for (i=0; i<count; i++)
   {
     item = mArray[i];
     NS_ENSURE_TRUE(item, NS_ERROR_NULL_POINTER);
     if (item->startNode.get() == aOriginalNode)
       item->startNode = aNewNode;
     if (item->endNode.get() == aOriginalNode)
       item->endNode = aNewNode;
   }
   return NS_OK;
 }
 nsresult
 nsRangeUpdater::WillRemoveContainer()
 {
   if (mLock) return NS_ERROR_UNEXPECTED;
   mLock = true;
   return NS_OK;
 }
 nsresult
 nsRangeUpdater::DidRemoveContainer(nsIDOMNode *aNode, nsIDOMNode *aParent, int32_t aOffset, uint32_t aNodeOrigLen)
 {
   NS_ENSURE_TRUE(mLock, NS_ERROR_UNEXPECTED);
   mLock = false;
   NS_ENSURE_TRUE(aNode && aParent, NS_ERROR_NULL_POINTER);
   uint32_t i, count = mArray.Length();
   if (!count) {
     return NS_OK;
   }
   nsRangeStore *item;
   for (i=0; i<count; i++)
   {
     item = mArray[i];
     NS_ENSURE_TRUE(item, NS_ERROR_NULL_POINTER);
     if (item->startNode.get() == aNode)
     {
       item->startNode = aParent;
       item->startOffset += aOffset;
     }
     else if ((item->startNode.get() == aParent) && (item->startOffset > aOffset))
       item->startOffset += (int32_t)aNodeOrigLen-1;
     if (item->endNode.get() == aNode)
     {
       item->endNode = aParent;
       item->endOffset += aOffset;
     }
     else if ((item->endNode.get() == aParent) && (item->endOffset > aOffset))
       item->endOffset += (int32_t)aNodeOrigLen-1;
   }
   return NS_OK;
 }
 nsresult
 nsRangeUpdater::WillInsertContainer()
 {
   if (mLock) return NS_ERROR_UNEXPECTED;
   mLock = true;
   return NS_OK;
 }
 nsresult
 nsRangeUpdater::DidInsertContainer()
 {
   NS_ENSURE_TRUE(mLock, NS_ERROR_UNEXPECTED);
   mLock = false;
   return NS_OK;
 }
 void
 nsRangeUpdater::WillMoveNode()
 {
   mLock = true;
 }
 void
 nsRangeUpdater::DidMoveNode(nsINode* aOldParent, int32_t aOldOffset,
                             nsINode* aNewParent, int32_t aNewOffset)
 {
   MOZ_ASSERT(aOldParent);
   MOZ_ASSERT(aNewParent);
   NS_ENSURE_TRUE_VOID(mLock);
   mLock = false;
   nsIDOMNode* oldParent = aOldParent->AsDOMNode();
   nsIDOMNode* newParent = aNewParent->AsDOMNode();
   for (uint32_t i = 0, count = mArray.Length(); i < count; ++i) {
     nsRangeStore* item = mArray[i];
     NS_ENSURE_TRUE_VOID(item);
     // like a delete in aOldParent
     if (item->startNode == oldParent && item->startOffset > aOldOffset) {
       item->startOffset--;
     }
     if (item->endNode == oldParent && item->endOffset > aOldOffset) {
       item->endOffset--;
     }
     // and like an insert in aNewParent
     if (item->startNode == newParent && item->startOffset > aNewOffset) {
       item->startOffset++;
     }
     if (item->endNode == newParent && item->endOffset > aNewOffset) {
       item->endOffset++;
     }
   }
 }
 /***************************************************************************
  * helper class for nsSelectionState.  nsRangeStore stores range endpoints.
  */
   // DEBUG: int32_t nsRangeStore::n = 0;
 nsRangeStore::nsRangeStore()
 {
   // DEBUG: n++;  printf("range store alloc count=%d\n", n);
 }
 nsRangeStore::~nsRangeStore()
 {
   // DEBUG: n--;  printf("range store alloc count=%d\n", n);
 }
 nsresult nsRangeStore::StoreRange(nsIDOMRange *aRange)
 {
   NS_ENSURE_TRUE(aRange, NS_ERROR_NULL_POINTER);
   aRange->GetStartContainer(getter_AddRefs(startNode));
   aRange->GetEndContainer(getter_AddRefs(endNode));
   aRange->GetStartOffset(&startOffset);
   aRange->GetEndOffset(&endOffset);
   return NS_OK;
 }
 nsresult nsRangeStore::GetRange(nsRange** outRange)
 {
   return nsRange::CreateRange(startNode, startOffset, endNode, endOffset,
                               outRange);
 }

The Tor Browser / annotate

editor/libeditor/base/nsSelectionState.cpp@129ffea94266 (annotated)

editor/libeditor/base/nsSelectionState.cpp