Searched refs:ltab (Results 1 - 7 of 7) sorted by relevance
/linux-master/fs/ubifs/ |
H A D | lpt_commit.c | 132 lnum, c->ltab[lnum - c->lpt_first].free, 133 c->ltab[lnum - c->lpt_first].dirty, free, dirty); 135 c->ltab[lnum - c->lpt_first].free = free; 136 c->ltab[lnum - c->lpt_first].dirty += dirty; 144 * This function finds the next empty LEB in the ltab starting from @lnum. If a 155 if (c->ltab[i].tgc || c->ltab[i].cmt) 157 if (c->ltab[i].free == c->leb_size) { 158 c->ltab[i].cmt = 1; 165 if (c->ltab[ [all...] |
H A D | lpt.c | 13 * contains the LEB properties tree, a table of LPT area eraseblocks (ltab), and 140 /* Verify that ltab fits in a single LEB (since ltab is a single node */ 142 ubifs_err(c, "LPT ltab too big"); 204 ubifs_err(c, "LPT ltab too big"); 403 * @ltab: LPT's own lprops table to pack 406 struct ubifs_lpt_lprops *ltab) 414 pack_bits(c, &addr, &pos, ltab[i].free, c->lpt_spc_bits); 415 pack_bits(c, &addr, &pos, ltab[i].dirty, c->lpt_spc_bits); 457 lnum, dirty, c->ltab[lnu 405 ubifs_pack_ltab(struct ubifs_info *c, void *buf, struct ubifs_lpt_lprops *ltab) argument 607 struct ubifs_lpt_lprops *ltab = NULL; local [all...] |
H A D | debug.c | 820 pr_err("\tLPT ltab is at %d:%d\n", c->ltab_lnum, c->ltab_offs); 826 i + c->lpt_first, c->ltab[i].free, c->ltab[i].dirty, 827 c->ltab[i].tgc, c->ltab[i].cmt);
|
H A D | ubifs.h | 248 * LTAB_DIRTY: ltab node is dirty 1216 * @lpt_drty_flgs: dirty flags for LPT special nodes e.g. ltab 1238 * @ltab: LPT's own lprops table 1490 struct ubifs_lpt_lprops *ltab; member in struct:ubifs_info 1981 struct ubifs_lpt_lprops *ltab);
|
H A D | sb.c | 857 int free = c->ltab[lnum - c->lpt_first].free;
|
/linux-master/arch/arm/crypto/ |
H A D | aes-cipher-core.S | 102 .macro do_crypt, round, ttab, ltab, bsz 158 2: .ifb \ltab 161 mov_l ttab, \ltab
|
/linux-master/arch/arm64/crypto/ |
H A D | aes-cipher-core.S | 84 .macro do_crypt, round, ttab, ltab, bsz 112 3: adr_l tt, \ltab
|
Completed in 168 milliseconds