/netbsd/external/gpl3/gcc/dist/libphobos/src/std/container/ |
H A D | util.d | 118 auto make(T)(T[] items...) 121 return .make!(Container!(T, Args))(items);
|
/netbsd/external/bsd/tcpdump/dist/tests/ |
H A D | cve-2014-8769-AODV.out | 2 10.1.1.104.654 > 10.2.2.2.3328: aodv rerr [items 0] [19192]:
|
H A D | vqp-oobr.out | 3 VQPv1, unknown (127) Message, error-code unknown (31) (31), seq 0x80f90000, items 27, length 18
|
/netbsd/external/gpl3/binutils/dist/gprofng/src/ |
H A D | DbeView.cc | 904 Vector<Metric*> *items = mlist->get_items (); in add_compare_metrics() local 914 Metric *mtr = items->get (i); in add_compare_metrics() 972 items->reset (); in add_compare_metrics() 973 items->addAll (newItems); in add_compare_metrics() 998 Vector<Metric*> *items = mlist->get_items (); in remove_compare_metrics() local 999 Vector<Metric*> *items_old = items->copy (); in remove_compare_metrics() 1000 items->reset (); in remove_compare_metrics() 1009 items->append (m); in remove_compare_metrics() 1022 items->append (new_met); in remove_compare_metrics() 1149 if (visindex >= items->size ()) in setSort() [all …]
|
H A D | Filter.h | 96 Vector<RangePair *> *items; // sorted array of items variable
|
/netbsd/crypto/external/cpl/trousers/dist/ |
H A D | NICETOHAVES | 2 These items are of lower priority than the TODO list. If any of these become
|
/netbsd/external/bsd/ntp/dist/ntpdc/ |
H A D | ntpdc.c | 605 size_t items; in getresponse() local 762 items = INFO_NITEMS(rpkt.err_nitems); in getresponse() 768 datasize = items * size; in getresponse() 773 items, size, datasize, n-RESP_HEADER_SIZE); in getresponse() 814 if ((datap + datasize + (pad * items)) > (pktdata + pktdatasize)) { in getresponse() 826 for (i = 0; i < items; i++) { in getresponse() 837 *ritems += items; in getresponse()
|
/netbsd/external/bsd/ntp/dist/lib/isc/ |
H A D | mem.c | 1862 mpctx->items = NULL; in isc__mempool_create() 1929 item = mpctx->items; in isc__mempool_destroy() 1930 mpctx->items = item->next; in isc__mempool_destroy() 1996 item = mpctx->items; in isc___mempool_get() 1998 mpctx->items = item->next; in isc___mempool_get() 2021 item->next = mpctx->items; in isc___mempool_get() 2022 mpctx->items = item; in isc___mempool_get() 2030 item = mpctx->items; in isc___mempool_get() 2034 mpctx->items = item->next; in isc___mempool_get() 2101 item->next = mpctx->items; in isc___mempool_put() [all …]
|
/netbsd/external/bsd/unbound/dist/doc/ |
H A D | TODO | 1 TODO items. These are interesting todo items. 62 compared to the absolute time, and now-expired items can be dealt with.
|
/netbsd/external/mpl/bind/dist/lib/isc/ |
H A D | mem.c | 1681 mpctx->items = NULL; in isc_mempool_create() 1732 while (mpctx->items != NULL) { in isc_mempool_destroy() 1735 item = mpctx->items; in isc_mempool_destroy() 1736 mpctx->items = item->next; in isc_mempool_destroy() 1819 if (ISC_UNLIKELY(mpctx->items == NULL)) { in isc__mempool_get() 1828 item->next = mpctx->items; in isc__mempool_get() 1829 mpctx->items = item; in isc__mempool_get() 1838 item = mpctx->items; in isc__mempool_get() 1843 mpctx->items = item->next; in isc__mempool_get() 1900 item->next = mpctx->items; in isc__mempool_put() [all …]
|
/netbsd/external/gpl3/gdb/dist/gdb/compile/ |
H A D | compile-object-load.h | 44 std::vector<munmap_item> items; member
|
/netbsd/external/gpl3/gdb.old/dist/gdb/compile/ |
H A D | compile-object-load.h | 44 std::vector<munmap_item> items; member
|
/netbsd/external/gpl3/gcc/dist/libphobos/src/std/ |
H A D | array.d | 3646 p(items); 3669 if (items.length == 1) 3671 put(items.front); 3682 auto bigData = bigDataFun(items.length); 3692 bigData[len .. newlen] = items[]; 3699 emplaceRef!T(it, items.front); 3700 items.popFront(); 3712 while (!items.empty) 3714 auto c = items.decodeFront; 3722 for (; !items.empty; items.popFront()) [all …]
|
/netbsd/external/gpl3/gdb/dist/gdb/ |
H A D | osdata.h | 47 std::vector<osdata_item> items; member
|
/netbsd/external/gpl3/gdb.old/dist/gdb/ |
H A D | osdata.h | 47 std::vector<osdata_item> items; member
|
/netbsd/usr.bin/make/unit-tests/ |
H A D | directive-for-errors.mk | 72 . info Would be reached if there were items to loop over.
|
/netbsd/external/gpl3/gcc/dist/contrib/ |
H A D | filter-clang-warnings.py | 60 for name, ignores in ignores.items():
|
/netbsd/external/gpl2/gettext/dist/gettext-tools/src/ |
H A D | x-perl.c | 2531 token_ty **items; member 2548 token_ty *token = stack->items[i]; in token_stack_dump() 2575 stack->items = xrealloc (stack->items, nbytes); in token_stack_push() 2577 stack->items[stack->nitems++] = token; in token_stack_push() 2586 return stack->items[--(stack->nitems)]; in token_stack_pop() 2597 return stack->items[stack->nitems - 1]; in token_stack_peek() 2609 free_token (stack->items[i]); in token_stack_free() 2610 free (stack->items); in token_stack_free() 3394 token_stack.items = NULL; in extract_perl()
|
/netbsd/external/gpl2/texinfo/dist/util/ |
H A D | README | 13 The other items here are for your amusement and/or hacking pleasure.
|
/netbsd/external/gpl3/gcc.old/dist/contrib/ |
H A D | filter-clang-warnings.py | 46 for name, ignores in ignores.items():
|
/netbsd/external/gpl3/gcc/dist/gcc/ |
H A D | ipa-prop.c | 361 if (jump_func->agg.items) in ipa_print_node_jump_functions_for_edge() 1624 vec_alloc (jfunc->agg.items, value_count); in build_agg_jump_func_from_list() 1658 jfunc->agg.items->quick_push (item); in build_agg_jump_func_from_list() 2934 if (dst->agg.items) in update_jump_functions_after_inlining() 3056 gcc_assert (!dst->agg.items); in update_jump_functions_after_inlining() 3058 dst->agg.items = vec_safe_copy (src->agg.items); in update_jump_functions_after_inlining() 3163 if (src->agg.items in update_jump_functions_after_inlining() 3168 gcc_assert (!dst->agg.items); in update_jump_functions_after_inlining() 3171 dst->agg.items = vec_safe_copy (src->agg.items); in update_jump_functions_after_inlining() 3474 FOR_EACH_VEC_ELT (agg->items, i, item) in ipa_find_agg_cst_for_param() [all …]
|
/netbsd/external/gpl3/gcc.old/dist/gcc/ |
H A D | ipa-prop.c | 361 if (jump_func->agg.items) in ipa_print_node_jump_functions_for_edge() 1624 vec_alloc (jfunc->agg.items, value_count); in build_agg_jump_func_from_list() 1658 jfunc->agg.items->quick_push (item); in build_agg_jump_func_from_list() 2934 if (dst->agg.items) in update_jump_functions_after_inlining() 3056 gcc_assert (!dst->agg.items); in update_jump_functions_after_inlining() 3058 dst->agg.items = vec_safe_copy (src->agg.items); in update_jump_functions_after_inlining() 3163 if (src->agg.items in update_jump_functions_after_inlining() 3168 gcc_assert (!dst->agg.items); in update_jump_functions_after_inlining() 3171 dst->agg.items = vec_safe_copy (src->agg.items); in update_jump_functions_after_inlining() 3474 FOR_EACH_VEC_ELT (agg->items, i, item) in ipa_find_agg_cst_for_param() [all …]
|
/netbsd/crypto/external/bsd/heimdal/dist/lib/wind/ |
H A D | gen-combining.py | 51 for k,v in ud.items():
|
/netbsd/external/apache2/llvm/dist/llvm/utils/lit/tests/Inputs/test-data/ |
H A D | dummy_format.py | 27 for key,value_str in cfg.items('results'):
|
/netbsd/crypto/external/bsd/openssl/dist/doc/man3/ |
H A D | OPENSSL_LH_COMPFUNC.pod | 75 will contain items of some particular type and the I<hash> and 142 /* Call "TYPE_cleanup" against all items in a hash table. */ 154 The best solution is probably to avoid deleting items from the hash 228 internally represents lh_insert()'d items with a "const void *" 231 parameters that pass back the table items' data pointers - for
|