HomeSort by relevance Sort by last modified time
    Searched refs:End (Results 76 - 100 of 251) sorted by null

1 2 34 5 6 7 8 91011

  /external/freetype/src/sfnt/
ttpost.c 251 " truncating at end of post table (%d byte left)\n",
523 goto End;
546 goto End;
558 End:
563 /* END */
  /external/llvm/lib/Target/X86/Utils/
X86ShuffleDecode.cpp 177 unsigned End = NumLaneElts / 2;
179 for (unsigned i = Start; i != End; ++i) {
185 End += NumLaneElts;
  /external/clang/lib/Rewrite/
RewriteRope.cpp 123 } // end anonymous namespace
229 } // end anonymous namespace
241 // Fastpath for a common case. There is already a splitpoint at the end.
461 } // end anonymous namespace
503 // Fastpath for a common case. Insert at end of last child.
513 // Insert at the end of this child.
586 // must be deleting to the end of the child.
682 else // Empty tree, this is an end() iterator.
701 else // Hit end().
765 RopePiece RewriteRope::MakeRopeString(const char *Start, const char *End) {
    [all...]
  /external/llvm/include/llvm/Bitcode/
BitstreamReader.h 56 BitstreamReader(const unsigned char *Start, const unsigned char *End) {
58 init(Start, End);
61 void init(const unsigned char *Start, const unsigned char *End) {
63 LastChar = End;
64 assert(((End-Start) & 3) == 0 &&"Bitcode stream not a multiple of 4 bytes");
274 // If we run out of data, stop at the end of the stream.
514 // Figure out where the end of this blob will be including tail padding.
517 // If this would read off the end of the bitcode file, just set the
643 } // End llvm namespace
  /external/llvm/include/llvm/CodeGen/
LiveInterval.h 147 /// program, with an inclusive start point and an exclusive end point.
148 /// These ranges are rendered as [start,end).
151 SlotIndex end; // End point of the interval (exclusive) member in struct:llvm::LiveRange
155 : start(S), end(E), valno(V) {
163 return start <= I && I < end;
170 return (start <= S && S < end) && (start < E && E <= end);
174 return start < LR.start || (start == LR.start && end < LR.end);
    [all...]
  /external/chromium/sdch/open-vcdiff/src/
vcdecoder.cc 111 // RESULT_END_OF_DATA if the end of input was reached before the entire window
158 // RESULT_ERROR if an error occurred, or RESULT_END_OF_DATA if the end of
190 // non-negative value on success, or RESULT_END_OF_DATA if the end of input
220 // Don't read past the end of currently-available data
456 // data after the end of the delta file.
492 // occurred, or RESULT_END_OF_DATA if the end of available data was reached
506 // error occurred, or RESULT_END_OF_DATA if the end of available data was
517 // error occurs, or RESULT_END_OF_DATA if the end of available data was
530 // DecodeChunk() reaches the end of its input and returns RESULT_END_OF_DATA.
665 // if an error occurred, and RESULT_END_OF_DATA if the end of available data wa
    [all...]
headerparser.cc 46 << " is beyond end of data " << end_ << LOG_ENDL;
92 VarintBE<int32_t>::Parse(parseable_chunk_.End(),
119 VarintBE<int64_t>::Parse(parseable_chunk_.End(),
196 LOG(ERROR) << "Source segment end position (" << source_segment_end
220 "end of dictionary",
  /external/chromium/chrome/browser/autofill/
autofill_country.cc 296 static const Iterator End();
341 const CountryDataMap::Iterator CountryDataMap::End() {
342 return GetInstance()->country_data_.end();
416 it != CountryDataMap::End();
436 collators_.end());
445 if (result != common_names_.end())
472 it != CountryDataMap::End();
512 if (result != localized_names.end())
574 DCHECK(result != CountryDataMap::End());
592 it != CountryDataMap::End();
    [all...]
  /external/quake/quake/src/QW/server/
qwsv.mak 407 # End Source File
489 # End Source File
571 # End Source File
653 # End Source File
735 # End Source File
817 # End Source File
899 # End Source File
981 # End Source File
1063 # End Source File
1145 # End Source File
    [all...]
  /external/clang/lib/Frontend/
TextDiagnostic.cpp 95 // If the end of the interesting region comes before we run out of
134 // Move the end of the interesting region right until we've
246 /// returns the end of the string.
273 /// \brief Find the end of the word starting at the given offset
276 /// \returns the index pointing one character past the end of the
282 unsigned End = Start + 1;
284 // If we are already at the end of the string, take that as the word.
285 if (End == Str.size())
286 return End;
293 while (End < Length && !isspace(Str[End])
    [all...]
  /external/llvm/examples/Kaleidoscope/Chapter5/
toy.cpp 77 // Comment until end of line.
85 // Check for end of file. Don't eat the EOF.
154 ExprAST *Start, *End, *Step, *Body;
156 ForExprAST(const std::string &varname, ExprAST *start, ExprAST *end,
158 : VarName(varname), Start(start), End(end), Step(step), Body(body) {}
320 ExprAST *End = ParseExpression();
321 if (End == 0) return 0;
338 return new ForExprAST(IdName, Start, End, Step, Body);
522 // end of the function
    [all...]
  /external/llvm/examples/Kaleidoscope/Chapter6/
toy.cpp 82 // Comment until end of line.
90 // Check for end of file. Don't eat the EOF.
169 ExprAST *Start, *End, *Step, *Body;
171 ForExprAST(const std::string &varname, ExprAST *start, ExprAST *end,
173 : VarName(varname), Start(start), End(end), Step(step), Body(body) {}
348 ExprAST *End = ParseExpression();
349 if (End == 0) return 0;
366 return new ForExprAST(IdName, Start, End, Step, Body);
626 // end of the function
    [all...]
  /external/llvm/include/llvm/ADT/
DenseMap.h 86 return empty() ? end() : iterator(Buckets, Buckets+NumBuckets);
88 inline iterator end() { function in class:llvm::DenseMap
92 return empty() ? end() : const_iterator(Buckets, Buckets+NumBuckets);
94 inline const_iterator end() const { function in class:llvm::DenseMap
141 return end();
147 return end();
494 pointer Ptr, End;
496 DenseMapIterator() : Ptr(0), End(0) {}
498 DenseMapIterator(pointer Pos, pointer E) : Ptr(Pos), End(E) {
507 : Ptr(I.Ptr), End(I.End) {
    [all...]
ImmutableIntervalMap.h 24 int64_t End;
27 Interval(int64_t S, int64_t E) : Start(S), End(E) {}
30 int64_t getEnd() const { return End; }
192 /// ImmutableIntervalMap maps an interval [start, end] to a value. The intervals
246 } // end namespace llvm
  /external/llvm/lib/CodeGen/
MachineFunction.cpp 116 MachineFunction::iterator MBBI, E = end();
222 MachineInstr::mmo_iterator End) {
225 for (MachineInstr::mmo_iterator I = Begin; I != End; ++I)
232 for (MachineInstr::mmo_iterator I = Begin; I != End; ++I) {
254 MachineInstr::mmo_iterator End) {
257 for (MachineInstr::mmo_iterator I = Begin; I != End; ++I)
264 for (MachineInstr::mmo_iterator I = Begin; I != End; ++I) {
323 for (const_iterator BB = begin(), E = end(); BB != E; ++BB) {
328 OS << "\n# End machine code for function " << Fn->getName() << ".\n\n";
477 E = CSI.end(); I != E; ++I
    [all...]
  /external/llvm/lib/Support/
MemoryBuffer.cpp 82 init(InputData.begin(), InputData.end(), RequiresNullTerminator);
210 SmallString<256> PathBuf(Filename.begin(), Filename.end());
261 // If we need a null terminator and the end of the map is inside the file,
263 size_t End = Offset + MapSize;
264 assert(End <= FileSize);
265 if (End != FileSize)
366 ReadBytes = read(0, Buffer.end(), ChunkSize);
  /external/chromium/testing/gtest/include/gtest/internal/
gtest-param-util.h 79 // BaseGenerator()->End().
86 // Current() on an iterator equal to BaseGenerator()->End().
150 virtual ParamIteratorInterface<T>* End() const = 0;
172 iterator end() const { return iterator(impl_->End()); } function in class:testing::internal::ParamGenerator
185 RangeGenerator(T begin, T end, IncrementT step)
186 : begin_(begin), end_(end),
187 step_(step), end_index_(CalculateEndIndex(begin, end, step)) {}
193 virtual ParamIteratorInterface<T>* End() const {
243 const T& end,
    [all...]
  /external/gtest/include/gtest/internal/
gtest-param-util.h 98 // BaseGenerator()->End().
105 // Current() on an iterator equal to BaseGenerator()->End().
169 virtual ParamIteratorInterface<T>* End() const = 0;
191 iterator end() const { return iterator(impl_->End()); } function in class:testing::internal::ParamGenerator
204 RangeGenerator(T begin, T end, IncrementT step)
205 : begin_(begin), end_(end),
206 step_(step), end_index_(CalculateEndIndex(begin, end, step)) {}
212 virtual ParamIteratorInterface<T>* End() const {
258 const T& end,
    [all...]
  /external/harfbuzz/src/
harfbuzz-gdef.c 674 glyph_index = glyphID - gcrr[index - 1].End - 1;
679 glyph_index = glyphID - gcrr[index].End - 1;
756 HB_UShort end,
779 crr[index].End = end;
915 if ( gcrr[n].Start - gcrr[n - 1].End > 1 )
917 ( gcrr[n].Start - gcrr[n - 1].End + 2 ) / 4,
922 if ( gcrr[count - 1].End != num_glyphs - 1 )
925 ( num_glyphs - gcrr[count - 1].End + 2 ) / 4,
1040 glyph_index = glyphID - gcrr[index - 1].End - 1
    [all...]
  /external/llvm/utils/unittest/googletest/include/gtest/internal/
gtest-param-util.h 79 // BaseGenerator()->End().
86 // Current() on an iterator equal to BaseGenerator()->End().
150 virtual ParamIteratorInterface<T>* End() const = 0;
172 iterator end() const { return iterator(impl_->End()); } function in class:testing::internal::ParamGenerator
185 RangeGenerator(T begin, T end, IncrementT step)
186 : begin_(begin), end_(end),
187 step_(step), end_index_(CalculateEndIndex(begin, end, step)) {}
193 virtual ParamIteratorInterface<T>* End() const {
243 const T& end,
    [all...]
  /external/protobuf/gtest/include/gtest/internal/
gtest-param-util.h 98 // BaseGenerator()->End().
105 // Current() on an iterator equal to BaseGenerator()->End().
169 virtual ParamIteratorInterface<T>* End() const = 0;
191 iterator end() const { return iterator(impl_->End()); } function in class:testing::internal::ParamGenerator
204 RangeGenerator(T begin, T end, IncrementT step)
205 : begin_(begin), end_(end),
206 step_(step), end_index_(CalculateEndIndex(begin, end, step)) {}
212 virtual ParamIteratorInterface<T>* End() const {
261 const T& end,
    [all...]
  /external/webkit/Source/WebCore/rendering/svg/
SVGMarkerLayoutInfo.cpp 78 m_markerData.updateTypeAndMarker(SVGMarkerData::End, endMarker);
86 Vector<MarkerLayout>::iterator end = m_layout.end(); local
89 for (; it != end; ++it) {
116 Vector<MarkerLayout>::iterator end = m_layout.end(); local
118 for (; it != end; ++it) {
  /external/clang/lib/Driver/
Driver.cpp 99 InputArgList *Args = getOpts().ParseArgs(ArgList.begin(), ArgList.end(),
108 for (ArgList::const_iterator it = Args->begin(), ie = Args->end();
162 ie = Args.end(); it != ie; ++it) {
384 for (InputList::iterator it = Inputs.begin(), ie = Inputs.end(); it != ie;) {
399 ie = Inputs.end();
408 for (ArgList::const_iterator it = C.getArgs().begin(), ie = C.getArgs().end();
454 for (ArgStringList::const_iterator it = Files.begin(), ie = Files.end();
516 for (ArgList::const_iterator it = Args.begin(), ie = Args.end();
605 ie = TC.getProgramPaths().end(); it != ie; ++it) {
618 ie = TC.getFilePaths().end(); it != ie; ++it)
    [all...]
  /external/v8/src/
lithium-allocator.cc 129 cur->pos().Value() <= End().Value());
334 // end of a lifetime hole). Use at this position should be attributed to
391 ASSERT(start.Value() < first_interval_->end().Value());
396 void LiveRange::EnsureInterval(LifetimePosition start, LifetimePosition end) {
400 end.Value());
401 LifetimePosition new_end = end;
403 first_interval_->start().Value() <= end.Value()) {
404 if (first_interval_->end().Value() > end.Value()) {
405 new_end = first_interval_->end();
602 LifetimePosition end = LifetimePosition::FromInstructionIndex( local
775 int end = block->last_instruction_index(); local
1274 LifetimePosition end = LifetimePosition::FromInstructionIndex( local
1343 int end = 0; local
    [all...]
  /external/clang/include/clang/Serialization/
ASTBitCodes.h 13 // new features are added, they should have values added at the end of the
148 /// \brief Raw source location of end of range.
149 unsigned End;
155 End(R.getEnd().getRawEncoding()),
    [all...]

Completed in 864 milliseconds

1 2 34 5 6 7 8 91011