OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:find_first
(Results
1 - 21
of
21
) sorted by null
/external/llvm/unittests/ADT/
BitVectorTest.cpp
67
for (unsigned i = Vec.
find_first
(); i != -1u; i = Vec.find_next(i)) {
86
EXPECT_TRUE(Vec.
find_first
() == 3);
97
for (unsigned i = Vec.
find_first
(); i != -1u; i = Vec.find_next(i)) {
SmallBitVectorTest.cpp
64
for (unsigned i = Vec.
find_first
(); i != -1u; i = Vec.find_next(i)) {
83
EXPECT_TRUE(Vec.
find_first
() == 3);
94
for (unsigned i = Vec.
find_first
(); i != -1u; i = Vec.find_next(i)) {
/external/llvm/lib/CodeGen/
RegisterScavenging.cpp
75
for (int I = PR.
find_first
(); I>0; I = PR.find_next(I))
270
int Survivor = Candidates.
find_first
();
318
Survivor = Candidates.
find_first
();
SpillPlacement.cpp
284
for (int n = ActiveNodes->
find_first
(); n>=0; n = ActiveNodes->find_next(n)) {
362
for (int n = ActiveNodes->
find_first
(); n>=0; n = ActiveNodes->find_next(n))
MachineRegisterInfo.cpp
246
for (int i = UsedPhysRegs.
find_first
(); i >= 0;
VirtRegMap.h
502
int Reg = UnusedRegs.
find_first
();
RegAllocGreedy.cpp
207
for (int i = LiveBundles.
find_first
(); i >= 0;
865
for (int i = Cand.LiveBundles.
find_first
(); i>=0;
[
all
...]
AggressiveAntiDepBreaker.cpp
137
DEBUG(for (int r = CriticalPathSet.
find_first
(); r != -1;
584
DEBUG(for (int r = BV.
find_first
(); r != -1; r = BV.find_next(r))
[
all
...]
StackSlotColoring.cpp
235
NextColor = AllColors.
find_first
();
331
Color = UsedColors.
find_first
();
MachineVerifier.cpp
371
for (int Reg = regsReserved.
find_first
(); Reg>=0;
534
for (int I = PR.
find_first
(); I>0; I = PR.find_next(I)) {
[
all
...]
LiveIntervalAnalysis.cpp
[
all
...]
TwoAddressInstructionPass.cpp
[
all
...]
/system/core/run-as/
package.c
251
find_first
(const char* p, const char* end, char ch)
function
406
const char* end =
find_first
(p, buffer_end, '\n');
/external/llvm/include/llvm/ADT/
SparseBitVector.h
135
///
find_first
- Returns the index of the first set bit.
136
int
find_first
() const {
352
unsigned BitPos = Iter->
find_first
();
384
NextSetBitNumber = Iter->
find_first
();
788
int
find_first
() const {
792
return (First.index() * ElementSize) + First.
find_first
();
SmallBitVector.h
204
///
find_first
- Returns the index of the first set bit, -1 if none
206
int
find_first
() const {
function in class:llvm::SmallBitVector
217
return getPointer()->
find_first
();
BitVector.h
142
///
find_first
- Returns the index of the first set bit, -1 if none
144
int
find_first
() const {
function in class:llvm::BitVector
/external/bluetooth/glib/tests/
hash-test.c
343
static gboolean
find_first
(gpointer key,
function
398
pvalue = g_hash_table_find (hash_table,
find_first
, &value);
/external/llvm/utils/TableGen/
CodeGenRegisters.cpp
492
for (int s = SC.
find_first
(); s >= 0; s = SC.find_next(s)) {
/external/llvm/lib/Transforms/Scalar/
LoopStrengthReduce.cpp
192
int i = UsedByIndices.
find_first
();
[
all
...]
/external/clang/lib/Sema/
SemaChecking.cpp
[
all
...]
/external/llvm/lib/Target/X86/
X86ISelLowering.cpp
[
all
...]
Completed in 1831 milliseconds