/external/clang/lib/StaticAnalyzer/Core/ |
H A D | BasicValueFactory.cpp | 83 APSIntSet.InsertNode(P, InsertPos); 120 CompoundValDataSet.InsertNode(D, InsertPos); 139 LazyCompoundValDataSet.InsertNode(D, InsertPos); 255 Map.InsertNode(P, InsertPos); 280 Map.InsertNode(P, InsertPos);
|
H A D | SymbolManager.cpp | 159 DataSet.InsertNode(SD, InsertPos); 178 DataSet.InsertNode(SD, InsertPos); 196 DataSet.InsertNode(SD, InsertPos); 212 DataSet.InsertNode(SD, InsertPos); 230 DataSet.InsertNode(SD, InsertPos); 247 DataSet.InsertNode(data, InsertPos); 265 DataSet.InsertNode(data, InsertPos); 283 DataSet.InsertNode(data, InsertPos); 301 DataSet.InsertNode(data, InsertPos);
|
H A D | MemRegion.cpp | 51 Regions.InsertNode(R, InsertPos); 69 Regions.InsertNode(R, InsertPos); 90 Regions.InsertNode(R, InsertPos); 109 Regions.InsertNode(R, InsertPos); 128 Regions.InsertNode(R, InsertPos); 919 Regions.InsertNode(R, InsertPos);
|
H A D | ExplodedGraph.cpp | 328 Nodes.InsertNode(V, InsertPos);
|
H A D | PathDiagnostic.cpp | 280 Diags.InsertNode(OwningD.release()); 470 InsertNode(Entry, InsertPos);
|
H A D | ProgramState.cpp | 399 StateSet.InsertNode(newState, InsertPos);
|
/external/llvm/include/llvm/ADT/ |
H A D | FoldingSet.h | 89 /// should be inserted using InsertNode. 94 /// InsertNode(N, InsertPoint); 164 /// InsertNode - Insert the specified node into the folding set, knowing that 167 void InsertNode(Node *N, void *InsertPos); 169 /// InsertNode - Insert the specified node into the folding set, knowing that 171 void InsertNode(Node *N) { function in class:llvm::FoldingSetImpl 617 /// InsertNode - Insert the specified node into the folding set, knowing that 620 void InsertNode(T *N, void *InsertPos) { function in class:llvm::FoldingSetVector 621 Set.InsertNode(N, InsertPos); 625 /// InsertNode 627 void InsertNode(T *N) { function in class:llvm::FoldingSetVector [all...] |
H A D | ImmutableList.h | 182 Cache.InsertNode(L, InsertPos);
|
/external/llvm/lib/Support/ |
H A D | FoldingSet.cpp | 268 InsertNode(NodeInBucket, 304 /// InsertNode - Insert the specified node into the folding set, knowing that it 307 void FoldingSetImpl::InsertNode(Node *N, void *InsertPos) { function in class:FoldingSetImpl 383 InsertNode(N, IP);
|
/external/lzma/C/ |
H A D | Ppmd7.c | 118 static void InsertNode(CPpmd7 *p, void *node, unsigned indx)
function 138 InsertNode(p, ((Byte *)ptr) + U2B(k), nu - k - 1);
140 InsertNode(p, ptr, i);
204 InsertNode(p, node, PPMD_NUM_INDEXES - 1);
208 InsertNode(p, node + k, nu - k - 1);
210 InsertNode(p, node, i);
270 InsertNode(p, oldPtr, i0);
525 InsertNode(p, oldPtr, i);
621 InsertNode(p, stats, U2I(((numStats + 1) >> 1)));
|
/external/chromium_org/ui/gfx/geometry/ |
H A D | r_tree.h | 129 InsertNode(record.Pass(), &highest_reinsert_level);
|
H A D | r_tree_base.h | 278 // recursive calls from within InsertNode(). 279 void InsertNode(scoped_ptr<NodeBase> node, int* highest_reinsert_level);
|
H A D | r_tree_base.cc | 540 void RTreeBase::InsertNode( function in class:gfx::RTreeBase 593 InsertNode(make_scoped_ptr(temp_ptr), highest_reinsert_level); 638 InsertNode(make_scoped_ptr(temp_ptr), &starting_level);
|
/external/clang/lib/AST/ |
H A D | ASTContext.cpp | 673 CanonTemplateTemplateParms.InsertNode(Canonical, InsertPos); 2027 ExtQualNodes.InsertNode(eq, insertPos); 2137 ComplexTypes.InsertNode(New, InsertPos); 2165 PointerTypes.InsertNode(New, InsertPos); 2186 AdjustedTypes.InsertNode(AT, InsertPos); 2225 AdjustedTypes.InsertNode(AT, InsertPos); 2257 BlockPointerTypes.InsertNode(New, InsertPos); 2297 LValueReferenceTypes.InsertNode(New, InsertPos); 2333 RValueReferenceTypes.InsertNode(New, InsertPos); 2364 MemberPointerTypes.InsertNode(Ne [all...] |
H A D | DeclarationName.cpp | 419 SpecialNames->InsertNode(SpecialName, InsertPos); 447 LiteralNames->InsertNode(LiteralName, InsertPos);
|
H A D | DeclTemplate.cpp | 274 getSpecializations().InsertNode(Info, InsertPos); 361 getSpecializations().InsertNode(D, InsertPos); 382 getPartialSpecializations().InsertNode(D, InsertPos); 994 getSpecializations().InsertNode(D, InsertPos); 1014 getPartialSpecializations().InsertNode(D, InsertPos);
|
H A D | NestedNameSpecifier.cpp | 39 Context.NestedNameSpecifiers.InsertNode(NNS, InsertPos);
|
/external/clang/lib/Analysis/ |
H A D | AnalysisDeclContext.cpp | 346 Contexts.InsertNode(L, InsertPos); 363 Contexts.InsertNode(L, InsertPos); 388 Contexts.InsertNode(L, InsertPos);
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
H A D | SelectionDAG.cpp | 1187 CSEMap.InsertNode(N, IP); 1229 CSEMap.InsertNode(N, IP); 1292 CSEMap.InsertNode(N, IP); 1307 CSEMap.InsertNode(N, IP); 1327 CSEMap.InsertNode(N, IP); 1354 CSEMap.InsertNode(N, IP); 1382 CSEMap.InsertNode(N, IP); 1400 CSEMap.InsertNode(N, IP); 1414 CSEMap.InsertNode(N, IP); 1596 CSEMap.InsertNode( [all...] |
/external/llvm/lib/IR/ |
H A D | Metadata.cpp | 264 pImpl->MDNodeSet.InsertNode(N, InsertPoint); 390 pImpl->MDNodeSet.InsertNode(this, InsertPoint);
|
H A D | Attributes.cpp | 51 pImpl->AttrsSet.InsertNode(PA, InsertPoint); 71 pImpl->AttrsSet.InsertNode(PA, InsertPoint); 436 pImpl->AttrsSetNodes.InsertNode(PA, InsertPoint); 554 pImpl->AttrsLists.InsertNode(PA, InsertPoint);
|
/external/clang/lib/Basic/ |
H A D | IdentifierTable.cpp | 544 SelTabImpl.Table.InsertNode(SI, InsertPos);
|
/external/llvm/lib/TableGen/ |
H A D | Record.cpp | 470 ThePool.InsertNode(I, IP); 636 ThePool.InsertNode(I, IP); 1568 ThePool.InsertNode(I, IP);
|
/external/llvm/lib/Analysis/ |
H A D | ScalarEvolution.cpp | 319 UniqueSCEVs.InsertNode(S, IP); 896 UniqueSCEVs.InsertNode(S, IP); 1055 UniqueSCEVs.InsertNode(S, IP); 1335 UniqueSCEVs.InsertNode(S, IP); 1854 UniqueSCEVs.InsertNode(S, IP); 2148 UniqueSCEVs.InsertNode(S, IP); 2269 UniqueSCEVs.InsertNode(S, IP); 2468 UniqueSCEVs.InsertNode(S, IP); 2574 UniqueSCEVs.InsertNode(S, IP); 2678 UniqueSCEVs.InsertNode( [all...] |
/external/clang/lib/StaticAnalyzer/Checkers/ |
H A D | RetainCountChecker.cpp | 843 SimpleSummaries.InsertNode(N, Pos);
|