Home
last modified time | relevance | path

Searched refs:cyc (Results 1 – 25 of 63) sorted by relevance

123

/netbsd/external/gpl3/binutils/dist/gprof/
H A Dcg_arcs.c186 if (parent->cg.cyc.num == child->cg.cyc.num) in propagate_time()
252 for (cyc = &cycle_header[1]; cyc <= &cycle_header[num_cycles]; ++cyc) in cycle_time()
254 for (member = cyc->cg.cyc.next; member; member = member->cg.cyc.next) in cycle_time()
266 cyc->cg.prop.self = cyc->cg.prop.fract * cyc->hist.time; in cycle_time()
284 if (sym->cg.cyc.head == sym && sym->cg.cyc.next) in cycle_link()
304 if (!(sym->cg.cyc.head == sym && sym->cg.cyc.next != 0)) in cycle_link()
309 ++cyc; in cycle_link()
313 cyc->cg.cyc.num = num; /* internal number of cycle on */ in cycle_link()
314 cyc->cg.cyc.head = cyc; /* pointer to head of cycle */ in cycle_link()
315 cyc->cg.cyc.next = sym; /* pointer to next member of cycle */ in cycle_link()
[all …]
H A Dcg_dfn.c104 if (child->cg.cyc.head != child && child->cg.cyc.head == head) in find_cycle()
152 for (tail = head; tail->cg.cyc.next; tail = tail->cg.cyc.next) in find_cycle()
165 if (head->cg.cyc.head != head) in find_cycle()
167 head = head->cg.cyc.head; in find_cycle()
175 if (child->cg.cyc.head == child) in find_cycle()
181 tail->cg.cyc.next = child; in find_cycle()
182 child->cg.cyc.head = head; in find_cycle()
188 for (tail = child; tail->cg.cyc.next; tail = tail->cg.cyc.next) in find_cycle()
190 tail->cg.cyc.next->cg.cyc.head = head; in find_cycle()
192 print_name (tail->cg.cyc.next); in find_cycle()
[all …]
H A Dcg_print.c125 cyc->cg.prop.self / hz, cyc->cg.prop.child / hz, cyc->ncalls); in print_cycle()
132 printf (_(" <cycle %d as a whole> [%d]\n"), cyc->cg.cyc.num, cyc->cg.index); in print_cycle()
170 todo = cyc->cg.cyc.next; in sort_members()
171 cyc->cg.cyc.next = 0; in sort_members()
177 for (prev = cyc; prev->cg.cyc.next; prev = prev->cg.cyc.next) in sort_members()
183 doing->cg.cyc.next = prev->cg.cyc.next; in sort_members()
197 for (member = cyc->cg.cyc.next; member; member = member->cg.cyc.next) in print_members()
260 && right_parent->cg.cyc.num == right_child->cg.cyc.num) in cmp_arc()
281 && right_parent->cg.cyc.num == right_child->cg.cyc.num) in cmp_arc()
370 && parent->cg.cyc.num == child->cg.cyc.num)) in print_parents()
[all …]
H A Dutils.c103 if (self->cg.cyc.num != 0) in print_name()
105 printf (_(" <cycle %d>"), self->cg.cyc.num); in print_name()
H A Dsymtab.h95 cyc; member
/netbsd/external/gpl3/binutils.old/dist/gprof/
H A Dcg_arcs.c186 if (parent->cg.cyc.num == child->cg.cyc.num) in propagate_time()
252 for (cyc = &cycle_header[1]; cyc <= &cycle_header[num_cycles]; ++cyc) in cycle_time()
254 for (member = cyc->cg.cyc.next; member; member = member->cg.cyc.next) in cycle_time()
266 cyc->cg.prop.self = cyc->cg.prop.fract * cyc->hist.time; in cycle_time()
284 if (sym->cg.cyc.head == sym && sym->cg.cyc.next) in cycle_link()
304 if (!(sym->cg.cyc.head == sym && sym->cg.cyc.next != 0)) in cycle_link()
309 ++cyc; in cycle_link()
313 cyc->cg.cyc.num = num; /* internal number of cycle on */ in cycle_link()
314 cyc->cg.cyc.head = cyc; /* pointer to head of cycle */ in cycle_link()
315 cyc->cg.cyc.next = sym; /* pointer to next member of cycle */ in cycle_link()
[all …]
H A Dcg_dfn.c104 if (child->cg.cyc.head != child && child->cg.cyc.head == head) in find_cycle()
152 for (tail = head; tail->cg.cyc.next; tail = tail->cg.cyc.next) in find_cycle()
165 if (head->cg.cyc.head != head) in find_cycle()
167 head = head->cg.cyc.head; in find_cycle()
175 if (child->cg.cyc.head == child) in find_cycle()
181 tail->cg.cyc.next = child; in find_cycle()
182 child->cg.cyc.head = head; in find_cycle()
188 for (tail = child; tail->cg.cyc.next; tail = tail->cg.cyc.next) in find_cycle()
190 tail->cg.cyc.next->cg.cyc.head = head; in find_cycle()
192 print_name (tail->cg.cyc.next); in find_cycle()
[all …]
H A Dcg_print.c125 cyc->cg.prop.self / hz, cyc->cg.prop.child / hz, cyc->ncalls); in print_cycle()
132 printf (_(" <cycle %d as a whole> [%d]\n"), cyc->cg.cyc.num, cyc->cg.index); in print_cycle()
170 todo = cyc->cg.cyc.next; in sort_members()
171 cyc->cg.cyc.next = 0; in sort_members()
177 for (prev = cyc; prev->cg.cyc.next; prev = prev->cg.cyc.next) in sort_members()
183 doing->cg.cyc.next = prev->cg.cyc.next; in sort_members()
197 for (member = cyc->cg.cyc.next; member; member = member->cg.cyc.next) in print_members()
260 && right_parent->cg.cyc.num == right_child->cg.cyc.num) in cmp_arc()
281 && right_parent->cg.cyc.num == right_child->cg.cyc.num) in cmp_arc()
370 && parent->cg.cyc.num == child->cg.cyc.num)) in print_parents()
[all …]
H A Dutils.c104 if (self->cg.cyc.num != 0) in print_name()
106 printf (_(" <cycle %d>"), self->cg.cyc.num); in print_name()
H A Dsymtab.h95 cyc; member
/netbsd/external/gpl3/gdb/dist/gprof/
H A Dcg_arcs.c186 if (parent->cg.cyc.num == child->cg.cyc.num) in propagate_time()
252 for (cyc = &cycle_header[1]; cyc <= &cycle_header[num_cycles]; ++cyc) in cycle_time()
254 for (member = cyc->cg.cyc.next; member; member = member->cg.cyc.next) in cycle_time()
266 cyc->cg.prop.self = cyc->cg.prop.fract * cyc->hist.time; in cycle_time()
284 if (sym->cg.cyc.head == sym && sym->cg.cyc.next) in cycle_link()
304 if (!(sym->cg.cyc.head == sym && sym->cg.cyc.next != 0)) in cycle_link()
309 ++cyc; in cycle_link()
313 cyc->cg.cyc.num = num; /* internal number of cycle on */ in cycle_link()
314 cyc->cg.cyc.head = cyc; /* pointer to head of cycle */ in cycle_link()
315 cyc->cg.cyc.next = sym; /* pointer to next member of cycle */ in cycle_link()
[all …]
H A Dcg_dfn.c104 if (child->cg.cyc.head != child && child->cg.cyc.head == head) in find_cycle()
152 for (tail = head; tail->cg.cyc.next; tail = tail->cg.cyc.next) in find_cycle()
165 if (head->cg.cyc.head != head) in find_cycle()
167 head = head->cg.cyc.head; in find_cycle()
175 if (child->cg.cyc.head == child) in find_cycle()
181 tail->cg.cyc.next = child; in find_cycle()
182 child->cg.cyc.head = head; in find_cycle()
188 for (tail = child; tail->cg.cyc.next; tail = tail->cg.cyc.next) in find_cycle()
190 tail->cg.cyc.next->cg.cyc.head = head; in find_cycle()
192 print_name (tail->cg.cyc.next); in find_cycle()
[all …]
H A Dcg_print.c125 cyc->cg.prop.self / hz, cyc->cg.prop.child / hz, cyc->ncalls); in print_cycle()
132 printf (_(" <cycle %d as a whole> [%d]\n"), cyc->cg.cyc.num, cyc->cg.index); in print_cycle()
170 todo = cyc->cg.cyc.next; in sort_members()
171 cyc->cg.cyc.next = 0; in sort_members()
177 for (prev = cyc; prev->cg.cyc.next; prev = prev->cg.cyc.next) in sort_members()
183 doing->cg.cyc.next = prev->cg.cyc.next; in sort_members()
197 for (member = cyc->cg.cyc.next; member; member = member->cg.cyc.next) in print_members()
260 && right_parent->cg.cyc.num == right_child->cg.cyc.num) in cmp_arc()
281 && right_parent->cg.cyc.num == right_child->cg.cyc.num) in cmp_arc()
370 && parent->cg.cyc.num == child->cg.cyc.num)) in print_parents()
[all …]
H A Dutils.c101 if (self->cg.cyc.num != 0) in print_name()
103 printf (_(" <cycle %d>"), self->cg.cyc.num); in print_name()
H A Dsymtab.h95 cyc; member
/netbsd/external/gpl3/gdb.old/dist/gprof/
H A Dcg_arcs.c186 if (parent->cg.cyc.num == child->cg.cyc.num) in propagate_time()
252 for (cyc = &cycle_header[1]; cyc <= &cycle_header[num_cycles]; ++cyc) in cycle_time()
254 for (member = cyc->cg.cyc.next; member; member = member->cg.cyc.next) in cycle_time()
266 cyc->cg.prop.self = cyc->cg.prop.fract * cyc->hist.time; in cycle_time()
284 if (sym->cg.cyc.head == sym && sym->cg.cyc.next) in cycle_link()
304 if (!(sym->cg.cyc.head == sym && sym->cg.cyc.next != 0)) in cycle_link()
309 ++cyc; in cycle_link()
313 cyc->cg.cyc.num = num; /* internal number of cycle on */ in cycle_link()
314 cyc->cg.cyc.head = cyc; /* pointer to head of cycle */ in cycle_link()
315 cyc->cg.cyc.next = sym; /* pointer to next member of cycle */ in cycle_link()
[all …]
H A Dcg_dfn.c104 if (child->cg.cyc.head != child && child->cg.cyc.head == head) in find_cycle()
152 for (tail = head; tail->cg.cyc.next; tail = tail->cg.cyc.next) in find_cycle()
165 if (head->cg.cyc.head != head) in find_cycle()
167 head = head->cg.cyc.head; in find_cycle()
175 if (child->cg.cyc.head == child) in find_cycle()
181 tail->cg.cyc.next = child; in find_cycle()
182 child->cg.cyc.head = head; in find_cycle()
188 for (tail = child; tail->cg.cyc.next; tail = tail->cg.cyc.next) in find_cycle()
190 tail->cg.cyc.next->cg.cyc.head = head; in find_cycle()
192 print_name (tail->cg.cyc.next); in find_cycle()
[all …]
H A Dcg_print.c125 cyc->cg.prop.self / hz, cyc->cg.prop.child / hz, cyc->ncalls); in print_cycle()
132 printf (_(" <cycle %d as a whole> [%d]\n"), cyc->cg.cyc.num, cyc->cg.index); in print_cycle()
170 todo = cyc->cg.cyc.next; in sort_members()
171 cyc->cg.cyc.next = 0; in sort_members()
177 for (prev = cyc; prev->cg.cyc.next; prev = prev->cg.cyc.next) in sort_members()
183 doing->cg.cyc.next = prev->cg.cyc.next; in sort_members()
197 for (member = cyc->cg.cyc.next; member; member = member->cg.cyc.next) in print_members()
260 && right_parent->cg.cyc.num == right_child->cg.cyc.num) in cmp_arc()
281 && right_parent->cg.cyc.num == right_child->cg.cyc.num) in cmp_arc()
370 && parent->cg.cyc.num == child->cg.cyc.num)) in print_parents()
[all …]
H A Dutils.c101 if (self->cg.cyc.num != 0) in print_name()
103 printf (_(" <cycle %d>"), self->cg.cyc.num); in print_name()
H A Dsymtab.h95 cyc; member
/netbsd/external/apache2/llvm/dist/llvm/lib/Target/ARM/
H A DARMScheduleA57.td442 // LDRD pre-indexed: 5(2) cyc for reg, 4(1) cyc for imm.
490 // LDRD post-indexed: 4(2) cyc for reg, 4(1) cyc for imm.
1033 // 5cyc F0 for r0px, 4cyc F0 for r1p0 and later, 1cyc for accumulate sequence
1046 // 6cyc F0 for r0px, 5cyc F0 for r1p0 and later, 2cyc for accumulate sequence
1059 // 5cyc F0 for r0px, 4cyc F0 for r1p0 and later, 1cyc for accumulate sequence
1072 // 5cyc F0 for r0px, 4cyc F0 for r1p0 and later, 2cyc for accumulate sequence
1090 // 5cyc F0 for r0px, 4cyc F0 for r1p0 and later
1098 // 4cyc F1, 1cyc for accumulate sequence (3cyc ReadAdvance)
1104 // 4cyc F1, 1cyc for accumulate sequence (3cyc ReadAdvance)
1263 // 1-2 reg: 5cyc L, +I for writeback, 1 cyc wb latency
[all …]
/netbsd/external/bsd/ntp/dist/tests/libntp/
H A Dclocktime.c218 int cyc; in test_AlwaysInLimit() local
229 for (cyc = 0; cyc < 5; cyc++) { in test_AlwaysInLimit()
230 settime(1900 + cyc * 65, 1, 1, 0, 0, 0); in test_AlwaysInLimit()
/netbsd/usr.sbin/fwctl/
H A Dfwdv.c185 if (ciph->fdf.dv.cyc != 0xffff && k == 0) in dvrecv()
186 fprintf(stderr, "0x%04x\n", ntohs(ciph->fdf.dv.cyc)); in dvrecv()
317 ciph->fdf.dv.cyc = 0xffff; in dvsend()
376 ciph->fdf.dv.cyc = htons(f_cycle << 12 | f_frac); in dvsend()
378 ciph->fdf.dv.cyc = htons(cycle << 12 | f_frac); in dvsend()
384 ciph->fdf.dv.cyc = 0xffff; in dvsend()
/netbsd/external/bsd/unbound/dist/testdata/
H A Diter_dname_insec.rpl337 ;9 cyc.example.com. example.com. example.com. cyc.example.com.
338 ;10 cyc.example.com. example.com. c.example.com. cyc.c.example.com.
681 ;9 cyc.example.com. example.com. example.com. cyc.example.com.
687 cyc.example.com. IN A
698 cyc.example.com. IN A
701 cyc.example.com. 0 IN CNAME cyc.example.com.
754 cyc.example.com. IN A
757 cyc.example.com. IN CNAME cyc.example.com.
764 ;10 cyc.example.com. example.com. c.example.com. cyc.c.example.com.
766 ; cyc.example.com. was renamed to cyc2.example.com. to avoid cache clashes
H A Diter_dname_yx.rpl335 ;9 cyc.example.com. example.com. example.com. cyc.example.com.
336 ;10 cyc.example.com. example.com. c.example.com. cyc.c.example.com.
673 ; ;9 cyc.example.com. example.com. example.com. cyc.example.com.
679 ; cyc.example.com. IN A
689 ; cyc.example.com. IN A
742 ; cyc.example.com. IN A
745 ; cyc.example.com. IN CNAME cyc.example.com.
752 ; ;10 cyc.example.com. example.com. c.example.com. cyc.c.example.com.
754 ; ; cyc.example.com. was renamed to cyc2.example.com. to avoid cache clashes

123