| /darwin-on-arm/xnu/libkern/zlib/ |
| H A D | inftrees.h | 82 unsigned FAR *bits, unsigned short FAR *work));
|
| H A D | inftrees.c | 50 whose indices are 0..2^bits-1. work is a writable array of at least
51 lens shorts, which is used as a work area. type is the type of code
59 int inflate_table(type, lens, codes, table, bits, work)
65 unsigned short FAR *work;
123 table. The sorted table is work[], with that space being provided by
174 if (lens[sym] != 0) work[offs[lens[sym]]++] = (unsigned short)sym;
211 base = extra = work; /* dummy value--not used */
246 if ((int)(work[sym]) < end) {
248 this.val = work[sym];
250 else if ((int)(work[sy
[all...] |
| H A D | inflate.h | 140 unsigned short work[288]; /* work area for code table building */ member in struct:inflate_state
|
| H A D | infback.c | 124 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
131 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
409 &(state->lenbits), state->work);
475 &(state->lenbits), state->work);
484 &(state->next), &(state->distbits), state->work);
|
| H A D | inflate.c | 256 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
263 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
896 &(state->lenbits), state->work);
962 &(state->lenbits), state->work);
971 &(state->next), &(state->distbits), state->work);
|
| /darwin-on-arm/xnu/tools/tests/execperf/ |
| H A D | run.c | 16 void *work(void *);
35 ret = pthread_create(&threads[i], NULL, work, (void *)(intptr_t)count);
57 void *work(void *arg) function
|
| /darwin-on-arm/xnu/iokit/Kernel/ |
| H A D | IODMAEventSource.cpp | 135 bool work, again; local
138 work = !queue_empty(&dmaCommandsCompleted);
139 if (work) {
147 if (work) {
|
| H A D | IOServicePMPrivate.h | 664 virtual bool init( IOService * inOwner, Action work, Action retire );
668 static IOPMWorkQueue * create( IOService * inOwner, Action work, Action retire );
|
| H A D | IOServicePM.cpp | 754 // The rest of the work is performed async.
915 // block on the PM work loop.
922 // work from the PM work loop.
1145 // Request unblocked, work queue
1155 // The fPendingAdjustPowerRequest helps to reduce redundant parent work.
3369 // PM work loop, which can run to process acknowledgePowerChange()
5134 // Inside PM work loop's gate.
5147 // otherwise no need to signal the work loop.
6420 // Called from PM work loo
7631 create( IOService * inOwner, Action work, Action retire ) argument
7642 init( IOService * inOwner, Action work, Action retire ) argument
[all...] |
| H A D | IOPMrootDomain.cpp | 544 AbsoluteTime startTime; // time when work started
545 int depth; // work on nubs at this PM-tree depth
552 static void work( PMHaltWorker * me );
960 // events, and to handle those events on the PM work loop.
1755 // Release the lock to perform work, with busy flag set.
1788 // Submit a power event to handle those changes on the PM work loop.
2401 // Extend implementation in IOService. Running on PM work loop thread.
2418 // Called by IOService on PM work loop.
2473 // Called by IOService on PM work loop.
4260 // Running on PM work loo
6960 void PMHaltWorker::work( PMHaltWorker * me ) function in class:PMHaltWorker
[all...] |
| /darwin-on-arm/xnu/osfmk/kern/ |
| H A D | sched_grrr.c | 627 if ((group->work >= (UINT32_MAX-256)) || (rq->last_rescale_tick != grrr_rescale_tick)) {
630 group->work++;
642 * (group->work+1) / (nextgroup->work+1) > (group->weight) / (nextgroup->weight)
647 orderleft = (group->work + 1) * ((uint64_t)nextgroup->weight);
648 orderright = (nextgroup->work + 1) * ((uint64_t)group->weight);
685 runq->groups[index].work = 0;
701 rq->groups[index].work >>= 3;
|
| H A D | sched.h | 245 uint32_t work; member in struct:grrr_group
|
| /darwin-on-arm/xnu/tools/tests/affinity/ |
| H A D | pool.c | 23 * free / \ work / \
31 * There are a series of work stages. Each stage has an input and an output
39 * the work queue it is tagged with this affinity. When a consumer dequeues a
40 * work item, it sets its affinity to this tag. Hence consumer threads migrate
63 typedef struct work { struct
64 TAILQ_ENTRY(work) link;
72 * A work queue, complete with pthread objects for its management
77 TAILQ_HEAD(, work) queue;
254 * Quit if all work done.
285 DBG(" %s[%d,%d] todo %d work
[all...] |
| H A D | sets.c | 23 * free work
64 typedef struct work { struct
65 TAILQ_ENTRY(work) link;
70 * A work queue, complete with pthread objects for its management
75 TAILQ_HEAD(, work) queue;
260 DBG(" %s[%d,%d] iteration %d work %p data %p\n",
273 DBG(" %s[%d,%d] iteration %d signaling work\n",
471 DBG(" empty work item %p for set %d data %p\n",
497 * See how long the work took.
|
| /darwin-on-arm/xnu/bsd/dev/dtrace/ |
| H A D | dtrace.c | 1493 int i, work = 0;
1501 * If the dirty list is NULL, there is no dirty work to do.
1508 * any work for this CPU -- it means that there has not been
1515 work = 1;
1536 if (!work) {
1538 * We have no work to do; we can simply return.
2752 * is work to be done, it cross calls all CPUs to perform that work;
2760 int work = 0, rv;
2762 int work
[all...] |