Home
last modified time | relevance | path

Searched refs:left (Results 51 - 75 of 4249) sorted by relevance

12345678910>>...170

/third_party/ffmpeg/libavcodec/loongarch/
H A Dvp9dsp_loongarch.h91 void ff_vert_16x16_lsx(uint8_t *dst, ptrdiff_t stride, const uint8_t *left,
93 void ff_vert_32x32_lsx(uint8_t *dst, ptrdiff_t stride, const uint8_t *left,
95 void ff_hor_16x16_lsx(uint8_t *dst, ptrdiff_t stride, const uint8_t *left,
97 void ff_hor_32x32_lsx(uint8_t *dst, ptrdiff_t stride, const uint8_t *left,
99 void ff_dc_4x4_lsx(uint8_t *dst, ptrdiff_t stride, const uint8_t *left,
101 void ff_dc_8x8_lsx(uint8_t *dst, ptrdiff_t stride, const uint8_t *left,
103 void ff_dc_16x16_lsx(uint8_t *dst, ptrdiff_t stride, const uint8_t *left,
105 void ff_dc_32x32_lsx(uint8_t *dst, ptrdiff_t stride, const uint8_t *left,
107 void ff_dc_left_4x4_lsx(uint8_t *dst, ptrdiff_t stride, const uint8_t *left,
109 void ff_dc_left_8x8_lsx(uint8_t *dst, ptrdiff_t stride, const uint8_t *left,
[all...]
/third_party/skia/src/sksl/
H A DSkSLOperators.cpp233 bool Operator::isMatrixMultiply(const Type& left, const Type& right) { in isMatrixMultiply() argument
237 if (left.isMatrix()) { in isMatrixMultiply()
240 return left.isVector() && right.isMatrix(); in isMatrixMultiply()
248 const Type& left, in determineBinaryType()
255 case Token::Kind::TK_EQ: // left = right in determineBinaryType()
256 *outLeftType = &left; in determineBinaryType()
257 *outRightType = &left; in determineBinaryType()
258 *outResultType = &left; in determineBinaryType()
259 return right.canCoerceTo(left, allowNarrowing); in determineBinaryType()
261 case Token::Kind::TK_EQEQ: // left in determineBinaryType()
247 determineBinaryType(const Context& context, const Type& left, const Type& right, const Type** outLeftType, const Type** outRightType, const Type** outResultType) determineBinaryType() argument
[all...]
/third_party/icu/icu4c/source/common/
H A Duarrsort.cpp46 uprv_uint16Comparator(const void *context, const void *left, const void *right) { in uprv_uint16Comparator() argument
48 return (int32_t)*(const uint16_t *)left - (int32_t)*(const uint16_t *)right; in uprv_uint16Comparator()
52 uprv_int32Comparator(const void *context, const void *left, const void *right) { in uprv_int32Comparator() argument
54 return *(const int32_t *)left - *(const int32_t *)right; in uprv_int32Comparator()
58 uprv_uint32Comparator(const void *context, const void *left, const void *right) { in uprv_uint32Comparator() argument
60 uint32_t l=*(const uint32_t *)left, r=*(const uint32_t *)right; in uprv_uint32Comparator()
172 int32_t left, right; in subQuickSort() local
174 /* start and left are inclusive, limit and right are exclusive */ in subQuickSort()
181 left=start; in subQuickSort()
188 while(/* array[left]< in subQuickSort()
[all...]
/third_party/libuv/src/
H A Dheap-inl.h29 struct heap_node* left; member
84 if (child->left == child) { in heap_node_swap()
85 child->left = parent; in heap_node_swap()
89 sibling = child->left; in heap_node_swap()
94 if (parent->left != NULL) in heap_node_swap()
95 parent->left->parent = parent; in heap_node_swap()
101 else if (child->parent->left == parent) in heap_node_swap()
102 child->parent->left = child; in heap_node_swap()
116 newnode->left = NULL; in HEAP_EXPORT()
121 * heap so we always insert at the left in HEAP_EXPORT()
[all...]
/third_party/node/deps/icu-small/source/common/
H A Duarrsort.cpp46 uprv_uint16Comparator(const void *context, const void *left, const void *right) { in uprv_uint16Comparator() argument
48 return (int32_t)*(const uint16_t *)left - (int32_t)*(const uint16_t *)right; in uprv_uint16Comparator()
52 uprv_int32Comparator(const void *context, const void *left, const void *right) { in uprv_int32Comparator() argument
54 return *(const int32_t *)left - *(const int32_t *)right; in uprv_int32Comparator()
58 uprv_uint32Comparator(const void *context, const void *left, const void *right) { in uprv_uint32Comparator() argument
60 uint32_t l=*(const uint32_t *)left, r=*(const uint32_t *)right; in uprv_uint32Comparator()
172 int32_t left, right; in subQuickSort() local
174 /* start and left are inclusive, limit and right are exclusive */ in subQuickSort()
181 left=start; in subQuickSort()
188 while(/* array[left]< in subQuickSort()
[all...]
/third_party/node/deps/uv/src/
H A Dheap-inl.h28 struct heap_node* left; member
83 if (child->left == child) { in heap_node_swap()
84 child->left = parent; in heap_node_swap()
88 sibling = child->left; in heap_node_swap()
93 if (parent->left != NULL) in heap_node_swap()
94 parent->left->parent = parent; in heap_node_swap()
100 else if (child->parent->left == parent) in heap_node_swap()
101 child->parent->left = child; in heap_node_swap()
115 newnode->left = NULL; in HEAP_EXPORT()
120 * heap so we always insert at the left in HEAP_EXPORT()
[all...]
/third_party/skia/third_party/externals/icu/source/common/
H A Duarrsort.cpp46 uprv_uint16Comparator(const void *context, const void *left, const void *right) { in uprv_uint16Comparator() argument
48 return (int32_t)*(const uint16_t *)left - (int32_t)*(const uint16_t *)right; in uprv_uint16Comparator()
52 uprv_int32Comparator(const void *context, const void *left, const void *right) { in uprv_int32Comparator() argument
54 return *(const int32_t *)left - *(const int32_t *)right; in uprv_int32Comparator()
58 uprv_uint32Comparator(const void *context, const void *left, const void *right) { in uprv_uint32Comparator() argument
60 uint32_t l=*(const uint32_t *)left, r=*(const uint32_t *)right; in uprv_uint32Comparator()
172 int32_t left, right; in subQuickSort() local
174 /* start and left are inclusive, limit and right are exclusive */ in subQuickSort()
181 left=start; in subQuickSort()
188 while(/* array[left]< in subQuickSort()
[all...]
/foundation/communication/wifi/wifi/services/wifi_standard/wifi_framework/wifi_manage/wifi_native/client/hdi_client/hdi_interface/
H A Dwifi_hdi_common.c413 int left; in HdiConvertIe() local
445 left = (int)(wpaIeLen - sizeof(*hdr)); in HdiConvertIe()
447 if (left >= HDI_SELECTOR_LEN) { in HdiConvertIe()
450 left -= HDI_SELECTOR_LEN; in HdiConvertIe()
451 } else if (left > 0) { in HdiConvertIe()
452 LOGI("ie length mismatch, %{public}u too much", left); in HdiConvertIe()
456 if (left >= HDI_POS_SECOND) { in HdiConvertIe()
460 left -= HDI_POS_SECOND; in HdiConvertIe()
461 if (count == 0 || count > left / HDI_SELECTOR_LEN) { in HdiConvertIe()
462 LOGI("ie count botch (pairwise), count %{public}u left in HdiConvertIe()
504 int left; HdiConvertIeRsn() local
[all...]
/third_party/zlib/examples/
H A Denough.c42 all the symbols are used, there are exactly zero possible bit patterns left
126 left: number of available bit patterns at length len
132 left: 2..syms - 1, but only the evens (so syms == 8 -> 2, 4, 6)
135 syms == 2 is not saved since that immediately leads to a single code. left
137 the current length, which is double the number at the previous length. left
138 ends at syms-1 since left == syms immediately results in a single code.
139 (left > sym is not allowed since that would result in an incomplete code.)
156 to the num[] array as described above for the (syms, left, len) triplet.
237 local inline size_t map(int syms, int left, int len) { in map() argument
239 (left >> in map()
261 count(int syms, int left, int len) count() argument
308 been_here(int syms, int left, int len, int mem, int rem) been_here() argument
361 examine(int syms, int left, int len, int mem, int rem) examine() argument
[all...]
/kernel/linux/linux-5.10/include/linux/
H A Dregset.h22 size_t left; member
27 if (s->left) { in membuf_zero()
28 if (size > s->left) in membuf_zero()
29 size = s->left; in membuf_zero()
32 s->left -= size; in membuf_zero()
34 return s->left; in membuf_zero()
39 if (s->left) { in membuf_write()
40 if (size > s->left) in membuf_write()
41 size = s->left; in membuf_write()
44 s->left in membuf_write()
[all...]
/third_party/mesa3d/src/panfrost/bifrost/
H A Dnodearray.h139 unsigned left = 0; in nodearray_sparse_search() local
143 left = right; in nodearray_sparse_search()
145 while (left != right) { in nodearray_sparse_search()
148 unsigned probe = (left + right + 1) / 2; in nodearray_sparse_search()
153 left = probe; in nodearray_sparse_search()
156 *elem = data + left; in nodearray_sparse_search()
157 return left; in nodearray_sparse_search()
172 unsigned left = 0; in nodearray_orr()
177 left = nodearray_sparse_search(a, key, &elem); in nodearray_orr()
184 /* We insert before `left`, s in nodearray_orr()
[all...]
/third_party/skia/src/core/
H A DSkTSort.h114 static void SkTInsertionSort(T* left, int count, const C& lessThan) { in SkTInsertionSort() argument
115 T* right = left + count - 1; in SkTInsertionSort()
116 for (T* next = left + 1; next <= right; ++next) { in SkTInsertionSort()
125 } while (left < hole && lessThan(insert, *(hole - 1))); in SkTInsertionSort()
133 static T* SkTQSort_Partition(T* left, int count, T* pivot, const C& lessThan) { in SkTQSort_Partition() argument
134 T* right = left + count - 1; in SkTQSort_Partition()
138 T* newPivot = left; in SkTQSort_Partition()
139 while (left < right) { in SkTQSort_Partition()
140 if (lessThan(*left, pivotValue)) { in SkTQSort_Partition()
141 swap(*left, *newPivo in SkTQSort_Partition()
163 SkTIntroSort(int depth, T* left, int count, const C& lessThan) SkTIntroSort() argument
[all...]
/kernel/linux/linux-5.10/drivers/video/fbdev/core/
H A Dsyscopyarea.c33 int left, right; in bitcpy() local
81 left = -shift & (bits - 1); in bitcpy()
89 *dst = comp(*src << left, *dst, first); in bitcpy()
97 *dst = comp(d0 >> right | d1 << left, *dst, in bitcpy()
112 *dst = comp(d0 << left, *dst, first); in bitcpy()
118 *dst = comp(d0 >> right | d1 << left, *dst, in bitcpy()
130 *dst++ = d0 >> right | d1 << left; in bitcpy()
133 *dst++ = d0 >> right | d1 << left; in bitcpy()
136 *dst++ = d0 >> right | d1 << left; in bitcpy()
139 *dst++ = d0 >> right | d1 << left; in bitcpy()
227 int const left = shift & (bits-1); bitcpy_rev() local
303 d0 <<= left; bitcpy_rev() local
[all...]
H A Dsysfillrect.c82 unsigned long pat, int left, int right, unsigned n, int bits) in bitfill_unaligned()
103 pat = pat << left | pat >> right; in bitfill_unaligned()
111 pat = pat << left | pat >> right; in bitfill_unaligned()
113 pat = pat << left | pat >> right; in bitfill_unaligned()
115 pat = pat << left | pat >> right; in bitfill_unaligned()
117 pat = pat << left | pat >> right; in bitfill_unaligned()
122 pat = pat << left | pat >> right; in bitfill_unaligned()
192 unsigned long pat, int left, int right, unsigned n, in bitfill_unaligned_rev()
215 pat = pat << left | pat >> right; in bitfill_unaligned_rev()
223 pat = pat << left | pa in bitfill_unaligned_rev()
81 bitfill_unaligned(struct fb_info *p, unsigned long *dst, int dst_idx, unsigned long pat, int left, int right, unsigned n, int bits) bitfill_unaligned() argument
191 bitfill_unaligned_rev(struct fb_info *p, unsigned long *dst, int dst_idx, unsigned long pat, int left, int right, unsigned n, int bits) bitfill_unaligned_rev() argument
250 int dst_idx, left; sys_fillrect() local
[all...]
/kernel/linux/linux-6.6/drivers/video/fbdev/core/
H A Dsyscopyarea.c33 int left, right; in bitcpy() local
81 left = -shift & (bits - 1); in bitcpy()
89 *dst = comp(*src << left, *dst, first); in bitcpy()
97 *dst = comp(d0 >> right | d1 << left, *dst, in bitcpy()
112 *dst = comp(d0 << left, *dst, first); in bitcpy()
118 *dst = comp(d0 >> right | d1 << left, *dst, in bitcpy()
130 *dst++ = d0 >> right | d1 << left; in bitcpy()
133 *dst++ = d0 >> right | d1 << left; in bitcpy()
136 *dst++ = d0 >> right | d1 << left; in bitcpy()
139 *dst++ = d0 >> right | d1 << left; in bitcpy()
227 int const left = shift & (bits-1); bitcpy_rev() local
303 d0 <<= left; bitcpy_rev() local
[all...]
/third_party/ltp/testcases/kernel/device-drivers/v4l/user_space/
H A Dtest_VIDIOC_CROP.c165 "crop_orig = { .type=%i, .c={ .left=%i, .top=%i, .width=%i, .height=%i }}\n", in do_set_crop()
169 crop_orig.c.left, in do_set_crop()
179 ".bounds = { .left = %i, .top = %i, .width = %i, .height = %i }, " in do_set_crop()
180 ".defrect = { .left = %i, .top = %i, .width = %i, .height = %i }, " in do_set_crop()
183 cropcap.bounds.left, cropcap.bounds.top, cropcap.bounds.width, in do_set_crop()
184 cropcap.bounds.height, cropcap.defrect.left, cropcap.defrect.top, in do_set_crop()
194 "crop = { .type=%i, .c={ .left=%i, .top=%i, .width=%i, .height=%i }}\n", in do_set_crop()
198 crop.c.left, crop.c.top, crop.c.width, crop.c.height); in do_set_crop()
205 "crop_new = { .type=%i, .c={ .left=%i, .top=%i, .width=%i, .height=%i }}\n", in do_set_crop()
209 crop_new.c.left, in do_set_crop()
[all...]
/kernel/linux/linux-5.10/arch/x86/crypto/
H A Ddes3_ede-asm_64.S92 #define initial_permutation(left, right) \
93 do_permutation(left##d, right##d, 4, 0x0f0f0f0f); \
94 do_permutation(left##d, right##d, 16, 0x0000ffff); \
95 do_permutation(right##d, left##d, 2, 0x33333333); \
96 do_permutation(right##d, left##d, 8, 0x00ff00ff); \
98 movl left##d, RW0d; \
102 xorl RW0d, left##d; \
104 roll $1, left##d; \
106 expand_to_64bits(left, RT3);
108 #define final_permutation(left, righ
[all...]
/kernel/linux/linux-6.6/arch/x86/crypto/
H A Ddes3_ede-asm_64.S92 #define initial_permutation(left, right) \
93 do_permutation(left##d, right##d, 4, 0x0f0f0f0f); \
94 do_permutation(left##d, right##d, 16, 0x0000ffff); \
95 do_permutation(right##d, left##d, 2, 0x33333333); \
96 do_permutation(right##d, left##d, 8, 0x00ff00ff); \
98 movl left##d, RW0d; \
102 xorl RW0d, left##d; \
104 roll $1, left##d; \
106 expand_to_64bits(left, RT3);
108 #define final_permutation(left, righ
[all...]
/kernel/linux/linux-5.10/drivers/net/wireless/intersil/hostap/
H A Dhostap_info.c15 int left) in prism2_info_commtallies16()
19 if (left < sizeof(struct hfa384x_comm_tallies)) { in prism2_info_commtallies16()
21 "info frame\n", local->dev->name, left); in prism2_info_commtallies16()
55 int left) in prism2_info_commtallies32()
59 if (left < sizeof(struct hfa384x_comm_tallies32)) { in prism2_info_commtallies32()
61 "info frame\n", local->dev->name, left); in prism2_info_commtallies32()
95 int left) in prism2_info_commtallies()
98 prism2_info_commtallies32(local, buf, left); in prism2_info_commtallies()
100 prism2_info_commtallies16(local, buf, left); in prism2_info_commtallies()
130 int left) in prism2_info_linkstatus()
14 prism2_info_commtallies16(local_info_t *local, unsigned char *buf, int left) prism2_info_commtallies16() argument
54 prism2_info_commtallies32(local_info_t *local, unsigned char *buf, int left) prism2_info_commtallies32() argument
94 prism2_info_commtallies(local_info_t *local, unsigned char *buf, int left) prism2_info_commtallies() argument
129 prism2_info_linkstatus(local_info_t *local, unsigned char *buf, int left) prism2_info_linkstatus() argument
253 prism2_info_scanresults(local_info_t *local, unsigned char *buf, int left) prism2_info_scanresults() argument
305 prism2_info_hostscanresults(local_info_t *local, unsigned char *buf, int left) prism2_info_hostscanresults() argument
372 int left; hostap_info_process() local
[all...]
/kernel/linux/linux-6.6/drivers/net/wireless/intersil/hostap/
H A Dhostap_info.c15 int left) in prism2_info_commtallies16()
19 if (left < sizeof(struct hfa384x_comm_tallies)) { in prism2_info_commtallies16()
21 "info frame\n", local->dev->name, left); in prism2_info_commtallies16()
55 int left) in prism2_info_commtallies32()
59 if (left < sizeof(struct hfa384x_comm_tallies32)) { in prism2_info_commtallies32()
61 "info frame\n", local->dev->name, left); in prism2_info_commtallies32()
95 int left) in prism2_info_commtallies()
98 prism2_info_commtallies32(local, buf, left); in prism2_info_commtallies()
100 prism2_info_commtallies16(local, buf, left); in prism2_info_commtallies()
130 int left) in prism2_info_linkstatus()
14 prism2_info_commtallies16(local_info_t *local, unsigned char *buf, int left) prism2_info_commtallies16() argument
54 prism2_info_commtallies32(local_info_t *local, unsigned char *buf, int left) prism2_info_commtallies32() argument
94 prism2_info_commtallies(local_info_t *local, unsigned char *buf, int left) prism2_info_commtallies() argument
129 prism2_info_linkstatus(local_info_t *local, unsigned char *buf, int left) prism2_info_linkstatus() argument
253 prism2_info_scanresults(local_info_t *local, unsigned char *buf, int left) prism2_info_scanresults() argument
305 prism2_info_hostscanresults(local_info_t *local, unsigned char *buf, int left) prism2_info_hostscanresults() argument
372 int left; hostap_info_process() local
[all...]
/third_party/node/deps/v8/src/ic/
H A Dbinary-op-assembler.h25 const LazyNode<Context>& context, TNode<Object> left, TNode<Object> right,
30 const LazyNode<Context>& context, TNode<Object> left, TNode<Object> right,
35 const LazyNode<Context>& context, TNode<Object> left, TNode<Object> right,
58 const LazyNode<Context>& context, TNode<Object> left, TNode<Object> right, in Generate_BitwiseOrWithFeedback()
62 Operation::kBitwiseOr, left, right, context, slot, in Generate_BitwiseOrWithFeedback()
68 const LazyNode<Context>& context, TNode<Object> left, TNode<Object> right, in Generate_BitwiseXorWithFeedback()
72 Operation::kBitwiseXor, left, right, context, slot, in Generate_BitwiseXorWithFeedback()
79 const LazyNode<Context>& context, TNode<Object> left, TNode<Object> right, in Generate_BitwiseAndWithFeedback()
83 Operation::kBitwiseAnd, left, right, context, slot, in Generate_BitwiseAndWithFeedback()
90 const LazyNode<Context>& context, TNode<Object> left, TNod in Generate_ShiftLeftWithFeedback()
57 Generate_BitwiseOrWithFeedback( const LazyNode<Context>& context, TNode<Object> left, TNode<Object> right, TNode<UintPtrT> slot, const LazyNode<HeapObject>& maybe_feedback_vector, UpdateFeedbackMode update_feedback_mode, bool rhs_known_smi) Generate_BitwiseOrWithFeedback() argument
67 Generate_BitwiseXorWithFeedback( const LazyNode<Context>& context, TNode<Object> left, TNode<Object> right, TNode<UintPtrT> slot, const LazyNode<HeapObject>& maybe_feedback_vector, UpdateFeedbackMode update_feedback_mode, bool rhs_known_smi) Generate_BitwiseXorWithFeedback() argument
78 Generate_BitwiseAndWithFeedback( const LazyNode<Context>& context, TNode<Object> left, TNode<Object> right, TNode<UintPtrT> slot, const LazyNode<HeapObject>& maybe_feedback_vector, UpdateFeedbackMode update_feedback_mode, bool rhs_known_smi) Generate_BitwiseAndWithFeedback() argument
89 Generate_ShiftLeftWithFeedback( const LazyNode<Context>& context, TNode<Object> left, TNode<Object> right, TNode<UintPtrT> slot, const LazyNode<HeapObject>& maybe_feedback_vector, UpdateFeedbackMode update_feedback_mode, bool rhs_known_smi) Generate_ShiftLeftWithFeedback() argument
100 Generate_ShiftRightWithFeedback( const LazyNode<Context>& context, TNode<Object> left, TNode<Object> right, TNode<UintPtrT> slot, const LazyNode<HeapObject>& maybe_feedback_vector, UpdateFeedbackMode update_feedback_mode, bool rhs_known_smi) Generate_ShiftRightWithFeedback() argument
111 Generate_ShiftRightLogicalWithFeedback( const LazyNode<Context>& context, TNode<Object> left, TNode<Object> right, TNode<UintPtrT> slot, const LazyNode<HeapObject>& maybe_feedback_vector, UpdateFeedbackMode update_feedback_mode, bool rhs_known_smi) Generate_ShiftRightLogicalWithFeedback() argument
122 Generate_BitwiseBinaryOpWithFeedback( Operation bitwise_op, TNode<Object> left, TNode<Object> right, const LazyNode<Context>& context, TNode<UintPtrT> slot, const LazyNode<HeapObject>& maybe_feedback_vector, UpdateFeedbackMode update_feedback_mode, bool rhs_known_smi) Generate_BitwiseBinaryOpWithFeedback() argument
136 Generate_BitwiseBinaryOp(Operation bitwise_op, TNode<Object> left, TNode<Object> right, TNode<Context> context) Generate_BitwiseBinaryOp() argument
[all...]
/foundation/arkui/ace_engine/frameworks/core/components_ng/property/
H A Dmeasure_property.h371 std::optional<T> left; member
380 left = padding; in SetEdges()
388 left = leftValue; in SetEdges()
396 return (left == value.left) && (right == value.right) && (top == value.top) && (bottom == value.bottom); in operator ==()
412 left = value.left; in UpdateWithCheck()
446 str.append("[").append(left.has_value() ? left->ToString() : "NA"); in ToString()
454 if (top == right && right == bottom && bottom == left) { in ToJsonString()
498 std::optional<float> left; global() member
[all...]
/kernel/linux/linux-5.10/drivers/firmware/
H A Dedd.c45 #define left (PAGE_SIZE - (p - buf) - 1) macro
135 p += scnprintf(p, left, "%c", info->params.host_bus_type[i]); in edd_show_host_bus()
137 p += scnprintf(p, left, " "); in edd_show_host_bus()
142 p += scnprintf(p, left, "\tbase_address: %x\n", in edd_show_host_bus()
147 p += scnprintf(p, left, in edd_show_host_bus()
155 p += scnprintf(p, left, in edd_show_host_bus()
160 p += scnprintf(p, left, "\tunknown: %llx\n", in edd_show_host_bus()
181 p += scnprintf(p, left, "%c", info->params.interface_type[i]); in edd_show_interface()
183 p += scnprintf(p, left, " "); in edd_show_interface()
187 p += scnprintf(p, left, "\tdevic in edd_show_interface()
[all...]
/kernel/linux/linux-6.6/drivers/firmware/
H A Dedd.c45 #define left (PAGE_SIZE - (p - buf) - 1) macro
135 p += scnprintf(p, left, "%c", info->params.host_bus_type[i]); in edd_show_host_bus()
137 p += scnprintf(p, left, " "); in edd_show_host_bus()
142 p += scnprintf(p, left, "\tbase_address: %x\n", in edd_show_host_bus()
147 p += scnprintf(p, left, in edd_show_host_bus()
155 p += scnprintf(p, left, in edd_show_host_bus()
160 p += scnprintf(p, left, "\tunknown: %llx\n", in edd_show_host_bus()
181 p += scnprintf(p, left, "%c", info->params.interface_type[i]); in edd_show_interface()
183 p += scnprintf(p, left, " "); in edd_show_interface()
187 p += scnprintf(p, left, "\tdevic in edd_show_interface()
[all...]
/third_party/vulkan-loader/loader/
H A Dloader_linux.c76 struct LinuxSortedDeviceInfo *left = (struct LinuxSortedDeviceInfo *)a; in compare_devices() local
80 if (left->default_device) { in compare_devices()
87 int32_t dev_type_comp = device_type_compare(left->device_type, right->device_type); in compare_devices()
93 if (left->has_pci_bus_info && !right->has_pci_bus_info) { in compare_devices()
95 } else if (!left->has_pci_bus_info && right->has_pci_bus_info) { in compare_devices()
97 } else if (left->has_pci_bus_info && right->has_pci_bus_info) { in compare_devices()
99 if (left->pci_domain < right->pci_domain) { in compare_devices()
101 } else if (left->pci_domain > right->pci_domain) { in compare_devices()
105 if (left->pci_bus < right->pci_bus) { in compare_devices()
107 } else if (left in compare_devices()
147 struct LinuxSortedDeviceInfo *left = &grp_a->internal_device_info[0]; compare_device_groups() local
[all...]

Completed in 13 milliseconds

12345678910>>...170