/dragonfly/contrib/diffutils/src/ |
H A D | dir.c | 146 compare_collated (char const *name1, char const *name2) in compare_collated() argument 151 r = strcasecoll (name1, name2); in compare_collated() 153 r = strcoll (name1, name2); in compare_collated() 157 name1, name2); in compare_collated() 166 compare_names (char const *name1, char const *name2) in compare_names() argument 170 int diff = compare_collated (name1, name2); in compare_names() 174 return file_name_cmp (name1, name2); in compare_names() 186 char const *name2 = *f2; in compare_names_for_qsort() local 189 int diff = compare_collated (name1, name2); in compare_names_for_qsort() 193 return file_name_cmp (name1, name2); in compare_names_for_qsort()
|
/dragonfly/usr.bin/m4/ |
H A D | look.c | 230 char *name2; in setup_builtin() local 233 name2 = xalloc(strlen(name) + 3 + 1, NULL); in setup_builtin() 234 memcpy(name2, "m4_", 3); in setup_builtin() 235 memcpy(name2 + 3, name, strlen(name) + 1); in setup_builtin() 237 name2 = xstrdup(name); in setup_builtin() 239 n = create_entry(name2); in setup_builtin() 242 n->d->defn = name2; in setup_builtin()
|
/dragonfly/contrib/gcc-4.7/gcc/ |
H A D | tree-ssa-ifcombine.c | 308 tree name1, name2, bit1, bit2; in ifcombine_ifandif() local 325 && recognize_single_bit_test (outer_cond, &name2, &bit2) in ifcombine_ifandif() 326 && name1 == name2) in ifcombine_ifandif() 412 tree name1, name2, bits1, bits2; in ifcombine_iforif() local 428 && recognize_bits_test (outer_cond, &name2, &bits2)) in ifcombine_iforif() 434 if (name1 == name2) in ifcombine_iforif() 438 t = name2; in ifcombine_iforif() 439 name2 = bits2; in ifcombine_iforif() 447 t = name2; in ifcombine_iforif() 448 name2 = bits2; in ifcombine_iforif() [all …]
|
H A D | tree-predcom.c | 2075 find_common_use_stmt (tree *name1, tree *name2) in find_common_use_stmt() argument 2083 stmt2 = find_use_stmt (name2); in find_common_use_stmt() 2111 tree name1, name2; in combinable_refs_p() local 2115 name2 = name_for_ref (r2); in combinable_refs_p() 2118 stmt = find_common_use_stmt (&name1, &name2); in combinable_refs_p() 2174 reassociate_to_the_same_stmt (tree name1, tree name2) in reassociate_to_the_same_stmt() argument 2185 stmt2 = find_use_stmt (&name2); in reassociate_to_the_same_stmt() 2197 r2 = name2; in reassociate_to_the_same_stmt() 2224 remove_name_from_operation (stmt2, name2); in reassociate_to_the_same_stmt() 2266 tree name2 = name_for_ref (r2); in stmt_combining_refs() local [all …]
|
/dragonfly/tools/tools/netrate/netperf/tcp_stream/ |
H A D | tcp_stream.c | 58 const char *msgsz, *sockbuf, *name1, *name2; in main() local 287 name2 = ""; in main() 291 name2 = "/TCP_SENDFILE"; in main() 293 name2 = "/TCP_STREAM"; in main() 300 printf("%s%s %.2f Mbps\n", name1, name2, result); in main()
|
/dragonfly/bin/cpdup/ |
H A D | hcproto.c | 1506 return(link(name1, name2)); in hc_link() 1523 const char *name2 = NULL; in rc_link() local 1531 name2 = HCC_STRING(item); in rc_link() 1541 return(link(name1, name2)); in rc_link() 1752 return(symlink(name1, name2)); in hc_symlink() 1769 const char *name2 = NULL; in rc_symlink() local 1777 name2 = HCC_STRING(item); in rc_symlink() 1802 return(rename(name1, name2)); in hc_rename() 1819 const char *name2 = NULL; in rc_rename() local 1827 name2 = HCC_STRING(item); in rc_rename() [all …]
|
H A D | hcproto.h | 113 int hc_link(struct HostConf *hc, const char *name1, const char *name2); 118 int hc_symlink(struct HostConf *hc, const char *name1, const char *name2); 119 int hc_rename(struct HostConf *hc, const char *name1, const char *name2);
|
/dragonfly/contrib/cryptsetup/lib/ |
H A D | utils_debug.c | 88 char name[MAX_PATHNAME], name2[MAX_PATHNAME]; in report_proc() local 92 read_proc_info(ppid, &ppid2, name2, MAX_PATHNAME)) in report_proc() 94 pid, name, ppid, name2, dev_name); in report_proc()
|
/dragonfly/contrib/gcc-8.0/gcc/ |
H A D | tree-ssa-ifcombine.c | 386 tree name1, name2, bit1, bit2, bits1, bits2; in ifcombine_ifandif() local 405 && recognize_single_bit_test (outer_cond, &name2, &bit2, outer_inv) in ifcombine_ifandif() 406 && name1 == name2) in ifcombine_ifandif() 455 && recognize_bits_test (outer_cond, &name2, &bits2, !outer_inv)) in ifcombine_ifandif() 461 if (name1 == name2) in ifcombine_ifandif() 465 std::swap (name2, bits2); in ifcombine_ifandif() 469 std::swap (name2, bits2); in ifcombine_ifandif() 470 else if (bits1 == name2) in ifcombine_ifandif()
|
H A D | tree-vrp.c | 3239 name2 = gimple_assign_rhs1 (def_stmt); in register_edge_assert_for_2() 3241 if (TREE_CODE (name2) == SSA_NAME in register_edge_assert_for_2() 3283 if (name2 != NULL_TREE in register_edge_assert_for_2() 3291 tmp = name2; in register_edge_assert_for_2() 3332 if (TREE_CODE (name2) != SSA_NAME) in register_edge_assert_for_2() 3360 add_assert_info (asserts, name2, name2, comp_code, cst); in register_edge_assert_for_2() 3419 tmp = build2 (PLUS_EXPR, TREE_TYPE (name2), name2, cst); in register_edge_assert_for_2() 3450 if (TREE_CODE (name2) == SSA_NAME in register_edge_assert_for_2() 3469 tmp = name2; in register_edge_assert_for_2() 3543 if (TREE_CODE (name2) == SSA_NAME in register_edge_assert_for_2() [all …]
|
H A D | tree-predcom.c | 2509 find_common_use_stmt (tree *name1, tree *name2) in find_common_use_stmt() argument 2517 stmt2 = find_use_stmt (name2); in find_common_use_stmt() 2545 tree name1, name2; in combinable_refs_p() local 2549 name2 = name_for_ref (r2); in combinable_refs_p() 2552 stmt = find_common_use_stmt (&name1, &name2); in combinable_refs_p() 2608 reassociate_to_the_same_stmt (tree name1, tree name2) in reassociate_to_the_same_stmt() argument 2619 stmt2 = find_use_stmt (&name2); in reassociate_to_the_same_stmt() 2631 r2 = name2; in reassociate_to_the_same_stmt() 2658 remove_name_from_operation (stmt2, name2); in reassociate_to_the_same_stmt() 2697 tree name2 = name_for_ref (r2); in stmt_combining_refs() local [all …]
|
H A D | symtab.c | 103 symbol_table::assembler_names_equal_p (const char *name1, const char *name2) in assembler_names_equal_p() argument 105 if (name1 != name2) in assembler_names_equal_p() 120 if (name2[0] == '*') in assembler_names_equal_p() 124 name2 ++; in assembler_names_equal_p() 128 else if (strncmp (name2, user_label_prefix, ulp_len) == 0) in assembler_names_equal_p() 129 name2 += ulp_len; in assembler_names_equal_p() 133 return !strcmp (name1, name2); in assembler_names_equal_p() 1187 const char *name2 in verify_base() local 1190 if (!symbol_table::assembler_names_equal_p (name1, name2)) in verify_base()
|
/dragonfly/sbin/sysctl/ |
H A D | sysctl.c | 981 int name1[22], name2[22]; in sysctl_all() local 996 l2 = sizeof(name2); in sysctl_all() 997 retval = sysctl(name1, l1, name2, &l2, 0, 0); in sysctl_all() 1011 if (name2[i] != oid[i]) in sysctl_all() 1014 retval = show_var(name2, l2); in sysctl_all() 1018 memcpy(name1+2, name2, l2 * sizeof(int)); in sysctl_all()
|
/dragonfly/contrib/gdb-7/gdb/ |
H A D | go-exp.y | 1549 token_and_value name2; in yylex() local 1551 name2.token = lex_one_token (); in yylex() 1552 name2.value = yylval; in yylex() 1554 if (name2.token == NAME) in yylex() 1564 return classify_unsafe_function (name2.value.sval); in yylex() 1572 name2.value.sval.ptr, in yylex() 1573 name2.value.sval.length); in yylex() 1579 VEC_safe_push (token_and_value, token_fifo, &name2); in yylex()
|
H A D | minsyms.c | 994 const char *name2 = SYMBOL_LINKAGE_NAME (fn2); in compare_minimal_symbols() local 996 if (name1 && name2) /* both have names */ in compare_minimal_symbols() 997 return strcmp (name1, name2); in compare_minimal_symbols() 998 else if (name2) in compare_minimal_symbols()
|
H A D | go-exp.c | 3357 token_and_value name2; in yylex() local 3359 name2.token = lex_one_token (); in yylex() 3360 name2.value = yylval; in yylex() 3362 if (name2.token == NAME) in yylex() 3372 return classify_unsafe_function (name2.value.sval); in yylex() 3380 name2.value.sval.ptr, in yylex() 3381 name2.value.sval.length); in yylex() 3387 VEC_safe_push (token_and_value, token_fifo, &name2); in yylex()
|
/dragonfly/games/number/ |
H A D | number.c | 52 *name2[] = { variable 236 printf("%s", name2[val / 10]); in number()
|
/dragonfly/contrib/ncurses/ncurses/trace/ |
H A D | lib_tracebits.c | 108 #define DATA2(name,name2) { name, { #name2 } } in _nc_trace_ttymode() argument
|
/dragonfly/contrib/gcc-8.0/libgcc/ |
H A D | gthr-posix.h | 89 # define __gthrw2(name,name2,type) \ argument 90 static __typeof(type) name __attribute__ ((__weakref__(#name2))); \ 94 # define __gthrw2(name,name2,type) argument
|
/dragonfly/contrib/gcc-4.7/libgcc/ |
H A D | gthr-posix.h | 95 # define __gthrw2(name,name2,type) \ argument 96 static __typeof(type) name __attribute__ ((__weakref__(#name2))); \ 100 # define __gthrw2(name,name2,type) argument
|
/dragonfly/sys/vfs/hammer2/ |
H A D | hammer2_admin.c | 373 xop->name2 = kmalloc(name_len + 1, M_HAMMER2, M_WAITOK | M_ZERO); in hammer2_xop_setname2() 375 bcopy(name, xop->name2, name_len); in hammer2_xop_setname2() 751 if (xop->name2) { in hammer2_xop_retire() 752 kfree(xop->name2, M_HAMMER2); in hammer2_xop_retire() 753 xop->name2 = NULL; in hammer2_xop_retire()
|
/dragonfly/usr.sbin/makefs/hammer2/ |
H A D | hammer2_admin.c | 420 xop->name2 = kmalloc(name_len + 1, M_HAMMER2, M_WAITOK | M_ZERO); in hammer2_xop_setname2() 422 bcopy(name, xop->name2, name_len); in hammer2_xop_setname2() 808 if (xop->name2) { in hammer2_xop_retire() 809 kfree(xop->name2, M_HAMMER2); in hammer2_xop_retire() 810 xop->name2 = NULL; in hammer2_xop_retire()
|
/dragonfly/sys/netgraph/ |
H A D | netgraph.h | 329 const char *name, node_p node2, const char *name2); 337 int ng_mkpeer(node_p node, const char *name, const char *name2, char *type);
|
/dragonfly/stand/lib/ |
H A D | dosfs.h | 85 u_char name2[6][2]; /* 2nd name area */ member
|
/dragonfly/usr.sbin/lpr/lpd/ |
H A D | printjob.c | 1306 banner(struct printer *pp, char *name1, char *name2) in banner() argument 1320 write(ofd, name2, strlen(name2)); in banner() 1328 scan_out(pp, ofd, name2, '\0'); in banner() 1334 write(ofd, name2, strlen(name2)); in banner()
|