Home
last modified time | relevance | path

Searched full:circular (Results 1 – 25 of 295) sorted by relevance

12345678910>>...12

/freebsd/sbin/rcorder/
H A Drcorder.8194 .It "Circular dependency on provision %s in file %s."
195 A set of files has a circular dependency which was detected while
198 .It "Circular dependency on file %s."
199 A set of files has a circular dependency which was detected while
201 .It "%s was seen in circular dependencies for %d times."
202 Each node that was a part of circular dependency loops reports total number of
221 Edges and nodes where circular dependencies were detected are drawn bold red.
H A Drcorder.c681 /* circular dep? */ in generate_graphviz_file_links()
812 * print that there is a circular dependency on it and abort in satisfy_req()
820 warnx("Circular dependency on provision `%s' in " in satisfy_req()
826 warnx("Circular dependency on provision `%s': %s.", in satisfy_req()
882 * Circular dependencies will cause problems if we do.
900 warnx("Circular dependency on file `%s'.", in do_file()
984 warnx("`%s' was seen in circular dependencies for %d times.", in do_file()
/freebsd/sys/contrib/dev/iwlwifi/
H A Diwl-fh.h48 * TFD Circular Buffers Base (CBBC) addresses
51 * circular buffers (CBs/queues) containing Transmit Frame Descriptors (TFDs)
53 * bytes from one another. Each TFD circular buffer in DRAM must be 256-byte
160 * 1) Receive Buffer Descriptor (RBD) circular buffer (CB), typically with 256
170 * Driver sets physical address [35:8] of base of RBD circular buffer
175 * the RB's corresponding RBD within the circular buffer. Driver sets
185 * enter pointers to these RBs into contiguous RBD circular buffer entries,
191 * the circular buffer. This value should initially be 0 (before preparing any
193 * wrap back to 0 at the end of the circular buffer (but don't wrap before
197 * As the device fills RBs (referenced from contiguous RBDs within the circular
[all...]
/freebsd/contrib/ntp/html/
H A Dhowto.html44circular buffer. On occasion, either by timeout, sample count or call to the poll routine, the dri…
71 <dt><tt>refclock_process</tt> - insert a sample in the circular buffer</dt>
72 … timestamp and the days, hours, minutes, seconds and nanoseconds in the circular buffer. Note that…
84 …called once per second to read the latest PPS offset and save it in the circular buffer (see below…
99 sample will be save in the circular buffer and a bit set in the association
103 circular buffer and update the system clock.</p>
/freebsd/contrib/bmake/unit-tests/
H A Ddeptgt-order.mk12 # This .ORDER creates a circular dependency since 'three' depends on 'one'
18 # XXX: The circular dependency should be detected here.
/freebsd/share/man/man9/
H A Dktr.956 KTR provides a circular buffer of events that can be logged in a
91 The event is stored in the circular buffer with supplied arguments as is,
107 the base of the circular trace buffer and its length.
H A Dvm_map.972 Head node of a circular, doubly linked list of
81 A count of the members in use within the circular map entry list.
173 Pointer to the previous node in a doubly-linked, circular list.
175 Pointer to the next node in a doubly-linked, circular list.
/freebsd/sys/dev/smartpqi/
H A Dsmartpqi_tag.c81 * Initialize circular queue implementation of tag list.
132 * Destroy circular queue implementation of tag list.
153 * Initialize circular queue implementation of tag list.
192 * Destroy circular queue implementation of tag list.
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A Dcircular_raw_ostream.h9 // This file contains raw_ostream implementations for streams to do circular
21 /// to a circular buffer, or can pass it through directly to an
95 /// circular-buffered stream, handing it an underlying stream to
/freebsd/sys/net/altq/
H A Daltq_fairq.h93 struct fairq_bucket *next; /* circular list */
94 struct fairq_bucket *prev; /* circular list */
107 fairq_bucket_t *cl_head; /* head of circular bucket list */
/freebsd/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/translators/
H A Dtst.CircularTransDecl.d31 * Test circular declaration of translations
72 printf("Testing circular translations\n");
/freebsd/contrib/ntp/sntp/m4/
H A Dos_cflags.m419 # avoid circular dependencies in yp headers, and more
26 # avoid circular dependencies in yp headers
/freebsd/share/doc/papers/sysperf/
H A D2.t188 events in \fItrace records\fP in a circular buffer in kernel
197 the virtual address and process id in the trace record. The circular
209 periodically reads the circular buffer of trace records. The
/freebsd/contrib/llvm-project/llvm/include/llvm/MCA/HardwareUnits/
H A DRetireControlUnit.h93 // Return the current token from the RCU's circular token queue.
98 // Advance the pointer to the next token in the circular token queue.
/freebsd/sys/netpfil/ipfw/
H A Ddn_sched_rr.c94 q->qnext = si->head; /* make it circular */ in rr_append()
97 /* Remove the head queue from circular list. */
114 /* Remove a queue from circular list.
/freebsd/lib/librtld_db/
H A DMakefile11 # Avoid circular dependency, we only need the libproc.h header here.
/freebsd/contrib/jemalloc/include/jemalloc/internal/
H A Djemalloc_internal_includes.h6 * but there are circular dependencies that cannot be broken without
82 * resolve circular dependencies.
/freebsd/cddl/usr.sbin/dtrace/tests/common/union/
H A DMakefile11 err.D_DECL_INCOMPLETE.circular.d \
/freebsd/lib/libgcc_eh/
H A DMakefile19 # avoid circular dependencies
/freebsd/cddl/usr.sbin/dtrace/tests/common/struct/
H A DMakefile11 err.D_DECL_INCOMPLETE.circular.d \
/freebsd/contrib/ntp/sntp/libevent/compat/sys/
H A Dqueue.h40 * lists, simple queues, tail queues, and circular queues.
376 * Circular queue definitions.
394 * Circular queue access methods
415 * Circular queue functions.
/freebsd/contrib/libevent/compat/sys/
H A Dqueue.h40 * lists, simple queues, tail queues, and circular queues.
376 * Circular queue definitions.
394 * Circular queue access methods
415 * Circular queue functions.
/freebsd/contrib/less/
H A Dtags.c610 static int circular = 0; /* 1: circular tag structure */
628 if (!circular) in nextgtag()
657 if (!circular) in prevgtag()
609 static int circular = 0; /* 1: circular tag structure */ global() variable
/freebsd/sbin/dmesg/
H A Ddmesg.c139 /* Unwrap the circular buffer to start from the oldest data. */ in main()
163 * The message buffer is circular, but has been unwrapped so that in main()
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DRDFGraph.h51 // circular list, which is yet another consequence of the effort to save
54 // ways to accomplish that, but the circular list seemed the most natural.
100 // To get a full picture, the circular lists connecting blocks within a
146 // The circular lists are not explicit in the dump.
501 // Insert node NA after "this" in the circular chain.
512 NodeId Next; // Id of the next node in the circular chain.
914 // Get the "Next" reference in the circular list that references RR and in getNextRef()

12345678910>>...12