| /src/external/gpl3/gdb.old/dist/gdb/guile/lib/gdb/ |
| iterator.scm | 47 "Return a list of PROC applied to each element."
56 (define-public (iterator-for-each proc iter)
57 "Apply PROC to each element. The result is unspecified."
62 (iterator-for-each proc iter)))))
|
| /src/external/gpl3/gdb/dist/gdb/guile/lib/gdb/ |
| iterator.scm | 47 "Return a list of PROC applied to each element."
56 (define-public (iterator-for-each proc iter)
57 "Apply PROC to each element. The result is unspecified."
62 (iterator-for-each proc iter)))))
|
| /src/external/bsd/ntp/dist/libntp/ |
| ntp_worker.c | 133 const size_t each = sizeof(blocking_children[0]); local
150 prev_octets = prev_alloc * each;
152 octets = new_alloc * each;
|
| work_thread.c | 194 static const size_t each = local
204 c->workitems = erealloc(c->workitems, new_alloc * each);
230 static const size_t each = local
240 c->responses = erealloc(c->responses, new_alloc * each);
|
| /src/external/bsd/tmux/dist/ |
| layout.c | 27 * The window layout is a tree of cells each of which can be one of: a
31 * Each window has a pointer to the root of its layout tree (containing its
32 * panes), every pane has a pointer back to the cell containing it, and each
445 * Child cell runs in the same direction. Adjust each child equally
547 * < the minimum, growing proportionately by adding to each pane is
812 /* Check new size will work for each child. */
1104 u_int number, each, size, this, remainder; local
1130 each = (size - (number - 1)) / number;
1131 if (each == 0)
1137 remainder = size - (number * (each + 1)) + 1
[all...] |
| window-tree.c | 144 u_int each; member in struct:window_tree_modedata
550 u_int loop, total, visible, each, width, offset; local
599 each = (sx - 6) / visible;
600 remaining = (sx - 6) - (visible * each);
602 each = (sx - 3) / visible;
603 remaining = (sx - 3) - (visible * each);
605 each = sx / visible;
606 remaining = sx - (visible * each);
608 if (each == 0)
630 data->each = each
685 u_int loop, total, visible, each, width, offset; local
[all...] |
| /src/external/mit/isl/dist/interface/ |
| template_cpp.cc | 300 * Apply the substitution to each of the tuple kinds in the sequence.
536 static std::vector<Signature> each = { each_params, each_set, each_map }; variable
826 { "every", each },
831 { "foreach", each },
1122 * for each plain C++ class for which template kinds
1146 /* Call "fn" on each template class.
1311 * Each class has a predefined set of initial specializations,
1318 * For each specialization of a template class, call
2058 * for each pair of tuple kinds, checking that each update succeeds
[all...] |
| /src/external/gpl3/binutils/dist/bfd/ |
| dwarf2.c | 91 compilation unit any given address belongs to. Given that each compilation
1823 /* Remember some information about each function. If the function is
3243 struct funcinfo *each; local
3260 for (each = unit->function_table; each; each = each->prev_func)
3263 entry->funcinfo = each;
3290 /* Calculate the high watermark for each function in the lookup table. */
3397 struct funcinfo* each; local
3438 struct varinfo* each; local
5173 struct varinfo* each; local
5200 struct comp_unit *each; local
5616 struct comp_unit *each = parse_comp_unit (stash, file, local
5805 struct comp_unit* each; local
6096 struct comp_unit *each; local
[all...] |
| /src/external/gpl3/binutils.old/dist/bfd/ |
| dwarf2.c | 91 compilation unit any given address belongs to. Given that each compilation
1823 /* Remember some information about each function. If the function is
3243 struct funcinfo *each; local
3260 for (each = unit->function_table; each; each = each->prev_func)
3263 entry->funcinfo = each;
3290 /* Calculate the high watermark for each function in the lookup table. */
3397 struct funcinfo* each; local
3438 struct varinfo* each; local
5173 struct varinfo* each; local
5200 struct comp_unit *each; local
5616 struct comp_unit *each = parse_comp_unit (stash, file, local
5805 struct comp_unit* each; local
6096 struct comp_unit *each; local
[all...] |
| /src/external/gpl3/gdb.old/dist/bfd/ |
| dwarf2.c | 91 compilation unit any given address belongs to. Given that each compilation
1823 /* Remember some information about each function. If the function is
3243 struct funcinfo *each; local
3260 for (each = unit->function_table; each; each = each->prev_func)
3263 entry->funcinfo = each;
3290 /* Calculate the high watermark for each function in the lookup table. */
3397 struct funcinfo* each; local
3438 struct varinfo* each; local
5173 struct varinfo* each; local
5200 struct comp_unit *each; local
5617 struct comp_unit *each = parse_comp_unit (stash, file, local
5806 struct comp_unit* each; local
6097 struct comp_unit *each; local
[all...] |
| /src/external/gpl3/gdb/dist/bfd/ |
| dwarf2.c | 91 compilation unit any given address belongs to. Given that each compilation
1823 /* Remember some information about each function. If the function is
3243 struct funcinfo *each; local
3260 for (each = unit->function_table; each; each = each->prev_func)
3263 entry->funcinfo = each;
3290 /* Calculate the high watermark for each function in the lookup table. */
3397 struct funcinfo* each; local
3438 struct varinfo* each; local
5173 struct varinfo* each; local
5200 struct comp_unit *each; local
5616 struct comp_unit *each = parse_comp_unit (stash, file, local
5805 struct comp_unit* each; local
6096 struct comp_unit *each; local
[all...] |
| /src/external/gpl3/gcc/dist/gcc/config/i386/ |
| i386-expand.cc | 284 HOST_WIDE_INT each = wi::extract_uhwi (val, i, width); local
285 if (val_broadcast != each)
5481 bits as mask in the low 7 bits of each vector element.
5489 t3 { 97 99 05 9f ... | 87 12 1e 89 ... } where each ...
5516 /* Each of these shuffles will put 0s in places where
5538 just for repeated twice for each operand. merge_two:
5597 /* Replicate each of the input bytes into byte positions:
6100 /* real_to_target puts 32-bit pieces in each long. */
13009 where for each such pair it is sufficient if either of the ISAs is
19971 /* Within each 128-bit lane, the elements of op0 are numbere
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/config/i386/ |
| i386-expand.cc | 204 HOST_WIDE_INT each = wi::extract_uhwi (val, i, width); local
205 if (val_broadcast != each)
5157 bits as mask in the low 7 bits of each vector element.
5165 t3 { 97 99 05 9f ... | 87 12 1e 89 ... } where each ...
5192 /* Each of these shuffles will put 0s in places where
5214 just for repeated twice for each operand. merge_two:
5273 /* Replicate each of the input bytes into byte positions:
5741 /* real_to_target puts 32-bit pieces in each long. */
12293 where for each such pair it is sufficient if either of the ISAs is
18765 /* Within each 128-bit lane, the elements of op0 are numbere
[all...] |
