Searched refs:dst (Results 301 - 325 of 837) sorted by relevance

<<11121314151617181920>>

/haiku-buildtools/binutils/bfd/
H A Dcoff-i860.c446 #define RTYPE2HOWTO(cache_ptr, dst) \
448 ((dst)->r_type < sizeof (howto_table) / sizeof (howto_table[0]) \
449 ? howto_table + (dst)->r_type \
584 i860_reloc_processing (arelent *cache_ptr, struct internal_reloc *dst, argument
587 if (dst->r_type == COFF860_R_PAIR)
590 cache_ptr->howto = howto_table + dst->r_type;
591 cache_ptr->address = dst->r_vaddr;
592 cache_ptr->addend = dst->r_symndx;
600 cache_ptr->address = dst->r_vaddr;
602 if (dst
[all...]
/haiku-buildtools/binutils/include/opcode/
H A Dtic6x-insn-formats.h72 FLD(dst, 23, 5)))
75 FLD(src2, 18, 5), FLD(dst, 23, 5)))
84 FLD(baseR, 18, 5), FLD(sc, 23, 1), FLD(dst, 24, 4)))
90 FLD(dst, 23, 5)))
93 FLD(dst, 23, 5)))
268 SFLDS2(FLD(dst, 7, 3),
289 FLD(src2, 18, 5), FLD(dst, 23, 5)))
292 FLD(src2, 18, 5), FLD(dst, 23, 5)))
295 FLD(dst, 23, 5)))
301 SFLDS5(FLD(dst,
[all...]
/haiku-buildtools/isl/
H A Disl_schedule.c101 * dst is the sink node
113 struct isl_sched_node *dst; member in struct:isl_sched_edge
254 return edge->src == temp->src && edge->dst == temp->dst;
267 hash = isl_hash_builtin(hash, edge->dst);
301 struct isl_sched_node *src, struct isl_sched_node *dst)
305 struct isl_sched_edge temp = { .src = src, .dst = dst };
309 hash = isl_hash_builtin(hash, temp.dst);
321 struct isl_sched_node *src, struct isl_sched_node *dst)
298 graph_find_edge_entry( struct isl_sched_graph *graph, enum isl_edge_type type, struct isl_sched_node *src, struct isl_sched_node *dst) argument
319 graph_find_edge(struct isl_sched_graph *graph, enum isl_edge_type type, struct isl_sched_node *src, struct isl_sched_node *dst) argument
335 graph_has_edge(struct isl_sched_graph *graph, enum isl_edge_type type, struct isl_sched_node *src, struct isl_sched_node *dst) argument
357 graph_find_any_edge(struct isl_sched_graph *graph, struct isl_sched_node *src, struct isl_sched_node *dst) argument
395 graph_has_any_edge(struct isl_sched_graph *graph, struct isl_sched_node *src, struct isl_sched_node *dst) argument
413 graph_has_validity_edge(struct isl_sched_graph *graph, struct isl_sched_node *src, struct isl_sched_node *dst) argument
568 struct isl_sched_node *src, *dst; local
853 struct isl_sched_node *dst = edge->dst; local
1026 struct isl_sched_node *dst = edge->dst; local
1659 specialize(__isl_take isl_map *map, struct isl_sched_node *src, struct isl_sched_node *dst) argument
1820 copy_nodes(struct isl_sched_graph *dst, struct isl_sched_graph *src, int (*node_pred)(struct isl_sched_node *node, int data), int data) argument
1850 copy_edges(isl_ctx *ctx, struct isl_sched_graph *dst, struct isl_sched_graph *src, int (*edge_pred)(struct isl_sched_edge *edge, int data), int data) argument
1904 copy_schedule(struct isl_sched_graph *dst, struct isl_sched_graph *src, int (*node_pred)(struct isl_sched_node *node, int data), int data) argument
2250 struct isl_sched_node *dst = edge->dst; local
[all...]
H A Disl_dim_map.h24 __isl_take isl_basic_set *dst, __isl_take isl_basic_set *src,
27 __isl_take isl_basic_map *dst, __isl_take isl_basic_map *src,
/haiku-buildtools/legacy/binutils/bfd/
H A Delf64-mips.c1643 Elf64_Mips_Internal_Rela *dst)
1645 dst->r_offset = H_GET_64 (abfd, src->r_offset);
1646 dst->r_sym = H_GET_32 (abfd, src->r_sym);
1647 dst->r_ssym = H_GET_8 (abfd, src->r_ssym);
1648 dst->r_type3 = H_GET_8 (abfd, src->r_type3);
1649 dst->r_type2 = H_GET_8 (abfd, src->r_type2);
1650 dst->r_type = H_GET_8 (abfd, src->r_type);
1651 dst->r_addend = 0;
1658 Elf64_Mips_Internal_Rela *dst)
1660 dst
1639 mips_elf64_swap_reloc_in(bfd *abfd, const Elf64_Mips_External_Rel *src, Elf64_Mips_Internal_Rela *dst) argument
1654 mips_elf64_swap_reloca_in(bfd *abfd, const Elf64_Mips_External_Rela *src, Elf64_Mips_Internal_Rela *dst) argument
1669 mips_elf64_swap_reloc_out(bfd *abfd, const Elf64_Mips_Internal_Rela *src, Elf64_Mips_External_Rel *dst) argument
1683 mips_elf64_swap_reloca_out(bfd *abfd, const Elf64_Mips_Internal_Rela *src, Elf64_Mips_External_Rela *dst) argument
1698 mips_elf64_be_swap_reloc_in(bfd *abfd, const bfd_byte *src, Elf_Internal_Rela *dst) argument
1721 mips_elf64_be_swap_reloca_in(bfd *abfd, const bfd_byte *src, Elf_Internal_Rela *dst) argument
1744 mips_elf64_be_swap_reloc_out(bfd *abfd, const Elf_Internal_Rela *src, bfd_byte *dst) argument
1765 mips_elf64_be_swap_reloca_out(bfd *abfd, const Elf_Internal_Rela *src, bfd_byte *dst) argument
[all...]
H A Dcoff-we32k.c62 #define RTYPE2HOWTO(cache_ptr, dst) \
63 (cache_ptr)->howto = howto_table + (dst)->r_type;
/haiku-buildtools/binutils/gas/testsuite/gas/ppc/
H A Daltivec_xcoff.d12 8: 7c 25 22 ac dst r5,r4,1
H A Daltivec_xcoff64.d12 8: 7c 25 22 ac dst r5,r4,1
/haiku-buildtools/legacy/binutils/gas/testsuite/gas/ppc/
H A Daltivec.d12 8: 7c 25 22 ac dst r5,r4,1
H A Daltivec_xcoff.d12 8: 7c 25 22 ac dst r5,r4,1
H A Daltivec_xcoff64.d12 8: 7c 25 22 ac dst r5,r4,1
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/graphite/
H A Dpr42930.C10 Out copy(In first, In last, Out dst) { argument
12 *dst++ = *first++;
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.mike/
H A Dp11667.C22 T* dst = newlist; local
26 while (i--) *dst++ = *src++;
/haiku-buildtools/gcc/mpfr/tests/
H A Dtfrac.c35 mpfr_t sum, tmp, dst, fp2; local
40 mpfr_init2 (dst, prec);
59 inex1 = mpfr_frac (dst, sum, rnd);
68 if (!mpfr_number_p (dst) ||
69 MPFR_SIGN (dst) != MPFR_SIGN (fp2) ||
70 mpfr_cmp (dst, fp2))
76 mpfr_out_str (stdout, 2, 0, dst, MPFR_RNDN);
109 mpfr_clear (dst);
/haiku-buildtools/gcc/libstdc++-v3/libsupc++/
H A Dclass_type_info.cc97 __do_upcast (const __class_type_info *dst, const void *obj, argument
100 if (*this == *dst)
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/i386/
H A Davx512bw-vpermi2w-2.c17 CALC (short *dst, short *src1, short *ind, short *src2) argument
26 dst[i] = cond ? src2[offset] : src1[offset];
H A Davx512bw-vpmaxsb-2.c13 CALC (char *src1, char *src2, char *dst) argument
18 dst[i] = src1[i] > src2[i] ? src1[i] : src2[i];
H A Davx512bw-vpmaxsw-2.c13 CALC (short *src1, short *src2, short *dst) argument
18 dst[i] = src1[i] > src2[i] ? src1[i] : src2[i];
H A Davx512bw-vpmaxub-2.c14 unsigned char *dst)
19 dst[i] = src1[i] > src2[i] ? src1[i] : src2[i];
13 CALC(unsigned char *src1, unsigned char *src2, unsigned char *dst) argument
H A Davx512bw-vpmaxuw-2.c14 unsigned short *dst)
19 dst[i] = src1[i] > src2[i] ? src1[i] : src2[i];
13 CALC(unsigned short *src1, unsigned short *src2, unsigned short *dst) argument
H A Davx512bw-vpminsb-2.c13 CALC (char *src1, char *src2, char *dst) argument
18 dst[i] = src1[i] < src2[i] ? src1[i] : src2[i];
H A Davx512bw-vpminsw-2.c13 CALC (short *src1, short *src2, short *dst) argument
18 dst[i] = src1[i] < src2[i] ? src1[i] : src2[i];
H A Davx512bw-vpminub-2.c14 unsigned char *dst)
19 dst[i] = src1[i] < src2[i] ? src1[i] : src2[i];
13 CALC(unsigned char *src1, unsigned char *src2, unsigned char *dst) argument
H A Davx512bw-vpminuw-2.c14 unsigned short *dst)
19 dst[i] = src1[i] < src2[i] ? src1[i] : src2[i];
13 CALC(unsigned short *src1, unsigned short *src2, unsigned short *dst) argument
H A Davx512bw-vpmulhrsw-2.c12 CALC (short *src1, short *src2, short *dst) argument
19 dst[i] = (short) (t0 >> 1);

Completed in 97 milliseconds

<<11121314151617181920>>