Searched refs:bcc (Results 1 – 20 of 20) sorted by relevance
96 u8 bcc; member 103 u8 bcc; member 367 sel_req->bcc = sdd_res->bcc; in digital_in_send_sel_req() 394 u8 i, bcc; in digital_in_recv_sdd_res() local 410 for (i = 0, bcc = 0; i < 4; i++) in digital_in_recv_sdd_res() 411 bcc ^= sdd_res->nfcid1[i]; in digital_in_recv_sdd_res() 413 if (bcc != sdd_res->bcc) { in digital_in_recv_sdd_res() 1002 sdd_res->bcc in digital_tg_send_sdd_res() [all...]
69 bcc .Lno_insw_295 bcc 1f
80 bcc 1b134 bcc 7b
56 bcc .Lno_outsw_2
218 bcc Ldiv0246 bcc Ldiv0
142 CALGN( bcc 15f )
192 CALGN( bcc 15f )
36 bcc 2b74 bcc 2b100 bcc 2b179 bcc 2b
136 bcc .Lbyte_even
143 unsigned long bcc; long fill_00[3]; /* Backup Cache Control */ member
214 bcc .Lloop
56 bcc 0f @ If not, switch to the IRQ stack745 bcc kuser_cmpxchg32_fixup
522 bcc .Lenc_done591 bcc .Ldec_done875 bcc 4f // have to reload prev if R5 < 16
463 bcc .Lctrcarrydone
337 bcc LOGNEAR1 | ...BOUNDS IS ROUGHLY [15/16, 17/16]
118 bcc truncate |if (g=1) then
71 bcc 1b
136 <https://github.com/iovisor/bcc/>`_ is one of the solutions for BPF
400 bcc ldd2nd # no carry, do next quotient digit
348 /* check that bcc is at least as big as parms + data, and that it is in validate_t2() 3521 u16 bcc; in validate_ntransact() local 3531 bcc = get_bcc(&pSMBr->hdr); in validate_ntransact() 3532 end_of_smb = 2 /* sizeof byte count */ + bcc + in validate_ntransact() 3558 } else if (parm_count + data_count > bcc) { in validate_ntransact() 5931 /* check that length of list is not more than bcc */ in CIFSSMBQAllEAs() 5937 /* BB check if start of smb + data_offset > &bcc+ bcc */ in CIFSSMBQAllEAs()