Searched refs:depth (Results 1 - 5 of 5) sorted by relevance

/broadcom-cfe-1.4.2/cfe/arch/mips/cpu/bcm1480/src/
H A Dbcm1480_irq.c192 int depth; member in struct:irq_desc_s
221 p->depth = 0;
295 /* If depth is 0, unmask the interrupt. Increment depth. */
308 if (desc->depth == 0) {
315 desc->depth++;
320 /* Decrement depth. If depth is 0, mask the interrupt. */
333 desc->depth--;
334 if (desc->depth
[all...]
/broadcom-cfe-1.4.2/cfe/arch/mips/cpu/bcmcore/src/
H A Dbcmcore_irq.c100 int depth; member in struct:irq_desc_s
255 p->depth = 0;
312 /* If depth is 0, unmask the interrupt. Increment depth. */
325 if (desc->depth == 0) {
329 desc->depth++;
335 /* Decrement depth. If depth is 0, mask the interrupt. */
348 desc->depth--;
349 if (desc->depth
[all...]
/broadcom-cfe-1.4.2/cfe/arch/mips/cpu/sb1250/src/
H A Dsb1250_irq.c180 int depth; member in struct:irq_desc_s
208 p->depth = 0;
263 /* If depth is 0, unmask the interrupt. Increment depth. */
276 if (desc->depth == 0) {
280 desc->depth++;
285 /* Decrement depth. If depth is 0, mask the interrupt. */
298 desc->depth--;
299 if (desc->depth
[all...]
/broadcom-cfe-1.4.2/cfe/zlib/
H A Dtrees.c443 * Compares to subtrees, using the tree depth as tie breaker when
446 #define smaller(tree, n, m, depth) \
448 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
466 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
470 if (smaller(tree, v, s->heap[j], s->depth)) break;
640 s->depth[n] = 0;
654 s->depth[node] = 0;
678 s->depth[node] = (uch) (MAX(s->depth[
[all...]
H A Ddeflate.h197 uch depth[2*L_CODES+1]; member in struct:internal_state

Completed in 39 milliseconds