| /netbsd/usr.bin/xlint/lint1/ |
| H A D | lint1.h | 51 } *items; member
|
| H A D | mem1.c | 178 pool->items = xrealloc(pool->items, in mpool_add()
179 sizeof(*pool->items) * pool->cap); in mpool_add()
181 pool->items[pool->len++] = item; in mpool_add()
189 struct memory_pool_item *item = pool->items + pool->len - 1; in mpool_free()
373 free(expr_pool.items); in expr_restore_memory()
|
| /netbsd/external/gpl3/gcc/dist/lto-plugin/ |
| H A D | ChangeLog | 946 (all_symbols_read_handler): Use add_input_library for items that
|
| /netbsd/external/gpl3/gcc/dist/libstdc++-v3/python/libstdcxx/v6/ |
| H A D | printers.py | 1982 defargs = dict((n, d.replace('std::', ns)) for (n,d) in defargs.items())
|
| /netbsd/external/gpl3/gcc/dist/libstdc++-v3/include/std/ |
| H A D | bitset | 1157 * resolves DR 11 (items 1 and 2), but does not do the range-checking
|
| /netbsd/external/gpl3/gcc/dist/libstdc++-v3/include/ext/ |
| H A D | random | 3060 * the total number of items.
3068 * the total number of successful items.
3075 * @brief Returns the total number of unsuccessful items @f$ N - K @f$.
|
| /netbsd/external/gpl3/gcc/dist/libstdc++-v3/include/experimental/ |
| H A D | io_context | 665 // TODO run any posted items
|
| /netbsd/external/gpl3/gcc/dist/libstdc++-v3/doc/doxygen/ |
| H A D | user.cfg.in | 12 # For lists, items can also be appended using:
1573 # The TOC_EXPAND flag can be set to YES to add extra items for group members to
2576 # number of items for each type to make the size more manageable. Set this to 0
|
| /netbsd/external/gpl3/gcc/dist/libphobos/src/std/ |
| H A D | xml.d | 675 Item[] items; // The element's items
815 items ~= item; in appendItem()
849 immutable len = items.length; in opEquals()
853 if (!items[i].opEquals(element.items[i])) return false; in opEquals()
875 if (i == items.length && i == element.items.length) return 0; in opCmp()
878 if (!items[i].opEquals(element.items[i])) in opCmp()
879 return items[i].opCmp(element.items[i]); in opCmp()
913 foreach (item;items) in foreach() argument
936 if (items.length == 1)
946 foreach (item;items) in foreach() argument
[all …]
|
| H A D | meta.d | 378 private template AppendUnique(items...) in AppendUnique() argument
380 alias head = items[0 .. $ - 1]; in AppendUnique()
384 alias AppendUnique = items; in AppendUnique()
1205 template Repeat(size_t n, items...) in Repeat() argument
1213 alias Repeat = items; in Repeat()
1284 static if (items.length < 2) in staticSort()
1285 alias staticSort = items; in staticSort()
1320 alias staticMerge = items; in staticMerge()
1322 alias staticMerge = AliasSeq!(items[0 .. run], items[mid], in staticMerge()
1323 staticMerge!(cmp, mid - run, items[run .. mid], items[mid + 1 .. $])); in staticMerge()
[all …]
|
| 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/gcc/dist/libphobos/src/std/uni/ |
| H A D | package.d | 1282 this(inout(size_t)* origin, size_t offset, size_t items) inout @safe in PackedArrayViewImpl()
1286 limit = items; in PackedArrayViewImpl()
1567 private inout(PackedArrayView!T) packedArrayView(T)(inout(size_t)* ptr, size_t items) in packedArrayView()
1569 return inout(PackedArrayView!T)(ptr, 0, items); in packedArrayView()
|
| /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/gpl3/gcc/dist/libphobos/src/etc/c/ |
| H A D | zlib.d | 83 alias alloc_func = void* function (void* opaque, uint items, uint size);
|
| /netbsd/external/gpl3/gcc/dist/libphobos/src/std/algorithm/ |
| H A D | iteration.d | 3075 this(RoR items, Separator sep)
3077 _items = items;
3615 this(RoR items, ElementType!RoR current)
3617 _items = items;
|
| H A D | searching.d | 142 `all` can also be used without a predicate, if its items can be
190 `any` can also be used without a predicate, if its items can be
|
| /netbsd/external/gpl3/gcc/dist/libgcc/config/avr/libf7/ |
| H A D | t-libf7 | 125 iter-items := $(f7_parts)
128 -include $(patsubst %,$(libf7)/libf7-c-object.mk,$(iter-items))
136 iter-items := $(f7_parts)
139 -include $(patsubst %,$(libf7)/libf7-asm-object.mk,$(iter-items))
|
| /netbsd/external/gpl3/gcc/dist/libgcc/config/avr/ |
| H A D | t-avr | 130 iter-items := $(hiintfuncs16)
135 -include $(patsubst %,$(srcdir)/siditi-object.mk,$(iter-items))
166 iter-items := $(round_funcs)
168 iter-flags := $(patsubst %,-DL_round,$(iter-items))
170 -include $(patsubst %,$(srcdir)/config/avr/lib2-object.mk,$(iter-items))
180 iter-items := $(clrsb_funcs)
182 iter-flags := $(patsubst %,-DL_clrsb,$(iter-items))
194 iter-items := $(countls_funcs)
196 iter-flags := $(patsubst %,-DL_countls,$(iter-items))
208 iter-items := $(countlsu_funcs)
[all …]
|
| /netbsd/external/gpl3/gcc/dist/libgcc/ |
| H A D | ChangeLog | 706 (write_one_data): Pre-allocate buffer for number of items
|
| /netbsd/external/gpl3/gcc/dist/gcc/ |
| H A D | vec.cc | 50 size_t items, size_t items_peak, size_t element_size) in vec_usage() argument
52 m_items (items), m_items_peak (items_peak), in vec_usage()
|
| H A D | target.def | 5177 to refer to those items.",
|
| H A D | params.opt | 288 -param=ipa-max-agg-items=
290 Maximum number of aggregate content items for a parameter in jump functions and lattices.
|
| H A D | lto-compress.cc | 64 lto_zalloc (void *opaque, unsigned items, unsigned size) in lto_zalloc() argument
67 return xmalloc (items * size); in lto_zalloc()
|
| /netbsd/external/gpl3/gcc/dist/gcc/lto/ |
| H A D | ChangeLog | 3146 (add_cgraph_node_to_partition): Do not re-add items to partition;
3148 (add_varpool_node_to_partition): Do not re-add items to partition.
5130 * lto.c (lto_read_decls): Wrapped debug-only data items within #ifdef
|
| /netbsd/external/gpl3/gcc/dist/gcc/jit/docs/topics/ |
| H A D | performance.rst | 31 of "timer items": as control flow moves through your code, you can push
32 and pop named items relating to your code onto the stack, and the timer
38 For example, the following code uses a timer, recording client items
88 giving output like this, showing the internal GCC items at the top, then
89 client items, then the total::
92 GCC items:
116 Client items:
|