| /prebuilts/go/darwin-x86/src/compress/bzip2/ |
| move_to_front.go | 13 // as the symbol will be at the front of the list after the first access.
50 // First returns the symbol at the front of the list.
51 func (m moveToFrontDecoder) First() byte {
|
| /prebuilts/go/linux-x86/src/compress/bzip2/ |
| move_to_front.go | 13 // as the symbol will be at the front of the list after the first access.
50 // First returns the symbol at the front of the list.
51 func (m moveToFrontDecoder) First() byte {
|
| /external/clang/lib/AST/ |
| DeclFriend.cpp | 64 Decl *First = data().FirstFriend.get(Source);
65 return First ? cast<FriendDecl>(First) : nullptr;
|
| TemplateBase.cpp | 404 bool First = true;
406 if (First)
407 First = false;
|
| /external/testng/src/test/java/test/classgroup/ |
| First.java | 5 @Test(groups = { "first" })
6 public class First {
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| SelectorExtras.h | 20 const char *First,
23 II.push_back(&Ctx.Idents.get(First));
32 const char *First = va_arg(argp, const char *);
33 assert(First && "keyword selectors must have at least one argument");
34 return getKeywordSelectorImpl(Ctx, First, argp);
39 const char *First, ...) {
41 va_start(argp, First);
42 Selector result = getKeywordSelectorImpl(Ctx, First, argp);
49 const char *First, ...) {
53 va_start(argp, First);
[all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonOptimizeSZextends.cpp | 87 Instruction* First = &F.getEntryBlock().front();
88 SI->insertBefore(First);
117 // The first operand of Ashr comes from logical shift left.
128 // The first operand of Shl comes from an intrinsic.
|
| /external/clang/lib/Lex/ |
| MacroInfo.cpp | 56 assert(startInfo.first == endInfo.first &&
98 // If this isn't the first first token, check that the whitespace and
157 bool First = true;
161 if (First || Tok.hasLeadingSpace())
163 First = false;
|
| PreprocessingRecord.cpp | 54 return llvm::make_range(iterator(this, CachedRangeQuery.Result.first),
63 return llvm::make_range(iterator(this, Res.first),
136 return std::make_pair(Local.first, Local.second);
142 if (Loaded.first == Loaded.second)
143 return std::make_pair(Local.first, Local.second);
148 if (Local.first == Local.second)
149 return std::make_pair(int(Loaded.first)-TotalLoaded,
153 return std::make_pair(int(Loaded.first)-TotalLoaded, Local.second);
208 First = PreprocessedEntities.begin();
214 // whether we get the first macro expansion or its containing macro
[all...] |
| /external/llvm/lib/Target/PowerPC/ |
| PPCTLSDynamicCall.cpp | 107 // The ADDItls* instruction is the first instruction in the
109 MachineBasicBlock::iterator First = I;
110 --First;
128 LIS->repairIntervalsInRange(&MBB, First, Last, OrigRegs);
|
| PPCBoolRetToInt.cpp | 224 User *First = dyn_cast<User>(Pair.first);
226 assert((!First || Second) && "translated from user to non-user!?");
227 if (First)
228 for (unsigned i = 0; i < First->getNumOperands(); ++i)
229 Second->setOperand(i, BoolToIntMap[First->getOperand(i)]);
|
| /external/webrtc/webrtc/modules/rtp_rtcp/source/ |
| rtp_header_extension.cc | 124 *id = it->first;
190 RTPExtensionType RtpHeaderExtensionMap::First() const {
225 map->Register(extension->type, it->first, extension->active);
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| Store.h | 220 bool First;
224 : Sym(sym), Binding(nullptr), First(true) {}
228 explicit operator bool() { return First && Binding; }
|
| /external/clang/lib/Format/ |
| TokenAnnotator.h | 42 : First(Line.Tokens.front().Tok), Level(Line.Level),
52 First->Previous = nullptr;
53 FormatToken *Current = First;
75 FormatToken *Current = First;
86 return startsWith(First, Tokens...);
98 FormatToken *First;
|
| /external/clang/utils/TableGen/ |
| ClangASTNodesEmitter.cpp | 70 // Returns the first and last non-abstract subrecords
80 Record *First = nullptr, *Last = nullptr;
84 First = Last = Base;
106 if (!First && Result.first)
107 First = Result.first;
114 if (!First)
115 First = R;
122 if (First) {
[all...] |
| /external/compiler-rt/lib/ubsan/ |
| ubsan_type_hash_itanium.cc | 79 // * such a collision would have to occur on the *first* bad access,
85 // The first caching layer is a small hash table with no chaining; buckets are
99 unsigned First = (V & 65535) ^ 1;
100 unsigned Probe = First;
109 // just taking the first.
110 return &__ubsan_vptr_hash_set[First];
|
| /frameworks/compile/slang/ |
| slang_rs_pragma_handler.cpp | 91 // Skip first token, "java_package_name"
146 // Grab "reduce(name)" ("reduce" is already known to be the first
195 "times (first one is at %1)"))
254 bool First = true;
256 if (First)
257 First = false;
261 Ret += entry.first;
298 << Entry->first << getName();
309 << Entry->first << getName();
320 << Entry->first << getName()
[all...] |
| /external/clang/include/clang/AST/ |
| Redeclarable.h | 115 /// of this same Decl. If NextIsLatest() is true, this is the first
124 decl_type *First;
132 : RedeclLink(LatestDeclLink(Ctx)), First(static_cast<decl_type *>(this)) {}
135 /// is the first declaration.
146 /// \brief Return the first declaration of this declaration or itself if this
148 decl_type *getFirstDecl() { return First; }
150 /// \brief Return the first declaration of this declaration or itself if this
152 const decl_type *getFirstDecl() const { return First; }
154 /// \brief True if this is the first declaration in its redeclaration chain.
168 /// first and only declaration
[all...] |
| /external/clang/include/clang/Lex/ |
| PPCallbacks.h | 326 std::unique_ptr<PPCallbacks> First, Second;
331 : First(std::move(_First)), Second(std::move(_Second)) {}
336 First->FileChanged(Loc, Reason, FileType, PrevFID);
343 First->FileSkipped(SkippedFile, FilenameTok, FileType);
349 return First->FileNotFound(FileName, RecoveryPath) ||
358 First->InclusionDirective(HashLoc, IncludeTok, FileName, IsAngled,
368 First->moduleImport(ImportLoc, Path, Imported);
373 First->EndOfMainFile();
378 First->Ident(Loc, str);
384 First->PragmaComment(Loc, Kind, Str)
[all...] |
| /external/clang/lib/Sema/ |
| CodeCompleteConsumer.cpp | 295 bool First = true;
297 if (First)
298 First = false;
|
| SemaCoroutine.cpp | 45 // We found something weird. Complain about the first thing we found.
370 auto *First = Fn->CoroutineStmts[0];
371 Diag(First->getLocStart(), diag::note_declared_coroutine_here)
372 << (isa<CoawaitExpr>(First) ? 0 :
373 isa<CoyieldExpr>(First) ? 1 : 2);
|
| /external/clang/test/CXX/temp/temp.spec/temp.expl.spec/ |
| examples.cpp | 129 namespace First
145 typedef First::Bar<Second::Foo> Special;
148 First
277 template class BasicStringPiece<int>; // expected-note {{explicit instantiation first required here}}
291 extern template class BasicStringPiece<int>; // expected-note {{explicit instantiation first required here}}
298 extern template class BasicStringPiece<int>; // expected-note {{explicit instantiation first required here}}
|
| /external/llvm/lib/CodeGen/ |
| ExecutionDepsFix.cpp | 99 // First domain available.
153 /// The first instruction in each basic block is 0.
269 assert(LiveRegs && "Must enter basic block first.");
281 assert(LiveRegs && "Must enter basic block first.");
292 assert(LiveRegs && "Must enter basic block first.");
380 // Treat function live-ins as if they were defined just before the first
433 assert(LiveRegs && "Must enter basic block first.");
436 bool First = LiveOuts.insert(std::make_pair(MBB, LiveRegs)).second;
438 if (First) {
459 if (DomP.first) {
[all...] |
| InterferenceCache.h | 34 SlotIndex First;
217 return Current->First.isValid();
220 /// first - Return the starting index of the first interfering range in the
222 SlotIndex first() { function in class:llvm::InterferenceCache::Cursor
223 return Current->First;
|
| VirtRegMap.cpp | 249 SlotIndex First;
253 if (!First.isValid() || SR.segments.front().start < First)
254 First = SR.segments.front().start;
259 // Check all mbb start positions between First and Last while
261 for (SlotIndexes::MBBIndexIterator MBBI = Indexes->findMBBIndex(First);
262 MBBI != Indexes->MBBIndexEnd() && MBBI->first <= Last; ++MBBI) {
263 SlotIndex MBBBegin = MBBI->first;
268 const LiveInterval::SubRange *SR = RangeIterPair.first;
308 for (; I != Indexes->MBBIndexEnd() && I->first < Seg.end; ++I)
[all...] |
