| /external/icu4c/common/unicode/ |
| uiter.h | 253 * relatively slow because the iterator has to "walk" from a known index
|
| /external/icu4c/i18n/ |
| coll.cpp | 274 // for now, there is a hardcoded list, so just walk through that list and set it up.
|
| /external/llvm/include/llvm/ADT/ |
| SparseBitVector.h | 325 // Iterator to walk set bits in the bitmap. This iterator is a lot uglier
|
| /external/llvm/include/llvm/CodeGen/ |
| LiveInterval.h | 458 /// \brief Walk the interval and assert if any invariants fail to hold.
|
| MachineFunction.h | 505 // graph of basic blocks... and to walk it in inverse order. Inverse order for
|
| /external/llvm/lib/Analysis/ |
| BranchProbabilityInfo.cpp | 477 // Walk the basic blocks in post-order so that we can build up state about
|
| RegionInfo.cpp | 609 // As only a BasicBlock that postdominates entry can finish a region, walk the
|
| /external/llvm/lib/Analysis/IPA/ |
| GlobalsModRef.cpp | 309 // Walk the user list of the global. If we find anything other than a direct
|
| /external/llvm/lib/CodeGen/ |
| MachineSink.cpp | 261 // Walk the basic block bottom-up. Remember if we saw a store.
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGDumper.cpp | 555 // Having printed this SDNode, walk the children:
|
| /external/llvm/lib/IR/ |
| Metadata.cpp | 463 // First, walk both lists in older of the lower boundary of each interval.
|
| /external/llvm/lib/Support/ |
| FoldingSet.cpp | 257 // Walk the old buckets, rehashing nodes into their new place.
|
| /external/llvm/lib/Target/Hexagon/ |
| HexagonCopyToCombine.cpp | 10 // We walk along a basic block and look for two combinable instructions and try
|
| HexagonNewValueJump.cpp | 255 // Walk the instructions after the compare (predicate def) to the jump,
|
| /external/llvm/lib/Transforms/Scalar/ |
| GVN.cpp | 789 // incorrect. Walk the (transitive) successors of this block and mark them as
[all...] |
| /external/mesa3d/src/mesa/drivers/dri/i965/ |
| brw_misc_state.c | 378 * 3DSTATE_DEPTH_BUFFER: namely the tile walk, surface type, width, and
|
| brw_vec4.cpp | 753 /* Now walk up the instruction stream trying to see if we can
|
| /external/open-vcdiff/src/ |
| blockhash.h | 418 // Walk through the hash entry chain, skipping over any false matches
|
| /external/openfst/src/include/fst/ |
| cache.h | 332 // just for states_.resize(), does unnecessary walk.
|
| /external/openssl/crypto/x509v3/ |
| v3_asid.c | 801 * Now walk up the chain. Extensions must be in canonical form, no
|
| /external/oprofile/events/i386/core_2/ |
| events | 20 event:0x0c counters:0,1 um:page_walks minimum:500 name:PAGE_WALKS : Page table walk events
|
| /external/oprofile/events/i386/nehalem/ |
| events | 60 event:0x63 counters:0,1 um:cache_lock_cycles minimum:6000 name:CACHE_LOCK_CYCLES : Cycle count during which the L1/L2 caches are locked. A lock is asserted when there is a locked memory access, due to uncacheable memory, a locked operation that spans two cache lines, or a page walk from an uncacheable page table.
|
| /external/oprofile/pp/ |
| opannotate.cpp | 301 // We simultaneously walk the two structures (list and sample_container)
|
| /external/qemu/distrib/sdl-1.2.15/src/video/macrom/ |
| SDL_romvideo.c | 317 /* Walk the monitor rectangles, and combine any pieces that
|
| /external/skia/tests/ |
| RoundRectTest.cpp | 278 // point walk a 1x1 rect in from the edge of the bounding
|
