HomeSort by: relevance | last modified time | path
    Searched defs:entries (Results 1 - 25 of 482) sorted by relevancy

1 2 3 4 5 6 7 8 91011>>

  /src/sys/external/bsd/drm2/dist/drm/nouveau/nvkm/subdev/bios/
nouveau_nvkm_subdev_bios_bit.c 36 u8 entries = nvbios_rd08(bios, bios->bit_offset + 10); local
38 while (entries--) {
  /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/sys/arch/arm/acpi/
acpi_table.c 101 const u_int entries = (le32toh(xsdt->Header.Length) - sizeof(ACPI_TABLE_HEADER)) / ACPI_XSDT_ENTRY_SIZE; local
102 for (u_int n = 0; n < entries; n++) {
  /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
hosttable.h 32 struct host_table_entry *entries; member in struct:host_table
  /src/external/mit/expat/dist/tests/
structdata.h 50 int count; /* Number of entries used */
51 int max_count; /* Number of StructDataEntry items in `entries` */
52 StructDataEntry *entries; member in struct:__anon23650
  /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/dev/ppbus/
ppbus_device.h 40 SLIST_ENTRY(ppbus_device_softc) entries; member in struct:ppbus_device_softc
  /src/external/bsd/am-utils/dist/amd/
sun_map_parse.y 95 file : new_lines entries
96 | entries
99 entries : entry label
101 | entry new_lines entries
411 * The parser is designed to parse map entries with out the keys. For
  /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...]
  /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...]
  /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_fflags.c 42 } entries[] = { variable in typeref:struct:__anon7136
70 /* Write entries */
71 for (i = 0; entries[i].path != NULL; i++) {
73 archive_entry_set_fflags(ae, entries[i].fflags, 0);
74 archive_entry_copy_pathname(ae, entries[i].path);
109 /* Read entries */
110 for (i = 0; entries[i].path != NULL; i++) {
115 assertEqualInt((int)entries[i].fflags, (int)fset);
117 assertEqualString(entries[i].path, archive_entry_pathname(ae));
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/bsd/openldap/dist/contrib/ldapc++/examples/
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();
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();
  /src/external/mit/isl/dist/include/isl/
hash.h 53 struct isl_hash_table_entry *entries; member in struct:isl_hash_table
  /src/sys/arch/amiga/pci/
p5pbvar.h 42 TAILQ_ENTRY(p5pb_autoconf_entry) entries; member in struct:p5pb_autoconf_entry
  /src/sys/dev/i2c/
tvpllvar.h 53 } *entries; member in struct:tvpll_data
  /src/sys/external/bsd/drm2/dist/include/drm/
drm_debugfs_crc.h 53 * @entries: array of entries, with size of %DRM_CRC_ENTRIES_NR
63 struct drm_crtc_crc_entry *entries; member in struct:drm_crtc_crc
  /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/PDB/Native/
NamedStreamMap.cpp 108 StringMap<uint32_t> NamedStreamMap::entries() const { function in class:NamedStreamMap
  /src/external/gpl3/gdb/dist/readline/readline/
history.h 62 HIST_ENTRY **entries; /* Pointer to the entries themselves. */ member in struct:_hist_state
98 /* Remove a set of entries from the history list: FIRST to LAST, inclusive */
120 /* Stifle the history list, remembering only MAX number of entries. */
154 /* Return the number of bytes that the primary history entries are using.
176 If DIRECTION < 0, then the search is through previous entries,
214 /* Append NELEMENT entries to FILENAME. The entries appended are from
  /src/external/gpl3/gdb.old/dist/readline/readline/
history.h 62 HIST_ENTRY **entries; /* Pointer to the entries themselves. */ member in struct:_hist_state
98 /* Remove a set of entries from the history list: FIRST to LAST, inclusive */
120 /* Stifle the history list, remembering only MAX number of entries. */
154 /* Return the number of bytes that the primary history entries are using.
176 If DIRECTION < 0, then the search is through previous entries,
214 /* Append NELEMENT entries to FILENAME. The entries appended are from

Completed in 36 milliseconds

1 2 3 4 5 6 7 8 91011>>