HomeSort by: relevance | last modified time | path
    Searched defs:lb2 (Results 1 - 4 of 4) sorted by relevancy

  /src/tests/lib/libc/string/
t_memmem.c 63 int lb2 = 10; variable
81 expect(memmem(b2, lb2, p0, lp0) == b2);
86 expect(memmem(b2, lb2, p1, lp1) == b2);
87 expect(memmem(b2, lb2, p2, lp2) == (b2 + 4));
88 expect(memmem(b2, lb2, p3, lp3) == (b2 + 7));
90 expect(memmem(b2, lb2, p5, lp5) == b2);
91 expect(memmem(b2, lb2, p6, lp6) == (b2 + 9));
93 expect(memmem(b2, lb2, p4, lp4) == NULL);
94 expect(memmem(b2, lb2, p7, lp7) == NULL);
95 expect(memmem(b2, lb2, p8, lp8) == NULL)
    [all...]
  /src/external/gpl3/gcc/dist/libcpp/
line-map.cc 81 const struct location_adhoc_data *lb2 = local
83 return (lb1->locus == lb2->locus
84 && lb1->src_range.m_start == lb2->src_range.m_start
85 && lb1->src_range.m_finish == lb2->src_range.m_finish
86 && lb1->data == lb2->data
87 && lb1->discriminator == lb2->discriminator);
  /src/external/gpl3/gcc.old/dist/libcpp/
line-map.cc 80 const struct location_adhoc_data *lb2 = local
82 return (lb1->locus == lb2->locus
83 && lb1->src_range.m_start == lb2->src_range.m_start
84 && lb1->src_range.m_finish == lb2->src_range.m_finish
85 && lb1->data == lb2->data);
  /src/usr.sbin/lockstat/
main.c 611 lsbuf_t *lb, *lb2, *max; local
670 TAILQ_FOREACH(lb2, &l->tosort, lb_chain.tailq) {
671 if (lb->lb_callsite == lb2->lb_callsite)
674 if (lb2 != NULL) {
675 lb2->lb_counts[event] += lb->lb_counts[event];
676 lb2->lb_times[event] += lb->lb_times[event];
695 lb2 = TAILQ_FIRST(&l->bufs);
696 while (lb2 != NULL) {
699 lb2->lb_counts[event])
702 lb2->lb_times[event]
    [all...]

Completed in 54 milliseconds