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

  /src/external/gpl3/gdb/dist/gdb/
btrace.c 397 /* Skip gaps. */
523 std::vector<unsigned int> &gaps)
538 gaps.push_back (bfun->number);
994 /* Try to bridge gaps due to overflow or decode errors by connecting the
998 btrace_bridge_gaps (struct thread_info *tp, std::vector<unsigned int> &gaps)
1004 DEBUG ("bridge gaps");
1010 For big gaps or small traces, however, it may not be feasible to require a
1014 /* Let's try to bridge as many gaps as we can. In some cases, we need to
1015 skip a gap and revisit it again after we closed later gaps. */
1016 while (!gaps.empty ()
1919 std::vector<unsigned int> gaps; member in class:std
    [all...]
record-btrace.c 565 unsigned int insns, calls, gaps; local
586 gaps = 0;
605 gaps = btinfo->ngaps;
608 gdb_printf (_("Recorded %u instructions in %u functions (%u gaps) "
609 "for thread %s (%s).\n"), insns, calls, gaps,
1220 /* Indicate gaps in the trace. */
2098 /* Skip gaps at the end of the trace. */
2394 /* Skip gaps during replay. If we end up at a gap (at the end of the trace),
2459 Skip gaps during replay. If we end up at a gap (at the beginning of
2884 /* Skip gaps at the beginning of the trace. *
    [all...]
  /src/external/gpl3/gdb.old/dist/gdb/
btrace.c 395 /* Skip gaps. */
521 std::vector<unsigned int> &gaps)
536 gaps.push_back (bfun->number);
968 /* Try to bridge gaps due to overflow or decode errors by connecting the
972 btrace_bridge_gaps (struct thread_info *tp, std::vector<unsigned int> &gaps)
978 DEBUG ("bridge gaps");
984 For big gaps or small traces, however, it may not be feasible to require a
988 /* Let's try to bridge as many gaps as we can. In some cases, we need to
989 skip a gap and revisit it again after we closed later gaps. */
990 while (!gaps.empty ()
1565 std::vector<unsigned int> gaps; member in class:std
    [all...]
record-btrace.c 564 unsigned int insns, calls, gaps; local
585 gaps = 0;
604 gaps = btinfo->ngaps;
607 gdb_printf (_("Recorded %u instructions in %u functions (%u gaps) "
608 "for thread %s (%s).\n"), insns, calls, gaps,
1177 /* Indicate gaps in the trace. */
2051 /* Skip gaps at the end of the trace. */
2347 /* Skip gaps during replay. If we end up at a gap (at the end of the trace),
2393 Skip gaps during replay. If we end up at a gap (at the beginning of
2801 /* Skip gaps at the beginning of the trace. *
    [all...]
  /src/external/gpl3/binutils/dist/bfd/
elf32-spu.c 2554 are gaps in the current info we have about functions in SEC. */
2562 bool gaps = false; local
2579 gaps = true;
2582 gaps = true;
2586 gaps = true;
2595 gaps = true;
2597 return gaps;
2974 bool gaps = false; local
3006 if (!gaps)
3007 for (sec = ibfd->sections; sec != NULL && !gaps; sec = sec->next
    [all...]
  /src/external/gpl3/binutils/dist/ld/
pdb.h 751 struct lvar_addr_gap gaps[]; member in struct:defrange_register_rel
761 struct lvar_addr_gap gaps[]; member in struct:defrange_framepointer_rel
773 struct lvar_addr_gap gaps[]; member in struct:defrange_subfield_register
784 struct lvar_addr_gap gaps[]; member in struct:defrange_register
  /src/external/gpl3/binutils.old/dist/bfd/
elf32-spu.c 2554 are gaps in the current info we have about functions in SEC. */
2562 bool gaps = false; local
2579 gaps = true;
2582 gaps = true;
2586 gaps = true;
2595 gaps = true;
2597 return gaps;
2974 bool gaps = false; local
3006 if (!gaps)
3007 for (sec = ibfd->sections; sec != NULL && !gaps; sec = sec->next
    [all...]
  /src/external/gpl3/binutils.old/dist/ld/
pdb.h 751 struct lvar_addr_gap gaps[]; member in struct:defrange_register_rel
761 struct lvar_addr_gap gaps[]; member in struct:defrange_framepointer_rel
773 struct lvar_addr_gap gaps[]; member in struct:defrange_subfield_register
784 struct lvar_addr_gap gaps[]; member in struct:defrange_register
  /src/external/gpl3/gdb/dist/bfd/
elf32-spu.c 2550 are gaps in the current info we have about functions in SEC. */
2558 bool gaps = false; local
2575 gaps = true;
2578 gaps = true;
2582 gaps = true;
2591 gaps = true;
2593 return gaps;
2970 bool gaps = false; local
3002 if (!gaps)
3003 for (sec = ibfd->sections; sec != NULL && !gaps; sec = sec->next
    [all...]
  /src/external/gpl3/gdb.old/dist/bfd/
elf32-spu.c 2554 are gaps in the current info we have about functions in SEC. */
2562 bool gaps = false; local
2579 gaps = true;
2582 gaps = true;
2586 gaps = true;
2595 gaps = true;
2597 return gaps;
2974 bool gaps = false; local
3006 if (!gaps)
3007 for (sec = ibfd->sections; sec != NULL && !gaps; sec = sec->next
    [all...]
  /src/external/gpl3/binutils/dist/binutils/
objcopy.c 181 /* Filling gaps between sections. */
646 --gap-fill <val> Fill gaps between sections with <val>\n\
2312 handle gaps, we chose an artificially large end
2682 bfd_size_type *gaps = NULL;
3242 /* We must fill in gaps between the sections and/or we must pad
3245 increasing the section sizes as required to fill the gaps.
3255 gaps = xmalloc (num_sec * sizeof (*gaps));
3256 memset (gaps, 0, num_sec * sizeof (*gaps));
2680 bfd_size_type *gaps = NULL; local
    [all...]
  /src/external/gpl3/binutils.old/dist/binutils/
objcopy.c 187 /* Filling gaps between sections. */
639 --gap-fill <val> Fill gaps between sections with <val>\n\
2303 handle gaps, we chose an artificially large end
2680 bfd_size_type *gaps = NULL;
3237 /* We must fill in gaps between the sections and/or we must pad
3240 increasing the section sizes as required to fill the gaps.
3250 gaps = xmalloc (num_sec * sizeof (*gaps));
3251 memset (gaps, 0, num_sec * sizeof (*gaps));
2678 bfd_size_type *gaps = NULL; local
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
tree-vect-stmts.cc 1167 unsigned int gaps = DR_GROUP_SIZE (first_stmt_info); local
1171 gaps -= 1;
1175 if (gaps)
1180 gaps);
1181 vect_get_load_cost (vinfo, stmt_info, ncopies * gaps,
2168 group might not be consecutive; there can be gaps between statements
2195 /* True if we can cope with such overrun by peeling for gaps, so that
2206 /* Stores can't yet have gaps. */
2232 "Grouped store with gaps requires"
2301 gaps if necessary and sufficient and give up if not. *
    [all...]

Completed in 56 milliseconds