OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:PathPieces
(Results
1 - 7
of
7
) sorted by null
/external/clang/include/clang/StaticAnalyzer/Core/BugReporter/
PathDiagnostic.h
417
class
PathPieces
: public std::list<IntrusiveRefCntPtr<PathDiagnosticPiece> > {
418
void flattenTo(
PathPieces
&Primary,
PathPieces
&Current,
421
~
PathPieces
();
423
PathPieces
flatten(bool ShouldFlattenMacros) const {
424
PathPieces
Result;
553
PathDiagnosticCallPiece(
PathPieces
&oldPath, const Decl *caller)
572
PathPieces
path;
598
for (
PathPieces
::iterator I = path.begin(),
606
static PathDiagnosticCallPiece *construct(
PathPieces
&pieces
[
all
...]
BugReporter.h
455
bool RemoveUnneededCalls(
PathPieces
&pieces, BugReport *R);
/external/clang/lib/StaticAnalyzer/Core/
PathDiagnostic.cpp
32
for (
PathPieces
::const_iterator I = subPieces.begin(), E = subPieces.end();
65
PathPieces
::~
PathPieces
() {}
67
void
PathPieces
::flattenTo(
PathPieces
&Primary,
PathPieces
&Current,
69
for (
PathPieces
::const_iterator I = begin(), E = end(); I != E; ++I) {
92
PathPieces
NewPath;
141
const
PathPieces
&Path = CP->path;
217
SmallVector<const
PathPieces
*, 5> WorkList
[
all
...]
PlistDiagnostics.cpp
228
for (
PathPieces
::const_iterator I = P.path.begin(), E = P.path.end();I!=E;++I)
247
for (
PathPieces
::const_iterator I = P.subPieces.begin(), E=P.subPieces.end();
306
SmallVector<const
PathPieces
*, 5> WorkList;
310
const
PathPieces
&path = *WorkList.pop_back_val();
312
for (
PathPieces
::const_iterator I = path.begin(), E = path.end(); I != E;
377
for (
PathPieces
::const_iterator I = D->path.begin(), E = D->path.end();
BugReporter.cpp
97
/// An optimization pass over
PathPieces
that removes redundant diagnostics
102
static void removeRedundantMsgs(
PathPieces
&path) {
150
typedef llvm::DenseMap<const
PathPieces
*, const LocationContext *>
156
static bool removeUnneededCalls(
PathPieces
&pieces, BugReport *R,
218
adjustCallLocations(
PathPieces
&Pieces,
220
for (
PathPieces
::iterator I = Pieces.begin(), E = Pieces.end(); I != E; ++I) {
253
static void removeEdgesToDefaultInitializers(
PathPieces
&Pieces) {
254
for (
PathPieces
::iterator I = Pieces.begin(), E = Pieces.end(); I != E;) {
269
PathPieces
::iterator Next = std::next(I);
288
static void removePiecesWithInvalidLocations(
PathPieces
&Pieces)
[
all
...]
HTMLDiagnostics.cpp
120
PathPieces
path = D.path.flatten(/*ShouldFlattenMacros=*/false);
156
for (
PathPieces
::const_reverse_iterator I = path.rbegin(),
556
for (
PathPieces
::const_iterator I = P.subPieces.begin(), E=P.subPieces.end();
/external/clang/lib/StaticAnalyzer/Frontend/
AnalysisConsumer.cpp
121
PathPieces
FlatPath = PD->path.flatten(/*ShouldFlattenMacros=*/true);
122
for (
PathPieces
::const_iterator PI = FlatPath.begin(),
Completed in 506 milliseconds