Searched defs:entry (Results 501 - 525 of 1397) sorted by relevance

<<21222324252627282930>>

/external/iptables/extensions/
H A Dlibxt_set.c53 const void *entry, struct xt_entry_match **match)
133 const void *entry, struct xt_entry_match **match)
228 const void *entry, struct xt_entry_match **match)
335 const void *entry, struct xt_entry_match **match)
503 const void *entry, struct xt_entry_match **match)
52 set_parse_v0(int c, char **argv, int invert, unsigned int *flags, const void *entry, struct xt_entry_match **match) argument
132 set_parse_v1(int c, char **argv, int invert, unsigned int *flags, const void *entry, struct xt_entry_match **match) argument
227 set_parse_v2(int c, char **argv, int invert, unsigned int *flags, const void *entry, struct xt_entry_match **match) argument
334 set_parse_v3(int c, char **argv, int invert, unsigned int *flags, const void *entry, struct xt_entry_match **match) argument
502 set_parse_v4(int c, char **argv, int invert, unsigned int *flags, const void *entry, struct xt_entry_match **match) argument
H A Dlibxt_tcp.c142 const void *entry, struct xt_entry_match **match)
141 tcp_parse(int c, char **argv, int invert, unsigned int *flags, const void *entry, struct xt_entry_match **match) argument
/external/jmdns/src/javax/jmdns/impl/
H A DDNSCache.java29 * DNSEntry entry = i.next();
30 * ...do something with entry...
38 * DNSEntry entry = i.next();
39 * ...do something with entry...
168 * @param entry
170 protected _CacheEntry(Map.Entry<String, List<? extends DNSEntry>> entry) { argument
172 if (entry instanceof _CacheEntry) {
173 _key = ((_CacheEntry) entry).getKey();
174 _value = ((_CacheEntry) entry).getValue();
217 public boolean equals(Object entry) { argument
[all...]
H A DDNSEntry.java18 * DNS entry with a name, type, and class. This is the base class for questions and records.
39 * Create an entry.
73 * @param entry
76 public boolean isSameEntry(DNSEntry entry) { argument
77 return this.getKey().equals(entry.getKey()) && this.getRecordType().equals(entry.getRecordType()) && ((DNSRecordClass.CLASS_ANY == entry.getRecordClass()) || this.getRecordClass().equals(entry.getRecordClass()));
91 * Returns the subtype of this entry
93 * @return subtype of this entry
204 isSameRecordClass(DNSEntry entry) argument
214 isSameType(DNSEntry entry) argument
[all...]
/external/kmod/shared/
H A Dhash.c78 struct hash_entry *entry, *entry_end; local
79 entry = bucket->entries;
80 entry_end = entry + bucket->used;
81 for (; entry < entry_end; entry++)
82 hash->free_value((void *)entry->value);
152 struct hash_entry *entry, *entry_end; local
164 entry = bucket->entries;
165 entry_end = entry + bucket->used;
166 for (; entry < entry_en
195 struct hash_entry *entry, *entry_end; local
244 const struct hash_entry *entry = bsearch( local
259 struct hash_entry *entry, *entry_end; local
[all...]
/external/libchrome/base/
H A Dfeature_list.cc31 // An allocator entry for a feature in shared memory. The FeatureEntry is
44 // Size of the pickled structure, NOT the total size of this entry.
48 // valid on an initialized entry that's in shared memory.
101 const FeatureEntry* entry; local
102 while ((entry = iter.GetNextOfObject<FeatureEntry>()) != nullptr) {
104 static_cast<OverrideState>(entry->override_state);
108 if (!entry->GetFeatureAndTrialName(&feature_name, &trial_name))
133 OverrideEntry* entry = &overrides_.find(feature_name)->second; local
134 if (entry->field_trial) {
136 << " already has trial: " << entry
168 FeatureEntry* entry = allocator->New<FeatureEntry>(total_size); local
309 const OverrideEntry& entry = it->second; local
332 const OverrideEntry& entry = it->second; local
[all...]
/external/libchrome/base/trace_event/
H A Dheap_profiler_heap_dump_writer.cc204 Entry entry; local
205 entry.stack_frame_id = stack_frame_deduplicator_->Insert(
209 entry.type_id = bucket.is_broken_down_by_type_name
213 entry.size = bucket.size;
214 entry.count = bucket.count;
216 auto position_and_inserted = entries_.insert(entry);
230 // case. There might be multiple routes to the same entry (first break down
273 for (const Entry& entry : entries) {
277 SStringPrintf(&buffer, "%" PRIx64, static_cast<uint64_t>(entry.size));
280 SStringPrintf(&buffer, "%" PRIx64, static_cast<uint64_t>(entry
[all...]
/external/libdrm/radeon/
H A Dbof.c232 static void bof_print_bof(bof_t *bof, int level, int entry) argument
236 fprintf(stderr, "--NULL-- for entry %d\n", entry);
264 static void bof_print_rec(bof_t *bof, int level, int entry) argument
268 bof_print_bof(bof, level, entry);
/external/libdrm/
H A Dxf86drmSL.c74 SLEntryPtr entry; local
78 entry = drmMalloc(sizeof(*entry)
79 + (max_level + 1) * sizeof(entry->forward[0]));
80 if (!entry) return NULL;
81 entry->magic = SL_ENTRY_MAGIC;
82 entry->key = key;
83 entry->value = value;
84 entry->levels = max_level + 1;
86 return entry;
120 SLEntryPtr entry; local
140 SLEntryPtr entry; local
157 SLEntryPtr entry; local
191 SLEntryPtr entry; local
218 SLEntryPtr entry; local
259 SLEntryPtr entry; local
289 SLEntryPtr entry; local
[all...]
/external/libexif/libexif/
H A Dexif-tag.c43 * There may be more than one entry with the same tag value because some tags
878 * terminating NULL entry.
900 * Compares the tag with that in entry.
902 * \param[in] entry pointer to a struct TagEntry
903 * \return 0 if tags are equal, <0 if tag < entry, >0 if tag > entry
906 match_tag(const void *tag, const void *entry) argument
908 return *(int*)tag - ((struct TagEntry *)entry)->tag;
913 * Finds the first entry in the EXIF tag table with the given tag number
922 struct TagEntry *entry local
[all...]
/external/libmojo/mojo/public/cpp/bindings/
H A Dbinding_set.h183 explicit DispatchFilter(Entry* entry) : entry_(entry) {} argument
230 auto entry = base::MakeUnique<Entry>(std::move(impl), std::move(request), local
232 bindings_.insert(std::make_pair(id, std::move(entry)));
243 std::unique_ptr<Entry> entry = std::move(it->second); local
/external/libpcap/
H A Dpcap-libdlpi.c71 * for each linknamelist_t "entry" allocated.
77 linknamelist_t *entry; local
79 if ((entry = calloc(1, sizeof(linknamelist_t))) == NULL) {
83 (void) strlcpy(entry->linkname, linkname, DLPI_LINKNAME_MAX);
86 lwp->lw_list = entry;
88 entry->lnl_next = lwp->lw_list;
89 lwp->lw_list = entry;
289 linknamelist_t *entry, *next; local
311 for (entry = lw.lw_list; entry !
[all...]
/external/libunwind/src/arm/
H A DGex_tables.c278 * Reads the entry from the given cursor and extracts the unwind instructions
287 unw_word_t entry = (unw_word_t) c->pi.unwind_info; local
291 /* An ARM unwind entry consists of a prel31 offset to the start of a
294 * if bit 31 is one: this is a table entry itself (ARM_EXIDX_COMPACT)
296 table entry for this function */
297 if (prel31_to_addr(c->as, c->as_arg, entry, &addr) < 0)
300 if ((*c->as->acc.access_mem)(c->as, entry + 4, &data, 0, c->as_arg) < 0)
321 if (prel31_to_addr(c->as, c->as_arg, entry + 4, &extbl_data) < 0)
389 appropriate unwind entry. */
392 unw_word_t entry, va local
[all...]
/external/libxkbcommon/xkbcommon/src/
H A Dkeysym.c57 get_name(const struct name_keysym *entry) argument
59 return keysym_names + entry->offset;
66 const struct name_keysym *entry = b; local
67 if (*key < entry->keysym)
69 if (*key > entry->keysym)
78 const struct name_keysym *entry = b; local
79 return strcasecmp(key, get_name(entry));
85 const struct name_keysym *entry; local
92 entry = bsearch(&ks, keysym_to_name,
96 if (entry)
125 find_sym(const struct name_keysym *entry, const char *name, bool icase) argument
165 const struct name_keysym *entry; local
[all...]
/external/libxkbcommon/xkbcommon/src/xkbcomp/
H A Dexpr.c54 *index_rtrn = expr->array_ref.entry;
67 const LookupEntry *entry; local
74 for (entry = priv; entry && entry->name; entry++) {
75 if (istreq(str, entry->name)) {
76 *val_rtrn = entry->value;
H A Dkeymap-dump.c212 const struct xkb_key_type_entry *entry = &type->entries[j]; local
218 if (entry->level == 0 && entry->preserve.mods == 0)
221 str = ModMaskText(keymap->ctx, &keymap->mods, entry->mods.mods);
223 str, entry->level + 1);
225 if (entry->preserve.mods)
228 entry->preserve.mods));
/external/linux-kselftest/tools/testing/selftests/networking/timestamping/
H A Dtimestamping.c283 struct iovec entry; local
292 msg.msg_iov = &entry;
294 entry.iov_base = data;
295 entry.iov_len = sizeof(data);
/external/linux-kselftest/tools/testing/selftests/powerpc/pmu/ebb/
H A Debb.c133 u64 entry; local
136 entry = (u64)ebb_handler;
140 u64 entry; member in struct:opd
145 entry = opd->entry;
147 printf("EBB Handler is at %#llx\n", entry);
153 mtspr(SPRN_EBBHR, entry);
/external/llvm/include/llvm/Support/
H A DRegistry.h24 /// A simple registry entry which provides only a name, description, and
47 typedef SimpleRegistryEntry<T> entry; typedef in class:llvm::Registry
66 const entry& Val;
69 node(const entry &V) : Next(nullptr), Val(V) {}
91 const entry &operator*() const { return Cur->Val; }
92 const entry *operator->() const { return &Cur->Val; }
112 entry Entry;
/external/llvm/unittests/ADT/
H A DStringMapTest.cpp104 // A map with a single entry.
217 StringMap<uint32_t>::value_type* entry = local
220 EXPECT_STREQ(testKey, entry->first().data());
221 EXPECT_EQ(1u, entry->second);
222 free(entry);
/external/ltp/pan/
H A Dzoolib.c65 /* zoo_mark(): private function to make an entry to the zoo
67 static int zoo_mark(zoo_t z, char *entry);
130 static int zoo_mark(zoo_t z, char *entry) argument
161 /* write the entry, left justified, and padded/truncated to the
162 * same size as the previous entry */
164 (int)strlen(buf) - 1, entry);
177 fprintf(fp, "%-*.*s\n", 79, 79, entry);
/external/ltp/testcases/kernel/controllers/cgroup_xattr/
H A Dcgroup_xattr.c396 struct dirent *entry; local
410 while ((entry = readdir(dir)) != NULL) {
411 const char *file = entry->d_name;
426 if (errno && !entry) {
/external/ltp/testcases/kernel/syscalls/readahead/
H A Dreadahead02.c124 static unsigned long parse_entry(const char *fname, const char *entry) argument
136 if (sscanf(line, entry, &value) == 1)
147 char entry[] = "read_bytes: %lu"; local
149 return parse_entry(fname, entry);
154 char entry[] = "Cached: %lu"; local
155 return parse_entry(meminfo_fname, entry);
/external/ltp/testcases/realtime/include/
H A Dlist.h57 * using the generic single-entry routines.
76 * Insert a new entry between two known consecutive entries.
92 * list_add - add a new entry
93 * @new: new entry to be added
96 * Insert a new entry after the specified head.
105 * list_add_tail - add a new entry
106 * @new: new entry to be added
109 * Insert a new entry before the specified head.
118 * Delete a list entry by making the prev/next entries
131 * list_del - deletes entry fro
136 list_del(struct list_head *entry) argument
147 list_del_init(struct list_head *entry) argument
[all...]
/external/ltp/utils/ffsb-6.0-rc2/
H A Dfilelist.c275 void remove_file(struct benchfiles *b, struct ffsb_file *entry) argument
279 rbtree_remove(b->files, entry, NULL);
281 cl_insert_tail(b->holes, entry);

Completed in 4157 milliseconds

<<21222324252627282930>>