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

1 2 3 4 5 6

  /src/sys/external/bsd/drm2/linux/
linux_dma_fence_chain.c 35 #include <linux/dma-fence-chain.h>
44 * dma_fence_chain_init(chain, prev, fence, seqno)
46 * Initialize a fence chain node. If prev was already a chain,
47 * extend it; otherwise; create a new chain context.
50 dma_fence_chain_init(struct dma_fence_chain *chain, struct dma_fence *prev,
56 spin_lock_init(&chain->dfc_lock);
57 chain->dfc_prev = prev; /* consume caller's reference */
58 chain->dfc_fence = fence; /* consume caller's reference */
59 init_irq_work(&chain->dfc_irq_work, &dma_fence_chain_irq_work)
93 struct dma_fence_chain *chain = container_of(work, local in function:dma_fence_chain_irq_work
104 struct dma_fence_chain *chain = container_of(cb, local in function:dma_fence_chain_callback
114 struct dma_fence_chain *chain = to_dma_fence_chain(fence); local in function:dma_fence_chain_enable_signaling
158 struct dma_fence_chain *chain = to_dma_fence_chain(fence); local in function:dma_fence_chain_release
247 struct dma_fence_chain *chain, *prev_chain; local in function:dma_fence_chain_walk
291 struct dma_fence_chain *chain; local in function:dma_fence_chain_find_seqno
    [all...]
  /src/usr.bin/make/unit-tests/
var-scope-local.exp 1 Global: .ALLTARGETS = all target-rule.ext dir/subdir/target-rule.ext target-rule.ir-gen-from dir/subdir/target-rule-dir.ir-gen-from inference-rule.ir-to dir/subdir/inference-rule.ir-to inference-rule.ir-from dir/subdir/inference-rule.ir-from inference-rule-chain.ir-to dir/subdir/inference-rule-chain.ir-to inference-rule-chain.ir-gen-from dir/subdir/inference-rule-chain.ir-gen-from one
2 Global: .ALLTARGETS = all target-rule.ext dir/subdir/target-rule.ext target-rule.ir-gen-from dir/subdir/target-rule-dir.ir-gen-from inference-rule.ir-to dir/subdir/inference-rule.ir-to inference-rule.ir-from dir/subdir/inference-rule.ir-from inference-rule-chain.ir-to dir/subdir/inference-rule-chain.ir-to inference-rule-chain.ir-gen-from dir/subdir/inference-rule-chain.ir-gen-from one two
40 inference-rule-chain.ir-from: @ = <inference-rule-chain.ir-from
    [all...]
  /src/sys/external/bsd/drm2/dist/drm/i915/gem/
i915_gem_fence.c 18 struct i915_sw_fence chain; member in struct:stub_fence
24 struct stub_fence *stub = container_of(fence, typeof(*stub), chain);
53 i915_sw_fence_fini(&stub->chain);
77 i915_sw_fence_init(&stub->chain, stub_notify);
82 if (i915_sw_fence_await_reservation(&stub->chain,
102 i915_sw_fence_commit(&stub->chain);
  /src/sys/external/bsd/drm2/dist/drm/i915/
i915_sw_fence_work.h 30 struct i915_sw_fence chain; member in struct:dma_fence_work
43 i915_sw_fence_commit(&f->chain);
i915_sw_fence_work.c 37 struct dma_fence_work *f = container_of(fence, typeof(*f), chain);
76 i915_sw_fence_fini(&f->chain);
95 i915_sw_fence_init(&f->chain, fence_notify);
104 return __i915_sw_fence_await_dma_fence(&f->chain, signal, &f->cb);
  /src/usr.sbin/mlxctl/
extern.h 48 SIMPLEQ_ENTRY(mlx_disk) chain;
dklist.c 111 SIMPLEQ_FOREACH(md, &mlx_disks, chain)
124 SIMPLEQ_FOREACH(md, &mlx_disks, chain)
137 SIMPLEQ_INSERT_TAIL(&mlx_disks, md, chain);
  /src/sys/arch/acorn32/doc/
interrupts 44 interrupt serviced but pass on down the chain
45 1 - interrupt serviced do not pass on down the chain
48 the chain of attached interrupt handlers.
52 Passing it on down the chain may result in the stray interrupt handler
55 the chain. These are interrupt which may commonly have multiple drivers
  /src/sys/arch/riscv/riscv/
bus_stubs.c 64 bus_dmamap_load_mbuf(bus_dma_tag_t t, bus_dmamap_t dmam, struct mbuf *chain,
67 kasan_dma_load(dmam, chain, 0, KASAN_DMA_MBUF);
68 return (*t->_dmamap_load_mbuf)(t, dmam, chain, flags);
  /src/sys/arch/amiga/dev/
siop2.c 242 TAILQ_REMOVE(&sc->free_list, acb, chain);
265 TAILQ_INSERT_TAIL(&sc->ready_list, acb, chain);
364 for (acb = sc->ready_list.tqh_first; acb; acb = acb->chain.tqe_next) {
370 TAILQ_REMOVE(&sc->ready_list, acb, chain);
443 } else if (sc->ready_list.tqh_last == &acb->chain.tqe_next) {
444 TAILQ_REMOVE(&sc->ready_list, acb, chain);
449 acb2 = acb2->chain.tqe_next)
451 TAILQ_REMOVE(&sc->nexus_list, acb, chain);
459 else if (acb->chain.tqe_next) {
460 TAILQ_REMOVE(&sc->ready_list, acb, chain);
    [all...]
siop.c 255 TAILQ_REMOVE(&sc->free_list, acb, chain);
279 TAILQ_INSERT_TAIL(&sc->ready_list, acb, chain);
379 for (acb = sc->ready_list.tqh_first; acb; acb = acb->chain.tqe_next) {
385 TAILQ_REMOVE(&sc->ready_list, acb, chain);
458 } else if (sc->ready_list.tqh_last == &acb->chain.tqe_next) {
459 TAILQ_REMOVE(&sc->ready_list, acb, chain);
464 acb2 = acb2->chain.tqe_next)
466 TAILQ_REMOVE(&sc->nexus_list, acb, chain);
474 else if (acb->chain.tqe_next) {
475 TAILQ_REMOVE(&sc->ready_list, acb, chain);
    [all...]
  /src/sys/external/bsd/drm2/dist/include/drm/
drm_syncobj.h 32 #include <linux/dma-fence-chain.h>
119 struct dma_fence_chain *chain,
  /src/sys/kern/
kern_uidinfo.c 139 uint64_t chain; local in function:uid_stats
150 chain = 0;
153 chain++;
155 if (chain > 0) {
157 hs->hash_items += chain;
158 if (chain > hs->hash_maxchain)
159 hs->hash_maxchain = chain;
  /src/sys/dev/raidframe/
rf_psstatus.c 101 * malloc up hash chain entries.
128 if (pssTable[i].chain) {
129 printf("ERROR: pss hash chain not null at recon shutdown\n");
157 RF_ReconParityStripeStatus_t *p, *pssPtr = hdr->chain;
166 p->next = hdr->chain;
167 hdr->chain = p;
196 * chain is ALREADY LOCKED.
203 RF_ReconParityStripeStatus_t *p = hdr->chain, *pt = NULL;
210 hdr->chain = p->next;
235 for (pt = NULL, p = hdr->chain; p; pt = p, p = p->next)
    [all...]
  /src/sys/arch/arm/arm/
bus_stubs.c 73 bus_dmamap_load_mbuf(bus_dma_tag_t t, bus_dmamap_t dmam, struct mbuf *chain,
76 kasan_dma_load(dmam, chain, 0, KASAN_DMA_MBUF);
77 return (*t->_dmamap_load_mbuf)(t, dmam, chain, flags);
  /src/lib/libc/stdlib/
hcreate.c 201 struct internal_head *table, *chain; local in function:hsearch_r
216 chain = &table[hashval & (head->size - 1)];
217 ie = SLIST_FIRST(chain);
239 SLIST_INSERT_HEAD(chain, ie, link);
  /src/sys/dev/ic/
adv.h 48 TAILQ_ENTRY(adv_ccb) chain;
adw.h 66 TAILQ_ENTRY(adw_ccb) chain;
  /src/usr.sbin/acpitools/aml/
aml_name.h 47 struct aml_name *chain; member in struct:aml_name
  /src/sys/dev/isa/
seagate.c 177 TAILQ_ENTRY(sea_scb) chain;
313 scb = scb->chain.tqe_next, issued++);
315 scb = scb->chain.tqe_next, disconnected++);
549 TAILQ_INSERT_TAIL(&sea->free_list, &sea->scb[i], chain);
667 TAILQ_REMOVE(&sea->free_list, scb, chain);
685 TAILQ_INSERT_TAIL(&sea->ready_list, scb, chain);
725 scb = scb->chain.tqe_next) {
731 TAILQ_REMOVE(&sea->ready_list, scb, chain);
768 scb, chain);
815 TAILQ_INSERT_TAIL(&sea->free_list, scb, chain);
    [all...]
  /src/sys/netipsec/
keydb.h 84 /* SA chain */
159 LIST_ENTRY(secreg) chain;
167 LIST_ENTRY(secacq) chain;
  /src/sys/arch/newsmips/dev/
sc_wrap.c 120 TAILQ_INSERT_TAIL(&sc->free_list, scb, chain);
150 TAILQ_INSERT_HEAD(&sc->free_list, scb, chain);
156 if (scb->chain.tqe_next == 0)
174 TAILQ_REMOVE(&sc->free_list, scb, chain);
212 TAILQ_INSERT_TAIL(&sc->ready_list, scb, chain);
288 scb = scb->chain.tqe_next;
342 nextscb = scb->chain.tqe_next;
344 TAILQ_REMOVE(&sc->ready_list, scb, chain);
  /src/usr.sbin/lockstat/
main.c 77 TAILQ_ENTRY(lockstruct) chain;
579 TAILQ_INSERT_TAIL(&freelist, lp, chain);
620 TAILQ_CONCAT(&freelist, &locklist, chain);
645 TAILQ_REMOVE(&freelist, l, chain);
654 TAILQ_INSERT_TAIL(&sortlist, l, chain);
687 TAILQ_REMOVE(&sortlist, l, chain);
724 l2 = TAILQ_NEXT(l2, chain);
727 TAILQ_INSERT_TAIL(&locklist, l, chain);
729 TAILQ_INSERT_BEFORE(l2, l, chain);
760 TAILQ_FOREACH(l, &locklist, chain) {
    [all...]
  /src/bin/sh/
output.h 49 struct output *chain; member in struct:output
  /src/lib/libc/arch/or1k/gen/
swapcontext.S 48 l.sw CALLFRAME_SP(r1),r1 # set up stack chain

Completed in 36 milliseconds

1 2 3 4 5 6