Home
last modified time | relevance | path

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

12345678910>>...59

/OK3568_Linux_fs/kernel/tools/perf/util/
H A Drb_resort.h15 * fields to be present in each of the entries in the new, sorted, rb_tree.
19 * the rb_tree used as a source for the entries to be sorted:
76 static void __name##_sorted__insert(struct __name##_sorted *sorted, \
79 struct rb_node **p = &sorted->entries.rb_node, *parent = NULL; \
88 rb_insert_color(sorted_nd, &sorted->entries); \
91 static void __name##_sorted__sort(struct __name##_sorted *sorted, \
97 struct __name##_sorted_entry *snd = &sorted->nd[i++]; \
99 __name##_sorted__insert(sorted, &snd->rb_node); \
106 struct __name##_sorted *sorted; \
107 sorted = malloc(sizeof(*sorted) + sizeof(sorted->nd[0]) * nr_entries); \
[all …]
/OK3568_Linux_fs/yocto/poky/bitbake/lib/toaster/tests/browser/
H A Dtest_toastertable_ui.py31 the sorted class on it.
35 selector = 'thead a.sorted'
69 # set up two builds which will order differently when sorted by
92 'table should be sorted by "Completed on" by default')
101 'table should be sorted by -completed_on')
120 'table should be sorted by "Started on"')
128 'table should be sorted by started_on')
140 'table should be sorted by "Completed on" after hiding sort column')
148 'table should be sorted by -completed_on')
/OK3568_Linux_fs/external/xserver/glamor/
H A Dglamor_spans.c47 int n, DDXPointPtr points, int *widths, int sorted) in glamor_fill_spans_gl() argument
161 int n, DDXPointPtr points, int *widths, int sorted) in glamor_fill_spans_bail() argument
165 fbFillSpans(drawable, gc, n, points, widths, sorted); in glamor_fill_spans_bail()
174 int n, DDXPointPtr points, int *widths, int sorted) in glamor_fill_spans() argument
177 glamor_fill_spans_gl(drawable, gc, n, points, widths, sorted)) in glamor_fill_spans()
179 glamor_fill_spans_bail(drawable, gc, n, points, widths, sorted); in glamor_fill_spans()
268 DDXPointPtr points, int *widths, int numPoints, int sorted) in glamor_set_spans_gl() argument
368 DDXPointPtr points, int *widths, int numPoints, int sorted) in glamor_set_spans_bail() argument
371 fbSetSpans(drawable, gc, src, points, widths, numPoints, sorted); in glamor_set_spans_bail()
378 DDXPointPtr points, int *widths, int numPoints, int sorted) in glamor_set_spans() argument
[all …]
/OK3568_Linux_fs/kernel/include/linux/
H A Dutil_macros.h19 * find_closest - locate the closest element in a sorted array
21 * @a: The array in which to look for the closest element. Must be sorted
30 * find_closest_descending - locate the closest element in a sorted array
32 * @a: The array in which to look for the closest element. Must be sorted
36 * Similar to find_closest() but 'a' is expected to be sorted in descending
/OK3568_Linux_fs/kernel/drivers/md/bcache/
H A Ddebug.c34 struct bset *ondisk, *sorted, *inmemory; in bch_btree_verify() local
44 sorted = b->c->verify_data->keys.set->data; in bch_btree_verify()
57 bch_bio_map(bio, sorted); in bch_btree_verify()
62 memcpy(ondisk, sorted, KEY_SIZE(&v->key) << 9); in bch_btree_verify()
65 sorted = v->keys.set->data; in bch_btree_verify()
67 if (inmemory->keys != sorted->keys || in bch_btree_verify()
69 sorted->start, in bch_btree_verify()
81 bch_dump_bset(&v->keys, sorted, 0); in bch_btree_verify()
95 if (inmemory->d[j] != sorted->d[j]) in bch_btree_verify()
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/algorithms/detail/
H A Dget_left_turns.hpp196 inline std::size_t assign_cluster_indices(AngleCollection& sorted, Point const& origin, in assign_cluster_indices() argument
200 BOOST_GEOMETRY_ASSERT(boost::size(sorted) >= 4u); in assign_cluster_indices()
203 typename boost::range_iterator<AngleCollection>::type it = sorted.begin(); in assign_cluster_indices()
208 for (; it != sorted.end(); ++it) in assign_cluster_indices()
221 inline void block_turns(AngleCollection& sorted, std::size_t cluster_size) in block_turns() argument
223 BOOST_GEOMETRY_ASSERT(boost::size(sorted) >= 4u && cluster_size > 0); in block_turns()
231 for (typename boost::range_iterator<AngleCollection const>::type it = sorted.begin(); in block_turns()
232 it != sorted.end(); ++it) in block_turns()
244 for (typename boost::range_iterator<AngleCollection>::type it = sorted.begin(); in block_turns()
245 it != sorted.end(); ++it) in block_turns()
/OK3568_Linux_fs/yocto/poky/meta/recipes-devtools/python/python3-hypothesis/
H A Dtest_binary_search.py32 """Take a list ls and a value v such that ls is sorted and v is comparable
37 1. ls.insert(i, v) is sorted
38 2. ls.insert(j, v) is not sorted for j < i
79 """Is this list sorted?"""
90 SortedLists = st.lists(Values).map(sorted)
94 # The problem is that Hypothesis will only generate long sorted lists with very
102 that inserting the value provided at that index would result in a sorted
/OK3568_Linux_fs/external/security/librkcrypto/third_party/libdrm/src/
H A Dxf86drmMode.c1372 drmModeAtomicReqPtr sorted; in drmModeAtomicCommit() local
1389 sorted = drmModeAtomicDuplicate(req); in drmModeAtomicCommit()
1390 if (sorted == NULL) in drmModeAtomicCommit()
1396 qsort(sorted->items, sorted->cursor, sizeof(*sorted->items), in drmModeAtomicCommit()
1399 /* Now the list is sorted, eliminate duplicate property sets. */ in drmModeAtomicCommit()
1400 for (i = 0; i < sorted->cursor; i++) { in drmModeAtomicCommit()
1401 if (sorted->items[i].object_id != last_obj_id) { in drmModeAtomicCommit()
1403 last_obj_id = sorted->items[i].object_id; in drmModeAtomicCommit()
1406 if (i == sorted->cursor - 1) in drmModeAtomicCommit()
1409 if (sorted->items[i].object_id != sorted->items[i + 1].object_id || in drmModeAtomicCommit()
[all …]
/OK3568_Linux_fs/kernel/tools/lib/traceevent/Documentation/
H A Dlibtraceevent-event_list.txt7 Get list of events, sorted by given criteria.
28 sorted by the _sort_type_ criteria. The last element of the array is NULL.
68 /* Failed to get the events, sorted by ID */
71 /* walk through the list of the events, sorted by ID */
79 /* Failed to get the events, sorted by name */
82 /* walk through the list of the events, sorted by name */
/OK3568_Linux_fs/yocto/meta-openembedded/meta-oe/recipes-core/sdbus-c++/sdbus-c++-libsystemd/
H A D0002-don-t-use-glibc-specific-qsort_r.patch90 sorted[i] = i * t->n_columns;
92 - typesafe_qsort_r(sorted, n_rows, table_data_compare, t);
95 + assert(sorted);
97 + qsort(sorted, n_rows, sizeof(size_t), table_data_compare);
104 sorted[i] = i * t->n_columns;
106 - typesafe_qsort_r(sorted, n_rows, table_data_compare, t);
109 + assert(sorted);
111 + qsort(sorted, n_rows, sizeof(size_t), table_data_compare);
/OK3568_Linux_fs/yocto/poky/meta/recipes-kernel/perf/perf/
H A Dsort-pmuevents.py66 # should end up as the last element in the sorted list, which
72 # a sorted() iteration of the keys. We don't care about the order we read
73 # things, just the sorted order. Hency why we couldn't create these during
79 for i in sorted(entry_dict.keys()):
84 for f in sorted(entry_dict[i]['fields'].keys()):
87 # dump the sorted elements to the outfile
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/move/algo/
H A Dadaptive_merge.hpp21 //! <b>Effects</b>: Merges two consecutive sorted ranges [first, middle) and [middle, last)
22 //! into one sorted range [first, last) according to the given comparison function comp.
32 //! - first: the beginning of the first sorted range.
33 //! - middle: the end of the first sorted range and the beginning of the second
34 //! - last: the end of the second sorted range
/OK3568_Linux_fs/buildroot/package/leafnode2/
H A D0001-cross_makefile.patch20 rm -f config.table.sorted
21 - ./b_sortnl$(EXEEXT) <$(srcdir)/config.table >config.table.sorted
22 + ./b_sortnl_host$(EXEEXT) <$(srcdir)/config.table >config.table.sorted
23 $(AWK) -f $(srcdir)/genconfigparam_data.awk <config.table.sorted >$@ \
/OK3568_Linux_fs/yocto/poky/meta/recipes-core/ovmf/ovmf/
H A D0006-reproducible.patch100 + self.ResultFileList = sorted([str(T.Target) for T in MyAgo.CodaTargetList])
109 + for Cmd in sorted(self.GenFfsList):
118 + for SecOutputFile, SecDepsFile, SecCmd in sorted(self.FfsOutputFileList):
148 + for Type in sorted(self._AutoGenObject.Targets):
151 + for T in sorted(self._AutoGenObject.Targets[Type]):
164 + AsBuiltInfDict['binary_item'] = sorted(AsBuiltInfDict['binary_item'])
174 + SaveFileOnChange(self.TimeStampPath, "\n".join(sorted(FileSet)), False)
/OK3568_Linux_fs/yocto/poky/scripts/contrib/
H A Dlist-packageconfig-flags.py39 for pn in sorted(pkg_pn):
69 pkg_dict[pkgname] = sorted(pkgconfigflags.keys())
97 for pkgname in sorted(pkg_dict):
109 for flag in sorted(flag_dict):
110 print('%-*s%s' % (flag_len, flag, ' '.join(sorted(flag_dict[flag]))))
/OK3568_Linux_fs/kernel/Documentation/devicetree/bindings/display/rockchip/
H A Drockchip,rk618.txt13 - clock-names: list of clock names sorted in the same order as the clocks
64 - clock-names: list of clock names sorted in the same order as the clocks
115 - clock-names: list of clock names sorted in the same order as the clocks
169 - clock-names: list of clock names sorted in the same order as the clocks
223 - clock-names: list of clock names sorted in the same order as the clocks
270 - clock-names: list of clock names sorted in the same order as the clocks
/OK3568_Linux_fs/yocto/poky/bitbake/lib/bb/
H A Dsiggen.py29 return dict(_set_object=list(sorted(obj)))
288 for dep in sorted(deps, key=clean_basepath):
908 …ependencies changed{color_default} from:\n%s\nto:\n%s") % (sorted(a_data['taskdeps']), sorted(b_da…
915 for dep in sorted(changed):
920 for dep in sorted(added):
923 for dep in sorted(removed):
929 for dep in sorted(changed):
999 for dep in sorted(added):
1009 for dep in sorted(removed):
1019 for dep in sorted(changed):
[all …]
H A Ddata.py97 for key in sorted(todolist):
190 keys = sorted((key for key in d.keys() if not key.startswith("__")), key=isfunc)
193 for key in sorted(keys):
217 for key in sorted(keys):
229 for dep in sorted(deps):
294 for k in sorted(contains):
298 for item in sorted(contains[k]):
308 for r in sorted(removes):
430 alldeps = sorted(seen)
/OK3568_Linux_fs/kernel/kernel/kcsan/
H A Ddebugfs.c42 bool sorted; /* if elements are sorted */ member
48 .sorted = false,
113 if (!report_filterlist.sorted) { in kcsan_skip_report_debugfs()
116 report_filterlist.sorted = true; in kcsan_skip_report_debugfs()
181 report_filterlist.sorted = false; in insert_report_filterlist()
/OK3568_Linux_fs/external/rknpu2/examples/3rdparty/opencv/opencv-linux-aarch64/include/opencv2/flann/
H A Dparams.h46 SearchParams(int checks = 32, float eps = 0, bool sorted = true )
52 // only for radius search, require neighbours sorted by distance (default: true)
53 (*this)["sorted"] = sorted;
/OK3568_Linux_fs/kernel/net/ceph/
H A Dstriper.c48 * Return the last extent with given objno (@object_extents is sorted
93 * Map a file extent to a sorted list of object extents.
104 * To keep @object_extents sorted, successive calls to this function
106 * are mapped using the same @object_extents must be sorted).
160 WARN(1, "%s: object_extents list not sorted!\n", in ceph_file_to_extents()
205 * Reverse map an object extent to a sorted list of file extents.
/OK3568_Linux_fs/yocto/poky/scripts/
H A Dbuildstats-diff46 subpaths = sorted(glob.glob(path + '/*'))
82 for name, val in sorted(diff.new.items()):
88 for name, val in sorted(diff.dropped.items()):
95 for name, val in sorted(diff.rchanged.items()):
103 for name, val in sorted(diff.vchanged.items()):
111 for name, val in sorted(diff.echanged.items()):
176 tasks_diff = sorted(tasks_diff, key=attrgetter(field), reverse=reverse)
/OK3568_Linux_fs/yocto/poky/meta/lib/oeqa/manual/
H A Dtoaster-unmanaged-mode.json56 "expected_results": "Build targets are sorted out by the \"Completed on\". "
185 …"action": "Observe that the fields are sorted as follows (with the indicated items greyed) \n \n…
193 …olumn header is in bold, it has a down-arrow icon, and that the table is sorted by this column in …
271 … in the table are \"File\" and \"Size\" \n * Observe that the table is sorted by \"File\" in asc…
275 … are: \n \"Package, Version, Size\" \n * Observe that the table is sorted by Package in asce…
305 …"action": "Make sure that by default the \"Recipes\" table is sorted by \"Recipe\" in ascending al…
309 …on in web-browser to go back to the \"Recipes\" table it should still be sorted by \"Section\". \…
317 …on\" column by \"Edit columns\". Make sure that the \"Recipes\" table is sorted by \"Recipe\" in a…
321 …sorted by the sorting criteria selected when the search query was submitted. \nSort recipes by \"s…
405 … * Click the \"Edit Columns\" button. \n * Observe that the fields are sorted as follows (with t…
[all …]
/OK3568_Linux_fs/yocto/poky/meta/lib/oeqa/utils/
H A Dgitarchive.py27 string, err, ', '.join(sorted(fields.keys()))))
173 """Get a sorted list of test runs, matching given pattern"""
205 # Return field names and a sorted list of revs
206 return undef_fields, sorted(revs)
225 # Return in sorted table
226 revs = sorted(revs.values(), key=attrgetter('commit_number'))
/OK3568_Linux_fs/yocto/poky/meta/lib/oeqa/selftest/cases/
H A Dpkgdata.py79 pkglist = sorted(result.output.split())
87 pkglist = sorted(result.output.split())
95 pkglist = sorted(result.output.split())
99 pkglist = sorted(result.output.split())
103 pkglist = sorted(result.output.split())
107 pkglist = sorted(result.output.split())
208 self.assertEqual(sorted(result.output.split()), sorted(desiredresult))

12345678910>>...59