Searched refs:elt (Results 1 - 25 of 76) sorted by relevance

1234

/freebsd-10.0-release/lib/libc/include/isc/
H A Dlist.h34 #define INIT_LINK_TYPE(elt, link, type) \
36 (elt)->link.prev = (type *)(-1); \
37 (elt)->link.next = (type *)(-1); \
39 #define INIT_LINK(elt, link) \
40 INIT_LINK_TYPE(elt, link, void)
41 #define LINKED(elt, link) ((void *)((elt)->link.prev) != (void *)(-1))
47 #define PREPEND(list, elt, link) \
49 INSIST(!LINKED(elt, link));\
51 (list).head->link.prev = (elt); \
[all...]
/freebsd-10.0-release/contrib/ntp/include/isc/
H A Dlist.h36 #define ISC_LINK_INIT_TYPE(elt, link, type) \
38 (elt)->link.prev = (type *)(-1); \
39 (elt)->link.next = (type *)(-1); \
41 #define ISC_LINK_INIT(elt, link) \
42 ISC_LINK_INIT_TYPE(elt, link, void)
43 #define ISC_LINK_LINKED(elt, link) ((void *)((elt)->link.prev) != (void *)(-1))
49 #define __ISC_LIST_PREPENDUNSAFE(list, elt, link) \
52 (list).head->link.prev = (elt); \
54 (list).tail = (elt); \
[all...]
H A Dutil.h186 #define INIT_LINK(elt, link) ISC_LINK_INIT(elt, link)
190 #define PREV(elt, link) ISC_LIST_PREV(elt, link)
191 #define NEXT(elt, link) ISC_LIST_NEXT(elt, link)
192 #define APPEND(list, elt, link) ISC_LIST_APPEND(list, elt, link)
193 #define PREPEND(list, elt, link) ISC_LIST_PREPEND(list, elt, lin
[all...]
/freebsd-10.0-release/contrib/gcc/
H A Dtree-sra.c397 can_completely_scalarize_p (struct sra_elt *elt)
401 if (elt->cannot_scalarize)
404 for (c = elt->children; c; c = c->sibling)
408 for (c = elt->groups; c; c = c->sibling)
535 struct sra_elt *elt;
547 elt = *slot;
548 if (!elt && insert == INSERT)
550 *slot = elt = obstack_alloc (&sra_obstack, sizeof (*elt));
551 memset (elt,
396 can_completely_scalarize_p(struct sra_elt *elt) argument
533 struct sra_elt *elt; local
589 struct sra_elt *elt; local
731 struct sra_elt *elt = maybe_lookup_element_for_expr (expr); local
1035 scan_use(struct sra_elt *elt, tree *expr_p ATTRIBUTE_UNUSED, block_stmt_iterator *bsi ATTRIBUTE_UNUSED, bool is_output ATTRIBUTE_UNUSED, bool use_all ATTRIBUTE_UNUSED) argument
1058 scan_ldst(struct sra_elt *elt, tree other ATTRIBUTE_UNUSED, block_stmt_iterator *bsi ATTRIBUTE_UNUSED, bool is_output ATTRIBUTE_UNUSED) argument
1068 scan_dump(struct sra_elt *elt) argument
1103 struct sra_elt *elt = lookup_element (NULL, var, NULL, NO_INSERT); local
1118 build_element_name_1(struct sra_elt *elt) argument
1163 build_element_name(struct sra_elt *elt) argument
1173 instantiate_element(struct sra_elt *elt) argument
1228 decide_instantiation_1(struct sra_elt *elt, unsigned int parent_uses, unsigned int parent_copies) argument
1273 sum_instantiated_sizes(struct sra_elt *elt, unsigned HOST_WIDE_INT *sizep) argument
1298 instantiate_missing_elements_1(struct sra_elt *elt, tree child, tree type) argument
1311 instantiate_missing_elements(struct sra_elt *elt) argument
1377 decide_block_copy(struct sra_elt *elt) argument
1521 struct sra_elt *elt = lookup_element (NULL, var, NULL, NO_INSERT); local
1593 mark_no_warning(struct sra_elt *elt) argument
1612 generate_one_element_ref(struct sra_elt *elt, tree base) argument
1649 generate_element_ref(struct sra_elt *elt) argument
1671 generate_copy_inout(struct sra_elt *elt, bool copy_out, tree expr, tree *list_p) argument
1743 generate_element_zero(struct sra_elt *elt, tree *list_p) argument
1786 generate_element_init_1(struct sra_elt *elt, tree init, tree *list_p) argument
1866 generate_element_init(struct sra_elt *elt, tree init, tree *list_p) argument
1962 scalarize_use(struct sra_elt *elt, tree *expr_p, block_stmt_iterator *bsi, bool is_output, bool use_all) argument
2157 scalarize_ldst(struct sra_elt *elt, tree other, block_stmt_iterator *bsi, bool is_output) argument
2230 struct sra_elt *elt = lookup_element (NULL, var, NULL, NO_INSERT); local
2259 dump_sra_elt_name(FILE *f, struct sra_elt *elt) argument
2289 debug_sra_elt_name(struct sra_elt *elt) argument
[all...]
H A Dcse.c684 struct table_elt *elt;
690 for (elt = classp->first_same_value; elt; elt = elt->next_same_value)
692 print_rtl (stderr, elt->exp);
1314 remove_from_table (struct table_elt *elt, unsigned int hash)
1316 if (elt == 0)
1320 elt->first_same_value = 0;
1325 struct table_elt *prev = elt
682 struct table_elt *elt; local
1310 remove_from_table(struct table_elt *elt, unsigned int hash) argument
1390 struct table_elt *elt; local
1512 struct table_elt *elt; local
1690 struct table_elt *elt, *next, *new; local
2085 use_related_value(rtx x, struct table_elt *elt) argument
2283 rtx elt; local
2855 struct table_elt *elt; local
3282 struct table_elt *elt; local
3323 struct table_elt *elt; local
4497 struct table_elt *elt; local
5082 struct table_elt *elt = 0, *p; local
5976 struct table_elt *elt; local
6045 struct table_elt *elt; local
6082 struct table_elt *elt; local
6221 struct table_elt *elt = sets[i].src_elt; local
6238 struct table_elt *elt; local
6316 struct table_elt *elt, *classp = 0; local
7447 rtx elt = XVECEXP (PATTERN (insn), 0, i); local
[all...]
H A Dbitmap.c51 bitmap_elem_to_freelist (bitmap head, bitmap_element *elt)
55 elt->next = NULL;
58 elt->prev = bit_obstack->elements;
59 bit_obstack->elements = elt;
63 elt->prev = bitmap_ggc_free;
64 bitmap_ggc_free = elt;
72 bitmap_element_free (bitmap head, bitmap_element *elt)
74 bitmap_element *next = elt->next;
75 bitmap_element *prev = elt->prev;
83 if (head->first == elt)
50 bitmap_elem_to_freelist(bitmap head, bitmap_element *elt) argument
71 bitmap_element_free(bitmap head, bitmap_element *elt) argument
150 bitmap_elt_clear_from(bitmap head, bitmap_element *elt) argument
356 bitmap_elt_insert_after(bitmap head, bitmap_element *elt, unsigned int indx) argument
562 bitmap_element *elt; local
589 bitmap_element *elt = a->first; local
866 bitmap_element *elt = bitmap_find_bit (head, start); local
[all...]
H A Dtree-ssa-threadupdate.c250 struct redirection_data *elt; local
254 elt = XNEW (struct redirection_data);
255 elt->outgoing_edge = e;
256 elt->dup_block = NULL;
257 elt->do_not_duplicate = false;
258 elt->incoming_edges = NULL;
260 slot = htab_find_slot (redirection_data, elt, insert);
266 free (elt);
274 *slot = (void *)elt;
275 elt
[all...]
H A Dtree-nested.c270 struct var_map_elt *elt, dummy; local
281 elt = (struct var_map_elt *) *slot;
283 if (!elt && insert == INSERT)
307 elt = GGC_NEW (struct var_map_elt);
308 elt->old = decl;
309 elt->new = field;
310 *slot = elt;
316 field = elt ? elt->new : NULL;
471 struct var_map_elt *elt, dumm local
867 struct var_map_elt *elt, dummy; local
1200 struct var_map_elt *elt, dummy; local
1493 struct var_map_elt *elt, dummy; local
1561 struct var_map_elt *elt, dummy; local
[all...]
H A Dcselib.h62 cselib_val *elt; local
H A Dcselib.c141 new_elt_list (struct elt_list *next, cselib_val *elt)
146 el->elt = elt;
388 || REG_VALUES (REGNO (x))->elt == NULL)
391 return GET_MODE (REG_VALUES (REGNO (x))->elt->u.val_rtx);
619 rtx elt;
625 elt = CONST_VECTOR_ELT (x, i);
626 hash += cselib_hash_rtx (elt, 0);
813 if (GET_MODE (l->elt->u.val_rtx) == mode)
814 return l->elt;
140 new_elt_list(struct elt_list *next, cselib_val *elt) argument
618 rtx elt; local
[all...]
H A Dtree-ssa-uncprop.c337 struct equiv_hash_elt *elt = (struct equiv_hash_elt *) p; local
338 VEC_free (tree, heap, elt->equivalences);
339 free (elt);
515 struct equiv_hash_elt *elt = (struct equiv_hash_elt *) *slot; local
523 for (j = VEC_length (tree, elt->equivalences) - 1; j >= 0; j--)
525 tree equiv = VEC_index (tree, elt->equivalences, j);
/freebsd-10.0-release/contrib/groff/src/preproc/grn/
H A Dgprint.h80 #define DBNextElt(elt) (elt->nextelt)
81 #define DBNextofSet(elt) (elt->setnext)
82 #define DBNullelt(elt) (elt == NULL)
/freebsd-10.0-release/contrib/gdb/gdb/
H A Dexpprint.c759 int elt; local
771 for (elt = 0; elt < exp->nelts; elt++)
773 fprintf_filtered (stream, "\t%5d ", elt);
774 opcode_name = op_name (exp, exp->elts[elt].opcode);
777 print_longest (stream, 'd', 0, exp->elts[elt].longconst);
780 for (eltscan = (char *) &exp->elts[elt],
797 dump_subexp (struct expression *exp, struct ui_file *stream, int elt) argument
803 fprintf_filtered (stream, "\t%5d ", elt);
823 dump_subexp_body(struct expression *exp, struct ui_file *stream, int elt) argument
831 dump_subexp_body_standard(struct expression *exp, struct ui_file *stream, int elt) argument
1052 int elt; local
[all...]
/freebsd-10.0-release/contrib/subversion/subversion/libsvn_subr/
H A Dskel.c163 svn_skel_t *elt;
165 for (elt = skel->children; elt; elt = elt->next)
166 if (! elt->is_atom)
182 svn_skel_t *elt;
184 for (elt = skel->children; elt; elt
160 svn_skel_t *elt; local
179 svn_skel_t *elt; local
700 svn_skel_t *elt; local
728 svn_skel_t *elt; local
758 svn_skel_t *elt; local
[all...]
/freebsd-10.0-release/contrib/apr-util/misc/
H A Dapr_thread_pool.c210 struct apr_thread_list_elt *elt; local
213 elt = apr_pcalloc(me->pool, sizeof(*elt));
214 if (NULL == elt) {
219 elt = APR_RING_FIRST(me->recycled_thds);
220 APR_RING_REMOVE(elt, link);
223 APR_RING_ELEM_INIT(elt, link);
224 elt->thd = t;
225 elt->current_owner = NULL;
226 elt
243 struct apr_thread_list_elt *elt; local
664 struct apr_thread_list_elt *elt; local
783 struct apr_thread_list_elt *head, *tail, *elt; local
831 struct apr_thread_list_elt *elt, *head, *tail; local
[all...]
/freebsd-10.0-release/contrib/texinfo/makeinfo/
H A Dxml.c666 xml_push_current_element (int elt)
668 element_stack[element_stack_index++] = elt;
672 xml_element_list[elt].name);
776 /* NOTE: We use `elt' rather than `element' in the argument list of
782 xml_insert_element_with_attribute (int elt, int arg, char *format, ...)
784 xml_insert_element_with_attribute (elt, arg, format, va_alist)
785 int elt;
801 (element_list->element_to_replace == elt) ) ||
804 (element_list->element_to_replace == elt) ) )
806 elt
664 xml_push_current_element(int elt) argument
780 xml_insert_element_with_attribute(int elt, int arg, char *format, ...) argument
988 xml_insert_element(int elt, int arg) argument
1348 xml_begin_docbook_float(int elt) argument
1641 int elt = xml_in_para ? INLINEIMAGE : MEDIAOBJECT; local
[all...]
H A Dxml.h108 xml_insert_element (int elt, int arg),
139 xml_begin_docbook_float (int elt);
154 void xml_insert_element_with_attribute (int elt, int arg, char *format, ...);
H A Dinsertion.c103 INSERTION_ELT *elt = insertion_stack;
107 while (!done && elt)
109 switch (elt->insertion)
130 elt = elt->next;
139 return done && (*elt->item_function) ? elt->item_function : NULL;
1924 int elt = STREQ (command, "shortcaption") ? SHORTCAPTION : CAPTION;
1925 xml_insert_element (elt, START);
1928 xml_insert_element (elt, EN
102 INSERTION_ELT *elt = insertion_stack; local
1919 int elt = STREQ (command, "shortcaption") ? SHORTCAPTION : CAPTION; local
2037 int elt = 0; local
[all...]
/freebsd-10.0-release/contrib/subversion/subversion/libsvn_ra_svn/
H A Dinternal_auth.c44 svn_ra_svn_item_t *elt; local
48 elt = &APR_ARRAY_IDX(mechlist, i, svn_ra_svn_item_t);
49 if (elt->kind == SVN_RA_SVN_WORD && strcmp(elt->u.word, mech) == 0)
H A Dclient.c201 svn_ra_svn_item_t *elt = &APR_ARRAY_IDX(list, i, svn_ra_svn_item_t);
203 if (elt->kind != SVN_RA_SVN_LIST)
207 SVN_ERR(svn_ra_svn__parse_tuple(elt->u.list, pool, "c(?s)", &prop->name,
1106 svn_ra_svn_item_t *elt = &APR_ARRAY_IDX(iproplist, i,
1108 if (elt->kind != SVN_RA_SVN_LIST)
1115 SVN_ERR(svn_ra_svn__parse_tuple(elt->u.list, iterpool, "cl",
1268 svn_ra_svn_item_t *elt = &APR_ARRAY_IDX(dirlist, i, svn_ra_svn_item_t);
1270 if (elt->kind != SVN_RA_SVN_LIST)
1273 SVN_ERR(svn_ra_svn__parse_tuple(elt->u.list, pool, "cwnbr(?c)(?c)",
1329 svn_ra_svn_item_t *elt;
200 svn_ra_svn_item_t *elt = &APR_ARRAY_IDX(list, i, svn_ra_svn_item_t); local
1105 svn_ra_svn_item_t *elt = &APR_ARRAY_IDX(iproplist, i, local
1267 svn_ra_svn_item_t *elt = &APR_ARRAY_IDX(dirlist, i, svn_ra_svn_item_t); local
1328 svn_ra_svn_item_t *elt; local
1606 svn_ra_svn_item_t *elt = &APR_ARRAY_IDX(cplist, i, local
2227 svn_ra_svn_item_t *elt; local
2283 svn_ra_svn_item_t *elt; local
2356 svn_ra_svn_item_t *elt; local
2410 svn_ra_svn_item_t *elt; local
2501 svn_ra_svn_item_t *elt = &APR_ARRAY_IDX(list, i, svn_ra_svn_item_t); local
[all...]
/freebsd-10.0-release/contrib/top/
H A Dgetans83 for elt in $path; do
84 if [ -f "$elt/$input" ]; then x=1; break; fi
/freebsd-10.0-release/contrib/subversion/subversion/libsvn_client/
H A Diprops.c114 svn_prop_inherited_item_t *elt =
118 if (! (svn_path_is_url(elt->path_or_url)
119 || svn_dirent_is_absolute(elt->path_or_url)))
121 elt->path_or_url = svn_path_url_add_component2(repos_root_url,
122 elt->path_or_url,
112 svn_prop_inherited_item_t *elt = local
/freebsd-10.0-release/contrib/apr-util/crypto/
H A Dapr_crypto_openssl.c207 char *elt; local
215 while ((elt = elts[i])) {
216 ptr = strchr(elt, '=');
218 for (klen = ptr - elt; klen && apr_isspace(elt[klen - 1]); --klen)
223 for (klen = strlen(elt); klen && apr_isspace(elt[klen - 1]); --klen)
226 elt[klen] = 0;
229 if (!strcasecmp(fields[j].field, elt)) {
H A Dapr_crypto_nss.c150 char *elt; local
158 while ((elt = elts[i])) {
159 ptr = strchr(elt, '=');
161 for (klen = ptr - elt; klen && apr_isspace(elt[klen - 1]); --klen)
166 for (klen = strlen(elt); klen && apr_isspace(elt[klen - 1]); --klen)
169 elt[klen] = 0;
172 if (klen && !strcasecmp(fields[j].field, elt)) {
/freebsd-10.0-release/sys/geom/part/
H A Dg_part_gpt.c359 enum gpt_elt elt)
369 table->state[elt] = GPT_STATE_MISSING;
374 if (elt == GPT_ELT_SECHDR) {
376 table->lba[elt] = last;
378 table->lba[elt] = 1;
379 buf = g_read_data(cp, table->lba[elt] * pp->sectorsize, pp->sectorsize,
387 table->state[elt] = GPT_STATE_CORRUPT;
402 table->state[elt] = GPT_STATE_INVALID;
407 if (hdr->hdr_lba_self != table->lba[elt])
442 table->state[elt]
358 gpt_read_hdr(struct g_part_gpt_table *table, struct g_consumer *cp, enum gpt_elt elt) argument
461 gpt_read_tbl(struct g_part_gpt_table *table, struct g_consumer *cp, enum gpt_elt elt, struct gpt_hdr *hdr) argument
[all...]

Completed in 195 milliseconds

1234