HomeSort by: relevance | last modified time | path
    Searched defs:Point (Results 1 - 12 of 12) sorted by relevancy

  /src/external/apache2/llvm/dist/clang/lib/Tooling/Refactoring/Rename/
USRFinder.cpp 10 /// point.
35 // Finds the NamedDecl at a point in the source.
36 // \param Point the location in the source to search for the NamedDecl.
37 explicit NamedDeclOccurrenceFindingVisitor(const SourceLocation Point,
41 Point(Point), Context(Context) {}
61 // Determines if the Point is within Start and End.
63 // FIXME: Add tests for Point == End.
64 return Point == Start || Point == End |
    [all...]
USRFindingAction.cpp 252 const SourceLocation Point = SourceMgr.getLocForStartOfFile(MainFileID)
255 ? getNamedDeclAt(Context, Point)
260 FullSourceLoc FullLoc(Point, SourceMgr);
264 Engine.Report(Point, CouldNotFindSymbolAt) << SymbolOffset;
  /src/external/apache2/llvm/dist/llvm/tools/llvm-exegesis/lib/
Clustering.cpp 49 if (PMeasurements.empty()) // Error point.
67 if (Measurements.empty()) // Error point.
77 // And now check that every point is a neighbour of the centroid. Also O(N).
82 if (PMeasurements.empty()) // Error point.
83 return true; // Pretend that error point is a neighbour.
102 const auto &Point = Points_[P];
103 if (!Point.Error.empty()) {
108 const auto *CurMeasurement = &Point.Measurements;
145 ClusterIdForPoint_[P] = CurrentCluster.Id; /* Label initial point */
152 // Retrieve a point from the set
    [all...]
Analysis.cpp 125 // point coordinates (measurements).
128 const InstructionBenchmark &Point = Clustering_.getPoints()[PointId];
131 writeSnippet<EscapeTag, kEscapeCsv>(OS, Point.AssembledSnippet, "; ");
133 writeEscaped<kEscapeCsv>(OS, Point.Key.Config);
135 assert(!Point.Key.Instructions.empty());
136 const MCInst &MCI = Point.keyInstruction();
147 for (const auto &Measurement : Point.Measurements) {
222 const InstructionBenchmark &Point = Points[PointId];
223 if (!Point.Error.empty())
225 assert(!Point.Key.Instructions.empty())
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
LoopVectorizationPlanner.h 63 /// Clear the insertion point: created instructions will not be inserted into
73 /// InsertPoint - A saved insertion point.
76 VPBasicBlock::iterator Point;
79 /// Creates a new insertion point which doesn't point to anything.
82 /// Creates a new insertion point at the given location.
84 : Block(InsertBlock), Point(InsertPoint) {}
86 /// Returns true if this insert point is set.
90 VPBasicBlock::iterator getPoint() const { return Point; }
93 /// Sets the current insert point to a previously-saved location
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Utils/
ScalarEvolutionExpander.h 123 // RAII object that stores the current insertion point and restores it when
131 BasicBlock::iterator Point;
140 : Builder(B), Block(B.GetInsertBlock()), Point(B.GetInsertPoint()),
151 Builder.restoreIP(IRBuilderBase::InsertPoint(Block, Point));
155 BasicBlock::iterator GetInsertPoint() const { return Point; }
156 void SetInsertPoint(BasicBlock::iterator I) { Point = I; }
185 // Make sure the insert point guard stack is consistent.
230 /// At is a parameter which specifies point in code where user is going to
276 /// insertion point. If a type is specified, the result will be expanded to
335 /// Set the current insertion point. This is useful if multiple calls t
    [all...]
  /src/external/apache2/llvm/dist/llvm/tools/llvm-profgen/
ProfileGenerator.cpp 123 // Sum of sample counts beginning at this point
125 // Sum of sample counts ending at this point
142 If there is a boundary point that both begin and end, the point itself
181 BoundaryPoint &Point = Item.second;
182 if (Point.BeginCount) {
185 Count += Point.BeginCount;
188 if (Point.EndCount) {
189 assert(BeginAddress && "First boundary point cannot be 'end' point");
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
DependenceAnalysis.h 16 // There's a single entry point that analyzes the dependence between a pair
381 /// 4) Point - A point <x, y> representing the dependence from
386 enum ConstraintKind { Empty, Point, Distance, Line, Any } Kind;
397 /// isPoint - Return true if the constraint is of kind Point.
398 bool isPoint() const { return Kind == Point; }
411 /// getX - If constraint is a point <X, Y>, returns X.
415 /// getY - If constraint is a point <X, Y>, returns Y.
438 /// setPoint - Change a constraint to Point.
881 /// propagatePoint - Attempt to propagate a point
    [all...]
  /src/external/apache2/llvm/dist/llvm/tools/sancov/
sancov.cpp 132 // Contents of .sancov file: list of coverage point addresses that were
145 // Coverage point has an opaque Id and corresponds to multiple source locations.
302 for (const auto &Point : Points) {
303 for (const DILineInfo &Loc : Point.Locs) {
304 PointsByFile[Loc.FileName].push_back(&Point);
324 for (const CoveragePoint *Point : P.second) {
325 for (const auto &Loc : Point->Locs) {
328 if (WrittenIds.find(Point->Id) != WrittenIds.end())
332 WrittenIds.insert(Point->Id);
333 W.attribute(Point->Id
    [all...]
  /src/external/gpl2/mkhybrid/dist/libhfs_iso/
internal.h 100 } Point;
112 Point frLocation; /* folder's location */
117 Point frScroll; /* scroll position */
128 Point fdLocation; /* file's location */
  /src/external/apache2/llvm/dist/llvm/include/llvm/IR/
IRBuilder.h 62 /// By default, this inserts the instruction at the insertion point.
171 /// Clear the insertion point: created instructions will not be
199 /// specified point.
250 /// InsertPoint - A saved insertion point.
253 BasicBlock::iterator Point;
256 /// Creates a new insertion point which doesn't point to anything.
259 /// Creates a new insertion point at the given location.
261 : Block(InsertBlock), Point(InsertPoint) {}
263 /// Returns true if this insert point is set
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
CodeGenPrepare.cpp 1223 // The first insertion point of a block containing an EH pad is after the
1372 // Finally, we need to ensure that the insert point will dominate all
1402 // to the cmp point does not really increase register pressure.
2645 } Point;
2656 Point.PrevInst = &*--It;
2658 Point.BB = Inst->getParent();
2666 Inst->insertAfter(Point.PrevInst);
2668 Instruction *Position = &*Point.BB->getFirstInsertionPt();
2965 /// Restoration point.
2966 /// The restoration point is a pointer to an action instead of an iterato
    [all...]

Completed in 24 milliseconds