HomeSort by: relevance | last modified time | path
    Searched defs:iq (Results 1 - 25 of 25) sorted by relevancy

  /src/lib/libm/src/
k_rem_pio2.c 119 * iq[] integer array by breaking up q[] in 24-bits chunk.
302 int32_t jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih; local
332 /* distill q[] into iq[] reversingly */
335 iq[i] = (int32_t)(z-two24*fw);
345 if(q0>0) { /* need iq[jz-1] to determine n */
346 i = (iq[jz-1]>>(24-q0)); n += i;
347 iq[jz-1] -= i<<(24-q0);
348 ih = iq[jz-1]>>(23-q0);
350 else if(q0==0) ih = iq[jz-1]>>23;
356 j = iq[i]
    [all...]
k_rem_pio2f.c 53 int32_t jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih; local
83 /* distill q[] into iq[] reversingly */
86 iq[i] = (int32_t)(z-two8*fw);
96 if(q0>0) { /* need iq[jz-1] to determine n */
97 i = (iq[jz-1]>>(8-q0)); n += i;
98 iq[jz-1] -= i<<(8-q0);
99 ih = iq[jz-1]>>(7-q0);
101 else if(q0==0) ih = iq[jz-1]>>8;
107 j = iq[i];
110 carry = 1; iq[i] = 0x100- j
    [all...]
  /src/sys/arch/arm/at91/
at91aic.c 129 struct intrq *iq; local
136 iq = &intrq[irq];
138 for (ih = TAILQ_FIRST(&iq->iq_list); ih != NULL;
141 iq->iq_levels = levels;
174 iq = &intrq[irq];
175 if (TAILQ_FIRST(&iq->iq_list) != NULL)
242 struct intrq *iq; local
251 iq = &intrq[i];
252 TAILQ_INIT(&iq->iq_list);
254 snprintf(iq->iq_name, sizeof(iq->iq_name), "irq %d", i)
281 struct intrq* iq; local
352 struct intrq* iq = &intrq[ih->ih_irq]; local
409 struct intrq* iq; local
    [all...]
  /src/sys/arch/arm/ep93xx/
ep93xx_intr.c 116 struct intrq *iq; local
123 iq = &intrq[irq];
125 for (ih = TAILQ_FIRST(&iq->iq_list); ih != NULL;
128 iq->iq_levels = levels;
185 iq = &intrq[irq];
186 if (TAILQ_FIRST(&iq->iq_list) != NULL)
188 for (ih = TAILQ_FIRST(&iq->iq_list); ih != NULL;
193 iq->iq_vic1_mask = vic1_irqs;
194 iq->iq_vic2_mask = vic2_irqs;
249 struct intrq *iq; local
278 struct intrq *iq; local
292 struct intrq* iq; local
321 struct intrq* iq = &intrq[ih->ih_irq]; local
335 struct intrq* iq; local
    [all...]
  /src/sys/arch/arm/footbridge/
footbridge_irqhandler.c 111 struct intrq *iq; local
118 iq = &footbridge_intrq[irq];
120 TAILQ_FOREACH(ih, &iq->iq_list, ih_list) {
123 iq->iq_levels = levels;
154 for (irq = 0, iq = footbridge_intrq; irq < NIRQ; irq++, iq++) {
156 if (!TAILQ_EMPTY(&iq->iq_list)) {
158 TAILQ_FOREACH(ih, &iq->iq_list, ih_list) {
162 iq->iq_mask = irqs;
188 struct intrq *iq; local
209 struct intrq *iq; local
223 struct intrq *iq; local
260 struct intrq *iq = &footbridge_intrq[ih->ih_irq]; local
282 struct intrq *iq; local
    [all...]
  /src/sys/arch/arm/footbridge/isa/
isa_machdep.c 184 struct intrq *iq; local
190 iq = &isa_intrq[irq];
191 for (ih = TAILQ_FIRST(&iq->iq_list); ih != NULL;
194 iq->iq_levels = levels;
212 iq = &isa_intrq[irq];
213 for (ih = TAILQ_FIRST(&iq->iq_list); ih != NULL;
216 iq->iq_mask = irqs;
254 struct intrq *iq; local
276 iq = &isa_intrq[i];
277 switch(iq->iq_ist)
334 struct intrq *iq; local
399 struct intrq *iq = &isa_intrq[ih->ih_irq]; local
429 struct intrq *iq; local
506 struct intrq *iq; local
    [all...]
  /src/sys/arch/arm/ixp12x0/
ixp12x0_intr.c 170 struct intrq *iq; local
177 iq = &intrq[irq];
179 for (ih = TAILQ_FIRST(&iq->iq_list); ih != NULL;
182 iq->iq_levels = levels;
242 iq = &intrq[irq];
243 if (TAILQ_FIRST(&iq->iq_list) != NULL)
245 for (ih = TAILQ_FIRST(&iq->iq_list); ih != NULL;
250 iq->iq_mask = irqs;
251 iq->iq_pci_mask = pci_irqs;
306 struct intrq *iq; local
333 struct intrq* iq; local
366 struct intrq* iq = &intrq[ih->ih_ipl]; local
378 struct intrq* iq; local
    [all...]
  /src/sys/arch/arm/xscale/
becc_icu.c 167 struct intrq *iq; local
174 iq = &intrq[irq];
176 for (ih = TAILQ_FIRST(&iq->iq_list); ih != NULL;
179 iq->iq_levels = levels;
209 iq = &intrq[irq];
210 if (TAILQ_FIRST(&iq->iq_list) != NULL)
212 for (ih = TAILQ_FIRST(&iq->iq_list); ih != NULL;
215 iq->iq_mask = irqs;
267 struct intrq *iq; local
273 iq = &intrq[i]
289 struct intrq *iq; local
322 struct intrq *iq = &intrq[ih->ih_irq]; local
337 struct intrq *iq; local
    [all...]
i80321_icu.c 165 struct intrq *iq; local
177 iq = &intrq[irq];
178 TAILQ_FOREACH(ih, &iq->iq_list, ih_list)
194 iq = &intrq[irq];
195 if (!TAILQ_EMPTY(&iq->iq_list))
244 struct intrq *iq; local
250 iq = &intrq[i];
251 TAILQ_INIT(&iq->iq_list);
264 struct intrq *iq = &intrq[i]; local
265 evcnt_attach_dynamic(&iq->iq_ev, EVCNT_TYPE_INTR
274 struct intrq *iq; local
307 struct intrq *iq = &intrq[ih->ih_irq]; local
353 struct intrq *iq; local
    [all...]
ixp425_intr.c 192 struct intrq *iq; local
199 iq = &intrq[irq];
201 for (ih = TAILQ_FIRST(&iq->iq_list); ih != NULL;
204 iq->iq_levels = levels;
248 iq = &intrq[irq];
249 if (TAILQ_FIRST(&iq->iq_list) != NULL)
251 for (ih = TAILQ_FIRST(&iq->iq_list); ih != NULL;
254 iq->iq_mask = irqs;
301 struct intrq *iq; local
307 iq = &intrq[i]
322 struct intrq *iq; local
335 struct intrq *iq; local
372 struct intrq *iq = &intrq[ih->ih_irq]; local
387 struct intrq *iq; local
    [all...]
  /src/sys/arch/evbarm/ifpga/
ifpga_intr.c 143 struct intrq *iq; local
150 iq = &intrq[irq];
152 for (ih = TAILQ_FIRST(&iq->iq_list); ih != NULL;
155 iq->iq_levels = levels;
185 iq = &intrq[irq];
186 if (TAILQ_FIRST(&iq->iq_list) != NULL)
188 for (ih = TAILQ_FIRST(&iq->iq_list); ih != NULL;
191 iq->iq_mask = irqs;
225 struct intrq *iq; local
231 iq = &intrq[i]
251 struct intrq *iq; local
284 struct intrq *iq = &intrq[ih->ih_irq]; local
299 struct intrq *iq; local
    [all...]
  /src/sys/arch/evbarm/iq80310/
iq80310_intr.c 147 struct intrq *iq; local
154 iq = &intrq[irq];
156 for (ih = TAILQ_FIRST(&iq->iq_list); ih != NULL;
159 iq->iq_levels = levels;
240 iq = &intrq[irq];
241 if (TAILQ_FIRST(&iq->iq_list) != NULL)
243 for (ih = TAILQ_FIRST(&iq->iq_list); ih != NULL;
246 iq->iq_mask = irqs;
326 struct intrq *iq; local
337 iq = &intrq[i]
356 struct intrq *iq; local
369 struct intrq *iq; local
402 struct intrq *iq = &intrq[ih->ih_irq]; local
417 struct intrq *iq; local
    [all...]
  /src/external/gpl3/gcc/dist/libquadmath/math/
rem_pio2q.c 115 * iq[] integer array by breaking up q[] in 24-bits chunk.
156 int32_t jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih; local
180 /* distill q[] into iq[] reversingly */
183 iq[i] = (int32_t)(z-two24*fw);
193 if(q0>0) { /* need iq[jz-1] to determine n */
194 i = (iq[jz-1]>>(24-q0)); n += i;
195 iq[jz-1] -= i<<(24-q0);
196 ih = iq[jz-1]>>(23-q0);
198 else if(q0==0) ih = iq[jz-1]>>23;
204 j = iq[i]
    [all...]
  /src/external/gpl3/gcc.old/dist/libquadmath/math/
rem_pio2q.c 115 * iq[] integer array by breaking up q[] in 24-bits chunk.
156 int32_t jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih; local
179 /* distill q[] into iq[] reversingly */
182 iq[i] = (int32_t)(z-two24*fw);
192 if(q0>0) { /* need iq[jz-1] to determine n */
193 i = (iq[jz-1]>>(24-q0)); n += i;
194 iq[jz-1] -= i<<(24-q0);
195 ih = iq[jz-1]>>(23-q0);
197 else if(q0==0) ih = iq[jz-1]>>23;
203 j = iq[i]
    [all...]
  /src/external/bsd/unbound/dist/ipsecmod/
ipsecmod.c 104 struct ipsecmod_qstate* iq = (struct ipsecmod_qstate*)regional_alloc( local
106 qstate->minfo[id] = iq;
107 if(!iq)
110 memset(iq, 0, sizeof(*iq));
111 iq->enabled = qstate->env->cfg->ipsecmod_enabled;
112 iq->is_whitelisted = ipsecmod_domain_is_whitelisted(
244 * @param iq: ipsecmod qstate.
249 call_hook(struct module_qstate* qstate, struct ipsecmod_qstate* iq,
291 rrset_data = (struct packed_rrset_data*)iq->ipseckey_rrset->entry.data
517 struct ipsecmod_qstate* iq = (struct ipsecmod_qstate*)qstate->minfo[id]; local
    [all...]
  /src/external/bsd/unbound/dist/ipset/
ipset.c 392 struct ipset_qstate *iq = (struct ipset_qstate *)regional_alloc( local
394 qstate->minfo[id] = iq;
395 if (!iq) {
399 memset(iq, 0, sizeof(*iq));
409 struct ipset_qstate *iq = (struct ipset_qstate *)qstate->minfo[id]; local
412 if (iq) {
417 if ((event == module_event_new || event == module_event_pass) && !iq) {
422 iq = (struct ipset_qstate*)qstate->minfo[id];
425 if (iq && (event == module_event_pass || event == module_event_new))
469 struct cachedb_qstate *iq; local
    [all...]
  /src/external/bsd/unbound/dist/cachedb/
cachedb.c 292 struct cachedb_qstate* iq = (struct cachedb_qstate*)regional_alloc( local
294 qstate->minfo[id] = iq;
295 if(!iq)
297 memset(iq, 0, sizeof(*iq));
783 * @param iq: query state specific for this module. per-query.
789 struct cachedb_qstate* ATTR_UNUSED(iq),
876 * @param iq: query state specific for this module. per-query.
882 struct cachedb_qstate* ATTR_UNUSED(iq), struct cachedb_env* ie, int id)
909 struct cachedb_qstate* iq = (struct cachedb_qstate*)qstate->minfo[id] local
965 struct cachedb_qstate* iq; local
    [all...]
  /src/external/bsd/unbound/dist/dns64/
dns64.c 575 struct dns64_qstate* iq = (struct dns64_qstate*)qstate->minfo[id]; local
579 if(iq && iq->state == DNS64_NEW_QUERY
587 if(iq && iq->state == DNS64_NEW_QUERY &&
598 if(iq && iq->state == DNS64_SUBQUERY_FINISHED)
619 struct dns64_qstate* iq = (struct dns64_qstate*)qstate->minfo[id]; local
638 (!iq || iq->state != DNS64_INTERNAL_QUERY) &
685 struct dns64_qstate* iq; local
    [all...]
  /src/sys/arch/m68k/m68k/
db_disasm.c 2001 int iq, hr; local
2006 iq = BITFIELD(ext,14,12);
2018 if (IS_INST(DIVSL,opc) && !ISBITSET(ext,10) && iq != hr)
2026 (iq != hr && IS_INST(DIVSL,opc))) {
2034 PRINT_DREG(dbuf, iq);
  /src/external/bsd/unbound/dist/iterator/
iterator.c 84 static void target_count_increase_nx(struct iter_qstate* iq, int num);
130 struct iter_qstate* iq = (struct iter_qstate*)regional_alloc( local
132 qstate->minfo[id] = iq;
133 if(!iq)
135 memset(iq, 0, sizeof(*iq));
136 iq->state = INIT_REQUEST_STATE;
137 iq->final_state = FINISHED_STATE;
138 iq->an_prepend_list = NULL;
139 iq->an_prepend_last = NULL
3759 struct iter_qstate* iq = (struct iter_qstate*)qstate->minfo[id]; local
3816 struct iter_qstate* iq = (struct iter_qstate*)qstate->minfo[id]; local
4055 struct iter_qstate* iq = (struct iter_qstate*)qstate->minfo[id]; local
4485 struct iter_qstate* iq = (struct iter_qstate*)qstate->minfo[id]; local
4529 struct iter_qstate* iq; local
    [all...]
  /src/sys/dev/pci/igc/
if_igc.c 658 for (int iq = 0; iq < sc->sc_nqueues; iq++, txconf++) {
659 struct tx_ring *txr = &sc->tx_rings[iq];
665 txr->txr_igcq = &sc->queues[iq];
666 txr->me = iq;
683 for (int iq = 0; iq < sc->sc_nqueues; iq++, rxconf++) {
684 struct rx_ring *rxr = &sc->rx_rings[iq];
1200 int iq, error; local
1297 struct igc_queue *iq = sc->queues; local
1346 struct igc_queue *iq = sc->queues; local
2756 struct igc_queue *iq = arg; local
2792 struct igc_queue *iq = &sc->queues[0]; local
2862 struct igc_queue *iq = arg; local
2899 struct igc_queue *iq = local
    [all...]
  /src/external/gpl3/gcc/dist/gcc/
dwarf2cfi.cc 1269 size_t iq;
1271 FOR_EACH_VEC_ELT (queued_reg_saves, iq, q)
1266 size_t iq; local
  /src/external/gpl3/gcc.old/dist/gcc/
dwarf2cfi.cc 1269 size_t iq;
1271 FOR_EACH_VEC_ELT (queued_reg_saves, iq, q)
1266 size_t iq; local
  /src/sys/dev/ic/
athnvar.h 375 struct athn_iq_cal iq[AR_MAX_CHAINS]; member in struct:athn_calib
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
AMDGPUISelLowering.cpp 1728 // int iq = (int)fq;
1729 SDValue iq = DAG.getNode(ToInt, DL, IntVT, fq); local
1745 // dst = iq + jq;
1746 SDValue Div = DAG.getNode(ISD::ADD, DL, VT, iq, jq);

Completed in 56 milliseconds