HomeSort by relevance Sort by last modified time
    Searched refs:Regions (Results 1 - 25 of 25) sorted by null

  /external/llvm/lib/ProfileData/
CoverageMapping.cpp 201 assert(!Record.MappingRegions.empty() && "Function has no regions");
279 // Avoid creating empty regions.
311 /// Build a list of CoverageSegments from a sorted list of Regions.
312 std::vector<CoverageSegment> buildSegments(ArrayRef<CountedRegion> Regions) {
314 for (const auto &Region : Regions) {
315 // Pop any regions that end before this one starts.
330 // Pop any regions that are left in the stack.
384 /// Sort a nested sequence of regions from a single file.
401 std::vector<coverage::CountedRegion> Regions;
410 Regions.push_back(CR)
    [all...]
  /external/llvm/unittests/ProfileData/
CoverageMappingTest.cpp 56 ArrayRef<CounterMappingRegion> Regions;
61 ArrayRef<CounterMappingRegion> Regions)
62 : Name(Name), Hash(Hash), Filenames(Filenames), Regions(Regions),
74 Record.MappingRegions = Regions;
144 std::string Regions = writeCoverageRegions();
145 readCoverageRegions(Regions);
  /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
SubEngine.h 128 ArrayRef<const MemRegion *> Regions,
145 ArrayRef<const MemRegion *> Regions,
ExprEngine.h 291 ArrayRef<const MemRegion *> Regions,
500 /// \param[in] ITraits Specifies invalidation traits for regions/symbols.
505 ArrayRef<const MemRegion *> Regions,
575 /// \brief Conservatively evaluate call by invalidating regions and binding
ProgramState.h 198 /// Utility method for getting regions.
220 /// \brief Returns the state with bindings for the given regions
223 /// Optionally invalidates global regions as well.
225 /// \param Regions the set of regions to be invalidated.
234 /// \param Call if non-null, the invalidated regions represent parameters to
239 invalidateRegions(ArrayRef<const MemRegion *> Regions, const Expr *E,
246 invalidateRegions(ArrayRef<SVal> Regions, const Expr *E,
307 /// \brief Visits the symbols reachable from the regions in the given
MemRegion.h 1 //== MemRegion.h - Abstract memory regions for static analysis --*- C++ -*--==//
76 /// MemRegion - The root abstract class for all memory regions.
97 // Untyped regions.
100 // Typed regions.
111 // Decl Regions.
412 /// SubRegion - A region that subsets another larger region. Most regions
475 /// TypedRegion - An abstract class representing regions that are typed.
497 /// TypedValueRegion - An abstract class representing regions having a typed value.
585 /// Blocks are represented with two kinds of regions. BlockTextRegions
626 /// Blocks are represented with two kinds of regions. BlockTextRegion
    [all...]
  /external/llvm/lib/MC/
MCMachOStreamer.cpp 215 std::vector<DataRegionData> &Regions = getAssembler().getDataRegions();
216 Regions.push_back(Data);
222 std::vector<DataRegionData> &Regions = getAssembler().getDataRegions();
223 assert(!Regions.empty() && "Mismatched .end_data_region!");
224 DataRegionData &Data = Regions.back();
  /external/clang/lib/StaticAnalyzer/Core/
MemRegion.cpp 1 //== MemRegion.cpp - Abstract memory regions for static analysis --*- C++ -*--//
45 RegionTy* R = cast_or_null<RegionTy>(Regions.FindNodeOrInsertPos(ID,
51 Regions.InsertNode(R, InsertPos);
63 RegionTy* R = cast_or_null<RegionTy>(Regions.FindNodeOrInsertPos(ID,
69 Regions.InsertNode(R, InsertPos);
84 RegionTy* R = cast_or_null<RegionTy>(Regions.FindNodeOrInsertPos(ID,
90 Regions.InsertNode(R, InsertPos);
103 RegionTy* R = cast_or_null<RegionTy>(Regions.FindNodeOrInsertPos(ID,
109 Regions.InsertNode(R, InsertPos);
122 RegionTy* R = cast_or_null<RegionTy>(Regions.FindNodeOrInsertPos(ID
    [all...]
ProgramState.cpp 139 ProgramState::invalidateRegions(RegionList Regions,
147 for (RegionList::const_iterator I = Regions.begin(),
148 End = Regions.end(); I != End; ++I)
236 // We only want to do fetches from regions that we can actually bind
516 // regions right now.
598 // If this is a subregion, also visit the parent regions.
612 // Regions captured by a block are also implicitly reachable.
CheckerManager.cpp 474 ArrayRef<const MemRegion *> Regions,
482 ExplicitRegions, Regions, Call);
RegionStore.cpp 54 assert(r && Base && "Must have known regions.");
61 assert(r && "Must have known regions.");
345 /// regions.
382 // Binding values to regions.
552 /// RegionStore's internal analysis. It must always contain all regions and
631 /// Used to determine which global regions are automatically included in the
634 /// Don't include any global regions.
638 /// Include all global regions.
668 /// regions specially included at the start of analysis.
748 assert(R == R->getBaseRegion() && "Should only be called for base regions");
    [all...]
ExprEngine.cpp 272 ArrayRef<const MemRegion *> Regions,
275 Explicits, Regions, Call);
    [all...]
BugReporter.cpp     [all...]
  /external/clang/lib/StaticAnalyzer/Checkers/
CheckerDocumentation.cpp 219 /// contents of any regions change.
221 /// Since it is not necessarily cheap to compute which regions are being
226 /// \brief Called when the contents of one or more regions change.
234 /// \param ExplicitRegions The regions explicitly requested for invalidation.
237 /// \param Regions The transitive closure of regions accessible from,
238 /// \p ExplicitRegions, i.e. all regions that may have been touched
253 ArrayRef<const MemRegion *> Regions,
MallocChecker.cpp     [all...]
CStringChecker.cpp 72 ArrayRef<const MemRegion *> Regions,
642 // FIXME: Handle element regions by upper-bounding the parent region's
647 // Other regions (mostly non-data) can't have a reliable C string length.
743 // Modifying the contents of string regions is undefined [C99 6.4.5p6],
764 // Other regions (mostly non-data) can't have a reliable C string length.
845 // Invalidate and escape only indirect regions accessible through the source
    [all...]
  /external/clang/include/clang/StaticAnalyzer/Core/BugReporter/
BugReporter.h 87 typedef llvm::DenseSet<const MemRegion *> Regions;
96 /// A (stack of) set of regions that are registered with this report as being
101 SmallVector<Regions *, 2> interestingRegions;
139 Regions &getInterestingRegions();
281 /// Ranges are used to highlight regions of interest in the source code.
  /development/samples/ApiDemos/src/com/example/android/apis/graphics/
Regions.java 24 public class Regions extends GraphicsActivity {
  /external/clang/include/clang/StaticAnalyzer/Core/
CheckerManager.h 313 /// \param ExplicitRegions The regions explicitly requested for invalidation.
315 /// \param Regions The transitive closure of accessible regions,
316 /// i.e. all regions that may have been touched by this change.
317 /// \param Call The call expression wrapper if the regions are invalidated
323 ArrayRef<const MemRegion *> Regions,
428 ArrayRef<const MemRegion *> Regions,
Checker.h 294 ArrayRef<const MemRegion *> Regions,
297 Explicits, Regions, Call);
  /external/llvm/include/llvm/Analysis/
RegionInfoImpl.h 9 // Detects single entry single exit regions in the control flow graph.
48 // Only clean the cache for this Region. Caches of child Regions will be
49 // cleaned when the child Regions are deleted.
701 // Tried to create regions from entry to lastExit. Next time take a
714 // regions from the bottom of the dominance tree. If the small regions are
715 // detected first, detection of bigger regions is faster, as we can jump
716 // over the small regions.
854 assert(A && B && "One of the Regions is NULL");
867 RegionInfoBase<Tr>::getCommonRegion(SmallVectorImpl<RegionT *> &Regions) const
    [all...]
RegionInfo.h 11 // regions.
100 /// iterate in Flat mode. During a Flat mode iteration all Regions are entered
154 /// example a BasicBlock is element of two Regions, there exist two
208 /// Regions.
212 /// Two canonical Regions either do not intersect at all or one is
216 /// Regions in the control flow graph and E is the \e parent relation of these
217 /// Regions.
222 /// A simple control flow graph, that contains two regions.
238 /// <tt> "opt -regions -analyze anyprogram.ll" </tt>
240 /// <tt> "opt -view-regions-only anyprogram.ll" </tt
    [all...]
  /external/clang/lib/CodeGen/
CoverageMappingGen.cpp 98 /// \brief The coverage mapping regions for this function
100 /// \brief The source mapping regions for this function.
153 /// \brief Find the set of files we have regions for and assign IDs
157 /// expansion regions.
206 /// \brief Gather all the regions that were skipped by the preprocessor
210 /// for mapping regions from the appropriate source files.
238 // Make sure that we only collect the regions that are inside
246 /// \brief Generate the coverage counter mapping regions from collected
247 /// source regions.
256 // Ignore regions that don't have a file, such as builtin macros
    [all...]
  /external/clang/tools/libclang/
Indexing.cpp 72 /// As an example of different regions separated by preprocessor directives:
86 /// There are 3 regions, with non-consecutive parts:
163 void update(ArrayRef<PPRegion> Regions) {
165 ParsedRegions.insert(Regions.begin(), Regions.end());
    [all...]
  /external/libunwind/doc/
libunwind-dynamic.tex 41 A procedure logically consists of a sequence of \emph{regions}.
42 Regions are nested in the sense that the frame state at the end of one
53 prologues of several (nested) regions.
151 \item[\Type{unw\_dyn\_region\_info\_t~*}\Var{regions}] A NULL-terminated
213 \section{Regions descriptors}
239 \emph{empty region} and such regions are perfectly legal. In fact,
240 empty regions can be useful to establish a particular frame state
247 two regions: one covering the prologue and one covering the epilogue.
302 Empty regions by definition contain no actual instructions and as such

Completed in 415 milliseconds