Searched refs:e1 (Results 26 - 50 of 112) sorted by relevance

12345

/freebsd-11-stable/contrib/atf/atf-c/detail/
H A Dlist.c372 struct list_entry *e1, *e2, *ghost1, *ghost2; local
377 e1 = ghost1->m_prev;
383 e1->m_next = e2;
384 e2->m_prev = e1;
/freebsd-11-stable/sys/geom/part/
H A Dg_part.c308 struct g_part_entry *e1, *e2; local
326 LIST_FOREACH(e1, &table->gpt_entry, gpe_entry) {
327 if (e1->gpe_deleted || e1->gpe_internal)
329 if (e1->gpe_start < table->gpt_first) {
331 "LBA: %jd < %jd\n", e1->gpe_index,
332 (intmax_t)e1->gpe_start,
336 if (e1->gpe_start > table->gpt_last) {
338 "LBA: %jd > %jd\n", e1->gpe_index,
339 (intmax_t)e1
[all...]
/freebsd-11-stable/crypto/heimdal/lib/asn1/
H A Dcheck-gen.c277 KRB_ERROR e1; local
282 e1.pvno = 5;
283 e1.msg_type = 30;
284 e1.ctime = NULL;
285 e1.cusec = NULL;
286 e1.stime = 1069632679;
287 e1.susec = 322981;
288 e1.error_code = 31;
289 e1.crealm = &realm;
290 e1
[all...]
/freebsd-11-stable/sys/netgraph/bluetooth/l2cap/
H A Dng_l2cap_main.c551 ng_l2cap_node_con_list_ep *e1 = NULL; local
563 sizeof(*e1) + n * sizeof(*e2), M_NOWAIT);
569 e1 = (ng_l2cap_node_con_list_ep *)(rsp->data);
570 e2 = (ng_l2cap_node_con_ep *)(e1 + 1);
572 e1->num_connections = n;
598 ng_l2cap_node_chan_list_ep *e1 = NULL; local
617 e1 = (ng_l2cap_node_chan_list_ep *)(rsp->data);
618 e2 = (ng_l2cap_node_chan_ep *)(e1 + 1);
620 e1->num_channels = n;
/freebsd-11-stable/contrib/gcc/
H A Dloop-invariant.c310 invariant_expr_equal_p (rtx insn1, rtx e1, rtx insn2, rtx e2) argument
312 enum rtx_code code = GET_CODE (e1);
322 if (code != GET_CODE (e2) || GET_MODE (e1) != GET_MODE (e2))
332 return rtx_equal_p (e1, e2);
335 use1 = df_find_use (df, insn1, e1);
343 return rtx_equal_p (e1, e2);
361 sub1 = XEXP (e1, i);
370 if (XVECLEN (e1, i) != XVECLEN (e2, i))
373 for (j = 0; j < XVECLEN (e1, i); j++)
375 sub1 = XVECEXP (e1,
408 eq_invariant_expr(const void *e1, const void *e2) argument
[all...]
H A Dtree-ssa-loop-niter.c780 tree e, te, e0, e1, e2, notcond; local
796 e1 = tree_simplify_using_condition_1 (cond, TREE_OPERAND (expr, 1));
797 if (TREE_OPERAND (expr, 1) != e1)
812 expr = fold_build3 (code, boolean_type_node, e0, e1, e2);
814 expr = fold_build2 (code, boolean_type_node, e0, e1);
826 e1 = TREE_OPERAND (cond, 1);
828 /* We know that e0 == e1. Check whether we cannot simplify expr
830 e = simplify_replace_tree (expr, e0, e1);
834 e = simplify_replace_tree (expr, e1, e0);
841 e1
959 tree e, e0, e1, e2; local
[all...]
H A Drtl-factoring.c381 match_seqs (p_hash_elem e0, p_hash_elem e1) argument
389 matching_length (e0->insn, e1->insn, &len, &cost);
414 while (p_next && p_next->idx < e1->idx)
423 mseq->insn = e1->insn;
424 mseq->idx = e1->idx;
444 p_hash_elem e0, e1; local
499 FOR_EACH_HTAB_ELEMENT (hash_bucket->seq_candidates, e1, p_hash_elem,
501 if (e0 != e1
504 && !bitmap_bit_p (&stack_reg_live, INSN_UID (e1->insn))
507 match_seqs (e0, e1);
[all...]
H A Dcfgcleanup.c1309 edge e1, e2;
1520 FOR_EACH_EDGE (e1, ei, bb1->succs)
1524 if (e1->flags & EDGE_EH)
1530 if (e1->flags & EDGE_FALLTHRU)
1531 fallthru1 = e1;
1567 FOR_EACH_EDGE (e1, ei, bb2->succs)
1571 basic_block d1 = e1->dest;
1607 try_crossjump_to_edge (int mode, edge e1, edge e2)
1610 basic_block src1 = e1->src, src2 = e2->src;
1636 e1
1302 edge e1, e2; local
1600 try_crossjump_to_edge(int mode, edge e1, edge e2) argument
[all...]
H A Dpredict.c1325 edge e1;
1328 FOR_EACH_EDGE (e1, ei1, bb->preds)
1329 if (!predicted_by_p (e1->src, PRED_NULL_RETURN)
1330 && !predicted_by_p (e1->src, PRED_CONST_RETURN)
1331 && !predicted_by_p (e1->src, PRED_NEGATIVE_RETURN)
1332 && !last_basic_block_p (e1->src))
1333 predict_edge_def (e1, PRED_TREE_EARLY_RETURN, NOT_TAKEN);
1322 edge e1; local
H A Dreg-stack.c2804 better_edge (edge e1, edge e2)
2806 if (!e1)
2809 if (EDGE_FREQUENCY (e1) > EDGE_FREQUENCY (e2))
2810 return e1;
2811 if (EDGE_FREQUENCY (e1) < EDGE_FREQUENCY (e2))
2814 if (e1->count > e2->count)
2815 return e1;
2816 if (e1->count < e2->count)
2822 if (EDGE_CRITICAL_P (e1) != EDGE_CRITICAL_P (e2))
2823 return EDGE_CRITICAL_P (e1)
2785 better_edge(edge e1, edge e2) argument
[all...]
H A Dtree-cfgcleanup.c355 phi_alternatives_equal (basic_block dest, edge e1, edge e2) argument
357 int n1 = e1->dest_idx;
/freebsd-11-stable/contrib/llvm-project/lld/COFF/
H A DDriver.cpp755 for (Export &e1 : config->exports) {
757 e2.Name = e1.name;
758 e2.SymbolName = e1.symbolName;
759 e2.ExtName = e1.extName;
760 e2.Ordinal = e1.ordinal;
761 e2.Noname = e1.noname;
762 e2.Data = e1.data;
763 e2.Private = e1.isPrivate;
764 e2.Constant = e1.constant;
841 for (COFFShortExport e1
[all...]
/freebsd-11-stable/contrib/ncurses/progs/
H A Dinfocmp.c247 useeq(ENTRY * e1, ENTRY * e2) argument
252 if (e1->nuses != e2->nuses)
256 for (i = 0; i < e1->nuses; i++) {
261 if (!strcmp(e1->uses[i].name, e2->uses[j].name)) {
423 ENTRY *e1 = &entries[0]; local
436 b1 = e1->tterm.Booleans[idx];
484 n1 = e1->tterm.Numbers[idx];
532 s1 = e1->tterm.Strings[idx];
582 if (!useeq(e1, e2)) {
584 print_uses(e1, stdou
[all...]
/freebsd-11-stable/contrib/groff/src/preproc/refer/
H A Dlabel.y162 binary_expr(expression *e1, expression *e2) : expr1(e1), expr2(e2) { }
172 alternative_expr(expression *e1, expression *e2) : binary_expr(e1, e2) { }
178 list_expr(expression *e1, expression *e2) : binary_expr(e1, e2) { }
184 substitute_expr(expression *e1, expression *e2) : binary_expr(e1, e2) { }
194 ternary_expr(expression *e1, expression *e2, expression *e3)
195 : expr1(e1), expr
[all...]
/freebsd-11-stable/sys/kern/
H A Dkern_rangelock.c91 ranges_overlap(const struct rl_q_entry *e1, argument
95 if (e1->rl_q_start < e2->rl_q_end && e1->rl_q_end > e2->rl_q_start)
H A Dkern_sysctl.c510 struct sysctl_ctx_entry *e, *e1; local
532 e1 = TAILQ_PREV(e, sysctl_ctx_list, link);
534 e1 = TAILQ_LAST(clist, sysctl_ctx_list);
535 while (e1 != NULL) {
536 sysctl_register_oid(e1->entry);
537 e1 = TAILQ_PREV(e1, sysctl_ctx_list, link);
546 e1 = TAILQ_NEXT(e, link);
552 e = e1;
/freebsd-11-stable/sys/netgraph/bluetooth/hci/
H A Dng_hci_main.c449 ng_hci_node_get_neighbor_cache_ep *e1 = NULL; local
468 NG_MKRESPONSE(rsp, msg, sizeof(*e1) + s * sizeof(*e2),
475 e1 = (ng_hci_node_get_neighbor_cache_ep *)(rsp->data);
476 e2 = (ng_hci_node_neighbor_cache_entry_ep *)(e1 + 1);
478 e1->num_entries = s;
498 ng_hci_node_con_list_ep *e1 = NULL; local
509 NG_MKRESPONSE(rsp, msg, sizeof(*e1) + s * sizeof(*e2),
516 e1 = (ng_hci_node_con_list_ep *)(rsp->data);
517 e2 = (ng_hci_node_con_ep *)(e1 + 1);
519 e1
[all...]
/freebsd-11-stable/sbin/ifconfig/
H A Difconfig.c246 struct ifa_order_elt *cur, *e1, *e2; local
250 e1 = e2 = NULL;
255 if (e1 && e2)
259 e1 = cur;
264 if (!e1 || !e2)
267 return (e1->if_order - e2->if_order);
272 e1 = cur;
277 if (!e1)
283 if (af1 < ORDERS_SIZE(e1->af_orders) &&
284 af2 < ORDERS_SIZE(e1
[all...]
/freebsd-11-stable/contrib/unbound/util/
H A Dfptr_wlist.h391 * @param e1: first order_id
395 int order_lock_cmp(const void* e1, const void* e2);
/freebsd-11-stable/stand/common/
H A Dpart.c388 struct pentry *e1, *entry; local
393 STAILQ_FOREACH(e1, &table->entries, entry) {
394 if (e1->type.mbr == DOSPTYP_EXT ||
395 e1->type.mbr == DOSPTYP_EXTLBA)
398 if (e1 == NULL)
401 offset = e1->part.start;
419 offset = e1->part.start + start;
436 offset = e1->part.start + le32toh(dp[1].dp_start);
/freebsd-11-stable/contrib/unbound/smallapp/
H A Dworker_cb.c227 int order_lock_cmp(const void* e1, const void* e2) argument
229 const struct order_id* o1 = e1;
/freebsd-11-stable/contrib/binutils/ld/
H A Dldlang.c6771 const struct bfd_elf_version_expr *e1 = p1;
6774 return strcmp (e1->symbol, e2->symbol) == 0;
6811 struct bfd_elf_version_expr *e1, *last;
6813 e1 = *loc;
6817 if (e1->mask == e->mask)
6822 last = e1;
6823 e1 = e1->next;
6825 while (e1 && strcmp (e1
6767 const struct bfd_elf_version_expr *e1 = p1; local
6807 struct bfd_elf_version_expr *e1, *last; local
6861 struct bfd_elf_version_expr *e1; local
[all...]
/freebsd-11-stable/usr.bin/sort/
H A Dcoll.c824 bool e1, e2, key1_read, key2_read; local
874 e1 = kv1->hint->v.nh.empty;
877 if (e1 && e2)
888 if (e1)
914 e1 = ((main1 + frac1) == 0);
917 if (e1 && e2)
926 if (e1)
/freebsd-11-stable/contrib/ntp/ntpd/
H A Dntpsim.c18 int determine_event_ordering(const Event *e1, const Event *e2);
42 const Event *e1,
46 return (e1->time - e2->time);
41 determine_event_ordering( const Event *e1, const Event *e2 ) argument
/freebsd-11-stable/contrib/libarchive/libarchive/test/
H A Dmain.c475 long long v1, const char *e1, long long v2, const char *e2, void *extra)
480 failure_start(file, line, "%s != %s", e1, e2);
481 logprintf(" %s=%lld (0x%llx, 0%llo)\n", e1, v1, v1, v1);
637 const char *v1, const char *e1,
646 failure_start(file, line, "%s != %s", e1, e2);
647 l1 = (int)strlen(e1);
651 strdump(e1, v1, l1, utf8);
699 const wchar_t *v1, const char *e1,
708 failure_start(file, line, "%s != %s", e1, e2);
709 wcsdump(e1, v
474 assertion_equal_int(const char *file, int line, long long v1, const char *e1, long long v2, const char *e2, void *extra) argument
636 assertion_equal_string(const char *file, int line, const char *v1, const char *e1, const char *v2, const char *e2, void *extra, int utf8) argument
698 assertion_equal_wstring(const char *file, int line, const wchar_t *v1, const char *e1, const wchar_t *v2, const char *e2, void *extra) argument
759 assertion_equal_mem(const char *file, int line, const void *_v1, const char *e1, const void *_v2, const char *e2, size_t l, const char *ld, void *extra) argument
[all...]

Completed in 280 milliseconds

12345