Searched refs:c1 (Results 176 - 200 of 256) sorted by relevance

1234567891011

/freebsd-11-stable/usr.bin/dtc/
H A Dfdt.cc993 node::cmp_children(node_ptr &c1, node_ptr &c2) argument
995 if (c1->name == c2->name)
997 return c1->unit_address < c2->unit_address;
999 return c1->name < c2->name;
H A Dfdt.hh555 static inline bool cmp_children(node_ptr &c1, node_ptr &c2);
/freebsd-11-stable/contrib/groff/src/devices/xditview/
H A Ddraw.c308 #define pack2(c1, c2) (((c1) << 8) | (c2))
/freebsd-11-stable/crypto/openssl/crypto/bn/asm/
H A Dmips.pl1066 $MULTU $a_0,$b_0 # mul_add_c(a[0],b[0],c1,c2,c3);
1076 $MULTU $a_0,$b_1 # mul_add_c(a[0],b[1],c2,c3,c1);
1085 $MULTU $a_1,$b_0 # mul_add_c(a[1],b[0],c2,c3,c1);
1089 $ST $c_1,0($a0) # r[0]=c1;
1094 $MULTU $a_2,$b_0 # mul_add_c(a[2],b[0],c3,c1,c2);
1104 $MULTU $a_1,$b_1 # mul_add_c(a[1],b[1],c3,c1,c2);
1111 $MULTU $a_0,$b_2 # mul_add_c(a[0],b[2],c3,c1,c2);
1119 $MULTU $a_0,$b_3 # mul_add_c(a[0],b[3],c1,c2,c3);
1130 $MULTU $a_1,$b_2 # mul_add_c(a[1],b[2],c1,c2,c3);
1138 $MULTU $a_2,$b_1 # mul_add_c(a[2],b[1],c1,c
[all...]
/freebsd-11-stable/contrib/ntp/ntpd/
H A Drefclock_palisade.c152 int c1,
157 *(buffer->data + 1) = (unsigned char)c1;
150 sendsupercmd( struct packettx *buffer, int c1, int c2 ) argument
/freebsd-11-stable/contrib/bmake/
H A Dvar.c2381 unsigned int h, k, c1, c2; local
2384 c1 = 0x95543787U;
2404 c1 = c1 * 5 + 0x7b7d159cU;
2406 k *= c1;
/freebsd-11-stable/sys/dev/mmc/
H A Dmmc.c1133 uint8_t c1; local
1152 c1 = (ivar->cid.oid >> 8) & 0x0ff;
1154 if (c1 > 0x1f && c1 < 0x7f && c2 > 0x1f && c2 < 0x7f)
1155 snprintf(oidstr, sizeof(oidstr), "%c%c", c1, c2);
/freebsd-11-stable/contrib/gcc/
H A Dvarasm.c2546 const struct constant_descriptor_tree *c1 = p1;
2548 if (c1->hash != c2->hash)
2550 return compare_constant (c1->value, c2->value);
2632 constructor_elt *c1 = VEC_index (constructor_elt, v1, idx);
2636 if (!compare_constant (c1->value, c2->value))
2641 if (!compare_constant (c1->index, c2->index))
2646 if (c1->index != c2->index)
2533 const struct constant_descriptor_tree *c1 = p1; local
2619 constructor_elt *c1 = VEC_index (constructor_elt, v1, idx); local
H A Dexpr.c6351 unsigned HOST_WIDE_INT c0, c1;
6376 c1 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6377 return MIN (c0, c1);
6381 c1 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6382 return c0 * c1;
6390 c1 = tree_low_cst (TREE_OPERAND (exp, 1), 1);
6391 return MAX (1, c0 / c1);
6404 c1 = highest_pow2_factor (TREE_OPERAND (exp, 2));
6405 return MIN (c0, c1);
6333 unsigned HOST_WIDE_INT c0, c1; local
/freebsd-11-stable/contrib/nvi/regex/
H A Dregcomp.c114 static int samesets(struct re_guts *g, int c1, int c2);
1296 samesets(struct re_guts *g, int c1, int c2) argument
1301 unsigned uc1 = (unsigned char)c1;
/freebsd-11-stable/contrib/libucl/src/
H A Ducl_parser.c287 ucl_lex_is_comment (const unsigned char c1, const unsigned char c2) argument
289 if (c1 == '/') {
294 else if (c1 == '#') {
/freebsd-11-stable/contrib/flex/
H A Dflexdef.h1165 /* return false if [c1-c2] is ambiguous for a caseless scanner. */
1166 bool range_covers_case (int c1, int c2);
/freebsd-11-stable/contrib/binutils/
H A Dconfig.sub450 convex-c1)
451 basic_machine=c1-convex
/freebsd-11-stable/contrib/libreadline/support/
H A Dconfig.sub406 convex-c1)
407 basic_machine=c1-convex
/freebsd-11-stable/contrib/ipfilter/
H A DMakefile170 make freebsd`uname -r|cut -c1`
/freebsd-11-stable/crypto/heimdal/
H A Dconfig.sub491 convex-c1)
492 basic_machine=c1-convex
/freebsd-11-stable/contrib/one-true-awk/
H A Dlib.c550 void bcheck2(int n, int c1, int c2) argument
/freebsd-11-stable/contrib/openbsm/config/
H A Dconfig.sub414 convex-c1)
415 basic_machine=c1-convex
/freebsd-11-stable/bin/sh/
H A Dexpand.c142 collate_range_cmp(wchar_t c1, wchar_t c2) argument
146 s1[0] = c1;
/freebsd-11-stable/contrib/unbound/validator/
H A Dval_nsec3.c496 nsec3_hash_cmp(const void* c1, const void* c2) argument
498 struct nsec3_cached_hash* h1 = (struct nsec3_cached_hash*)c1;
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Support/
H A Dregcomp.c1406 samesets(struct re_guts *g, int c1, int c2) argument
1411 unsigned uc1 = (uch)c1;
/freebsd-11-stable/contrib/llvm-project/lldb/source/Host/common/
H A DEditline.cpp937 std::max_element(results.begin(), results.end(), [](auto &c1, auto &c2) {
938 return c1.GetCompletion().size() < c2.GetCompletion().size();
/freebsd-11-stable/contrib/groff/src/roff/troff/
H A Dnode.cpp201 charinfo *get_lig(charinfo *c1, charinfo *c2);
202 int get_kern(charinfo *c1, charinfo *c2, hunits *res);
611 charinfo *tfont::get_lig(charinfo *c1, charinfo *c2) argument
616 if (c1->get_ascii_code() == 'f') {
632 else if (ligature_mode != 2 && c1->nm == SYMBOL_ff) {
649 inline int tfont::get_kern(charinfo *c1, charinfo *c2, hunits *res) argument
654 int n = fm->get_kern(c1->get_index(),
H A Dinput.cpp3647 int c1 = iter1.get(&nd1); local
3648 assert(c1 != EOF);
3652 if (c1 != c2) {
3653 if (c1 == 0)
3659 if (c1 == 0) {
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DDAGCombiner.cpp610 /// of folding (mul (add x, c1), c2) -> (add (mul x, c2), c1*c2).
611 /// MulNode is the original multiply, AddNode is (add x, c1),
967 // Reassociate: (op (op x, c1), c2) -> (op x, (op c1, c2))
973 // Reassociate: (op (op x, c1), y) -> (op (op x, y), c1)
974 // iff (op x, c1) has one use
2118 // fold (add c1, c2) -> c1
7641 uint64_t c1 = N0C1->getZExtValue(); local
7958 uint64_t c1 = N001C->getZExtValue(); local
[all...]

Completed in 545 milliseconds

1234567891011