s/ passed(...) / WTF::passed(...) / to avoid future ambiguity w/ base::Passed.

third_party/WebKit/Source/core/layout/LayoutCounter.cpp

 /**
  * Copyright (C) 2004 Allan Sandfeld Jensen (kde@carewolf.com)
  * Copyright (C) 2006, 2007 Apple Inc. All rights reserved.
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
  * License as published by the Free Software Foundation; either
  * version 2 of the License, or (at your option) any later version.
  *
  * This library is distributed in the hope that it will be useful,
@@ skipping 374 matching lines @@
   RefPtr<CounterNode> newPreviousSibling = nullptr;
   RefPtr<CounterNode> newNode = CounterNode::create(object, isReset, value);
   if (findPlaceForCounter(object, identifier, isReset, newParent,
                           newPreviousSibling))
     newParent->insertAfter(newNode.get(), newPreviousSibling.get(), identifier);
   CounterMap* nodeMap;
   if (object.hasCounterNodeMap()) {
     nodeMap = counterMaps().get(&object);
   } else {
     nodeMap = new CounterMap;
-    counterMaps().set(&object, wrapUnique(nodeMap));
+    counterMaps().set(&object, WTF::wrapUnique(nodeMap));
     object.setHasCounterNodeMap(true);
   }
   nodeMap->set(identifier, newNode);
   if (newNode->parent())
     return newNode.get();
   // Checking if some nodes that were previously counter tree root nodes
   // should become children of this node now.
   CounterMaps& maps = counterMaps();
   Element* stayWithin = parentElement(object);
   bool skipDescendants;
@@ skipping 299 matching lines @@
         current->parent(), current->previousSibling(), current->nextSibling(),
         current->hasCounterNodeMap()
             ? counterName ? blink::counterMaps().get(current)->get(identifier)
                           : (blink::CounterNode*)1
             : (blink::CounterNode*)0);
   }
   fflush(stderr);
 }
 
 #endif  // NDEBUG