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

1 2

  /src/distrib/utils/embedded/conf/
octeon.conf 29 populate() {
riscv32.conf 43 populate() {
riscv64.conf 47 populate() {
arm64.conf 90 populate() {
arm64mbr.conf 75 populate() {
rpi_inst.conf 37 populate() {
armv7.conf 121 populate() {
nintendo.conf 94 populate() {
rpi.conf 48 populate() {
x86.conf 83 populate() {
  /src/external/bsd/nsd/dist/contrib/bind2nsd/scripts/
bind2nsd 96 nsd.populate(named)
  /src/rescue/
Makefile 116 ${_MKMSG} "populate ${TARGETDIR}"
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
DependenceGraphBuilder.h 9 // This file defines a builder interface that can be used to populate dependence
59 void populate() { function in class:llvm::AbstractDependenceGraphBuilder
193 /// populate the \p NodeOrdinalMap.
LazyCallGraph.h 313 /// The node works much like an optional in order to lazily populate the
354 /// Populate the edges of this node if necessary.
356 /// The first time this is called it will populate the edges for this node
366 EdgeSequence &populate() { function in class:llvm::LazyCallGraph::Edge::Node
972 /// Get a graph node for a given function, scanning it to populate the graph
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
DDG.cpp 195 DDGBuilder(*this, D, BBList).populate();
210 DDGBuilder(*this, D, BBList).populate();
LazyCallGraph.cpp 509 /// (transitive) set of edges. Both callbacks should populate the set argument
1792 N.populate();
1942 // We need to populate each node as we begin to walk its edges.
1943 N.populate();
1971 for (LazyCallGraph::Edge &E : N.populate())
2018 for (LazyCallGraph::Edge &E : N.populate()) {
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/
socket.d 395 void populate(protoent* proto) @system pure nothrow
429 populate(proto);
442 populate(proto);
497 void populate(servent* serv) @system pure nothrow
535 populate(serv);
547 populate(serv);
635 void populate(hostent* he) @system pure nothrow
690 populate(he);
typecons.d 5058 * the AutoImplement's scope in a certain way; see the populate() below.
5075 template populate(overloads...)
5079 mixin populate!(overloads[0].name, overloads[0].contents);
5080 mixin populate!(overloads[1 .. $]);
5083 template populate(string name, methods...)
5087 mixin populate!(name, methods[0 .. $ - 1]);
5095 public mixin populate!(targetOverloadSets);
5096 public mixin populate!( ctorOverloadSet );
  /src/crypto/external/bsd/openssl.old/lib/libcrypto/arch/arm/
bsaes-armv7.S 1105 @ populate the key schedule
1119 @ populate the key schedule
1361 @ populate the key schedule
1382 @ populate the key schedule
1605 @ populate the key schedule
2085 @ populate the key schedule
  /src/distrib/utils/embedded/
mkimage 45 # - populate: Add common goods like kernel and bootloader
301 populate
  /src/crypto/external/apache2/openssl/dist/crypto/aes/asm/
bsaes-armv8.pl 1049 // populate the key schedule
1299 // populate the key schedule
1525 // populate the key schedule
1971 // populate the key schedule
  /src/external/bsd/nsd/dist/contrib/bind2nsd/bind2nsd/
NsdConf.py 340 def populate(self, named): member in class:NsdConf
  /src/crypto/external/bsd/openssh/dist/
monitor_wrap.c 1292 server_get_connection_info(struct ssh *ssh, int populate, int use_dns)
1296 if (ssh == NULL || !populate)
  /src/usr.bin/make/unit-tests/
directive-for.mk 15 # A typical use case for a .for loop is to populate a variable with a list of
  /src/external/gpl3/gcc/dist/gcc/analyzer/
access-diagram.cc 1029 /* Populate m_table_x_for_bit and m_bit_for_table_x. */
1030 void populate (const boundaries &boundaries, function in class:ana::bit_to_table_map
1149 /* If this fails, then we probably failed to fully populate m_boundaries
1161 /* If this fails, then we probably failed to fully populate m_boundaries
2093 /* Populate m_table_x_for_bit and m_bit_for_table_x.
2096 do populate it, so that looking at the table_x of one beyond the
2098 m_btm.populate (*m_boundaries, *m_op.get_manager (), logger);
2177 /* Populate the canvas_x per table_x. */

Completed in 64 milliseconds

1 2