Home
last modified time | relevance | path

Searched full:order (Results 1 – 25 of 5312) sorted by relevance

12345678910>>...213

/openbsd-src/sys/dev/pci/drm/ttm/
H A Dttm_pool.c56 * @vaddr: original vaddr return for the mapping and order in the lower bits
85 /* Allocate pages of size 1 << order with the given gfp_flags */
87 unsigned int order) in ttm_pool_alloc_page() argument
94 /* Don't set the __GFP_COMP flag for higher order allocations. in ttm_pool_alloc_page()
98 if (order) in ttm_pool_alloc_page()
103 p = alloc_pages_node(pool->nid, gfp_flags, order); in ttm_pool_alloc_page()
105 p->private = order; in ttm_pool_alloc_page()
114 if (order) in ttm_pool_alloc_page()
117 vaddr = dma_alloc_attrs(pool->dev, (1ULL << order) * PAGE_SIZE, in ttm_pool_alloc_page()
130 dma->vaddr = (unsigned long)vaddr | order; in ttm_pool_alloc_page()
[all …]
/openbsd-src/gnu/usr.bin/gcc/gcc/
H A Dggc-page.c74 (`order'), and satisfied from the appropriate page.
89 all full pages, with non-full pages arranged in order of decreasing
144 the indicated ORDER. */
145 #define OBJECTS_PER_PAGE(ORDER) objects_per_page_table[ORDER] argument
147 /* The size of an object on a page of the indicated ORDER. */
148 #define OBJECT_SIZE(ORDER) object_size_table[ORDER] argument
154 #define DIV_MULT(ORDER) inverse_table[ORDER].mult argument
155 #define DIV_SHIFT(ORDER) inverse_table[ORDER].shift argument
156 #define OFFSET_TO_BIT(OFFSET, ORDER) \ argument
157 (((OFFSET) * DIV_MULT (ORDER)) >> DIV_SHIFT (ORDER))
[all …]
/openbsd-src/gnu/usr.bin/perl/cpan/NEXT/t/
H A Dactual.t6 my $order = 0;
13 sub test { ++$order; ::ok($order==1,"test A"); $_[0]->NEXT::ACTUAL::test;}
18 sub test { ++$order; ::ok($order==2,"test B"); $_[0]->NEXT::ACTUAL::test;}
25 ++$order; ::ok($order==4||$order==6,"test C");
33 ++$order; ::ok($order==3||$order==5||$order==7||$order==8,"test D");
/openbsd-src/gnu/gcc/gcc/
H A Dggc-page.c84 (`order'), and satisfied from the appropriate page.
99 all full pages, with non-full pages arranged in order of decreasing
154 the indicated ORDER. */
155 #define OBJECTS_PER_PAGE(ORDER) objects_per_page_table[ORDER] argument
158 #define OBJECTS_IN_PAGE(P) ((P)->bytes / OBJECT_SIZE ((P)->order))
160 /* The size of an object on a page of the indicated ORDER. */
161 #define OBJECT_SIZE(ORDER) object_size_table[ORDER] argument
167 #define DIV_MULT(ORDER) inverse_table[ORDER].mult argument
168 #define DIV_SHIFT(ORDER) inverse_table[ORDER].shift argument
169 #define OFFSET_TO_BIT(OFFSET, ORDER) \ argument
[all …]
/openbsd-src/sys/dev/pci/drm/ttm/tests/
H A Dttm_pool_test.c14 unsigned int order; member
81 unsigned long order = __fls(size / PAGE_SIZE); in ttm_pool_pre_populated() local
84 tt = ttm_tt_kunit_init(test, order, caching, size); in ttm_pool_pre_populated()
104 .order = 0,
108 .order = 2,
112 .order = MAX_ORDER + 1,
116 .order = 0,
121 .order = MAX_ORDER + 1,
144 unsigned int expected_num_pages = 1 << params->order; in ttm_pool_alloc_basic()
168 if (params->order <= MAX_ORDER) { in ttm_pool_alloc_basic()
[all …]
/openbsd-src/gnu/llvm/llvm/lib/CodeGen/
H A DAllocationOrder.h1 //===-- llvm/CodeGen/AllocationOrder.h - Allocation Order -*- C++ -*-------===//
9 // This file implements an allocation order for virtual registers.
11 // The preferred allocation order for a virtual register depends on allocation
32 ArrayRef<MCPhysReg> Order; variable
33 // How far into the Order we can iterate. This is 0 if the AllocationOrder is
34 // constructed with HardHints = true, Order.size() otherwise. While
37 // avoid warnings and under the assumption that the size of Order is
54 /// Return the next physical register in the allocation order.
59 return AO.Order[Pos];
67 while (Pos >= 0 && Pos < AO.IterationLimit && AO.isHint(AO.Order[Pos]))
[all …]
/openbsd-src/gnu/llvm/lldb/include/lldb/Core/
H A DOpcode.h43 Opcode(uint8_t inst, lldb::ByteOrder order) in Opcode() argument
44 : m_byte_order(order), m_type(eType8) { in Opcode()
48 Opcode(uint16_t inst, lldb::ByteOrder order) in Opcode() argument
49 : m_byte_order(order), m_type(eType16) { in Opcode()
53 Opcode(uint32_t inst, lldb::ByteOrder order) in Opcode() argument
54 : m_byte_order(order), m_type(eType32) { in Opcode()
58 Opcode(uint64_t inst, lldb::ByteOrder order) in Opcode() argument
59 : m_byte_order(order), m_type(eType64) { in Opcode()
153 void SetOpcode8(uint8_t inst, lldb::ByteOrder order) { in SetOpcode8() argument
156 m_byte_order = order; in SetOpcode8()
[all …]
/openbsd-src/usr.sbin/amd/amd/
H A Dinfo_nis.c170 int order; in nis_search() local
178 if (yp_order(domain, map, &order)) in nis_search()
180 if ((time_t) order > *tp) { in nis_search()
181 *tp = (time_t) order; in nis_search()
189 order = time(NULL); in nis_search()
190 if ((time_t)order - *tp > am_timeo) { in nis_search()
191 *tp = (time_t)order; in nis_search()
201 if (yp_order(domain, map, &order)) in nis_search()
203 if ((time_t) order > *tp) { in nis_search()
204 *tp = (time_t) order; in nis_search()
[all …]
/openbsd-src/usr.bin/file/magdir/
H A Dolf6 # We have to check the byte order flag to see what byte order all the
31 >5 byte 0 invalid byte order
44 >>18 leshort 1 AT&T WE32100 - invalid byte order,
45 >>18 leshort 2 SPARC - invalid byte order,
47 >>18 leshort 4 Motorola 68000 - invalid byte order,
48 >>18 leshort 5 Motorola 88000 - invalid byte order,
51 >>18 leshort 8 MIPS R3000_BE - invalid byte order,
52 >>18 leshort 9 Amdahl - invalid byte order,
54 >>18 leshort 11 RS6000 - invalid byte order,
55 >>18 leshort 15 PA-RISC - invalid byte order,
[all …]
/openbsd-src/lib/libcrypto/ecdsa/
H A Decdsa.c168 const BIGNUM *order = NULL; in ECDSA_size() local
178 if ((order = EC_GROUP_get0_order(group)) == NULL) in ECDSA_size()
181 sig.r = (BIGNUM *)order; in ECDSA_size()
182 sig.s = (BIGNUM *)order; in ECDSA_size()
194 * Use the order_bits leftmost bits if it exceeds the group order.
275 const BIGNUM *order; in ecdsa_sign_setup() local
316 if ((order = EC_GROUP_get0_order(group)) == NULL) { in ecdsa_sign_setup()
321 if (BN_cmp(order, BN_value_one()) <= 0) { in ecdsa_sign_setup()
326 /* Reject curves with an order that is smaller than 80 bits. */ in ecdsa_sign_setup()
327 if ((order_bits = BN_num_bits(order)) < 80) { in ecdsa_sign_setup()
[all …]
/openbsd-src/sys/dev/pci/drm/
H A Ddrm_buddy.c18 unsigned int order, in drm_block_alloc() argument
23 BUG_ON(order > DRM_BUDDY_MAX_ORDER); in drm_block_alloc()
34 block->header |= order; in drm_block_alloc()
156 unsigned int order; in drm_buddy_init() local
159 order = ilog2(size) - ilog2(chunk_size); in drm_buddy_init()
160 root_size = chunk_size << order; in drm_buddy_init()
162 root = drm_block_alloc(mm, NULL, order, offset); in drm_buddy_init()
343 unsigned int order) in alloc_range_bias() argument
345 u64 req_size = mm->chunk_size << order; in alloc_range_bias()
369 if (drm_buddy_block_order(block) < order) in alloc_range_bias()
[all …]
/openbsd-src/gnu/llvm/libcxx/benchmarks/algorithms/
H A Dcommon.h32 enum class Order { enum
41 struct AllOrders : EnumValuesAsTuple<AllOrders, Order, 7> {
92 void fillValues(std::vector<T>& V, size_t N, Order O) { in fillValues()
93 if (O == Order::SingleElement) { in fillValues()
95 } else if (O == Order::QuickSortAdversary) { in fillValues()
104 void fillValues(std::vector<std::pair<T, T> >& V, size_t N, Order O) { in fillValues()
105 if (O == Order::SingleElement) { in fillValues()
119 void fillValues(std::vector<std::tuple<T1, T2, T3> >& V, size_t N, Order O) { in fillValues()
120 if (O == Order::SingleElement) { in fillValues()
140 inline void fillValues(std::vector<std::string>& V, size_t N, Order O) { in fillValues()
[all …]
/openbsd-src/sys/dev/pci/drm/i915/selftests/
H A Di915_syncmap.c274 unsigned int pass, order; in igt_syncmap_join_above() local
296 for (order = 0; order < 64; order += SHIFT) { in igt_syncmap_join_above()
297 u64 context = BIT_ULL(order); in igt_syncmap_join_above()
335 unsigned int step, order, idx; in igt_syncmap_join_below() local
345 for (order = 64 - SHIFT; order > 0; order -= SHIFT) { in igt_syncmap_join_below()
346 u64 context = step * BIT_ULL(order); in igt_syncmap_join_below()
353 … pr_err("Inserting context=%llx (order=%d, step=%d) did not return leaf (height=%d, prefix=%llx\n", in igt_syncmap_join_below()
354 context, order, step, sync->height, sync->prefix); in igt_syncmap_join_below()
362 for (order = SHIFT; order < 64; order += SHIFT) { in igt_syncmap_join_below()
363 u64 context = step * BIT_ULL(order); in igt_syncmap_join_below()
[all …]
H A Di915_random.c70 void i915_random_reorder(unsigned int *order, unsigned int count, in i915_random_reorder() argument
73 i915_prandom_shuffle(order, sizeof(*order), count, state); in i915_random_reorder()
78 unsigned int *order, i; in i915_random_order() local
80 order = kmalloc_array(count, sizeof(*order), in i915_random_order()
82 if (!order) in i915_random_order()
83 return order; in i915_random_order()
86 order[i] = i; in i915_random_order()
88 i915_random_reorder(order, count, state); in i915_random_order()
89 return order; in i915_random_order()
/openbsd-src/gnu/llvm/llvm/tools/llvm-tapi-diff/
H A DDiffEngine.cpp24 StringRef setOrderIndicator(InterfaceInputOrder Order) { in setOrderIndicator() argument
25 return ((Order == lhs) ? "< " : "> "); in setOrderIndicator()
35 OS << Indent << "\t" << setOrderIndicator(Order) << Val << "\n"; in print()
42 OS << Indent << "\t\t" << setOrderIndicator(Order) << Val << "\n"; in print()
49 OS << Indent << "\t" << setOrderIndicator(Order) << std::to_string(Val) in print()
57 OS << Indent << "\t" << setOrderIndicator(Order) in print()
98 OS << Indent << "\t\t" << ((Order == lhs) ? "< " : "> ") in print()
103 OS << Indent << "\t\t" << ((Order == lhs) ? "< " : "> ") in print()
107 OS << Indent << "\t\t" << ((Order == lhs) ? "< " : "> ") in print()
120 InterfaceInputOrder Order) { in addDiffForTargSlice() argument
[all …]
H A DDiffEngine.h64 DiffScalarVal(InterfaceInputOrder Order, T Val) in DiffScalarVal() argument
65 : AttributeDiff(U), Order(Order), Val(Val){}; in DiffScalarVal()
72 InterfaceInputOrder getOrder() const { return Order; } in getOrder()
75 /// The order is the file from which the diff is found.
76 InterfaceInputOrder Order;
80 /// SymScalar is the diff symbol and the order.
83 SymScalar(InterfaceInputOrder Order, const MachO::Symbol *Sym) in SymScalar() argument
84 : Order(Order), Val(Sym){}; in SymScalar()
95 InterfaceInputOrder getOrder() const { return Order; } in getOrder()
98 /// The order is the file from which the diff is found.
[all …]
/openbsd-src/usr.bin/tsort/
H A Dtsort.c51 * by make_transparent, which does propagate order values to unmarked
95 unsigned int order; /* Order of nodes according to a hint file. */ member
219 n->order = NO_ORDER; in new_node()
253 printf("%s (%u/%u): ", n->k, n->order, n->refs); in dump_node()
256 printf("%s(%u/%u) ", l->node->k, l->node->order, l->node->refs); in dump_node()
303 unsigned int order, int hint) in read_pairs() argument
330 if (a->order == NO_ORDER && hint) in read_pairs()
331 a->order = order++; in read_pairs()
352 return order; in read_pairs()
357 unsigned int order) in read_hints() argument
[all …]
/openbsd-src/usr.bin/file/
H A Dmagic.572 A two-byte value in this machine's native byte order.
74 A four-byte value in this machine's native byte order.
76 An eight-byte value in this machine's native byte order.
78 A 32-bit single precision IEEE floating point number in this machine's native byte order.
80 A 64-bit double precision IEEE floating point number in this machine's native byte order.
118 A two-byte value in big-endian byte order.
120 A four-byte value in big-endian byte order.
122 An eight-byte value in big-endian byte order.
124 A 32-bit single precision IEEE floating point number in big-endian byte order.
126 A 64-bit double precision IEEE floating point number in big-endian byte order.
[all …]
/openbsd-src/usr.sbin/acme-client/
H A Dnetproc.c440 * Submit a new order for a certificate. in doneworder()
444 struct order *order, const struct capaths *p) in doneworder()
453 else if ((lc = sreq(c, p->neworder, 1, req, &order->uri)) < 0) in doneworder()
459 else if (!json_parse_order(j, order)) in doneworder()
460 warnx("%s: bad order", p->neworder); in doneworder()
461 else if (order->status == ORDER_INVALID)
462 warnx("%s: order invalid", p->neworder);
475 * Update order status in doupdorder()
478 doupdorder(struct conn *c, struct order *orde in doupdorder()
432 doneworder(struct conn * c,const char * const * alts,size_t altsz,struct order * order,const struct capaths * p) doneworder() argument
466 doupdorder(struct conn * c,struct order * order) doupdorder() argument
669 struct order order; netproc() local
[all...]
/openbsd-src/gnu/llvm/libcxx/benchmarks/
H A Dmap.bench.cpp45 enum class Order { Sorted, Random }; enum
46 struct AllOrders : EnumValuesAsTuple<AllOrders, Order, 2> {
236 template <class Mode, class Order>
243 Order::value == ::Order::Random ? Shuffle::Keys : Shuffle::None, 1000); in run()
264 Order::value == ::Order::Random ? Shuffle::Keys in run()
272 return "BM_Insert" + baseName() + Mode::name() + Order::name(); in name()
355 template <class Mode, class Order>
362 Order::value == ::Order::Random ? Shuffle::Keys : Shuffle::None, 1000); in run()
383 Order::value == ::Order::Random ? Shuffle::Keys in run()
391 return "BM_InsertAssign" + baseName() + Mode::name() + Order::name(); in name()
[all …]
/openbsd-src/gnu/llvm/clang/utils/perf-training/
H A DCMakeLists.txt2 "The path to a lit testsuite containing samples for PGO and order file generation"
38 ${CMAKE_CURRENT_SOURCE_DIR}/order-files.lit.site.cfg.in
39 ${CMAKE_CURRENT_BINARY_DIR}/order-files/lit.site.cfg
43 ${CMAKE_CURRENT_BINARY_DIR}/order-files/
54 message(FATAL_ERROR "Output clang order file is not set")
57 add_custom_target(generate-order-file
58 …COMMAND "${Python3_EXECUTABLE}" ${CMAKE_CURRENT_SOURCE_DIR}/perf-helper.py gen-order-file --binary…
59 COMMENT "Generating order file"
/openbsd-src/lib/libc/net/
H A Dhtobe64.3107 byte order used by the host to/from either little- or big-endian (a.k.a
108 network) order.
113 convert between host and big-endian (most significant byte first) order
116 convert between host and little-endian (least significant byte first) order
152 .Nm {src-order}to{dst-order}{size}
156 .Nm {src-order}{size}to{dst-order}
164 byte order does not allow PDP-11 users to sleep soundly at night.
/openbsd-src/gnu/llvm/lld/MachO/
H A DSectionPriorities.h22 // callGraphProfile. If an order file is present, any edges where one or both
23 // of the vertices are specified in the order file are discarded.
26 // Reads the order file at `path` into config->priorities.
28 // An order file has one entry per line, in the following format:
45 // out in decreasing order; that is, a higher priority section will be closer
48 // If either an order file or a call graph profile are present, this is used
49 // as the source of priorities. If both are present, the order file takes
51 // appear in the order file. If neither is present, an empty map is returned.
60 // (highest first) instead of order (lowest first) has the convenient property
62 // a user-defined order -- naturally ends up putting them at the end of the
/openbsd-src/gnu/usr.bin/binutils-2.17/ld/
H A Dmri.c48 static struct section_name_struct *order; variable
132 if (order == NULL) in mri_draw_tree()
133 order = address; in mri_draw_tree()
141 for (olist = order; done == 0 && olist != NULL; olist = olist->next) in mri_draw_tree()
152 /* Add this onto end of order list. */ in mri_draw_tree()
153 mri_add_to_list (&order, alist->name, alist->vma, 0, 0, 0); in mri_draw_tree()
165 if (order == NULL) in mri_draw_tree()
166 order = only_load; in mri_draw_tree()
170 for (ptr2 = order; ptr2; ptr2 = ptr2->next) in mri_draw_tree()
179 for (ptr = order; ptr; ptr = ptr->next) in mri_draw_tree()
[all …]
/openbsd-src/gnu/usr.bin/perl/t/mro/
H A Dcomplex_dfs.t87 ), '... got the right DFS merge order for Test::A');
92 ), '... got the right DFS merge order for Test::B');
97 ), '... got the right DFS merge order for Test::C');
102 ), '... got the right DFS merge order for Test::D');
107 ), '... got the right DFS merge order for Test::E');
112 ), '... got the right DFS merge order for Test::F');
117 ), '... got the right DFS merge order for Test::G');
122 ), '... got the right DFS merge order for Test::H');
127 ), '... got the right DFS merge order for Test::I');
132 ), '... got the right DFS merge order for Test::J');
[all …]

12345678910>>...213