| /dports/net/fort/FORT-validator-1.5.3/src/ |
| H A D | sorted_array.h | 14 struct sorted_array;
29 struct sorted_array *sarray_create(size_t, sarray_cmp);
30 void sarray_get(struct sorted_array *);
31 void sarray_put(struct sorted_array *);
41 int sarray_add(struct sorted_array *, void *);
42 bool sarray_empty(struct sorted_array *);
43 bool sarray_contains(struct sorted_array *, void *);
46 int sarray_foreach(struct sorted_array *, sarray_foreach_cb, void *);
|
| H A D | sorted_array.c | 8 struct sorted_array { struct
22 struct sorted_array * argument
25 struct sorted_array *result; in sarray_create()
27 result = malloc(sizeof(struct sorted_array)); in sarray_create()
46 sarray_get(struct sorted_array *sarray) in sarray_get()
52 sarray_put(struct sorted_array *sarray) in sarray_put()
63 get_nth_element(struct sorted_array *sarray, unsigned int index) in get_nth_element()
74 compare(struct sorted_array *sarray, void *new) in compare()
105 sarray_add(struct sorted_array *sarray, void *element) in sarray_add()
128 sarray_empty(struct sorted_array *sarray) in sarray_empty()
[all …]
|
| /dports/net/fort/FORT-validator-1.5.3/src/resource/ |
| H A D | ip4.c | 60 sarray_get((struct sorted_array *) ips); in res4_get()
66 sarray_put((struct sorted_array *) ips); in res4_put()
74 return sarray_add((struct sorted_array *) ips, &n); in res4_add_prefix()
82 return sarray_add((struct sorted_array *) ips, &n); in res4_add_range()
88 return sarray_empty((struct sorted_array *) ips); in res4_empty()
100 return sarray_contains((struct sorted_array *) ips, &n); in res4_contains_prefix()
108 return sarray_contains((struct sorted_array *) ips, &n); in res4_contains_range()
|
| H A D | ip6.c | 97 sarray_get((struct sorted_array *) ips); in res6_get()
103 sarray_put((struct sorted_array *) ips); in res6_put()
111 return sarray_add((struct sorted_array *) ips, &r); in res6_add_prefix()
117 return sarray_add((struct sorted_array *) ips, range); in res6_add_range()
123 return sarray_empty((struct sorted_array *) ips); in res6_empty()
131 return sarray_contains((struct sorted_array *) ips, &r); in res6_contains_prefix()
137 return sarray_contains((struct sorted_array *) ips, range); in res6_contains_range()
|
| H A D | asn.c | 55 sarray_get((struct sorted_array *) asns); in rasn_get()
61 sarray_put((struct sorted_array *) asns); in rasn_put()
68 return sarray_add((struct sorted_array *) asns, &n); in rasn_add()
74 return sarray_empty((struct sorted_array *) asns); in rasn_empty()
81 return sarray_contains((struct sorted_array *) asns, &n); in rasn_contains()
113 error = sarray_foreach((struct sorted_array *) asns, asn_node_cb, in rasn_foreach()
|
| /dports/math/pspp/pspp-1.4.1/src/language/stats/ |
| H A D | median.c | 62 struct val_node **sorted_array;
256 results[v].sorted_array = xcalloc (hmap_count (&map), sizeof (void*));
267 results[v].sorted_array[x++] = vn;
273 sort (results[v].sorted_array, x, sizeof (*results[v].sorted_array),
291 struct val_node *vn = rs->sorted_array[i];
295 free (rs->sorted_array);
314 nst->indep_var, &results->sorted_array[i]->val), PIVOT_RC_COUNT);
330 const struct val_node *vn = rs->sorted_array[indep_idx];
|
| /dports/databases/libgda5/libgda-5.2.10/tools/browser/ldap-browser/ |
| H A D | mgr-ldap-entries.c | 226 GArray *sorted_array; in mgr_ldap_entries_update_children() local
227 sorted_array = g_array_new (FALSE, FALSE, sizeof (GdaLdapEntry*)); in mgr_ldap_entries_update_children()
231 g_array_prepend_val (sorted_array, lentry); in mgr_ldap_entries_update_children()
235 g_array_sort (sorted_array, (GCompareFunc) lentry_array_sort_func); in mgr_ldap_entries_update_children()
237 for (i = 0; i < sorted_array->len; i++) { in mgr_ldap_entries_update_children()
242 lentry = g_array_index (sorted_array, GdaLdapEntry*, i); in mgr_ldap_entries_update_children()
291 g_array_free (sorted_array, TRUE); in mgr_ldap_entries_update_children()
|
| /dports/databases/libgda5-postgresql/libgda-5.2.10/tools/browser/ldap-browser/ |
| H A D | mgr-ldap-entries.c | 226 GArray *sorted_array; in mgr_ldap_entries_update_children() local
227 sorted_array = g_array_new (FALSE, FALSE, sizeof (GdaLdapEntry*)); in mgr_ldap_entries_update_children()
231 g_array_prepend_val (sorted_array, lentry); in mgr_ldap_entries_update_children()
235 g_array_sort (sorted_array, (GCompareFunc) lentry_array_sort_func); in mgr_ldap_entries_update_children()
237 for (i = 0; i < sorted_array->len; i++) { in mgr_ldap_entries_update_children()
242 lentry = g_array_index (sorted_array, GdaLdapEntry*, i); in mgr_ldap_entries_update_children()
291 g_array_free (sorted_array, TRUE); in mgr_ldap_entries_update_children()
|
| /dports/databases/libgda5-ui/libgda-5.2.10/tools/browser/ldap-browser/ |
| H A D | mgr-ldap-entries.c | 226 GArray *sorted_array; in mgr_ldap_entries_update_children() local
227 sorted_array = g_array_new (FALSE, FALSE, sizeof (GdaLdapEntry*)); in mgr_ldap_entries_update_children()
231 g_array_prepend_val (sorted_array, lentry); in mgr_ldap_entries_update_children()
235 g_array_sort (sorted_array, (GCompareFunc) lentry_array_sort_func); in mgr_ldap_entries_update_children()
237 for (i = 0; i < sorted_array->len; i++) { in mgr_ldap_entries_update_children()
242 lentry = g_array_index (sorted_array, GdaLdapEntry*, i); in mgr_ldap_entries_update_children()
291 g_array_free (sorted_array, TRUE); in mgr_ldap_entries_update_children()
|
| /dports/databases/libgda5-ldap/libgda-5.2.10/tools/browser/ldap-browser/ |
| H A D | mgr-ldap-entries.c | 226 GArray *sorted_array; in mgr_ldap_entries_update_children() local
227 sorted_array = g_array_new (FALSE, FALSE, sizeof (GdaLdapEntry*)); in mgr_ldap_entries_update_children()
231 g_array_prepend_val (sorted_array, lentry); in mgr_ldap_entries_update_children()
235 g_array_sort (sorted_array, (GCompareFunc) lentry_array_sort_func); in mgr_ldap_entries_update_children()
237 for (i = 0; i < sorted_array->len; i++) { in mgr_ldap_entries_update_children()
242 lentry = g_array_index (sorted_array, GdaLdapEntry*, i); in mgr_ldap_entries_update_children()
291 g_array_free (sorted_array, TRUE); in mgr_ldap_entries_update_children()
|
| /dports/databases/libgda5-mysql/libgda-5.2.10/tools/browser/ldap-browser/ |
| H A D | mgr-ldap-entries.c | 226 GArray *sorted_array; in mgr_ldap_entries_update_children() local
227 sorted_array = g_array_new (FALSE, FALSE, sizeof (GdaLdapEntry*)); in mgr_ldap_entries_update_children()
231 g_array_prepend_val (sorted_array, lentry); in mgr_ldap_entries_update_children()
235 g_array_sort (sorted_array, (GCompareFunc) lentry_array_sort_func); in mgr_ldap_entries_update_children()
237 for (i = 0; i < sorted_array->len; i++) { in mgr_ldap_entries_update_children()
242 lentry = g_array_index (sorted_array, GdaLdapEntry*, i); in mgr_ldap_entries_update_children()
291 g_array_free (sorted_array, TRUE); in mgr_ldap_entries_update_children()
|
| /dports/databases/libgda5-bdb/libgda-5.2.10/tools/browser/ldap-browser/ |
| H A D | mgr-ldap-entries.c | 226 GArray *sorted_array;
227 sorted_array = g_array_new (FALSE, FALSE, sizeof (GdaLdapEntry*));
231 g_array_prepend_val (sorted_array, lentry);
235 g_array_sort (sorted_array, (GCompareFunc) lentry_array_sort_func);
237 for (i = 0; i < sorted_array->len; i++) {
242 lentry = g_array_index (sorted_array, GdaLdapEntry*, i);
291 g_array_free (sorted_array, TRUE);
|
| /dports/databases/libgda5-jdbc/libgda-5.2.10/tools/browser/ldap-browser/ |
| H A D | mgr-ldap-entries.c | 226 GArray *sorted_array;
227 sorted_array = g_array_new (FALSE, FALSE, sizeof (GdaLdapEntry*));
231 g_array_prepend_val (sorted_array, lentry);
235 g_array_sort (sorted_array, (GCompareFunc) lentry_array_sort_func);
237 for (i = 0; i < sorted_array->len; i++) {
242 lentry = g_array_index (sorted_array, GdaLdapEntry*, i);
291 g_array_free (sorted_array, TRUE);
|
| /dports/devel/onetbb/oneTBB-2021.4.0/test/tbb/ |
| H A D | test_parallel_sort.cpp | 179 ValueType* sorted_array = new ValueType[Size]; in run() local
181 while (fill_ranges(array, sorted_array, Size, default_comp)) { in run()
183 validate(array, sorted_array, Size); in run()
187 delete[] sorted_array; in run()
193 ValueType* sorted_array = new ValueType[Size]; in run() local
195 while (fill_ranges(array, sorted_array, Size, comp)) { in run()
197 validate(array, sorted_array, Size); in run()
201 delete[] sorted_array; in run()
|
| /dports/graphics/vulkan-loader/Vulkan-Loader-1.2.203/loader/ |
| H A D | loader_windows.c | 829 struct LoaderSortedPhysicalDevice *sorted_array = *sorted_devices; in windows_read_sorted_physical_devices() local
830 sorted_array[*sorted_count].device_count = 0; in windows_read_sorted_physical_devices()
831 sorted_array[*sorted_count].physical_devices = NULL; in windows_read_sorted_physical_devices()
858 sorted_array[*sorted_count].physical_devices = in windows_read_sorted_physical_devices()
862 if (sorted_array[*sorted_count].physical_devices == NULL) { in windows_read_sorted_physical_devices()
866 sorted_array[*sorted_count].device_count = count; in windows_read_sorted_physical_devices()
873 loader_instance_heap_free(inst, sorted_array[*sorted_count].physical_devices); in windows_read_sorted_physical_devices()
874 sorted_array[*sorted_count].physical_devices = NULL; in windows_read_sorted_physical_devices()
883 inst->total_gpu_count += (sorted_array[*sorted_count].device_count = count); in windows_read_sorted_physical_devices()
884 sorted_array[*sorted_count].icd_index = icd_idx; in windows_read_sorted_physical_devices()
[all …]
|
| /dports/math/yices/yices-2.6.2/src/solvers/cdcl/ |
| H A D | wide_truth_tables.c | 30 static bool sorted_array(const bvar_t *a, uint32_t n) { in sorted_array() function
204 assert(sorted_array(a, n)); in merge_vars()
205 assert(sorted_array(b, m)); in merge_vars()
227 assert(sorted_array(c, j)); in merge_vars()
259 assert(sorted_array(ttbl->label, ttbl->nvars)); in wide_ttbl_import()
272 assert(sorted_array(w1->var, w1->nvars)); in wide_ttbl_copy()
473 assert(sorted_array(a, n)); in filter_redundant_vars()
489 assert(sorted_array(c, j)); in filter_redundant_vars()
|
| /dports/benchmarks/phoronix-test-suite/phoronix-test-suite-10.6.1/pts-core/objects/ |
| H A D | pts_arrays.php | 124 $sorted_array = array();
128 $sorted_array[$k] = $array[$k];
131 $array = array_reverse($sorted_array, true);
|
| /dports/emulators/gxemul/gxemul-0.6.3/src/symbol/ |
| H A D | symbol.cc | 67 if (sc->sorted_array) { in get_symbol_addr()
125 if (!sc->sorted_array) { in get_symbol_name_and_n_args()
204 if (sc->sorted_array) { in add_symbol_name()
386 sc->sorted_array = 1; in symbol_recalc_sizes()
418 sc->sorted_array = 0; in symbol_init()
|
| /dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/interpreter/ |
| H A D | bytecodeHistogram.cpp | 85 static GrowableArray<HistoEntry*>* sorted_array(int* array, int length) { in sorted_array() function
120 GrowableArray<HistoEntry*>* profile = sorted_array(_counters, Bytecodes::number_of_codes); in print()
162 GrowableArray<HistoEntry*>* profile = sorted_array(_counters, number_of_pairs); in print()
|
| /dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/interpreter/ |
| H A D | bytecodeHistogram.cpp | 85 static GrowableArray<HistoEntry*>* sorted_array(int* array, int length) { in sorted_array() function
120 GrowableArray<HistoEntry*>* profile = sorted_array(_counters, Bytecodes::number_of_codes); in print()
162 GrowableArray<HistoEntry*>* profile = sorted_array(_counters, number_of_pairs); in print()
|
| /dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/hotspot/share/interpreter/ |
| H A D | bytecodeHistogram.cpp | 85 static GrowableArray<HistoEntry*>* sorted_array(int* array, int length) { in sorted_array() function
120 GrowableArray<HistoEntry*>* profile = sorted_array(_counters, Bytecodes::number_of_codes); in print()
162 GrowableArray<HistoEntry*>* profile = sorted_array(_counters, number_of_pairs); in print()
|
| /dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/hotspot/share/interpreter/ |
| H A D | bytecodeHistogram.cpp | 85 static GrowableArray<HistoEntry*>* sorted_array(int* array, int length) { in sorted_array() function
120 GrowableArray<HistoEntry*>* profile = sorted_array(_counters, Bytecodes::number_of_codes); in print()
162 GrowableArray<HistoEntry*>* profile = sorted_array(_counters, number_of_pairs); in print()
|
| /dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/hotspot/share/interpreter/ |
| H A D | bytecodeHistogram.cpp | 85 static GrowableArray<HistoEntry*>* sorted_array(int* array, int length) { in sorted_array() function
120 GrowableArray<HistoEntry*>* profile = sorted_array(_counters, Bytecodes::number_of_codes); in print()
162 GrowableArray<HistoEntry*>* profile = sorted_array(_counters, number_of_pairs); in print()
|
| /dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/hotspot/share/interpreter/ |
| H A D | bytecodeHistogram.cpp | 85 static GrowableArray<HistoEntry*>* sorted_array(int* array, int length) { in sorted_array() function
120 GrowableArray<HistoEntry*>* profile = sorted_array(_counters, Bytecodes::number_of_codes); in print()
162 GrowableArray<HistoEntry*>* profile = sorted_array(_counters, number_of_pairs); in print()
|
| /dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/hotspot/share/interpreter/ |
| H A D | bytecodeHistogram.cpp | 85 static GrowableArray<HistoEntry*>* sorted_array(int* array, int length) { in sorted_array() function
120 GrowableArray<HistoEntry*>* profile = sorted_array(_counters, Bytecodes::number_of_codes); in print()
162 GrowableArray<HistoEntry*>* profile = sorted_array(_counters, number_of_pairs); in print()
|