Searched refs:items (Results 51 - 75 of 130) sorted by relevance

123456

/freebsd-10.2-release/contrib/ncurses/menu/
H A Dm_pattern.c72 | E_NOT_CONNECTED - no items connected to menu
86 if (!(menu->items))
/freebsd-10.2-release/tools/regression/netinet/ip_id_period/
H A Dip_id_period.py61 sorted_minperiod = list(zip(*reversed(list(zip(*list(id_minperiod.items()))))))
/freebsd-10.2-release/contrib/libyaml/src/
H A Ddumper.c187 STACK_DEL(emitter, node.data.sequence.items);
218 for (item = node->data.sequence.items.start;
219 item < node->data.sequence.items.top; item ++) {
353 for (item = node->data.sequence.items.start;
354 item < node->data.sequence.items.top; item ++) {
H A Dloader.c328 } items = { NULL, NULL, NULL }; local
338 if (!STACK_INIT(parser, items, INITIAL_STACK_SIZE)) goto error;
340 SEQUENCE_NODE_INIT(node, tag, items.start, items.end,
357 parser->document->nodes.start[index-1].data.sequence.items,
/freebsd-10.2-release/sys/dev/cxgbe/
H A Dt4_mp_ring.c101 * all items up to the pidx_tail in the state are visible.
172 * The acquire style atomic above guarantees visibility of items
194 r = malloc(__offsetof(struct mp_ring, items[size]), mt, flags | M_ZERO);
244 * Enqueue n items and maybe drain the ring for some time.
249 mp_ring_enqueue(struct mp_ring *r, void **items, int n, int budget) argument
255 MPASS(items != NULL);
259 * Reserve room for the new items. Our reservation, if successful, is
284 * items, one producer at a time. It is our turn when the ring's
295 r->items[i] = *items
[all...]
/freebsd-10.2-release/usr.sbin/nscd/
H A Dcachelib.c195 while (!TAILQ_EMPTY(&ws->items)) {
196 data_item = TAILQ_FIRST(&ws->items);
197 TAILQ_REMOVE(&ws->items, data_item, entries);
232 HASHTABLE_FOREACH(&(common_entry->items), ht_item) {
241 HASHTABLE_DESTROY(&(common_entry->items), data);
301 HASHTABLE_FOREACH(&(common_entry->items), ht_item) {
398 hash = HASHTABLE_CALCULATE_HASH(cache_ht_, &entry->items,
400 assert(hash < HASHTABLE_ENTRIES_COUNT(&entry->items));
402 ht_item = HASHTABLE_GET_ENTRY(&(entry->items), hash);
576 HASHTABLE_INIT(&(new_common_entry->items),
[all...]
/freebsd-10.2-release/contrib/ntp/ntpd/
H A Dntp_request.c374 DPRINTF(3, ("request: flushing packet, %d items\n", nitems));
803 u_short items; local
814 items = INFO_NITEMS(inpkt->err_nitems);
823 while (items-- > 0 && ip != NULL) {
946 u_short items; local
955 items = INFO_NITEMS(inpkt->err_nitems);
964 while (items-- > 0 && ip != NULL) {
1288 u_short items; local
1300 items = INFO_NITEMS(inpkt->err_nitems);
1308 while (items
1397 u_short items; local
1781 u_short items; local
1941 u_short items; local
2078 register int items; local
2475 register int items; local
2541 register int items; local
2615 register int items; local
[all...]
/freebsd-10.2-release/contrib/llvm/tools/lldb/include/lldb/DataFormatters/
H A DFormatManager.h158 TypeCategoryImpl::FormatCategoryItems items = TypeCategoryImpl::ALL_ITEM_TYPES,
164 items,
H A DDataVisualization.h77 TypeCategoryImpl::FormatCategoryItems items = TypeCategoryImpl::ALL_ITEM_TYPES,
H A DTypeCategoryMap.h86 TypeCategoryImpl::FormatCategoryItems items = TypeCategoryImpl::ALL_ITEM_TYPES,
/freebsd-10.2-release/contrib/unbound/util/
H A Dwinsock_event.h125 /** The number of items that the winsock event handler can service.
137 struct event** items; member in struct:event_base
138 /** number of items in use in array */
140 /** capacity of array, size of array in items */
191 /** index of this event in the items array (if added) */
/freebsd-10.2-release/contrib/byacc/
H A Dgraph.c24 closure(state_table[i]->items, state_table[i]->nitems);
H A Dlr0.c143 closure(this_state->items, this_state->nitems);
188 isp2 = sp->items;
240 p->items[i] = rrhs[start_derives[i]];
306 isp2 = p->items;
337 itemno = p->items[i];
/freebsd-10.2-release/lib/libz/
H A Dzutil.h239 voidpf ZLIB_INTERNAL zcalloc OF((voidpf opaque, unsigned items,
244 #define ZALLOC(strm, items, size) \
245 (*((strm)->zalloc))((strm)->opaque, (items), (size))
/freebsd-10.2-release/sys/net/
H A Dzutil.h223 voidpf zcalloc OF((voidpf opaque, unsigned items, unsigned size));
226 #define ZALLOC(strm, items, size) \
227 (*((strm)->zalloc))((strm)->opaque, (items), (size))
/freebsd-10.2-release/sys/cddl/contrib/opensolaris/uts/common/zmod/
H A Dzutil.h266 voidpf zcalloc OF((voidpf opaque, unsigned items, unsigned size));
269 #define ZALLOC(strm, items, size) \
270 (*((strm)->zalloc))((strm)->opaque, (items), (size))
/freebsd-10.2-release/contrib/wpa/wpa_supplicant/dbus/
H A Ddbus_dict_helpers.c609 * @param items The array of strings
616 const char **items,
624 if (!items && (num_items != 0))
634 items[i]))
652 * @param items The array of wpabuf structures
659 const struct wpabuf **items,
667 if (!items && (num_items != 0))
679 wpabuf_head(items[i]),
680 wpabuf_len(items[i])))
614 wpa_dbus_dict_append_string_array(DBusMessageIter *iter_dict, const char *key, const char **items, const dbus_uint32_t num_items) argument
657 wpa_dbus_dict_append_wpabuf_array(DBusMessageIter *iter_dict, const char *key, const struct wpabuf **items, const dbus_uint32_t num_items) argument
/freebsd-10.2-release/usr.sbin/pmcstat/
H A Dpmcpl_calltree.c109 /* TODO: optimize for large number of items. */
227 pmcpl_ct_arc_grow(int cursize, int *maxsize, struct pmcpl_ct_arc **items) argument
235 *items = realloc(*items, nmaxsize * sizeof(struct pmcpl_ct_arc));
236 if (*items == NULL)
238 bzero((char *)*items + *maxsize * sizeof(struct pmcpl_ct_arc),
248 pmcpl_ct_instr_grow(int cursize, int *maxsize, struct pmcpl_ct_instr **items) argument
256 *items = realloc(*items, nmaxsize * sizeof(struct pmcpl_ct_instr));
257 if (*items
[all...]
/freebsd-10.2-release/tools/tools/shlib-compat/
H A Dshlib-compat.py118 self.items = {}
125 if self.enabled and self.items.has_key(id):
127 return self.items[id]
134 if self.items.has_key(id) and obj is not self.items[id]:
136 # (id, self.items[id], obj))
138 (id, self.items[id], obj))
139 self.items[id] = obj
143 assert self.items.has_key(id)
144 self.items[i
[all...]
/freebsd-10.2-release/contrib/llvm/tools/lldb/source/DataFormatters/
H A DDataVisualization.cpp106 TypeCategoryImpl::FormatCategoryItems items,
112 items,
105 AnyMatches(ConstString type_name, TypeCategoryImpl::FormatCategoryItems items, bool only_enabled, const char** matching_category, TypeCategoryImpl::FormatCategoryItems* matching_type) argument
/freebsd-10.2-release/bin/ps/
H A Dps.c985 descendant_sort(KINFO *ki, int items) argument
997 while (src < items) {
1002 for (nsrc = 1; src + nsrc < items; nsrc++)
1006 for (dst = 0; dst < items; dst++) {
1013 if (dst == items) {
1018 for (ndst = 1; dst + ndst < items; ndst++)
1059 for (src = 0; src < items; src++) {
1073 for (siblings = 0, dst = src + 1; dst < items; dst++) {
/freebsd-10.2-release/sys/kern/
H A Dkern_ctf.c42 z_alloc(void *nil, u_int items, u_int size) argument
46 ptr = malloc(items * size, M_TEMP, M_NOWAIT);
H A Dkern_gzio.c76 local void *gz_alloc OF((void *notused, u_int items, u_int size));
387 gz_alloc(void *notused __unused, u_int items, u_int size) argument
391 MALLOC(ptr, void *, items * size, M_TEMP, M_NOWAIT | M_ZERO);
/freebsd-10.2-release/tools/sched/
H A Dschedgraph.py278 self.items = LabelFrame(self, text="Item Type")
281 self.items.grid(row=0, column=0, sticky=E+W)
296 item = ColorConf(self.items, name, color)
364 self.items = []
368 self.items.append(f)
370 self.items[0].grid(row=0, column=0, sticky=E+W)
391 self.items.append(f)
392 item = SourceConf(self.items[self.icol], source)
672 canvas.items[item] = self
817 # It is much faster to append items t
[all...]
/freebsd-10.2-release/contrib/dialog/
H A Dcalendar.c83 nl_item items[7] = local
87 table[n] = nl_langinfo(items[n]);
125 nl_item items[12] = local
130 table[n] = nl_langinfo(items[n]);

Completed in 270 milliseconds

123456