HomeSort by: relevance | last modified time | path
    Searched refs:le2 (Results 1 - 11 of 11) sorted by relevancy

  /src/external/cddl/osnet/dist/tools/ctf/common/
list.c 86 list_t *le, **le2; local
92 for (le = *list, le2 = list; le; le2 = &le->l_next, le = le->l_next) {
94 *le2 = le->l_next;
  /src/external/lgpl3/gmp/dist/mpn/arm/
mod_34lsub1.asm 61 blt L(le2) C n <= 2
114 L(le2): cmn n, #1
aorslsh1_n.asm 92 blt L(le2) C carry clear on branch path
138 L(le2): tst n, #1 C n = {-1,-2,-3} map to [2], [1], [0]
  /src/external/lgpl3/gmp/dist/mpn/arm/v7a/cora17/
mod_34lsub1.asm 61 blt L(le2) C n <= 2
111 L(le2): cmn n, #1
  /src/external/lgpl3/gmp/dist/mpn/arm64/
mod_34lsub1.asm 67 b.lt L(le2) C n <= 2
115 L(le2): cmn n, #1
  /src/external/lgpl3/gmp/dist/mpn/x86_64/fastsse/
lshift.asm 83 jle L(le2)
159 L(le2): jne L(end8)
lshiftc.asm 86 jle L(le2)
167 L(le2): jne L(end8)
  /src/external/cddl/osnet/dist/tools/ctf/cvt/
tdata.c 281 labelent_t *le2 = arg2; local
282 return (le1->le_idx - le2->le_idx);
  /src/external/cddl/osnet/dist/uts/common/fs/zfs/
zap_leaf.c 723 struct zap_leaf_entry *le2; local
732 *chunkp != CHAIN_END; chunkp = &le2->le_next) {
733 le2 = ZAP_LEAF_ENTRY(l, *chunkp);
734 if (le2->le_cd > le->le_cd)
  /src/sys/ufs/chfs/
ebh.c 57 int ltree_entry_cmp(struct chfs_ltree_entry *le1, struct chfs_ltree_entry *le2);
545 struct chfs_ltree_entry *le2)
547 return (le1->lnr - le2->lnr);
  /src/external/lgpl3/gmp/dist/mpn/x86_64/k8/
redc_1.asm 300 L(le2): add %r10, (up)

Completed in 55 milliseconds