| /external/icu/icu4c/source/test/intltest/ |
| tscoll.h | 26 struct Order
28 int32_t order; member in struct:IntlTestCollator::Order
51 Order *getOrders(CollationElementIterator &iter, int32_t &orderLength);
|
| /external/aac/libAACdec/src/ |
| aacdec_tns.h | 99 TNS_MAXIMUM_ORDER = 20, /* 12 for AAC-LC and AAC-SSR. Set to 20 for AAC-Main (AOT 1). Some broken encoders also do order 20 for AAC-LC :( */
113 UCHAR Order;
|
| /external/llvm/lib/CodeGen/ |
| AllocationOrder.h | 1 //===-- llvm/CodeGen/AllocationOrder.h - Allocation Order -*- C++ -*-------===//
10 // This file implements an allocation order for virtual registers.
12 // The preferred allocation order for a virtual register depends on allocation
31 ArrayRef<MCPhysReg> Order;
44 /// Get the allocation order without reordered hints.
45 ArrayRef<MCPhysReg> getOrder() const { return Order; }
47 /// Return the next physical register in the allocation order, or 0.
54 Limit = Order.size();
56 unsigned Reg = Order[Pos++];
64 /// Limit'th register in the RegisterClassInfo allocation order
[all...] |
| CriticalAntiDepBreaker.cpp | 382 ArrayRef<MCPhysReg> Order = RegClassInfo.getOrder(RC);
383 for (unsigned i = 0; i != Order.size(); ++i) {
384 unsigned NewReg = Order[i];
536 // the anti-dependencies in an instruction in order to be effective.
|
| /external/lzma/CPP/7zip/Compress/ |
| PpmdEncoder.h | 21 int Order;
27 Order = -1;
|
| /external/chromium-trace/catapult/third_party/gsutil/third_party/protorpc/demos/guestbook/client/ |
| guestbook.py | 26 class Order(messages.Enum):
33 order = messages.EnumField('guestbook.GetNotesRequest.Order', 3, default=1) variable in class:GetNotesRequest
|
| /external/webrtc/webrtc/base/ |
| bytebuffer.h | 26 ORDER_NETWORK = 0, // Default, use network byte order (big endian).
27 ORDER_HOST, // Use the native order of the host.
30 // |byte_order| defines order of bytes in the buffer.
46 ByteOrder Order() const { return byte_order_; }
|
| /external/gemmlowp/test/ |
| test.h | 57 static const MapOrder Order = tOrder;
|
| /external/mesa3d/src/egl/main/ |
| eglmode.c | 208 EGLint Order; /* SMALLER or LARGER */
211 /* the order of these entries is the priority */
242 else if (SortInfo[i].Order == SMALLER) {
245 else if (SortInfo[i].Order == LARGER) {
|
| /external/chromium-trace/catapult/third_party/gsutil/third_party/boto/boto/mashups/ |
| order.py | 22 High-level abstraction of an EC2 order for servers
162 class Order(IObject):
174 print('This Order consists of the following items')
|
| /external/chromium-trace/catapult/third_party/gsutil/third_party/protorpc/demos/guestbook/server/ |
| guestbook.py | 47 "ORDER BY date DESC LIMIT 10")
90 class Order(messages.Enum):
93 order = messages.EnumField(Order, 3, default=Order.WHEN) variable in class:GetNotesRequest
119 query = Greeting.all().order('-date')
135 if request.order == GetNotesRequest.Order.TEXT:
|
| /external/llvm/include/llvm/CodeGen/ |
| RegisterClassInfo.h | 33 std::unique_ptr<MCPhysReg[]> Order;
40 return makeArrayRef(Order.get(), NumRegs);
90 /// getOrder - Returns the preferred allocation order for RC. The order
116 /// Get the minimum register cost in RC's allocation order.
|
| ScheduleDAG.h | 52 Order ///< Any other ordering dependency.
85 /// Order - Additional information about Order dependencies.
120 : Dep(S, Order), Contents(), Latency(0) {
132 case Order:
179 /// isNormalMemory - Test if this is an Order dependence between two
183 return getKind() == Order && (Contents.OrdKind == MayAliasMem
187 /// isBarrier - Test if this is an Order dependence that is marked
190 return getKind() == Order && Contents.OrdKind == Barrier;
199 /// isMustAlias - Test if this is an Order dependence that is marke
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SDNodeDbgValue.h | 50 unsigned Order;
59 : Var(Var), Expr(Expr), Offset(off), DL(dl), Order(O), IsIndirect(indir) {
68 : Var(Var), Expr(Expr), Offset(off), DL(dl), Order(O), IsIndirect(false) {
76 : Var(Var), Expr(Expr), Offset(off), DL(dl), Order(O), IsIndirect(false) {
111 // Returns the SDNodeOrder. This is the order of the preceding node in the
113 unsigned getOrder() const { return Order; }
|
| /external/lzma/CS/7zip/ |
| ICoder.cs | 93 /// Specifies order for PPM methods.
95 Order,
|
| /frameworks/opt/vcard/tests/src/com/android/vcard/tests/ |
| VCardParserTests.java | 38 private enum Order {
47 private final List<Order> mHistory = new ArrayList<Order>();
48 private final List<Order> mExpectedOrder = new ArrayList<Order>();
50 public MockVCardInterpreter addExpectedOrder(Order order) {
51 mExpectedOrder.add(order);
55 private void inspectOrder(Order order) {
[all...] |
| /external/deqp/external/vulkancts/modules/vulkan/memory/ |
| vktMemoryAllocationTests.cpp | 69 enum Order
80 Order order; member in struct:vkt::memory::__anon8924::TestConfig
84 , order (ORDER_LAST)
124 if (m_config.order == TestConfig::ALLOC_REVERSE_FREE)
125 log << TestLog::Message << "Memory is freed in reversed order. " << TestLog::EndMessage;
126 else if (m_config.order == TestConfig::ALLOC_FREE)
127 log << TestLog::Message << "Memory is freed in same order as allocated. " << TestLog::EndMessage;
128 else if (m_config.order == TestConfig::MIXED_ALLOC_FREE)
131 DE_FATAL("Unknown allocation order");
[all...] |
| /external/eigen/unsupported/Eigen/src/Splines/ |
| Spline.h | 109 * \brief Evaluation of spline derivatives of up-to given order.
115 * for i ranging between 0 and order.
118 * \param order The order up to which the derivatives are computed.
121 derivatives(Scalar u, DenseIndex order) const;
130 derivatives(Scalar u, DenseIndex order = DerivativeOrder) const;
152 * \brief Computes the non-zero spline basis function derivatives up to given order.
158 * with i ranging from 0 up to the specified order.
162 * \param order The order up to which the basis function derivatives are computes
[all...] |
| /external/llvm/tools/verify-uselistorder/ |
| verify-uselistorder.cpp | 10 // Verify that use-list order can be serialized correctly. After reading the
20 // 2. Visit every Value in a deterministic order.
22 // 3. Assign a random number to each Use in the Value's use-list in order.
24 // 4. If the numbers are already in order, reassign numbers until they aren't.
93 /// here. The order needs to be deterministic, but it's unnecessary to match
185 // The current mapping order makes it easier to debug the tables. It happens
347 report_fatal_error("use-list order changed");
399 SmallDenseMap<const Use *, short, 16> Order;
401 [&Order](const Use &L, const Use &R) { return Order[&L] < Order[&R]; }
[all...] |
| /external/lzma/CPP/7zip/UI/Common/ |
| ZipRegistry.h | 42 UInt32 Order;
53 BlockLogSize = NumThreads = Level = Dictionary = Order = UInt32(-1);
|
| /external/skia/tests/ |
| GrTRecorderTest.cpp | 210 class Order {
212 Order() { this->reset(); }
221 static void test_subclasses_iters(skiatest::Reporter*, Order&, Base::Recorder::Iter&,
226 Order order; local
228 switch (order.next()) {
256 order.reset();
260 test_subclasses_iters(reporter, order, iter, reverseIter);
266 static void test_subclasses_iters(skiatest::Reporter* reporter, Order& order,
[all...] |
| /packages/apps/TV/src/com/android/tv/parental/ |
| ContentRatingSystem.java | 33 * A comparator that implements the display order of a group of content rating systems.
66 // Ordered list of main content ratings. UX should respect the order.
69 // Ordered list of sub content ratings. UX should respect the order.
73 // For example, let say we have following order.
74 // <order>
77 // </order>
81 private final List<Order> mOrders;
117 public List<Order> getOrders(){
157 List<Order> orders, boolean isCustom) {
179 private final List<Order.Builder> mOrderBuilders = new ArrayList<>()
[all...] |
| /external/llvm/utils/TableGen/ |
| RegisterInfoEmitter.cpp | 274 PSets[i].push_back(RegBank.getRegPressureSet(*PSetI).Order);
[all...] |
| /external/opencv3/3rdparty/openexr/Imath/ |
| ImathEuler.h | 67 // must order the angles according to their priorities. So, the
79 // If instead, the order was YXZ for instance you would have to
90 // Notice how the order you put the angles into the three slots
93 // ijk vector order is the same as the enum. If you treat the
101 // that order, you can do this:
151 enum Order
220 Euler(Order p);
221 Euler(const Vec3<T> &v, Order o = Default, InputLayout l = IJKLayout);
222 Euler(T i, T j, T k, Order o = Default, InputLayout l = IJKLayout);
223 Euler(const Euler<T> &euler, Order newp)
773 Euler<T>::order() const function in class:Imath::Euler
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| StructurizeCFG.cpp | 175 RNVector Order;
285 /// \brief Build up the general order of nodes
294 // The reverse post-order traversal of the list gives us an ordering close
314 if (std::find(Order.begin(), Order.end(), *I) != Order.end())
327 Order.push_back(*LoopI);
338 Order.push_back(*I);
341 // This pass originally used a post-order traversal and then operated on
342 // the list in reverse. Now that we are using a reverse post-order traversa
[all...] |
