| /dragonfly/crypto/libressl/apps/openssl/ |
| H A D | openssl.c | 682 const FUNCTION *f2 = _f2; in SortFnByName() local
684 if (f1->type != f2->type) in SortFnByName()
685 return f1->type - f2->type; in SortFnByName()
686 return strcmp(f1->name, f2->name); in SortFnByName()
|
| /dragonfly/contrib/gcc-4.7/gcc/ |
| H A D | cfgcleanup.c | 1264 flow_find_cross_jump (basic_block bb1, basic_block bb2, rtx *f1, rtx *f2, in flow_find_cross_jump() argument
1385 *f2 = last2; in flow_find_cross_jump()
1400 rtx *f2, int stop_after) in flow_find_head_matching_sequence() argument
1489 *f2 = last2; in flow_find_head_matching_sequence()
1537 edge b1, f1, b2, f2; in outgoing_edges_match() local
1550 f2 = FALLTHRU_EDGE (bb2); in outgoing_edges_match()
1557 if (FORWARDER_BLOCK_P (f2->dest)) in outgoing_edges_match()
1558 f2 = single_succ_edge (f2->dest); in outgoing_edges_match()
1564 || FORWARDER_BLOCK_P (f2->dest) in outgoing_edges_match()
1569 if (f1->dest == f2->dest && b1->dest == b2->dest) in outgoing_edges_match()
[all …]
|
| H A D | tree-sra.c | 1332 const access_p f2 = *fp2; in compare_access_positions() local
1334 if (f1->offset != f2->offset) in compare_access_positions()
1335 return f1->offset < f2->offset ? -1 : 1; in compare_access_positions()
1337 if (f1->size == f2->size) in compare_access_positions()
1339 if (f1->type == f2->type) in compare_access_positions()
1343 && is_gimple_reg_type (f2->type)) in compare_access_positions()
1346 && !is_gimple_reg_type (f2->type)) in compare_access_positions()
1361 && INTEGRAL_TYPE_P (f2->type)) in compare_access_positions()
1368 else if (INTEGRAL_TYPE_P (f2->type) in compare_access_positions()
1370 != TYPE_PRECISION (f2->type))) in compare_access_positions()
[all …]
|
| /dragonfly/contrib/less/ |
| H A D | ubin.uni | 1 /* Generated by "./mkutable -f2 Cc Cs Co Zl Zp -- unicode/UnicodeData.txt" on Mon Nov 14 18:19:24 P…
|
| H A D | fmt.uni | 1 /* Generated by "./mkutable -f2 Cf -- unicode/UnicodeData.txt" on Mon Nov 14 18:19:23 PST 2022 */
|
| /dragonfly/usr.bin/sort/ |
| H A D | coll.c | 319 size_t f2, next_field_start, pos_end; in find_field_end() local
326 f2 = ks->f2; in find_field_end()
328 if (f2 == 0) in find_field_end()
332 next_field_start = skip_fields_to_start(s, f2 + 1, in find_field_end()
339 next_field_start = skip_fields_to_start(s, f2, in find_field_end()
|
| H A D | file.c | 871 file_header_cmp(struct file_header *f1, struct file_header *f2) in file_header_cmp() argument
874 if (f1 == f2) in file_header_cmp()
878 return ((f2->fr == NULL) ? 0 : +1); in file_header_cmp()
879 } else if (f2->fr == NULL) in file_header_cmp()
884 ret = list_coll(&(f1->si), &(f2->si)); in file_header_cmp()
886 return ((f1->file_pos < f2->file_pos) ? -1 : +1); in file_header_cmp()
|
| H A D | coll.h | 113 size_t f2; member
|
| /dragonfly/contrib/diffutils/src/ |
| H A D | dir.c | 184 char const *const *f2 = file2; in compare_names_for_qsort() local
186 char const *name2 = *f2; in compare_names_for_qsort()
|
| /dragonfly/contrib/gcc-8.0/gcc/ |
| H A D | cfgcleanup.c | 1338 rtx_insn **f2, enum replace_direction *dir_p) in flow_find_cross_jump() argument
1463 *f2 = last2; in flow_find_cross_jump()
1479 rtx_insn **f2, int stop_after) in flow_find_head_matching_sequence() argument
1568 *f2 = last2; in flow_find_head_matching_sequence()
1618 edge b1, f1, b2, f2; in outgoing_edges_match() local
1631 f2 = FALLTHRU_EDGE (bb2); in outgoing_edges_match()
1638 if (FORWARDER_BLOCK_P (f2->dest)) in outgoing_edges_match()
1639 f2 = single_succ_edge (f2->dest); in outgoing_edges_match()
1645 || FORWARDER_BLOCK_P (f2->dest) in outgoing_edges_match()
1650 if (f1->dest == f2->dest && b1->dest == b2->dest) in outgoing_edges_match()
[all …]
|
| H A D | gimple.c | 2250 gimple_compare_field_offset (tree f1, tree f2) in gimple_compare_field_offset() argument
2252 if (DECL_OFFSET_ALIGN (f1) == DECL_OFFSET_ALIGN (f2)) in gimple_compare_field_offset()
2255 tree offset2 = DECL_FIELD_OFFSET (f2); in gimple_compare_field_offset()
2264 && (DECL_SIZE (f1) == DECL_SIZE (f2) in gimple_compare_field_offset()
2266 && TREE_CODE (DECL_SIZE (f2)) == PLACEHOLDER_EXPR) in gimple_compare_field_offset()
2267 || operand_equal_p (DECL_SIZE (f1), DECL_SIZE (f2), 0)) in gimple_compare_field_offset()
2268 && DECL_ALIGN (f1) == DECL_ALIGN (f2)) in gimple_compare_field_offset()
2271 DECL_FIELD_BIT_OFFSET (f2))); in gimple_compare_field_offset()
2278 && tree_fits_shwi_p (DECL_FIELD_OFFSET (f2))) in gimple_compare_field_offset()
2285 bit_offset2 = TREE_INT_CST_LOW (DECL_FIELD_BIT_OFFSET (f2)); in gimple_compare_field_offset()
[all …]
|
| H A D | tree-sra.c | 1562 const access_p f2 = *fp2; in compare_access_positions() local
1564 if (f1->offset != f2->offset) in compare_access_positions()
1565 return f1->offset < f2->offset ? -1 : 1; in compare_access_positions()
1567 if (f1->size == f2->size) in compare_access_positions()
1569 if (f1->type == f2->type) in compare_access_positions()
1573 && is_gimple_reg_type (f2->type)) in compare_access_positions()
1576 && !is_gimple_reg_type (f2->type)) in compare_access_positions()
1593 && !INTEGRAL_TYPE_P (f2->type)) in compare_access_positions()
1596 && INTEGRAL_TYPE_P (f2->type)) in compare_access_positions()
1600 && INTEGRAL_TYPE_P (f2->type) in compare_access_positions()
[all …]
|
| /dragonfly/share/misc/ |
| H A D | latin1 | 27 | f0 � | f1 � | f2 � | f3 � | f4 � | f5 � | f6 � | f7 � |
|
| /dragonfly/contrib/binutils-2.34/gold/ |
| H A D | ehframe.h | 133 const typename Fde_addresses<size>::Fde_address& f2) const in operator()
134 { return f1.first < f2.first; } in operator()
|
| /dragonfly/contrib/binutils-2.27/gold/ |
| H A D | ehframe.h | 133 const typename Fde_addresses<size>::Fde_address& f2) const in operator()
134 { return f1.first < f2.first; } in operator()
|
| /dragonfly/contrib/gcc-4.7/gcc/lto/ |
| H A D | lto.c | 828 tree f1, f2; in uniquify_nodes() local
830 for (f1 = TYPE_FIELDS (t), f2 = TYPE_FIELDS (oldt); in uniquify_nodes()
831 f1 && f2; f1 = TREE_CHAIN (f1), f2 = TREE_CHAIN (f2)) in uniquify_nodes()
834 gcc_assert (f1 != f2 && DECL_NAME (f1) == DECL_NAME (f2)); in uniquify_nodes()
835 if (!streamer_tree_cache_lookup (cache, f2, &ix)) in uniquify_nodes()
850 lto_fixup_types (f2); in uniquify_nodes()
|
| /dragonfly/bin/dd/ |
| H A D | ref.ascii | 15 000000d0 7d 4a 4b 4c 4d 4e 4f 50 51 52 ee ef f0 f1 f2 f3 |}JKLMNOPQR......|
|
| H A D | ref.lcase | 17 000000f0 f0 f1 f2 f3 f4 f5 f6 f7 f8 f9 fa fb fc fd fe ff |................|
|
| H A D | ref.oldascii | 15 000000d0 7d 4a 4b 4c 4d 4e 4f 50 51 52 ee ef f0 f1 f2 f3 |}JKLMNOPQR......|
|
| H A D | ref.swab | 17 000000f0 f1 f0 f3 f2 f5 f4 f7 f6 f9 f8 fb fa fd fc ff fe |................|
|
| H A D | ref.ucase | 17 000000f0 f0 f1 f2 f3 f4 f5 f6 f7 f8 f9 fa fb fc fd fe ff |................|
|
| H A D | ref.ebcdic | 5 00000030 f0 f1 f2 f3 f4 f5 f6 f7 f8 f9 7a 5e 4c 7e 6e 6f |..........z^L~no|
|
| H A D | ref.ibm | 5 00000030 f0 f1 f2 f3 f4 f5 f6 f7 f8 f9 7a 5e 4c 7e 6e 6f |..........z^L~no|
|
| H A D | ref.oldebcdic | 5 00000030 f0 f1 f2 f3 f4 f5 f6 f7 f8 f9 7a 5e 4c 7e 6e 6f |..........z^L~no|
|
| H A D | ref.oldibm | 5 00000030 f0 f1 f2 f3 f4 f5 f6 f7 f8 f9 7a 5e 4c 7e 6e 6f |..........z^L~no|
|