HomeSort by: relevance | last modified time | path
    Searched refs:inserted (Results 1 - 25 of 134) sorted by relevancy

1 2 3 4 5 6

  /src/external/gpl3/gdb.old/dist/gdb/dwarf2/
abbrev-table-cache.c 29 bool inserted = m_tables.emplace (std::move (table)).second;
32 gdb_assert (inserted);
  /src/external/gpl3/gdb/dist/gdb/dwarf2/
abbrev-table-cache.c 29 bool inserted = m_tables.emplace (std::move (table)).second;
32 gdb_assert (inserted);
cooked-index-worker.c 51 auto [it, inserted] = m_reader_hash.insert (std::move (reader));
52 gdb_assert (inserted);
  /src/external/bsd/libevent/dist/test/
regress_minheap.c 59 struct event *inserted[1024]; local
66 inserted[i] = malloc(sizeof(struct event));
67 set_random_timeout(inserted[i]);
68 min_heap_push_(&heap, inserted[i]);
75 min_heap_erase_(&heap, inserted[i]);
92 free(inserted[i]);
  /src/external/bsd/ntp/dist/sntp/libevent/test/
regress_minheap.c 60 struct event *inserted[1024]; local
67 inserted[i] = malloc(sizeof(struct event));
68 set_random_timeout(inserted[i]);
69 min_heap_push_(&heap, inserted[i]);
76 min_heap_erase_(&heap, inserted[i]);
93 free(inserted[i]);
  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.base/
continue-after-aborted-step-over.exp 51 gdb_test_no_output "set breakpoint always-inserted $breakpoint_always_inserted"
90 foreach_with_prefix breakpoint-always-inserted {"off" "on"} {
91 do_test ${displaced-stepping} ${breakpoint-always-inserted}
  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.base/
continue-after-aborted-step-over.exp 52 gdb_test_no_output "set breakpoint always-inserted $breakpoint_always_inserted"
91 foreach_with_prefix breakpoint-always-inserted {"off" "on"} {
92 do_test ${displaced-stepping} ${breakpoint-always-inserted}
  /src/external/gpl3/gdb.old/dist/gdbserver/
mem-break.cc 46 at an address is had already inserted one previously in a few
74 `inserted' state associated with this low level breakpoint
111 /* Positive if this breakpoint is currently inserted in the
113 gone. Zero if not inserted. */
114 int inserted; member in struct:raw_breakpoint
204 it will be left inserted. */
336 && bp->inserted >= 0)
397 /* Since there can be trap breakpoints inserted in the same address
436 bp->inserted = -1;
453 if (!bp->inserted)
505 int inserted; member in struct:fast_tracepoint_jump
    [all...]
  /src/external/gpl3/gdb/dist/gdbserver/
mem-break.cc 46 at an address is had already inserted one previously in a few
74 `inserted' state associated with this low level breakpoint
111 /* Positive if this breakpoint is currently inserted in the
113 gone. Zero if not inserted. */
114 int inserted; member in struct:raw_breakpoint
204 it will be left inserted. */
336 && bp->inserted >= 0)
397 /* Since there can be trap breakpoints inserted in the same address
436 bp->inserted = -1;
453 if (!bp->inserted)
505 int inserted; member in struct:fast_tracepoint_jump
    [all...]
  /src/sys/arch/evbmips/alchemy/
omsal400.c 235 uint16_t inserted = 0; local
239 inserted = !AUGPIO_READ(5); /* pin 5 */
243 return inserted;
  /src/sys/external/bsd/compiler_rt/dist/lib/msan/
msan_chained_origin_depot.cc 111 bool inserted; local
112 ChainedOriginDepotNode::Handle h = chainedOriginDepot.Put(desc, &inserted);
114 return inserted;
msan_origin.h 132 bool inserted = ChainedOriginDepotPut(h.id(), prev.raw_id(), &chained_id); local
135 if (inserted && flags()->origin_history_per_stack_limit > 0)
  /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/
sanitizer_stackdepotbase.h 30 handle_type Put(args_type args, bool *inserted = nullptr);
99 bool *inserted) {
100 if (inserted) *inserted = false;
132 if (inserted) *inserted = true;
  /src/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/
sanitizer_stackdepotbase.h 44 u32 Put(args_type args, bool *inserted = nullptr);
116 bool *inserted) {
117 if (inserted)
118 *inserted = false;
146 if (inserted) *inserted = true;
sanitizer_chained_origin_depot.cpp 131 bool inserted; local
132 *new_id = depot.Put(desc, &inserted);
133 return inserted;
  /src/external/gpl3/gcc.old/dist/libsanitizer/sanitizer_common/
sanitizer_stackdepotbase.h 44 u32 Put(args_type args, bool *inserted = nullptr);
116 bool *inserted) {
117 if (inserted)
118 *inserted = false;
146 if (inserted) *inserted = true;
sanitizer_chained_origin_depot.cpp 132 bool inserted; local
133 *new_id = depot.Put(desc, &inserted);
134 return inserted;
  /src/external/gpl2/diffutils/dist/src/
context.c 224 If lines were inserted here in file 1, this is "changed".
226 prefix = (next->inserted > 0 ? "!" : "-");
245 while (next && next->line1 + next->inserted <= i)
254 Otherwise it is "inserted". */
368 /* Then output the inserted part. */
370 k = next->inserted;
409 top1 = start->line1 + start->inserted;
428 It should be 1 if all the lines inserted or deleted in that change
util.c 513 the line is inserted, deleted, changed, etc.). */
651 Return UNCHANGED if only ignorable lines are inserted or deleted,
653 NEW if lines of file 1 are inserted,
682 l1 = next->line1 + next->inserted - 1;
684 show_to += next->inserted;
711 /* If all inserted or deleted lines are ignorable,
763 long inserted = sp->inserted;
765 line0, line1, deleted, inserted);
752 long inserted = sp->inserted; local
  /src/external/gpl2/xcvs/dist/diff/
context.c 195 If lines were inserted here in file 1, this is "changed".
197 prefix = (next->inserted > 0 ? "!" : "-");
216 while (next && next->line1 + next->inserted <= i)
225 Otherwise it is "inserted". */
341 /* Then output the inserted part. */
343 k = next->inserted;
376 top1 = start->line1 + start->inserted;
397 It should be 1 if all the lines inserted or deleted in that change
  /src/sys/dev/fdt/
