Home
last modified time | relevance | path

Searched refs:newRoot (Results 1 – 25 of 57) sorted by relevance

123

/external/angle/src/libANGLE/
DSharedContextMutex.cpp339 SharedContextMutex *newRoot = lockedRoot; in Merge() local
341 if (oldRoot->mRank > newRoot->mRank) in Merge()
343 std::swap(oldRoot, newRoot); in Merge()
345 else if (oldRoot->mRank == newRoot->mRank) in Merge()
347 ++newRoot->mRank; in Merge()
354 leaf->setNewRoot(newRoot); in Merge()
357 oldRoot->setNewRoot(newRoot); in Merge()
365 newRoot->doLock(); in Merge()
371 void SharedContextMutex<Mutex>::setNewRoot(SharedContextMutex *newRoot) in setNewRoot() argument
375 ASSERT(newRoot != oldRoot); in setNewRoot()
[all …]
/external/antlr/runtime/JavaScript/src/org/antlr/runtime/tree/
DBaseTreeAdaptor.js95 becomeRoot: function(newRoot, oldRoot) { argument
96 if (newRoot instanceof org.antlr.runtime.Token || !newRoot) {
97 newRoot = this.create(newRoot);
100 var newRootTree = newRoot,
103 return newRoot;
/external/antlr/runtime/ObjC/Framework/
DTreeException.m38 + (id) newException:(id<BaseTree>)theOldRoot newRoot:(id<BaseTree>)theNewRoot stream:(id<IntStream>…
40 return [[TreeException alloc] initWithOldRoot:theOldRoot newRoot:theNewRoot stream:aStream];
43 - (id) initWithOldRoot:(id<BaseTree>)theOldRoot newRoot:(id<BaseTree>)theNewRoot stream:(id<IntStre…
64 if (newRoot != aTree) {
66 if ( newRoot ) [newRoot release];
67 newRoot = aTree;
82 …: <%@> new root: <%@>", [super description], [oldRoot treeDescription], [newRoot treeDescription]];
DTreeException.h33 id<BaseTree> newRoot; variable
36 + (id) newException:(id<BaseTree>)theOldRoot newRoot:(id<BaseTree>)theNewRoot stream:(id<IntStream>…
37 - (id) initWithOldRoot:(id<BaseTree>)theOldRoot newRoot:(id<BaseTree>)theNewRoot stream:(id<IntStre…
DBaseTreeAdaptor.m146 /** If oldRoot is a nil root, just copy or move the children to newRoot.
147 * If not a nil root, make oldRoot a child of newRoot.
152 * If newRoot is a nil-rooted single child tree, use the single
158 * If oldRoot was null, it's ok, just return newRoot (even if isNil).
163 * Return newRoot. Throw an exception if newRoot is not a
165 * node. If newRoot is ^(nil x) return x as newRoot.
167 * Be advised that it's ok for newRoot to point at oldRoot's
172 - (id)becomeRoot:(id)newRoot old:(id)oldRoot
175 return newRoot;
177 //System.out.println("becomeroot new "+newRoot.toString()+" old "+oldRoot);
[all …]
/external/antlr/runtime/CSharp2/Sources/Antlr3.Runtime.Tests/
DITreeFixture.cs175 CommonTree newRoot = new CommonTree(new CommonToken(5)); in testBecomeRoot()
183 adaptor.BecomeRoot(newRoot, oldRoot); in testBecomeRoot()
184 newRoot.SanityCheckParentAndChildIndexes(); in testBecomeRoot()
191 CommonTree newRoot = new CommonTree(new CommonToken(5)); in testBecomeRoot2()
198 adaptor.BecomeRoot(newRoot, oldRoot); in testBecomeRoot2()
199 newRoot.SanityCheckParentAndChildIndexes(); in testBecomeRoot2()
206 CommonTree newRoot = new CommonTree((IToken)null); in testBecomeRoot3()
207 newRoot.AddChild(new CommonTree(new CommonToken(5))); in testBecomeRoot3()
215 adaptor.BecomeRoot(newRoot, oldRoot); in testBecomeRoot3()
216 newRoot.SanityCheckParentAndChildIndexes(); in testBecomeRoot3()
[all …]
/external/antlr/tool/src/test/java/org/antlr/test/
DTestTrees.java172 CommonTree newRoot = new CommonTree(new CommonToken(5)); in testBecomeRoot() local
180 adaptor.becomeRoot(newRoot, oldRoot); in testBecomeRoot()
181 newRoot.sanityCheckParentAndChildIndexes(); in testBecomeRoot()
186 CommonTree newRoot = new CommonTree(new CommonToken(5)); in testBecomeRoot2() local
193 adaptor.becomeRoot(newRoot, oldRoot); in testBecomeRoot2()
194 newRoot.sanityCheckParentAndChildIndexes(); in testBecomeRoot2()
199 CommonTree newRoot = new CommonTree((Token)null); in testBecomeRoot3() local
200 newRoot.addChild(new CommonTree(new CommonToken(5))); in testBecomeRoot3()
208 adaptor.becomeRoot(newRoot, oldRoot); in testBecomeRoot3()
209 newRoot.sanityCheckParentAndChildIndexes(); in testBecomeRoot3()
[all …]
/external/antlr/runtime/ActionScript/project/src/org/antlr/runtime/tree/
DBaseTreeAdaptor.as82 /** If oldRoot is a nil root, just copy or move the children to newRoot.
83 * If not a nil root, make oldRoot a child of newRoot.
88 * If newRoot is a nil-rooted single child tree, use the single
94 * If oldRoot was null, it's ok, just return newRoot (even if isNil).
99 * Return newRoot. Throw an exception if newRoot is not a
101 * node. If newRoot is ^(nil x) return x as newRoot.
103 * Be advised that it's ok for newRoot to point at oldRoot's
108 public function becomeRoot(newRoot:Object, oldRoot:Object):Object {
110 if (newRoot is Token) {
111 newRoot = createWithPayload(Token(newRoot));
[all …]
DTreeAdaptor.as94 /** If oldRoot is a nil root, just copy or move the children to newRoot.
95 * If not a nil root, make oldRoot a child of newRoot.
100 * If newRoot is a nil-rooted single child tree, use the single
106 * If oldRoot was null, it's ok, just return newRoot (even if isNil).
111 * Return newRoot. Throw an exception if newRoot is not a
113 * node. If newRoot is ^(nil x) return x as newRoot.
115 * Be advised that it's ok for newRoot to point at oldRoot's
120 function becomeRoot(newRoot:Object, oldRoot:Object):Object;
/external/antlr/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Debug/
DDebugTreeAdaptor.cs124 public virtual object BecomeRoot(object newRoot, object oldRoot) { in BecomeRoot() argument
125 object n = adaptor.BecomeRoot(newRoot, oldRoot); in BecomeRoot()
126 dbg.BecomeRoot(newRoot, oldRoot); in BecomeRoot()
139 public virtual object BecomeRoot(IToken newRoot, object oldRoot) { in BecomeRoot() argument
140 object n = this.Create(newRoot); in BecomeRoot()
142 dbg.BecomeRoot(newRoot, oldRoot); in BecomeRoot()
/external/antlr/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
DBaseTreeAdaptor.cs153 public virtual object BecomeRoot(object newRoot, object oldRoot) { in BecomeRoot() argument
155 ITree newRootTree = (ITree)newRoot; in BecomeRoot()
158 return newRoot; in BecomeRoot()
194 public virtual object BecomeRoot(IToken newRoot, object oldRoot) { in BecomeRoot() argument
195 return BecomeRoot(Create(newRoot), oldRoot); in BecomeRoot()
DITreeAdaptor.cs143 object BecomeRoot(object newRoot, object oldRoot); in BecomeRoot() argument
194 object BecomeRoot(IToken newRoot, object oldRoot); in BecomeRoot() argument
/external/antlr/runtime/Java/src/main/java/org/antlr/runtime/debug/
DDebugTreeAdaptor.java128 public Object becomeRoot(Object newRoot, Object oldRoot) { in becomeRoot() argument
129 Object n = adaptor.becomeRoot(newRoot, oldRoot); in becomeRoot()
130 dbg.becomeRoot(newRoot, oldRoot); in becomeRoot()
145 public Object becomeRoot(Token newRoot, Object oldRoot) { in becomeRoot() argument
146 Object n = this.create(newRoot); in becomeRoot()
148 dbg.becomeRoot(newRoot, oldRoot); in becomeRoot()
/external/antlr/runtime/Java/src/main/java/org/antlr/runtime/tree/
DBaseTreeAdaptor.java143 public Object becomeRoot(Object newRoot, Object oldRoot) { in becomeRoot() argument
145 Tree newRootTree = (Tree)newRoot; in becomeRoot()
148 return newRoot; in becomeRoot()
186 public Object becomeRoot(Token newRoot, Object oldRoot) { in becomeRoot() argument
187 return becomeRoot(create(newRoot), oldRoot); in becomeRoot()
DTreeAdaptor.java122 public Object becomeRoot(Object newRoot, Object oldRoot); in becomeRoot() argument
161 public Object becomeRoot(Token newRoot, Object oldRoot); in becomeRoot() argument
/external/antlr/runtime/Python/antlr3/
Ddebug.py294 def becomeRoot(self, newRoot, oldRoot): argument
295 if isinstance(newRoot, Token):
296 n = self.createWithPayload(newRoot)
299 n = self.adaptor.becomeRoot(newRoot, oldRoot)
301 self.dbg.becomeRoot(newRoot, oldRoot)
687 def becomeRoot(self, newRoot, oldRoot): argument
804 def becomeRoot(self, newRoot, oldRoot): argument
806 self.adaptor.getUniqueID(newRoot),
1092 def becomeRoot(self, newRoot, oldRoot): argument
1094 self.adaptor.getUniqueID(newRoot),
Dtree.py361 def becomeRoot(self, newRoot, oldRoot): argument
1037 def becomeRoot(self, newRoot, oldRoot): argument
1066 if isinstance(newRoot, Token):
1067 newRoot = self.create(newRoot)
1070 return newRoot
1072 if not isinstance(newRoot, CommonTree):
1073 newRoot = self.createWithPayload(newRoot)
1076 if newRoot.isNil():
1077 nc = newRoot.getChildCount()
1079 newRoot = newRoot.getChild(0)
[all …]
/external/antlr/runtime/Python3/antlr3/
Ddebug.py301 def becomeRoot(self, newRoot, oldRoot): argument
302 if isinstance(newRoot, Token):
303 n = self.createWithPayload(newRoot)
306 n = self.adaptor.becomeRoot(newRoot, oldRoot)
308 self.dbg.becomeRoot(newRoot, oldRoot)
687 def becomeRoot(self, newRoot, oldRoot): argument
804 def becomeRoot(self, newRoot, oldRoot): argument
806 self.adaptor.getUniqueID(newRoot),
1089 def becomeRoot(self, newRoot, oldRoot): argument
1091 self.adaptor.getUniqueID(newRoot),
Dtree.py361 def becomeRoot(self, newRoot, oldRoot): argument
1030 def becomeRoot(self, newRoot, oldRoot): argument
1059 if isinstance(newRoot, Token):
1060 newRoot = self.create(newRoot)
1063 return newRoot
1065 if not isinstance(newRoot, CommonTree):
1066 newRoot = self.createWithPayload(newRoot)
1069 if newRoot.isNil():
1070 nc = newRoot.getChildCount()
1072 newRoot = newRoot.getChild(0)
[all …]
/external/guava/android/guava/src/com/google/common/collect/
DTreeMultiset.java266 AvlNode<E> newRoot = new AvlNode<E>(element, occurrences); in add() local
267 successor(header, newRoot, header); in add()
268 rootReference.checkAndSet(root, newRoot); in add()
272 AvlNode<E> newRoot = root.add(comparator(), element, occurrences, result); in add() local
273 rootReference.checkAndSet(root, newRoot); in add()
286 AvlNode<E> newRoot; in remove() local
293 newRoot = root.remove(comparator(), e, occurrences, result); in remove()
297 rootReference.checkAndSet(root, newRoot); in remove()
318 AvlNode<E> newRoot = root.setCount(comparator(), element, count, result); in setCount() local
319 rootReference.checkAndSet(root, newRoot); in setCount()
[all …]
/external/guava/guava/src/com/google/common/collect/
DTreeMultiset.java268 AvlNode<E> newRoot = new AvlNode<E>(element, occurrences); in add() local
269 successor(header, newRoot, header); in add()
270 rootReference.checkAndSet(root, newRoot); in add()
274 AvlNode<E> newRoot = root.add(comparator(), element, occurrences, result); in add() local
275 rootReference.checkAndSet(root, newRoot); in add()
288 AvlNode<E> newRoot; in remove() local
295 newRoot = root.remove(comparator(), e, occurrences, result); in remove()
299 rootReference.checkAndSet(root, newRoot); in remove()
320 AvlNode<E> newRoot = root.setCount(comparator(), element, count, result); in setCount() local
321 rootReference.checkAndSet(root, newRoot); in setCount()
[all …]
/external/antlr/runtime/Cpp/include/
Dantlr3commontreeadaptor.hpp65 TreeType* becomeRoot( TreeType* newRoot, TreeType* oldRoot);
68 TreeType* becomeRootToken(CommonTokenType* newRoot, TreeType* oldRoot);
146 TreeType* becomeRootToken(TreeType* newRoot, TreeType* oldRoot);
/external/antlr/runtime/C/src/
Dantlr3basetreeadaptor.c51 …TREE becomeRoot (pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE newRoot, pANTLR3_BASE_TRE…
52 …EE dbgBecomeRoot (pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE newRoot, pANTLR3_BASE_TRE…
56 static pANTLR3_BASE_TREE becomeRootToken (pANTLR3_BASE_TREE_ADAPTOR adaptor, void * newRoot, pANT…
57 static pANTLR3_BASE_TREE dbgBecomeRootToken (pANTLR3_BASE_TREE_ADAPTOR adaptor, void * newRoot, pA…
740 becomeRootToken (pANTLR3_BASE_TREE_ADAPTOR adaptor, void * newRoot, pANTLR3_BASE_TREE oldRoot) in becomeRootToken() argument
742 …REE)adaptor->becomeRoot(adaptor, adaptor->create(adaptor, (pANTLR3_COMMON_TOKEN)newRoot), oldRoot); in becomeRootToken()
745 dbgBecomeRootToken (pANTLR3_BASE_TREE_ADAPTOR adaptor, void * newRoot, pANTLR3_BASE_TREE oldRoot) in dbgBecomeRootToken() argument
749 …REE)adaptor->becomeRoot(adaptor, adaptor->create(adaptor, (pANTLR3_COMMON_TOKEN)newRoot), oldRoot); in dbgBecomeRootToken()
/external/antlr/runtime/Python/unittests/
Dtesttree.py670 newRoot = CommonTree(CommonToken(5))
677 self.adaptor.becomeRoot(newRoot, oldRoot)
678 newRoot.sanityCheckParentAndChildIndexes()
683 newRoot = CommonTree(CommonToken(5))
689 self.adaptor.becomeRoot(newRoot, oldRoot)
690 newRoot.sanityCheckParentAndChildIndexes()
695 newRoot = CommonTree(None)
696 newRoot.addChild(CommonTree(CommonToken(5)))
703 self.adaptor.becomeRoot(newRoot, oldRoot)
704 newRoot.sanityCheckParentAndChildIndexes()
[all …]
/external/antlr/runtime/Python3/unittests/
Dtesttree.py667 newRoot = CommonTree(CommonToken(5))
674 self.adaptor.becomeRoot(newRoot, oldRoot)
675 newRoot.sanityCheckParentAndChildIndexes()
680 newRoot = CommonTree(CommonToken(5))
686 self.adaptor.becomeRoot(newRoot, oldRoot)
687 newRoot.sanityCheckParentAndChildIndexes()
692 newRoot = CommonTree(None)
693 newRoot.addChild(CommonTree(CommonToken(5)))
700 self.adaptor.becomeRoot(newRoot, oldRoot)
701 newRoot.sanityCheckParentAndChildIndexes()
[all …]

123