Searched refs:qsort (Results 1 - 25 of 36) sorted by relevance

12

/haiku/src/system/kernel/scheduler/
H A Dscheduler_profiler.cpp114 qsort(fFunctionData, count, sizeof(FunctionData),
128 qsort(fFunctionData, count, sizeof(FunctionData),
142 qsort(fFunctionData, count, sizeof(FunctionData),
156 qsort(fFunctionData, count, sizeof(FunctionData),
170 qsort(fFunctionData, count, sizeof(FunctionData),
/haiku/src/system/libroot/posix/musl/dirent/
H A Dscandir.c43 if (cmp) qsort(names, cnt, sizeof *names, (int (*)(const void *, const void *))cmp);
/haiku/src/tests/kits/locale/
H A DcollatorTest.cpp198 qsort(kStrings, kNumStrings, sizeof(char *), compareStrings);
/haiku/src/system/libnetwork/netresolv/net/
H A Dnsdispatch.c355 qsort(mod.mtab, mod.mtabsize, sizeof(mod.mtab[0]),
366 qsort(_nsmod, _nsmodsize, sizeof(*_nsmod), _nsmodcmp);
545 qsort(_nsmap, _nsmapsize, sizeof(*_nsmap), _nsdbtcmp);
/haiku/src/add-ons/kernel/file_systems/netfs/client/
H A DShareAttrDir.cpp238 qsort(_iterators, iteratorCount, sizeof(ShareAttrDirIterator*),
462 qsort(attributes, count, sizeof(Attribute*), compare_attributes);
/haiku/src/libs/glut/
H A DglutGameMode.cpp195 qsort(fModesList, fModesCount, sizeof(display_mode), _CompareModes);
/haiku/headers/posix/
H A Dstdlib.h151 extern void qsort(void *base, size_t numElements, size_t sizeOfElement,
/haiku/src/system/libroot/posix/stdlib/
H A Dqsort.c33 static char sccsid[] = "@(#)qsort.c 8.1 (Berkeley) 6/4/93";
76 * The actual qsort() implementation is static to avoid preemptible calls when
170 /* qsort(pn - d2, d2 / es, es, cmp); */
182 /* qsort(a, d1 / es, es, cmp); */
190 qsort(void *a, size_t n, size_t es, cmp_t *cmp) function
/haiku/src/libs/iconv/
H A Diconv.c582 qsort(aliasbuf, num_aliases, sizeof(struct nalias), compare_by_index);
594 qsort(namesbuf, i, sizeof(const char *), compare_by_name);
/haiku/src/add-ons/kernel/partitioning_systems/common/
H A DPartitionMap.cpp887 qsort(byOffset, byOffsetCount, sizeof(Partition*),
889 qsort(tableOffsets, tableOffsetCount, sizeof(off_t), cmp_offset);
/haiku/src/add-ons/kernel/file_systems/userlandfs/server/beos/
H A Dfs_cache.c861 qsort(ents, num_ents, sizeof(cache_ent **), cache_ent_cmp);
1232 qsort(ents, cur, sizeof(cache_ent **), cache_ent_cmp);
1248 qsort(ents, cur, sizeof(cache_ent **), cache_ent_cmp);
1325 qsort(ents, max, sizeof(cache_ent **), cache_ent_cmp);
1508 qsort(ents, cur, sizeof(cache_ent **), cache_ent_cmp);
1525 qsort(ents, cur, sizeof(cache_ent **), cache_ent_cmp);
2037 qsort(ents, real_nblocks, sizeof(cache_ent **), cache_ent_cmp);
2453 qsort(ents, count, sizeof(cache_ent **), cache_ent_cmp);
/haiku/src/system/kernel/fs/
H A Dvfs_net_boot.cpp382 qsort(partitions, count, sizeof(KPartition*),
H A Dvfs_boot.cpp315 qsort(partitions, count, sizeof(KPartition*),
/haiku/src/kits/support/
H A DList.cpp255 qsort(fObjectList, fItemCount, sizeof(void*), compareFunc);
/haiku/src/apps/mail/
H A DWIndex.cpp259 qsort(fEntryList, fEntries, fEntrySize,
/haiku/src/system/kernel/vm/
H A DVMAddressSpaceLocking.cpp433 qsort(fItems, fCount, sizeof(lock_item), &_CompareItems);
/haiku/src/bin/bfs_tools/
H A Dchkindex.cpp207 qsort(runs,index,sizeof(block_run),(int (*)(const void *,const void *))compareBlockRuns);
/haiku/src/preferences/screen/
H A DScreenMode.cpp194 qsort(fModeList, fModeCount, sizeof(display_mode), compare_mode);
/haiku/src/system/libroot/posix/
H A Dglob.c523 qsort(pglob->gl_pathv + pglob->gl_offs + oldpathc,
/haiku/src/system/libroot/posix/glibc/stdlib/
H A Dstdlib.h738 extern void qsort (void *__base, size_t __nmemb, size_t __size,
/haiku/src/add-ons/media/plugins/ape_reader/MAClib/
H A DAPETag.cpp736 qsort(m_aryFields, m_nFields, sizeof(CAPETagField *), CompareFields);
/haiku/src/add-ons/accelerants/common/
H A Dcreate_display_modes.cpp382 qsort(fModes, fCount, sizeof(display_mode), compare_mode);
/haiku/src/kits/storage/disk_device/
H A DDiskDeviceJobGenerator.cpp301 qsort(fMoveInfos, childCount, sizeof(MoveInfo),
/haiku/src/system/kernel/slab/
H A DSlab.cpp784 qsort(sCallerInfoTable, sCallerInfoCount, sizeof(caller_info),
/haiku/src/libs/bsd/
H A Dfts.c1048 * Construct an array of pointers to the structures and call qsort(3).
1049 * Reassemble the array in the order returned by qsort. If unable to
1064 qsort(sp->fts_array, nitems, sizeof(FTSENT *), fts_compar);

Completed in 238 milliseconds

12