fdt_memory.c 184 bool inserted = false; local
199 inserted = true;
202 if (!inserted)
  /src/external/gpl3/gcc/dist/gcc/cp/
vtable-class-hierarchy.cc 315 seen-but-not-yet-processed nodes. INSERTED is a bitmap, one bit
324 sbitmap inserted)
328 if (bitmap_bit_p (inserted, node->class_uid))
336 bitmap_set_bit (inserted, node->class_uid);
383 sbitmap inserted = sbitmap_alloc (num_vtable_map_nodes); local
396 bitmap_clear (inserted);
402 && ! (bitmap_bit_p (inserted, cur->class_info->class_uid)))
403 add_to_worklist (&worklist, cur->class_info, inserted);
425 if (!bitmap_bit_p (inserted, temp_node->parents[i]->class_uid))
426 add_to_worklist (&worklist, temp_node->parents[i], inserted);
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/cp/
vtable-class-hierarchy.cc 315 seen-but-not-yet-processed nodes. INSERTED is a bitmap, one bit
324 sbitmap inserted)
328 if (bitmap_bit_p (inserted, node->class_uid))
336 bitmap_set_bit (inserted, node->class_uid);
383 sbitmap inserted = sbitmap_alloc (num_vtable_map_nodes); local
396 bitmap_clear (inserted);
402 && ! (bitmap_bit_p (inserted, cur->class_info->class_uid)))
403 add_to_worklist (&worklist, cur->class_info, inserted);
425 if (!bitmap_bit_p (inserted, temp_node->parents[i]->class_uid))
426 add_to_worklist (&worklist, temp_node->parents[i], inserted);
    [all...]
  /src/external/gpl3/gcc/dist/gcc/
splay-tree-utils.cc 169 bool inserted = tree.insert (node, compare); local
170 ASSERT_TRUE (inserted);
  /src/external/gpl3/gcc.old/dist/gcc/
splay-tree-utils.cc 169 bool inserted = tree.insert (node, compare); local
170 ASSERT_TRUE (inserted);

Completed in 32 milliseconds

1 2 3 4 5 6