| /device/linaro/bootloader/edk2/MdePkg/Library/BaseOrderedCollectionRedBlackTreeLib/ |
| BaseOrderedCollectionRedBlackTreeLib.c | 417 @param[out] NewRoot If Pivot has a parent node on input, then the
419 according to the rotation, and NewRoot is not
424 new root node of the tree in NewRoot.
429 OUT RED_BLACK_TREE_NODE **NewRoot
446 *NewRoot = LeftChild;
482 @param[out] NewRoot If Pivot has a parent node on input, then the
484 according to the rotation, and NewRoot is not
489 new root node of the tree in NewRoot.
494 OUT RED_BLACK_TREE_NODE **NewRoot
511 *NewRoot = RightChild;
[all...] |
| /external/libtextclassifier/utils/ |
| flatbuffers_test.cc | 49 std::unique_ptr<ReflectiveFlatbuffer> buffer = reflective_builder.NewRoot();
76 std::unique_ptr<ReflectiveFlatbuffer> buffer = reflective_builder.NewRoot();
109 std::unique_ptr<ReflectiveFlatbuffer> buffer = reflective_builder.NewRoot();
127 std::unique_ptr<ReflectiveFlatbuffer> buffer = reflective_builder.NewRoot();
165 std::unique_ptr<ReflectiveFlatbuffer> buffer = reflective_builder.NewRoot();
196 std::unique_ptr<ReflectiveFlatbuffer> buffer = reflective_builder.NewRoot();
218 std::unique_ptr<ReflectiveFlatbuffer> buffer = reflective_builder.NewRoot();
257 std::unique_ptr<ReflectiveFlatbuffer> buffer = reflective_builder.NewRoot();
277 std::unique_ptr<ReflectiveFlatbuffer> buffer = reflective_builder.NewRoot();
|
| flatbuffers.h | 324 std::unique_ptr<ReflectiveFlatbuffer> NewRoot() const;
|
| flatbuffers.cc | 68 std::unique_ptr<ReflectiveFlatbuffer> ReflectiveFlatbufferBuilder::NewRoot()
|
| /external/llvm/lib/CodeGen/ |
| MachineCombiner.cpp | 68 unsigned getLatency(MachineInstr *Root, MachineInstr *NewRoot,
123 /// \returns Depth of last instruction in \InsInstrs ("NewRoot")
177 /// \param Root is a machine instruction that could be replaced by NewRoot.
178 /// It is used to compute a more accurate latency information for NewRoot in
180 /// \param NewRoot is the instruction for which the latency is computed
183 /// \returns Latency of \p NewRoot
184 unsigned MachineCombiner::getLatency(MachineInstr *Root, MachineInstr *NewRoot,
189 // Check each definition in NewRoot and compute the latency
192 for (const MachineOperand &MO : NewRoot->operands()) {
205 NewRoot, NewRoot->findRegisterDefOperandIdx(MO.getReg()), UseMO
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/ |
| MachineCombiner.cpp | 92 unsigned getLatency(MachineInstr *Root, MachineInstr *NewRoot,
156 /// \returns Depth of last instruction in \InsInstrs ("NewRoot")
210 /// \param Root is a machine instruction that could be replaced by NewRoot.
211 /// It is used to compute a more accurate latency information for NewRoot in
213 /// \param NewRoot is the instruction for which the latency is computed
216 /// \returns Latency of \p NewRoot
217 unsigned MachineCombiner::getLatency(MachineInstr *Root, MachineInstr *NewRoot,
222 // Check each definition in NewRoot and compute the latency
225 for (const MachineOperand &MO : NewRoot->operands()) {
238 NewRoot, NewRoot->findRegisterDefOperandIdx(MO.getReg()), UseMO
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/Hexagon/ |
| HexagonISelDAGToDAG.cpp | [all...] |
| /external/antlr/runtime/Delphi/Sources/Antlr3.Runtime.Tests/ |
| Antlr.Runtime.Tree.Tests.pas | 253 OldRoot, NewRoot: ICommonTree;
257 NewRoot := TCommonTree.Create(TCommonToken.Create(5));
263 Adaptor.BecomeRoot(NewRoot, OldRoot);
264 NewRoot.SanityCheckParentAndChildIndexes;
269 OldRoot, NewRoot: ICommonTree;
273 NewRoot := TCommonTree.Create(TCommonToken.Create(5));
278 Adaptor.BecomeRoot(NewRoot, OldRoot);
279 NewRoot.SanityCheckParentAndChildIndexes;
284 OldRoot, NewRoot: ICommonTree;
288 NewRoot := TCommonTree.Create(IToken(nil))
[all...] |
| /external/libtextclassifier/actions/ |
| lua-utils.cc | 218 auto buffer = ReflectiveFlatbufferBuilder(entity_data_schema).NewRoot();
296 ReflectiveFlatbufferBuilder(actions_entity_data_schema).NewRoot();
|
| lua-ranker_test.cc | 233 std::unique_ptr<ReflectiveFlatbuffer> buffer = builder.NewRoot();
|
| actions-suggestions.cc | [all...] |
| actions-suggestions_test.cc | 761 entity_data_builder.NewRoot();
[all...] |
| /external/libtextclassifier/utils/intents/ |
| jni.cc | 221 std::unique_ptr<ReflectiveFlatbuffer> buffer = entity_data_builder.NewRoot();
|
| /external/antlr/runtime/Delphi/Sources/Antlr3.Runtime/ |
| Antlr.Runtime.Tree.pas | 134 /// If oldRoot is a nil root, just copy or move the children to newRoot.
135 /// If not a nil root, make oldRoot a child of newRoot.
142 /// If newRoot is a nil-rooted single child tree, use the single
148 /// If oldRoot was null, it's ok, just return newRoot (even if isNil).
153 /// Return newRoot. Throw an exception if newRoot is not a
155 /// node. If newRoot is ^(nil x) return x as newRoot.
157 /// Be advised that it's ok for newRoot to point at oldRoot's
162 function BecomeRoot(const NewRoot, OldRoot: IANTLRInterface): IANTLRInterface; overload
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
| SelectionDAGBuilder.cpp | [all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGBuilder.cpp | [all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGBuilder.cpp | [all...] |
| /external/libtextclassifier/annotator/ |
| annotator.cc | [all...] |
