| /src/external/bsd/jemalloc/dist/test/unit/ |
| qr.c | 5 /* Number of ring entries, in [2..26]. */
18 init_entries(ring_t *entries) {
22 qr_new(&entries[i], link);
23 entries[i].id = 'a' + i;
28 test_independent_entries(ring_t *entries) {
34 qr_foreach(t, &entries[i], link) {
43 qr_reverse_foreach(t, &entries[i], link) {
51 t = qr_next(&entries[i], link);
52 expect_ptr_eq(t, &entries[i],
57 t = qr_prev(&entries[i], link)
65 ring_t entries[NENTRIES]; local
106 ring_t entries[NENTRIES]; local
118 ring_t entries[NENTRIES]; local
147 ring_t entries[NENTRIES]; local
207 ring_t entries[NENTRIES]; local
[all...] |
| ql.c | 5 /* Number of ring entries, in [2..26]. */
48 init_entries(list_t *entries, unsigned nentries) {
52 entries[i].id = 'a' + i;
53 ql_elm_new(&entries[i], link);
58 test_entries_list(list_head_t *head, list_t *entries, unsigned nentries) {
63 expect_c_eq(ql_first(head)->id, entries[0].id, "Element id mismatch");
64 expect_c_eq(ql_last(head, link)->id, entries[nentries-1].id,
69 expect_c_eq(t->id, entries[i].id, "Element id mismatch");
75 expect_c_eq(t->id, entries[nentries-i-1].id,
81 t = ql_next(head, &entries[i], link)
96 list_t entries[NENTRIES]; local
111 list_t entries[NENTRIES]; local
130 list_t entries[NENTRIES]; local
145 list_t entries[NENTRIES]; local
164 list_t entries[8]; local
247 list_t entries[NENTRIES]; local
265 list_t entries[NENTRIES]; local
287 list_t entries[NENTRIES]; local
[all...] |
| /src/external/bsd/jemalloc.old/dist/test/unit/ |
| qr.c | 5 /* Number of ring entries, in [2..26]. */
18 init_entries(ring_t *entries) {
22 qr_new(&entries[i], link);
23 entries[i].id = 'a' + i;
28 test_independent_entries(ring_t *entries) {
34 qr_foreach(t, &entries[i], link) {
43 qr_reverse_foreach(t, &entries[i], link) {
51 t = qr_next(&entries[i], link);
52 assert_ptr_eq(t, &entries[i],
57 t = qr_prev(&entries[i], link)
65 ring_t entries[NENTRIES]; local
106 ring_t entries[NENTRIES]; local
118 ring_t entries[NENTRIES]; local
147 ring_t entries[NENTRIES]; local
207 ring_t entries[NENTRIES]; local
[all...] |
| ql.c | 5 /* Number of ring entries, in [2..26]. */
47 init_entries(list_t *entries, unsigned nentries) {
51 entries[i].id = 'a' + i;
52 ql_elm_new(&entries[i], link);
57 test_entries_list(list_head_t *head, list_t *entries, unsigned nentries) {
61 assert_c_eq(ql_first(head)->id, entries[0].id, "Element id mismatch");
62 assert_c_eq(ql_last(head, link)->id, entries[nentries-1].id,
67 assert_c_eq(t->id, entries[i].id, "Element id mismatch");
73 assert_c_eq(t->id, entries[nentries-i-1].id,
79 t = ql_next(head, &entries[i], link)
94 list_t entries[NENTRIES]; local
109 list_t entries[NENTRIES]; local
128 list_t entries[NENTRIES]; local
143 list_t entries[NENTRIES]; local
162 list_t entries[8]; local
[all...] |
| /src/external/gpl3/gcc.old/dist/libphobos/libdruntime/core/gc/ |
| registry.d | 43 auto ptr = cast(Entry*)realloc(entries.ptr, (entries.length + 1) * Entry.sizeof);
44 entries = ptr[0 .. entries.length + 1];
45 entries[$ - 1] = Entry(name, factory);
60 foreach (entry; entries)
66 free(entries.ptr);
67 entries = null;
76 return entries;
87 __gshared Entry[] entries;
[all...] |
| /src/external/bsd/libarchive/dist/libarchive/test/ |
| test_write_format_mtree_classic.c | 37 } entries[] = { variable in typeref:struct:__anon7134
126 /* Write entries */
127 for (i = 0; entries[i].path != NULL; i++) {
129 archive_entry_set_nlink(ae, entries[i].nlink);
130 assertEqualInt(entries[i].nlink, archive_entry_nlink(ae));
131 archive_entry_set_mtime(ae, entries[i].mtime, 0);
132 assertEqualInt(entries[i].mtime, archive_entry_mtime(ae));
133 archive_entry_set_mode(ae, entries[i].mode);
134 assertEqualInt(entries[i].mode, archive_entry_mode(ae));
135 archive_entry_set_uid(ae, entries[i].uid)
[all...] |
| test_write_format_mtree_classic_indent.c | 37 } entries[] = { variable in typeref:struct:__anon7135
128 /* Write entries */
129 for (i = 0; entries[i].path != NULL; i++) {
131 archive_entry_set_nlink(ae, entries[i].nlink);
132 assertEqualInt(entries[i].nlink, archive_entry_nlink(ae));
133 archive_entry_set_mtime(ae, entries[i].mtime, 0);
134 assertEqualInt(entries[i].mtime, archive_entry_mtime(ae));
135 archive_entry_set_mode(ae, entries[i].mode);
136 assertEqualInt(entries[i].mode, archive_entry_mode(ae));
137 archive_entry_set_uid(ae, entries[i].uid)
[all...] |
| test_write_format_mtree.c | 36 } entries[] = { variable in typeref:struct:__anon7132
88 /* Write entries */
89 for (i = 0; entries[i].path != NULL; i++) {
91 archive_entry_set_mtime(ae, entries[i].mtime, 0);
92 assert(entries[i].mtime == archive_entry_mtime(ae));
93 archive_entry_set_mode(ae, entries[i].mode);
94 assert(entries[i].mode == archive_entry_mode(ae));
95 archive_entry_set_uid(ae, entries[i].uid);
96 assert(entries[i].uid == archive_entry_uid(ae));
97 archive_entry_set_gid(ae, entries[i].gid)
[all...] |
| /src/external/mit/isl/dist/ |
| isl_hash.c | 56 table->entries = isl_calloc_array(ctx, struct isl_hash_table_entry,
58 if (!table->entries)
74 * We reuse isl_hash_table_find to create entries in the extended table.
75 * Since all entries in the original table are assumed to be different,
82 struct isl_hash_table_entry *entries; local
85 entries = table->entries;
88 table->entries = isl_calloc_array(ctx, struct isl_hash_table_entry,
90 if (!table->entries) {
91 table->entries = entries
[all...] |
| /src/sys/stand/efiboot/ |
| overlay.c | 40 TAILQ_ENTRY(dtoverlay_entry) entries;
53 TAILQ_FOREACH(d, &dtoverlay_entries, entries) {
68 TAILQ_FOREACH(d, &dtoverlay_entries, entries) {
76 TAILQ_INSERT_TAIL(&dtoverlay_entries, d, entries);
89 TAILQ_FOREACH(d, &dtoverlay_entries, entries) {
91 TAILQ_REMOVE(&dtoverlay_entries, d, entries);
105 TAILQ_REMOVE(&dtoverlay_entries, d, entries);
|
| module.c | 42 TAILQ_ENTRY(boot_module) entries;
90 TAILQ_FOREACH(bm, &boot_modules, entries) {
105 TAILQ_FOREACH(bm, &boot_modules, entries) {
115 TAILQ_INSERT_TAIL(&boot_modules, bm, entries);
127 TAILQ_FOREACH(bm, &boot_modules, entries) {
129 TAILQ_REMOVE(&boot_modules, bm, entries);
143 TAILQ_REMOVE(&boot_modules, bm, entries);
|
| userconf.c | 38 TAILQ_ENTRY(userconf_command) entries;
48 TAILQ_FOREACH(uc, &userconf_commands, entries) {
80 TAILQ_INSERT_TAIL(&userconf_commands, uc, entries);
|
| /src/sys/external/bsd/drm2/dist/drm/nouveau/include/nvif/ |
| clb069.h | 8 __u32 entries; member in struct:nvif_clb069_v0
|
| /src/crypto/external/cpl/trousers/dist/src/include/ |
| memmgr.h | 29 struct memEntry *entries; member in struct:memTable
|
| /src/external/bsd/cron/dist/ |
| job.c | 36 SIMPLEQ_ENTRY(_job) entries;
52 SIMPLEQ_FOREACH(j, &jobs, entries) {
68 SIMPLEQ_INSERT_TAIL(&jobs, j, entries);
76 SIMPLEQ_FOREACH(j, &jobs, entries) {
79 SIMPLEQ_REMOVE_HEAD(&jobs, entries);
81 SIMPLEQ_REMOVE_AFTER(&jobs, prev, entries);
95 SIMPLEQ_FOREACH(j, &jobs, entries) {
98 SIMPLEQ_REMOVE_HEAD(&jobs, entries);
100 SIMPLEQ_REMOVE_AFTER(&jobs, prev, entries);
115 SIMPLEQ_REMOVE_HEAD(&jobs, entries);
[all...] |
| /src/tests/include/sys/ |
| t_list.c | 54 LIST_ENTRY(entry) entries;
62 LIST_INSERT_HEAD(&old_head, n1, entries);
66 LIST_INSERT_HEAD(&old_head, n2, entries);
68 LIST_MOVE(&old_head, &new_head, entries);
75 LIST_REMOVE(n3, entries);
79 LIST_REMOVE(LIST_FIRST(&new_head), entries); local
|
| /src/external/bsd/openldap/dist/contrib/ldapc++/examples/ |
| readSchema.cpp | 30 LDAPSearchResults* entries = lc->search("", local
34 LDAPEntry* rootDse = entries->getNext();
44 entries = lc->search(schemabase, LDAPConnection::SEARCH_BASE, "(objectClass=*)",
46 if (entries != 0){
47 LDAPEntry* entry = entries->getNext();
|
| main.cpp | 50 LDAPSearchResults* entries = lc->search("o=Organisation,c=DE", local
52 if (entries != 0){
53 LDAPEntry* entry = entries->getNext();
59 entry = entries->getNext();
|
| /src/crypto/external/bsd/heimdal/dist/lib/roken/ |
| dirent.c | 51 struct dirent **entries; member in struct:_dirent_dirinfo
138 dp->entries = calloc(dp->nc_entries, sizeof(dp->entries[0]));
140 if (dp->entries == NULL) {
154 ne = realloc(dp->entries, sizeof(dp->entries[0]) * dp->nc_entries);
162 dp->entries = ne;
175 dp->entries[dp->n_entries++] = e;
192 if (dp->entries) {
196 free(dp->entries[i])
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| stringpool.cc | 57 /* Create with 16K (2^14) entries. */
62 /* Create with 64 (2^6) entries. */
274 entries;
285 entries;
301 spd->entries = ggc_vec_alloc<ht_identifier_ptr> (spd->nslots);
302 memcpy (spd->entries, ident_hash->entries,
303 spd->nslots * sizeof (spd->entries[0]));
308 spd2->entries = ggc_vec_alloc<ht_identifier_ptr> (spd2->nslots);
309 memcpy (spd2->entries, ident_hash_extra->entries
[all...] |
| /src/distrib/sets/ |
| fmt-list | 206 local function column(entries, get_width_before, colname)
214 for _, entry in ipairs(entries) do
241 -- The entries are nicely aligned, therefore there is no need to change
243 local entries = {
247 assert_equals(entries[2].category_col, 8)
248 assert_equals(width_before_category(entries[2]), 7)
249 assert_equals(column(entries, width_before_category, "category_col"), 8)
251 -- The entries are currently not aligned, therefore they are aligned
253 entries = {
257 assert_equals(entries[2].category_col, 24
[all...] |
| /src/sys/arch/luna68k/stand/boot/ |
| parse.c | 133 static const struct command_entry entries[] = { variable in typeref:struct:command_entry
161 for (i = 0; entries[i].name != NULL; i++) {
162 if (!strcmp(argv[0], entries[i].name)) {
163 status = (*entries[i].func)(argc, argv);
|
| /src/sys/arch/shark/include/ |
| profileio.h | 82 unsigned int tableSize; /* total table size in entries */
83 unsigned int entries; /* first level table size, in entries */ member in struct:profHashHeader
98 struct profHashEntry *entries; member in struct:profHashTable
106 unsigned int tableSize; /* the total table size in entries */
107 unsigned int entries; /* number of entries to hash */ member in struct:profStartInfo
132 unsigned int tableSize; /* the total table size in entries */
133 unsigned int entries; /* number of entries to hash * member in struct:startSamplingCommand
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/amd/powerplay/hwmgr/ |
| hwmgr_ppt.h | 52 uint32_t count; /* Number of entries. */
53 phm_ppt_v1_clock_voltage_dependency_record entries[1]; /* Dynamically allocate count entries. */ member in struct:phm_ppt_v1_clock_voltage_dependency_table
75 uint32_t count; /* Number of entries. */
76 phm_ppt_v1_mm_clock_voltage_dependency_record entries[1]; /* Dynamically allocate count entries. */ member in struct:phm_ppt_v1_mm_clock_voltage_dependency_table
91 phm_ppt_v1_voltage_lookup_record entries[1]; /* Dynamically allocate count entries. */ member in struct:phm_ppt_v1_voltage_lookup_table
107 uint32_t count; /* Number of entries. */
108 phm_ppt_v1_pcie_record entries[1]; /* Dynamically allocate count entries. * member in struct:phm_ppt_v1_pcie_table
[all...] |
| /src/external/bsd/pam-u2f/dist/fuzz/ |
| make_seed.py | 16 with os.scandir("../tests/credentials") as entries:
17 for entry in entries:
|
