| /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 | 67 Decl *First = data().FirstFriend.get(Source);
68 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/IR/ |
| OptBisect.cpp | 72 bool First = true;
74 if (First)
75 First = false;
|
| /external/llvm/lib/Target/WebAssembly/MCTargetDesc/ |
| WebAssemblyTargetStreamer.cpp | 39 bool First = true;
41 if (First)
42 First = false;
|
| /external/swiftshader/third_party/subzero/src/ |
| IceRangeSpec.cpp | 39 /// Helper function to parse "X" or "X:Y" into First and Last.
49 void getRange(const std::string &Token, uint32_t *First, uint32_t *Last) {
53 *First = std::stoul(Tokens[0]);
54 *Last = *First + 1;
56 *First = Tokens[0].empty() ? 0 : std::stoul(Tokens[0]);
61 if (*First >= *Last) {
80 uint32_t First, Last;
81 getRange(Token, &First, &Last);
83 D->AllFrom = std::min(D->AllFrom, First);
87 D->Numbers.set(First, Last)
[all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonOptimizeSZextends.cpp | 90 Instruction* First = &F.getEntryBlock().front();
91 SI->insertBefore(First);
120 // The first operand of Ashr comes from logical shift left.
131 // The first operand of Shl comes from an intrinsic.
|
| HexagonBlockRanges.h | 51 First = 11 // 10th + 1st
53 static bool isInstr(IndexType X) { return X.Index >= First; }
82 IndexType start() const { return first; }
96 void setStart(const IndexType &S) { first = S; }
129 IndexType First, Last;
167 assert(Index >= First);
192 Index = First;
|
| /device/linaro/bootloader/edk2/MdePkg/Include/Protocol/ |
| McaInitPmi.h | 39 UINT64 First : 1;
126 @param MakeFirst This flag specifies the handler should be made first in the list
150 @param MakeFirst This flag specifies the handler should be made first in the list
174 @param MakeFirst This flag specifies the handler should be made first in the list
|
| /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;
|
| /external/llvm/lib/Target/PowerPC/ |
| PPCTLSDynamicCall.cpp | 109 // The ADDItls* instruction is the first instruction in the
111 MachineBasicBlock::iterator First = I;
112 --First;
132 LIS->repairIntervalsInRange(&MBB, First, Last, OrigRegs);
|
| PPCBoolRetToInt.cpp | 227 User *First = dyn_cast<User>(Pair.first);
229 assert((!First || Second) && "translated from user to non-user!?");
230 if (First)
231 for (unsigned i = 0; i < First->getNumOperands(); ++i)
232 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);
|
| /device/linaro/bootloader/edk2/ArmPkg/Library/ArmDisassemblerLib/ |
| ArmDisassembler.c | 91 BOOLEAN First;
95 for (Index = 0, First = TRUE; Index <= 15; Index++) {
102 if (!First) {
105 First = FALSE;
118 if (First) {
|
| /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 First && First->startsSequence(Tokens...);
106 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];
|
| /external/pdfium/core/fxcrt/ |
| bytestring.h | 137 CharType First() const { return GetLength() ? (*this)[0] : 0; }
151 ByteString Mid(size_t first, size_t count) const;
|
| string_view_template.h | 141 UnsignedType First() const { return GetLength() ? (*this)[0] : 0; }
161 StringViewTemplate Mid(size_t first, size_t count) const {
165 if (!IsValidIndex(first))
171 if (!IsValidIndex(first + count - 1))
174 return StringViewTemplate(m_Ptr.Get() + first, count);
|
| widestring.h | 132 CharType First() const { return GetLength() ? (*this)[0] : 0; }
141 WideString Mid(size_t first, size_t count) const;
|
| /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...] |
