| /src/usr.bin/grep/ |
| queue.c | 62 struct qentry *item; local in function:enqueue
64 item = grep_malloc(sizeof(struct qentry));
65 item->data.dat = grep_malloc(sizeof(char) * x->len);
66 item->data.len = x->len;
67 item->data.line_no = x->line_no;
68 item->data.off = x->off;
69 memcpy(item->data.dat, x->dat, x->len);
70 item->data.file = x->file;
72 STAILQ_INSERT_TAIL(&queue, item, list);
75 item = dequeue()
84 struct qentry *item; local in function:dequeue
98 struct qentry *item; local in function:printqueue
110 struct qentry *item; local in function:clearqueue
[all...] |
| /src/usr.sbin/bthcid/ |
| client.c | 63 * request. The event is used to expire the item.
65 struct item { struct
71 LIST_ENTRY(item) next;
77 static LIST_HEAD(,item) item_list;
189 struct item *item; local in function:process_client
207 LIST_FOREACH(item, &item_list, next) {
208 if (bdaddr_same(&rp.laddr, &item->laddr) == 0
209 || bdaddr_same(&rp.raddr, &item->raddr) == 0)
212 evtimer_del(&item->ev)
261 struct item *item; local in function:send_client_request
312 struct item *item = arg; local in function:process_item
325 struct item *item; local in function:lookup_pin
[all...] |
| /src/lib/libmenu/ |
| item.c | 1 /* $NetBSD: item.c,v 1.12 2012/03/21 05:33:27 matt Exp $ */
30 __RCSID("$NetBSD: item.c,v 1.12 2012/03/21 05:33:27 matt Exp $");
40 /* keep default item options for setting in new_item */
41 ITEM _menui_default_item = {
42 {NULL, 0}, /* item name struct */
43 {NULL, 0}, /* item description struct */
45 0, /* is item visible? */
46 0, /* is item selected? */
47 0, /* row item is on */
48 0, /* column item is on *
251 ITEM *item = (param_item != NULL) ? param_item : &_menui_default_item; local in function:set_item_value
[all...] |
| userptr.c | 39 /* the following is defined in item.c */
40 extern ITEM _menui_default_item;
43 * Set the item user pointer data
46 set_item_userptr(ITEM *param_item, char *userptr)
48 ITEM *item = (param_item != NULL) ? param_item : &_menui_default_item; local in function:set_item_userptr
50 item->userptr = userptr;
56 * Return the item user pointer
59 item_userptr(ITEM *item)
[all...] |
| internals.c | 45 * to calculate the widest item entry, then work out how many columns
47 * be. Once the layout is determined the neighbours of each item is
48 * calculated and the item structures updated.
70 /* fill in the row and column value of the item */
86 * Calculate the neighbours for an item in menu.
92 ITEM *item; local in function:_menui_calc_neighbours
96 item = menu->items[item_no];
100 item->up = item;
[all...] |
| internals.h | 44 void _menui_draw_item(MENU *menu, int item);
46 int _menui_goto_item(MENU *menu, ITEM *item, int new_top_row);
|
| /src/sys/external/bsd/drm/dist/bsd-core/ |
| drm_hashtab.h | 54 extern int drm_ht_insert_item(struct drm_open_hash *ht, struct drm_hash_item *item);
55 extern int drm_ht_just_insert_please(struct drm_open_hash *ht, struct drm_hash_item *item,
58 extern int drm_ht_find_item(struct drm_open_hash *ht, unsigned long key, struct drm_hash_item **item);
62 extern int drm_ht_remove_item(struct drm_open_hash *ht, struct drm_hash_item *item);
|
| drm_hashtab.c | 90 int drm_ht_insert_item(struct drm_open_hash *ht, struct drm_hash_item *item)
95 unsigned long key = item->key;
108 LIST_INSERT_AFTER(parent, item, head);
110 LIST_INSERT_HEAD(h_list, item, head);
116 * Just insert an item and return any "bits" bit key that hasn't been
119 int drm_ht_just_insert_please(struct drm_open_hash *ht, struct drm_hash_item *item,
130 item->key = (unshifted_key << shift) + add;
131 ret = drm_ht_insert_item(ht, item);
144 struct drm_hash_item **item)
152 *item = entry
[all...] |
| /src/sys/external/bsd/drm2/dist/include/drm/ |
| drm_hashtab.h | 57 int drm_ht_insert_item(struct drm_open_hash *ht, struct drm_hash_item *item);
58 int drm_ht_just_insert_please(struct drm_open_hash *ht, struct drm_hash_item *item,
61 int drm_ht_find_item(struct drm_open_hash *ht, unsigned long key, struct drm_hash_item **item);
65 int drm_ht_remove_item(struct drm_open_hash *ht, struct drm_hash_item *item);
|
| /src/lib/libpam/modules/pam_echo/ |
| pam_echo.c | 59 int err, i, item; local in function:_pam_echo
74 item = PAM_RHOST;
78 item = -1;
81 item = PAM_SERVICE;
84 item = PAM_TTY;
87 item = PAM_RUSER;
90 item = PAM_USER;
93 item = -1;
97 if (item == -1)
99 err = pam_get_item(pamh, item, &str)
[all...] |
| /src/sys/arch/hpcmips/stand/pbsdboot/ |
| layout.c | 50 DLGITEMTEMPLATE item; local in function:CreateMainWindow
153 item = *(DLGITEMTEMPLATE*)mem;
199 if (item.id == 0xffff) {
200 item.id = i + 1;
204 debug_printf(TEXT("Control: %04x "), item.id);
210 item.dwExtendedStyle,
213 item.style, // Style
214 item.x * ratio_x / 100,
215 item.y * ratio_y / 100 + cmdbar_height,
216 item.cx * ratio_x / 100
[all...] |
| /src/usr.sbin/sysinst/ |
| txtwalk.c | 13 * notice, item list of conditions and the following disclaimer.
15 * notice, item list of conditions and the following disclaimer in the
18 * or promote products derived from item software without specific prior
76 /* Assume item starts a line. */
125 process(const struct lookfor *item, char *line)
134 if (finddata(item, line, found, &numfound)) {
150 switch (item->todo[0]) {
152 p = item->todo;
165 *((int *)item->var+j)
169 strlcpy(*((char **)item->var+j)
[all...] |
| /src/usr.bin/pmap/ |
| pmap.h | 105 #define KDEREFOK(kd, item) _KDEREFOK((kd), A(item), D(item, data), S(item))
106 #define KDEREF(kd, item) _KDEREF((kd), A(item), D(item, data), S(item))
|
| /src/sys/external/bsd/drm2/dist/drm/ |
| drm_hashtab.c | 118 int drm_ht_insert_item(struct drm_open_hash *ht, struct drm_hash_item *item)
124 unsigned long key = item->key;
137 hlist_add_behind_rcu(&item->head, parent);
139 hlist_add_head_rcu(&item->head, h_list);
146 * Just insert an item and return any "bits" bit key that hasn't been
149 int drm_ht_just_insert_please(struct drm_open_hash *ht, struct drm_hash_item *item,
160 item->key = (unshifted_key << shift) + add;
161 ret = drm_ht_insert_item(ht, item);
175 struct drm_hash_item **item)
183 *item = hlist_entry(list, struct drm_hash_item, head)
[all...] |
| /src/games/larn/ |
| savelev.c | 25 pitem = item[0];
33 pcel->item = *pitem++;
54 pitem = item[0];
62 *pitem++ = pcel->item;
|
| create.c | 132 item[j][i] = tmp;
137 item[33][MAXY - 1] = 0; /* exit from dungeon */
159 item[i][j] = 0;
168 item[i][my] = 0;
188 if ((item[xx - 1][yy] != OWALL) || (item[xx - 2][yy] != OWALL))
190 item[xx - 1][yy] = item[xx - 2][yy] = 0;
197 if ((item[xx + 1][yy] != OWALL) || (item[xx + 2][yy] != OWALL)
[all...] |
| /src/sys/external/bsd/drm/dist/shared-core/ |
| sis_ds.h | 54 int setAdd(set_t * set, ITEM_TYPE item);
55 int setDel(set_t * set, ITEM_TYPE item);
56 int setFirst(set_t * set, ITEM_TYPE * item);
57 int setNext(set_t * set, ITEM_TYPE * item);
|
| /src/usr.bin/usbhidctl/ |
| usbhid.c | 87 * An instance number can be used to identify an item by
97 int (*opfunc)(struct hid_item *item, struct Susbvar *var,
302 * hidmatch() determines whether the item specified in 'item', and
308 hidmatch(u_int32_t const *collist, size_t collen, struct hid_item *item,
322 iscollection = item->kind == hid_collection ||
323 item->kind == hid_endcollection;
337 (item->flags & HIO_CONST)) {
345 ((item->kind != hid_output &&
346 item->kind != hid_feature) |
[all...] |
| /src/lib/libc/stdlib/ |
| hcreate.c | 190 hsearch(ENTRY item, ACTION action)
194 (void)hsearch_r(item, action, &ep, &htable);
199 hsearch_r(ENTRY item, ACTION action, ENTRY **itemp, struct hsearch_data *head)
207 _DIAGASSERT(item.key != NULL);
213 len = strlen(item.key);
214 hashval = (*__default_hash)(item.key, len);
219 if (strcmp(ie->ent.key, item.key) == 0)
236 ie->ent.key = item.key;
237 ie->ent.data = item.data;
|
| /src/sys/external/bsd/drm2/dist/drm/sis/ |
| sis_mm.c | 96 struct sis_memblock *item; local in function:sis_drm_alloc
112 item = kzalloc(sizeof(*item), GFP_KERNEL);
113 if (!item) {
121 &item->mm_node,
123 offset = item->mm_node.start;
126 item->req.size = mem->size;
127 sis_malloc(&item->req);
128 if (item->req.size == 0)
130 offset = item->req.offset
[all...] |
| /src/usr.bin/rpcgen/ |
| rpc_util.h | 99 #define STOREVAL(list,item) \
100 storeval(list,item)
102 #define FINDVAL(list,item,finder) \
103 findval(list, item, finder)
|
| /src/tests/usr.bin/indent/ |
| opt_bc.c | 141 const struct paren_level *prev = state.prev_ps.paren.item,
142 *curr = ps.paren.item;
149 const struct paren_level *prev = state.prev_ps.paren.item, *curr = ps.paren.item;
|
| /src/sys/external/bsd/drm2/dist/drm/via/ |
| via_mm.c | 125 struct via_memblock *item; local in function:via_mem_alloc
145 item = kzalloc(sizeof(*item), GFP_KERNEL);
146 if (!item) {
154 &item->mm_node,
158 &item->mm_node,
163 retval = idr_alloc(&dev_priv->object_idr, item, 1, 0, GFP_KERNEL);
168 list_add(&item->owner_list, &file_priv->obj_list);
174 ((item->mm_node.start) << VIA_MM_ALIGN_SHIFT);
180 drm_mm_remove_node(&item->mm_node)
[all...] |
| /src/sys/dev/i2c/ |
| ims.c | 100 struct hid_item item __debugused;
124 while (hid_get_item(d, &item)) {
125 if (item.kind != hid_input
126 || HID_GET_USAGE_PAGE(item.usage) != HUP_GENERIC_DESKTOP
127 || item.report_ID != sc->sc_hdev.sc_report_id)
129 if (HID_GET_USAGE(item.usage) == HUG_X) {
130 aprint_normal("X range: %d - %d\n", item.logical_minimum, item.logical_maximum);
132 if (HID_GET_USAGE(item.usage) == HUG_Y) {
133 aprint_normal("Y range: %d - %d\n", item.logical_minimum, item.logical_maximum)
[all...] |
| /src/sys/kern/ |
| subr_pcq.c | 38 * P1. initialize an item
43 * P3. atomic_store_release(&pcq->pcq_items[c], item) to publish
44 * the item in the space it reserved
56 * unconsumed but potentially published item (fails if item
60 * published item
67 * C6. use the item
78 * Initializing item at P1 is dependency-ordered before usage of
79 * item at C6, so items placed by pcq_put can be safely used by
88 * C2 (if not, pcq_get fails in `if (item == NULL) retur
238 void *item; local in function:pcq_get
[all...] |
