HomeSort by: relevance | last modified time | path
    Searched refs:elem (Results 1 - 25 of 37) sorted by relevancy

1 2

  /src/sys/arch/sparc64/sparc64/
mdesc.c 69 struct md_element *elem; local in function:mdesc_get_prop_val
74 elem = (struct md_element *)(mdesc + sizeof(struct md_header));
77 while (elem[idx].tag != 'E') {
78 str = name_blk + elem[idx].name_offset;
79 if (elem[idx].tag == 'v' && strcmp(str, name) == 0)
80 return (elem[idx].d.val);
91 struct md_element *elem; local in function:mdesc_get_prop_str
97 elem = (struct md_element *)(mdesc + sizeof(struct md_header));
101 while (elem[idx].tag != 'E') {
102 str = name_blk + elem[idx].name_offset
115 struct md_element *elem; local in function:mdesc_get_prop_data
141 struct md_element *elem; local in function:mdesc_find
164 struct md_element *elem; local in function:mdesc_find_child
193 struct md_element *elem; local in function:mdesc_find_node_by_idx
219 struct md_element *elem; local in function:mdesc_next_node
230 struct md_element *elem; local in function:mdesc_name_by_idx
    [all...]
  /src/usr.sbin/tpctl/
data.c 94 struct tpctl_data_elem *elem; local in function:read_data
122 elem = alloc(sizeof(*elem));
123 elem->type = TPCTL_COMMENT;
124 elem->name = strdup_prune(buf);
125 TAILQ_INSERT_TAIL(&data->list, elem, link);
130 elem = alloc(sizeof(*elem));
131 elem->type = TPCTL_CALIBCOORDS;
138 free(elem);
259 struct tpctl_data_elem *elem; local in function:write_data
339 struct tpctl_data_elem *elem; local in function:free_data
361 struct tpctl_data_elem *elem; local in function:replace_data
387 struct tpctl_data_elem *elem; local in function:search_data
    [all...]
  /src/lib/librefuse/
refuse_signals.c 191 struct refuse_obj_elem* elem; local in function:exit_handler
203 for (elem = fuse_head; elem != NULL; elem = elem->next)
204 fuse_exit(elem->fuse);
229 struct refuse_obj_elem* elem; local in function:__fuse_set_signal_handlers
257 for (elem = fuse_head; elem != NULL; elem = elem->next)
286 struct refuse_obj_elem* elem; local in function:__fuse_remove_signal_handlers
    [all...]
  /src/sys/dev/raidframe/
rf_fifo.c 67 rf_FifoEnqueue(void *q_in, RF_DiskQueueData_t *elem, int priority)
73 elem->next = NULL;
77 q->hq_head = q->hq_tail = elem;
80 q->hq_tail->next = elem;
81 q->hq_tail = elem;
85 RF_ASSERT(elem->next == NULL);
89 elem->raidPtr->raidid);
94 q->lq_head = q->lq_tail = elem;
97 q->lq_tail->next = elem;
98 q->lq_tail = elem;
    [all...]
rf_fifo.h 54 rf_FifoEnqueue(void *q_in, RF_DiskQueueData_t * elem,
  /src/sys/sys/
callout.h 75 struct callout_impl *elem; member in union:callout_circq::__anon121ba573010a
80 struct callout_impl *elem; member in union:callout_circq::__anon121ba573020a
84 #define cq_next_e cq_next.elem
85 #define cq_prev_e cq_prev.elem
  /src/lib/libc/net/
nsparser.y 157 _nsaddsrctomap(const char *elem)
162 _DIAGASSERT(elem != NULL);
166 if ((strcasecmp(elem, NSSRC_COMPAT) == 0) ||
176 if (strcasecmp(curdbt.srclist[i].name, elem) == 0) {
180 "duplicate source", elem);
184 cursrc.name = elem;
189 "error adding", elem);
nsdispatch.c 197 _nsvect_append(const void *elem, void *vec, u_int *count, size_t esize)
207 memmove((void *)(((uintptr_t)vec) + (*count * esize)), elem, esize);
225 void *elem; local in function:_nsvect_free
229 elem = _nsvect_elem(i, vec, *count, esize);
230 if (elem != NULL)
231 (*free_elem)(elem);
  /src/sys/arch/next68k/dev/
nextdmavar.h 66 #define nextdma_setconf(nsc, elem, val) nsc->sc_conf.nd_##elem = (val)
  /src/bin/ed/
ed.h 144 /* INSQUE: insert elem in circular queue after pred */
145 #define INSQUE(elem, pred) \
147 REQUE((elem), (pred)->q_forw); \
148 REQUE((pred), elem); \
151 /* remque: remove elem from circular queue */
152 #define REMQUE(elem) REQUE((elem)->q_back, (elem)->q_forw);
  /src/usr.bin/rs/
rs.c 83 static char **elem; variable in typeref:typename:char **
155 ep = getptrs(elem);
182 padto = elem + irows * icols;
190 nelem = ep - elem;
199 ep = elem;
283 lp = elem + orows * ocols;
285 getptrs(elem + nelem);
286 lp = elem + orows * ocols;
289 for (ep = elem + nelem; ep < lp; ep++)
291 nelem = lp - elem;
    [all...]
  /src/sbin/mount_portal/
conf.c 84 ins_que(qelem *elem, qelem *pred)
87 elem->q_back = pred;
88 elem->q_forw = p;
89 pred->q_forw = elem;
90 p->q_back = elem;
97 rem_que(qelem *elem)
99 qelem *p = elem->q_forw;
100 qelem *p2 = elem->q_back;
  /src/sys/external/bsd/compiler_rt/dist/lib/tsan/rtl/
tsan_clock.cc 155 if (tid_ >= nclk || src->elem(tid_).reused != reused_) {
171 src->elem(tid_).reused = reused_;
199 // only dst->elem(tid_).
200 if (dst->elem(tid_).epoch > last_acquire_) {
227 dst->elem(i).reused = 0;
233 dst->elem(tid_).reused = reused_;
261 dst->elem(tid_).reused = reused_;
273 dst->elem(tid_).epoch > last_acquire_) {
295 dst->elem(tid_).reused = reused_;
335 dst->elem(tid_).epoch = clk_[tid_]
514 ALWAYS_INLINE ClockElem &SyncClock::elem(unsigned tid) const { function in class:__tsan::SyncClock
    [all...]
  /src/sbin/iscsid/
iscsid_lists.c 381 generic_entry_t *elem = NULL; local in function:search_list
402 elem = find_id(&list[par->list_kind].list, par->intval);
406 elem = find_name(&list[par->list_kind].list, par->strval);
414 elem = (void *)find_TargetName(par->list_kind,
419 TAILQ_FOREACH(elem, &list[SESSION_LIST].list, link)
420 if (strcmp((char *)((session_t *)(void *)elem)->target.TargetName,
434 TAILQ_FOREACH(elem, &list[PORTAL_LIST].list, link) {
435 portal_t *p = (void *)elem;
444 TAILQ_FOREACH(elem, &list[SEND_TARGETS_LIST].list, link) {
445 send_target_t *t = (void *)elem;
    [all...]
  /src/sys/arch/sparc64/dev/
cbus.c 255 struct md_element *elem; local in function:cbus_get_channel_endpoint
269 elem = (struct md_element *)(mdesc + sizeof(struct md_header));
284 for (; elem[idx].tag != 'E'; idx++) {
285 str = name_blk + elem[idx].name_offset;
286 if (elem[idx].tag != 'a' || strcmp(str, "fwd") != 0)
289 arc = elem[idx].d.val;
290 str = name_blk + elem[arc].name_offset;
  /src/sys/dev/sbus/
dbrivar.h 180 #define dbri_dma_off(member, elem) \
182 (&(((struct dbri_dma *)0)->member[elem])))
  /src/sys/external/bsd/ena-com/
ena_eth_com.h 178 static inline void ena_com_comp_ack(struct ena_com_io_sq *io_sq, u16 elem)
180 io_sq->next_to_comp += elem;
  /src/sys/external/bsd/compiler_rt/dist/include/sanitizer/
dfsan_interface.h 73 /// Returns whether the given label label contains the label elem.
74 int dfsan_has_label(dfsan_label label, dfsan_label elem);
  /src/sys/kern/
kern_timeout.c 141 #define CIRCQ_INSERT(elem, list) \
143 (elem)->cq_prev_e = (list)->cq_prev_e; \
144 (elem)->cq_next_l = (list); \
145 (list)->cq_prev_l->cq_next_l = (elem); \
146 (list)->cq_prev_l = (elem); \
160 #define CIRCQ_REMOVE(elem) \
162 (elem)->cq_next_l->cq_prev_e = (elem)->cq_prev_e; \
163 (elem)->cq_prev_l->cq_next_e = (elem)->cq_next_e;
    [all...]
  /src/usr.bin/tic/
tic.c 136 ENTRY elem, *elemp; local in function:find_term
138 elem.key = __UNCONST(name);
139 elem.data = NULL;
140 elemp = hsearch(elem, FIND);
164 ENTRY elem; local in function:store_term
169 elem.key = estrdup(name);
170 elem.data = term;
171 hsearch(elem, ENTER);
  /src/usr.bin/menuc/
parse.y 180 elem_list : elem
181 | elem_list "," elem
184 elem : NEXT MENU NAME label
  /src/sys/dev/wscons/
wskbdutil.c 43 keysym_t elem[2]; member in struct:compose_tab_s
285 if (i->elem[0] == j->elem[0])
286 return(i->elem[1] - j->elem[1]);
288 return(i->elem[0] - j->elem[0]);
310 if (compose_tab[j + i/2].elem[0] == compose_buf[0]) {
311 if (compose_tab[j + i/2].elem[1] == compose_buf[1])
313 r = compose_tab[j + i/2].elem[1] < compose_buf[1]
    [all...]
  /src/lib/libintl/
sysdep.c 212 cmp_sysdep_tag(const void *tag, const void *elem)
214 const struct sysdep_pair *pair = elem;
  /src/usr.bin/indent/
lexi.c 328 cmp_keyword_by_name(const void *key, const void *elem)
330 return strcmp(key, ((const struct keyword *)elem)->name);
  /src/usr.sbin/mtree/
misc.c 179 addtag(slist_t *list, char *elem)
193 list->list[list->count] = elem;

Completed in 26 milliseconds

1 2