| /external/llvm/lib/CodeGen/ |
| RegAllocBasic.cpp | 488 ArrayRef<unsigned> Order =
490 for (ArrayRef<unsigned>::iterator I = Order.begin(), E = Order.end(); I != E;
|
| ScheduleDAG.cpp | 314 case SDep::Order: dbgs() << "ch "; break;
335 case SDep::Order: dbgs() << "ch "; break;
409 /// "Online algorithms for managing the topological order of
413 /// "Maintaining a topological order under edge insertions".
497 // Update the topological order.
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGFast.cpp | 334 AddPred(NewSU, SDep(LoadSU, SDep::Order, LoadSU->Latency));
594 AddPred(TrySU, SDep(Copies.front(), SDep::Order, /*Latency=*/1,
603 AddPred(NewDef, SDep(TrySU, SDep::Order, /*Latency=*/1,
629 // Reverse the order since it is bottom up.
|
| SelectionDAGBuilder.cpp | [all...] |
| ScheduleDAGRRList.cpp | 13 // the priority queue (thus in priority order), checked for legality to
54 "order when possible",
742 /// BTCycle in order to schedule a specific node.
[all...] |
| SelectionDAG.cpp | [all...] |
| /external/mesa3d/docs/OLD/ |
| MESA_packed_depth_stencil.spec | 82 Format Name Buffer Element Meaning and Order
103 gives a description of and the number and order of elements in a
|
| /external/clang/lib/CodeGen/ |
| CGExpr.cpp | [all...] |
| CGBuiltin.cpp | 701 // doesn't implicitly ignore high-order bits when doing
[all...] |
| /external/llvm/lib/MC/ |
| MachObjectWriter.cpp | 367 // when we see the attribute, but that makes getting the order in the symbol
439 // The particular order that we collect the symbols and create the string
511 // External and undefined symbols are required to be in lexicographic order.
532 const SmallVectorImpl<MCSectionData*> &Order = Layout.getSectionOrder();
533 for (int i = 0, n = Order.size(); i != n ; ++i) {
534 const MCSectionData *SD = Order[i];
747 // Write the section relocation entries, in reverse order to match 'as'
|
| /external/icu4c/test/intltest/ |
| itercoll.cpp | 191 Order *orders = getOrders(*iter, orderLength);
306 uint32_t order; local
310 order = iter->previous(status);
313 if (CollationElementIterator::isIgnorable(order))
314 order = iter->previous(status);
322 if (U_FAILURE(status) && iter->getMaxExpansion(order) < count) {
536 * Testing the strength order
540 int order = 0x0123ABCD; local
560 if (iter->strengthOrder(order) != 0x01230000) {
561 errln("Strength order for a primary strength collator should be the first 2 bytes")
586 int32_t order; local
[all...] |
| /external/llvm/lib/VMCore/ |
| Instructions.cpp | [all...] |
| /external/llvm/include/llvm/ |
| Instructions.h | 152 unsigned Align, AtomicOrdering Order,
156 unsigned Align, AtomicOrdering Order,
275 unsigned Align, AtomicOrdering Order,
279 unsigned Align, AtomicOrdering Order,
[all...] |
| /external/llvm/include/llvm/Support/ |
| Dwarf.h | 709 /// ArrayOrderString - Return the string for the specified array order.
711 const char *ArrayOrderString(unsigned Order);
|
| /external/llvm/lib/Transforms/Scalar/ |
| ObjCARC.cpp | 54 /// MapVector - An associative container with fast insertion-order
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| SelectionDAG.h | 127 /// selection in order to allow implementation of machine specific optimizations
[all...] |
| /external/mesa3d/src/mesa/main/ |
| mtypes.h | 993 /* Fields are in the order in which they're applied... */
[all...] |
| /external/chromium/chrome/browser/resources/file_manager/js/ |
| file_manager.js | 122 * assigned to dom elements for a file. Order of evaluation is not
[all...] |
| /ndk/build/core/ |
| definitions.mk | 69 # Returns : the list with duplicate items removed, order is preserved.
511 # NOTE: this function must not modify the existing dependency order when new depends are added.
617 # Order matters and should match the one used by the build command
[all...] |
