address_translation.h File Reference

#include "ftl_config.h"
#include "nvme/nvme.h"

Include dependency graph for address_translation.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures
struct	_LOGICAL_SLICE_ENTRY
	Exactly the Virtual Slice Address. More...
struct	_LOGICAL_SLICE_MAP
	The Logical -> Virtual Slice Address mapping table. More...
struct	_VIRTUAL_SLICE_ENTRY
	Exactly the Logical Slice Address. More...
struct	_VIRTUAL_SLICE_MAP
	The Virtual -> Logical Slice mapping table. More...
struct	_VIRTUAL_BLOCK_ENTRY
	The metadata for this block. More...
struct	_VIRTUAL_BLOCK_MAP
	The block metadata table for all the blocks. More...
struct	_VIRTUAL_DIE_ENTRY
	The metadata for this die. More...
struct	_VIRTUAL_DIE_MAP
	The metadata table for all user dies. More...
struct	_FRRE_BLOCK_ALLOCATION_LIST
struct	_BAD_BLOCK_TABLE_INFO_ENTRY
	The bad block table for this die. More...
struct	_BAD_BLOCK_TABLE_INFO_MAP
	The bad block tables. More...
struct	_PHY_BLOCK_ENTRY
	The metadata of the physical block. More...
struct	_PHY_BLOCK_MAP
	The metadata table for all the physical blocks. More...

Macros
#define	LSA_NONE   0xffffffff
#define	LSA_FAIL   0xffffffff
#define	VSA_NONE   0xffffffff
#define	VSA_FAIL   0xffffffff
#define	PAGE_NONE   0xffff
#define	BLOCK_NONE   0xffff
#define	BLOCK_FAIL   0xffff
#define	DIE_NONE   0xff
#define	DIE_FAIL   0xff
#define	RESERVED_FREE_BLOCK_COUNT   0x1
#define	GET_FREE_BLOCK_NORMAL   0x0
#define	GET_FREE_BLOCK_GC   0x1
#define	BLOCK_STATE_NORMAL   0
#define	BLOCK_STATE_BAD   1
#define	DIE_STATE_BAD_BLOCK_TABLE_NOT_EXIST   0
#define	DIE_STATE_BAD_BLOCK_TABLE_EXIST   1
#define	DIE_STATE_BAD_BLOCK_TABLE_HOLD   2
#define	DIE_STATE_BAD_BLOCK_TABLE_UPDATE   3
#define	BAD_BLOCK_TABLE_MAKER_IDLE   0
#define	BAD_BLOCK_TABLE_MAKER_TRIGGER   1
#define	CLEAN_DATA_IN_BYTE   0xff
#define	USED_PAGES_FOR_BAD_BLOCK_TABLE_PER_DIE   (TOTAL_BLOCKS_PER_DIE / BYTES_PER_DATA_REGION_OF_PAGE + 1)
#define	DATA_SIZE_OF_BAD_BLOCK_TABLE_PER_DIE   (TOTAL_BLOCKS_PER_DIE)
#define	START_PAGE_NO_OF_BAD_BLOCK_TABLE_BLOCK   (1)
	The start physical page number that stored the bbt of this die. More...
#define	BBT_INFO_GROWN_BAD_UPDATE_NONE   0
#define	BBT_INFO_GROWN_BAD_UPDATE_BOOKED   1
#define	Vsa2VdieTranslation(virtualSliceAddr)   ((virtualSliceAddr) % (USER_DIES))
#define	Vsa2VblockTranslation(virtualSliceAddr)   (((virtualSliceAddr) / (USER_DIES)) / (SLICES_PER_BLOCK))
#define	Vsa2VpageTranslation(virtualSliceAddr)   (((virtualSliceAddr) / (USER_DIES)) % (SLICES_PER_BLOCK))
#define	Vorg2VsaTranslation(dieNo, blockNo, pageNo)    ((dieNo) + (USER_DIES) * ((blockNo) * (SLICES_PER_BLOCK) + (pageNo)))
	Translate virtual NAND organization (location vector) into VSA. More...
#define	Vdie2PchTranslation(dieNo)   ((dieNo) % (USER_CHANNELS))
#define	Vdie2PwayTranslation(dieNo)   ((dieNo) / (USER_CHANNELS))
#define	Vblock2PblockOfTbsTranslation(blockNo)    (((blockNo) / (USER_BLOCKS_PER_LUN)) * (TOTAL_BLOCKS_PER_LUN) + ((blockNo) % (USER_BLOCKS_PER_LUN)))
	Get the PBA (in total block space) of the given VBN. More...
#define	Vblock2PblockOfMbsTranslation(blockNo)    (((blockNo) / (USER_BLOCKS_PER_LUN)) * (MAIN_BLOCKS_PER_LUN) + ((blockNo) % (USER_BLOCKS_PER_LUN)))
	The V2P block mapping rule (main block space). More...
#define	Vpage2PlsbPageTranslation(pageNo)   ((pageNo) > (0) ? (2 * (pageNo)-1) : (0))
	Map the virtual page to the physical LSB page in SLC mode. More...
#define	Pcw2VdieTranslation(chNo, wayNo)   ((chNo) + (wayNo) * (USER_CHANNELS))
	Get die number from physical channel number and way number. More...
#define	PlsbPage2VpageTranslation(pageNo)   ((pageNo) > (0) ? (((pageNo) + 1) / 2) : (0))
	Get the corresponding virtual page number of the given LSB page number. More...
#define	VDIE_ENTRY(iDie)   (&virtualDieMapPtr->die[(iDie)])
#define	VDIE_PREV_IDX(iDie)   (VDIE_ENTRY((iDie))->prevDie)
#define	VDIE_NEXT_IDX(iDie)   (VDIE_ENTRY((iDie))->nextDie)
#define	VDIE_PREV_ENTRY(iDie)   (VDIE_ENTRY(VDIE_PREV_IDX((iDie))))
#define	VDIE_NEXT_ENTRY(iDie)   (VDIE_ENTRY(VDIE_NEXT_IDX((iDie))))
#define	VBLK_ENTRY(iDie, iBlk)   (&virtualBlockMapPtr->block[(iDie)][(iBlk)])
#define	VBLK_PREV_IDX(iDie, iBlk)   (VBLK_ENTRY((iDie), (iBlk))->prevBlock)
#define	VBLK_NEXT_IDX(iDie, iBlk)   (VBLK_ENTRY((iDie), (iBlk))->nextBlock)
#define	VBLK_PREV_ENTRY(iDie, iBlk)   (VBLK_ENTRY((iDie), VBLK_PREV_IDX((iDie), (iBlk))))
#define	VBLK_NEXT_ENTRY(iDie, iBlk)   (VBLK_ENTRY((iDie), VBLK_NEXT_IDX((iDie), (iBlk))))
#define	PBLK_ENTRY(iDie, iBlk)   (&phyBlockMapPtr->phyBlock[(iDie)][(iBlk)])
#define	LSA_ENTRY(lsa)   (&logicalSliceMapPtr->logicalSlice[(lsa)])
#define	VSA_ENTRY(vsa)   (&virtualSliceMapPtr->virtualSlice[(vsa)])
#define	LSA2VSA(lsa)   (LSA_ENTRY((lsa))->virtualSliceAddr)
#define	VSA2LSA(vsa)   (VSA_ENTRY((vsa))->logicalSliceAddr)
#define	VDIE2PCH(iDie)   (Vdie2PchTranslation((iDie)))
#define	VDIE2PWAY(iDie)   (Vdie2PwayTranslation((iDie)))
#define	VSA2VDIE(vsa)   (Vsa2VdieTranslation((vsa)))
#define	VSA2VBLK(vsa)   (Vsa2VblockTranslation((vsa)))
#define	VSA2VPAGE(vsa)   (Vsa2VpageTranslation((vsa)))
#define	VBA2PBA_MBS(vba)   (Vblock2PblockOfMbsTranslation((vba)))
#define	VBA2PBA_TBS(vba)   (Vblock2PblockOfTbsTranslation((vba)))
#define	VORG2VSA(iDie, iBlk, iPage)   (Vorg2VsaTranslation((iDie), (iBlk), (iPage)))
#define	PCH2VDIE(iCh, iWay)   (Pcw2VdieTranslation((iCh), (iWay)))

Typedefs
typedef struct _LOGICAL_SLICE_ENTRY	LOGICAL_SLICE_ENTRY
	Exactly the Virtual Slice Address. More...
typedef struct _LOGICAL_SLICE_ENTRY *	P_LOGICAL_SLICE_ENTRY
typedef struct _LOGICAL_SLICE_MAP	LOGICAL_SLICE_MAP
	The Logical -> Virtual Slice Address mapping table. More...
typedef struct _LOGICAL_SLICE_MAP *	P_LOGICAL_SLICE_MAP
typedef struct _VIRTUAL_SLICE_ENTRY	VIRTUAL_SLICE_ENTRY
	Exactly the Logical Slice Address. More...
typedef struct _VIRTUAL_SLICE_ENTRY *	P_VIRTUAL_SLICE_ENTRY
typedef struct _VIRTUAL_SLICE_MAP	VIRTUAL_SLICE_MAP
	The Virtual -> Logical Slice mapping table. More...
typedef struct _VIRTUAL_SLICE_MAP *	P_VIRTUAL_SLICE_MAP
typedef struct _VIRTUAL_BLOCK_ENTRY	VIRTUAL_BLOCK_ENTRY
	The metadata for this block. More...
typedef struct _VIRTUAL_BLOCK_ENTRY *	P_VIRTUAL_BLOCK_ENTRY
typedef struct _VIRTUAL_BLOCK_MAP	VIRTUAL_BLOCK_MAP
	The block metadata table for all the blocks. More...
typedef struct _VIRTUAL_BLOCK_MAP *	P_VIRTUAL_BLOCK_MAP
typedef struct _VIRTUAL_DIE_ENTRY	VIRTUAL_DIE_ENTRY
	The metadata for this die. More...
typedef struct _VIRTUAL_DIE_ENTRY *	P_VIRTUAL_DIE_ENTRY
typedef struct _VIRTUAL_DIE_MAP	VIRTUAL_DIE_MAP
	The metadata table for all user dies. More...
typedef struct _VIRTUAL_DIE_MAP *	P_VIRTUAL_DIE_MAP
typedef struct _FRRE_BLOCK_ALLOCATION_LIST	FRRE_BLOCK_ALLOCATION_LIST
typedef struct _FRRE_BLOCK_ALLOCATION_LIST *	P_FRRE_BLOCK_ALLOCATION_LIST
typedef struct _BAD_BLOCK_TABLE_INFO_ENTRY	BAD_BLOCK_TABLE_INFO_ENTRY
	The bad block table for this die. More...
typedef struct _BAD_BLOCK_TABLE_INFO_ENTRY *	P_BAD_BLOCK_TABLE_ENTRY
typedef struct _BAD_BLOCK_TABLE_INFO_MAP	BAD_BLOCK_TABLE_INFO_MAP
	The bad block tables. More...
typedef struct _BAD_BLOCK_TABLE_INFO_MAP *	P_BAD_BLOCK_TABLE_INFO_MAP
typedef struct _PHY_BLOCK_ENTRY	PHY_BLOCK_ENTRY
	The metadata of the physical block. More...
typedef struct _PHY_BLOCK_ENTRY *	P_PHY_BLOCK_ENTRY
typedef struct _PHY_BLOCK_MAP	PHY_BLOCK_MAP
	The metadata table for all the physical blocks. More...
typedef struct _PHY_BLOCK_MAP *	P_PHY_BLOCK_MAP

Functions
void	InitAddressMap ()
	Initialize the translation related maps. More...
void	InitSliceMap ()
	Initialize Logical and Virtual Slick Map. More...
void	InitBlockDieMap ()
	Build the bad block table and V2P block mapping of each user die. More...
unsigned int	AddrTransRead (unsigned int logicalSliceAddr)
	Get the virtual slice address of the given logical slice. More...
unsigned int	AddrTransWrite (unsigned int logicalSliceAddr)
	Assign a new virtual (physical) page to the specified logical page. More...
unsigned int	FindFreeVirtualSlice ()
	Select a free physical page (virtual slice). More...
unsigned int	FindFreeVirtualSliceForGc (unsigned int copyTargetDieNo, unsigned int victimBlockNo)
unsigned int	FindDieForFreeSliceAllocation ()
	Update and get the die number to serve the next write request. More...
void	InvalidateOldVsa (unsigned int logicalSliceAddr)
	Invalidate the specified virtual page. More...
void	EraseBlock (unsigned int dieNo, unsigned int blockNo)
	Erase the specified block of the specified die and discard its LSAs. More...
void	PutToFbList (unsigned int dieNo, unsigned int blockNo)
	Append the given virtual block to the free block list of its die. More...
unsigned int	GetFromFbList (unsigned int dieNo, unsigned int getFreeBlockOption)
	Pop the first block in the free block list of the specified die. More...
void	UpdatePhyBlockMapForGrownBadBlock (unsigned int dieNo, unsigned int phyBlockNo)
	Mark the given physical block bad block and update the bbt later. More...
void	UpdateBadBlockTableForGrownBadBlock (unsigned int tempBufAddr)
	Update the bad block table and persist to the specified block. More...

Variables
P_LOGICAL_SLICE_MAP	logicalSliceMapPtr
P_VIRTUAL_SLICE_MAP	virtualSliceMapPtr
P_VIRTUAL_BLOCK_MAP	virtualBlockMapPtr
P_VIRTUAL_DIE_MAP	virtualDieMapPtr
P_PHY_BLOCK_MAP	phyBlockMapPtr
P_BAD_BLOCK_TABLE_INFO_MAP	bbtInfoMapPtr
unsigned char	sliceAllocationTargetDie
unsigned int	mbPerbadBlockSpace

Macro Definition Documentation

BAD_BLOCK_TABLE_MAKER_IDLE

#define BAD_BLOCK_TABLE_MAKER_IDLE   0

Definition at line 81 of file address_translation.h.

BAD_BLOCK_TABLE_MAKER_TRIGGER

#define BAD_BLOCK_TABLE_MAKER_TRIGGER   1

Definition at line 82 of file address_translation.h.

BBT_INFO_GROWN_BAD_UPDATE_BOOKED

#define BBT_INFO_GROWN_BAD_UPDATE_BOOKED   1

Definition at line 101 of file address_translation.h.

BBT_INFO_GROWN_BAD_UPDATE_NONE

#define BBT_INFO_GROWN_BAD_UPDATE_NONE   0

Definition at line 100 of file address_translation.h.

BLOCK_FAIL

#define BLOCK_FAIL   0xffff

Definition at line 63 of file address_translation.h.

BLOCK_NONE

#define BLOCK_NONE   0xffff

Definition at line 62 of file address_translation.h.

BLOCK_STATE_BAD

#define BLOCK_STATE_BAD   1

Definition at line 74 of file address_translation.h.

BLOCK_STATE_NORMAL

#define BLOCK_STATE_NORMAL   0

Definition at line 73 of file address_translation.h.

CLEAN_DATA_IN_BYTE

#define CLEAN_DATA_IN_BYTE   0xff

Definition at line 84 of file address_translation.h.

DATA_SIZE_OF_BAD_BLOCK_TABLE_PER_DIE

#define DATA_SIZE_OF_BAD_BLOCK_TABLE_PER_DIE   (TOTAL_BLOCKS_PER_DIE)

Definition at line 88 of file address_translation.h.

DIE_FAIL

#define DIE_FAIL   0xff

Definition at line 66 of file address_translation.h.

DIE_NONE

#define DIE_NONE   0xff

Definition at line 65 of file address_translation.h.

DIE_STATE_BAD_BLOCK_TABLE_EXIST

#define DIE_STATE_BAD_BLOCK_TABLE_EXIST   1

Definition at line 77 of file address_translation.h.

DIE_STATE_BAD_BLOCK_TABLE_HOLD

#define DIE_STATE_BAD_BLOCK_TABLE_HOLD   2

Definition at line 78 of file address_translation.h.

DIE_STATE_BAD_BLOCK_TABLE_NOT_EXIST

#define DIE_STATE_BAD_BLOCK_TABLE_NOT_EXIST   0

Definition at line 76 of file address_translation.h.

DIE_STATE_BAD_BLOCK_TABLE_UPDATE

#define DIE_STATE_BAD_BLOCK_TABLE_UPDATE   3

Definition at line 79 of file address_translation.h.

GET_FREE_BLOCK_GC

#define GET_FREE_BLOCK_GC   0x1

Definition at line 71 of file address_translation.h.

GET_FREE_BLOCK_NORMAL

#define GET_FREE_BLOCK_NORMAL   0x0

Definition at line 70 of file address_translation.h.

LSA2VSA

#define LSA2VSA

(

lsa

)

(LSA_ENTRY((lsa))->virtualSliceAddr)

Definition at line 374 of file address_translation.h.

LSA_ENTRY

#define LSA_ENTRY

(

lsa

)

(&logicalSliceMapPtr->logicalSlice[(lsa)])

Definition at line 372 of file address_translation.h.

LSA_FAIL

#define LSA_FAIL   0xffffffff

Definition at line 55 of file address_translation.h.

LSA_NONE

#define LSA_NONE   0xffffffff

Definition at line 54 of file address_translation.h.

PAGE_NONE

#define PAGE_NONE   0xffff

Definition at line 60 of file address_translation.h.

PBLK_ENTRY

#define PBLK_ENTRY	(		iDie,
			iBlk
	)		(&phyBlockMapPtr->phyBlock[(iDie)][(iBlk)])

Definition at line 370 of file address_translation.h.

PCH2VDIE

#define PCH2VDIE	(		iCh,
			iWay
	)		(Pcw2VdieTranslation((iCh), (iWay)))

Definition at line 386 of file address_translation.h.

Pcw2VdieTranslation

#define Pcw2VdieTranslation	(		chNo,
			wayNo
	)		((chNo) + (wayNo) * (USER_CHANNELS))

Get die number from physical channel number and way number.

Warning

: Why the LSB page is at odd page ??

Definition at line 179 of file address_translation.h.

PlsbPage2VpageTranslation

#define PlsbPage2VpageTranslation

(

pageNo

)

((pageNo) > (0) ? (((pageNo) + 1) / 2) : (0))

Get the corresponding virtual page number of the given LSB page number.

Warning

: No need to check if pageNo > 0 or not.

Definition at line 186 of file address_translation.h.

RESERVED_FREE_BLOCK_COUNT

#define RESERVED_FREE_BLOCK_COUNT   0x1

Definition at line 68 of file address_translation.h.

START_PAGE_NO_OF_BAD_BLOCK_TABLE_BLOCK

#define START_PAGE_NO_OF_BAD_BLOCK_TABLE_BLOCK   (1)

The start physical page number that stored the bbt of this die.

The first page will be used for checking the bad block mark, so start putting the bbt from second page.

Note

the bad block table should be saved at lsb pages

Definition at line 98 of file address_translation.h.

USED_PAGES_FOR_BAD_BLOCK_TABLE_PER_DIE

#define USED_PAGES_FOR_BAD_BLOCK_TABLE_PER_DIE   (TOTAL_BLOCKS_PER_DIE / BYTES_PER_DATA_REGION_OF_PAGE + 1)

Definition at line 87 of file address_translation.h.

VBA2PBA_MBS

#define VBA2PBA_MBS

(

vba

)

(Vblock2PblockOfMbsTranslation((vba)))

Definition at line 382 of file address_translation.h.

VBA2PBA_TBS

#define VBA2PBA_TBS

(

vba

)

(Vblock2PblockOfTbsTranslation((vba)))

Definition at line 383 of file address_translation.h.

VBLK_ENTRY

#define VBLK_ENTRY	(		iDie,
			iBlk
	)		(&virtualBlockMapPtr->block[(iDie)][(iBlk)])

Definition at line 365 of file address_translation.h.

VBLK_NEXT_ENTRY

#define VBLK_NEXT_ENTRY	(		iDie,
			iBlk
	)		(VBLK_ENTRY((iDie), VBLK_NEXT_IDX((iDie), (iBlk))))

Definition at line 369 of file address_translation.h.

VBLK_NEXT_IDX

#define VBLK_NEXT_IDX	(		iDie,
			iBlk
	)		(VBLK_ENTRY((iDie), (iBlk))->nextBlock)

Definition at line 367 of file address_translation.h.

VBLK_PREV_ENTRY

#define VBLK_PREV_ENTRY	(		iDie,
			iBlk
	)		(VBLK_ENTRY((iDie), VBLK_PREV_IDX((iDie), (iBlk))))

Definition at line 368 of file address_translation.h.

VBLK_PREV_IDX

#define VBLK_PREV_IDX	(		iDie,
			iBlk
	)		(VBLK_ENTRY((iDie), (iBlk))->prevBlock)

Definition at line 366 of file address_translation.h.

Vblock2PblockOfMbsTranslation

#define Vblock2PblockOfMbsTranslation

(

blockNo

)

(((blockNo) / (USER_BLOCKS_PER_LUN)) * (MAIN_BLOCKS_PER_LUN) + ((blockNo) % (USER_BLOCKS_PER_LUN)))

The V2P block mapping rule (main block space).

Note

Mbs = Main block space

Warning

why this needed?

Definition at line 159 of file address_translation.h.

Vblock2PblockOfTbsTranslation

#define Vblock2PblockOfTbsTranslation

(

blockNo

)

(((blockNo) / (USER_BLOCKS_PER_LUN)) * (TOTAL_BLOCKS_PER_LUN) + ((blockNo) % (USER_BLOCKS_PER_LUN)))

Get the PBA (in total block space) of the given VBN.

The mapping rule is basically use static mapping, but since the number of user blocks on a die may be less than the number of total blocks (MAIN + EXTENDED) on that die, we must use USER_BLOCKS_PER_LUN to calculate the offset of the given VBN.

Note

Tbs = Total block space = MAIN + EXTENDED

Definition at line 150 of file address_translation.h.

VDIE2PCH

#define VDIE2PCH

(

iDie

)

(Vdie2PchTranslation((iDie)))

Definition at line 377 of file address_translation.h.

Vdie2PchTranslation

#define Vdie2PchTranslation

(

dieNo

)

((dieNo) % (USER_CHANNELS))

Definition at line 138 of file address_translation.h.

VDIE2PWAY

#define VDIE2PWAY

(

iDie

)

(Vdie2PwayTranslation((iDie)))

Definition at line 378 of file address_translation.h.

Vdie2PwayTranslation

#define Vdie2PwayTranslation

(

dieNo

)

((dieNo) / (USER_CHANNELS))

Definition at line 139 of file address_translation.h.

VDIE_ENTRY

#define VDIE_ENTRY

(

iDie

)

(&virtualDieMapPtr->die[(iDie)])

Definition at line 359 of file address_translation.h.

VDIE_NEXT_ENTRY

#define VDIE_NEXT_ENTRY

(

iDie

)

(VDIE_ENTRY(VDIE_NEXT_IDX((iDie))))

Definition at line 363 of file address_translation.h.

VDIE_NEXT_IDX

#define VDIE_NEXT_IDX

(

iDie

)

(VDIE_ENTRY((iDie))->nextDie)

Definition at line 361 of file address_translation.h.

VDIE_PREV_ENTRY

#define VDIE_PREV_ENTRY

(

iDie

)

(VDIE_ENTRY(VDIE_PREV_IDX((iDie))))

Definition at line 362 of file address_translation.h.

VDIE_PREV_IDX

#define VDIE_PREV_IDX

(

iDie

)

(VDIE_ENTRY((iDie))->prevDie)

Definition at line 360 of file address_translation.h.

VORG2VSA

#define VORG2VSA	(		iDie,
			iBlk,
			iPage
	)		(Vorg2VsaTranslation((iDie), (iBlk), (iPage)))

Definition at line 384 of file address_translation.h.

Vorg2VsaTranslation

#define Vorg2VsaTranslation	(		dieNo,
			blockNo,
			pageNo
	)		((dieNo) + (USER_DIES) * ((blockNo) * (SLICES_PER_BLOCK) + (pageNo)))

Translate virtual NAND organization (location vector) into VSA.

Warning

why the pages with same offset but on different die are grouped together?

The virtual slices with same page offset but on different die are grouped together, that is the virtual slice address 0 ~ (USER_DIES - 1) will be mapped to the page 0 of each user die, the virtual slice address USER_DIES ~ (2 x USER_DIES - 1) will be mapped to the page 1 of each user die, and so on.

Therefore, in order to translate the virtual organization into VSA, we should:

1. Calculate the page offset within a die
2. Use the page offset to find the group within all the groups
3. Use dieNo to get the VSA for this die in the target group

Parameters

dieNo	the die number for this slice request.
blockNo	the block number for this slice request.
pageNo	the page offset in this block for this slice request.

Definition at line 131 of file address_translation.h.

Vpage2PlsbPageTranslation

#define Vpage2PlsbPageTranslation

(

pageNo

)

((pageNo) > (0) ? (2 * (pageNo)-1) : (0))

Map the virtual page to the physical LSB page in SLC mode.

Warning

This may reduce the flash lifetime since this is not true SLC mode.

Why the LSB page is at odd page ??

Definition at line 168 of file address_translation.h.

VSA2LSA

#define VSA2LSA

(

vsa

)

(VSA_ENTRY((vsa))->logicalSliceAddr)

Definition at line 375 of file address_translation.h.

VSA2VBLK

#define VSA2VBLK

(

vsa

)

(Vsa2VblockTranslation((vsa)))

Definition at line 380 of file address_translation.h.

Vsa2VblockTranslation

#define Vsa2VblockTranslation

(

virtualSliceAddr

)

(((virtualSliceAddr) / (USER_DIES)) / (SLICES_PER_BLOCK))

Definition at line 108 of file address_translation.h.

VSA2VDIE

#define VSA2VDIE

(

vsa

)

(Vsa2VdieTranslation((vsa)))

Definition at line 379 of file address_translation.h.

Vsa2VdieTranslation

#define Vsa2VdieTranslation

(

virtualSliceAddr

)

((virtualSliceAddr) % (USER_DIES))

Definition at line 107 of file address_translation.h.

VSA2VPAGE

#define VSA2VPAGE

(

vsa

)

(Vsa2VpageTranslation((vsa)))

Definition at line 381 of file address_translation.h.

Vsa2VpageTranslation

#define Vsa2VpageTranslation

(

virtualSliceAddr

)

(((virtualSliceAddr) / (USER_DIES)) % (SLICES_PER_BLOCK))

Definition at line 109 of file address_translation.h.

VSA_ENTRY

#define VSA_ENTRY

(

vsa

)

(&virtualSliceMapPtr->virtualSlice[(vsa)])

Definition at line 373 of file address_translation.h.

VSA_FAIL

#define VSA_FAIL   0xffffffff

Definition at line 58 of file address_translation.h.

VSA_NONE

#define VSA_NONE   0xffffffff

Definition at line 57 of file address_translation.h.

Typedef Documentation

BAD_BLOCK_TABLE_INFO_ENTRY

typedef struct _BAD_BLOCK_TABLE_INFO_ENTRY BAD_BLOCK_TABLE_INFO_ENTRY

The bad block table for this die.

BAD_BLOCK_TABLE_INFO_MAP

typedef struct _BAD_BLOCK_TABLE_INFO_MAP BAD_BLOCK_TABLE_INFO_MAP

The bad block tables.

FRRE_BLOCK_ALLOCATION_LIST

typedef struct _FRRE_BLOCK_ALLOCATION_LIST FRRE_BLOCK_ALLOCATION_LIST

Warning

typo (FRRE -> FREE)

not used

LOGICAL_SLICE_ENTRY

typedef struct _LOGICAL_SLICE_ENTRY LOGICAL_SLICE_ENTRY

Exactly the Virtual Slice Address.

LOGICAL_SLICE_MAP

typedef struct _LOGICAL_SLICE_MAP LOGICAL_SLICE_MAP

The Logical -> Virtual Slice Address mapping table.

P_BAD_BLOCK_TABLE_ENTRY

typedef struct _BAD_BLOCK_TABLE_INFO_ENTRY * P_BAD_BLOCK_TABLE_ENTRY

P_BAD_BLOCK_TABLE_INFO_MAP

typedef struct _BAD_BLOCK_TABLE_INFO_MAP * P_BAD_BLOCK_TABLE_INFO_MAP

P_FRRE_BLOCK_ALLOCATION_LIST

typedef struct _FRRE_BLOCK_ALLOCATION_LIST * P_FRRE_BLOCK_ALLOCATION_LIST

P_LOGICAL_SLICE_ENTRY

typedef struct _LOGICAL_SLICE_ENTRY * P_LOGICAL_SLICE_ENTRY

P_LOGICAL_SLICE_MAP

typedef struct _LOGICAL_SLICE_MAP * P_LOGICAL_SLICE_MAP

P_PHY_BLOCK_ENTRY

typedef struct _PHY_BLOCK_ENTRY * P_PHY_BLOCK_ENTRY

P_PHY_BLOCK_MAP

typedef struct _PHY_BLOCK_MAP * P_PHY_BLOCK_MAP

P_VIRTUAL_BLOCK_ENTRY

typedef struct _VIRTUAL_BLOCK_ENTRY * P_VIRTUAL_BLOCK_ENTRY

P_VIRTUAL_BLOCK_MAP

typedef struct _VIRTUAL_BLOCK_MAP * P_VIRTUAL_BLOCK_MAP

P_VIRTUAL_DIE_ENTRY

typedef struct _VIRTUAL_DIE_ENTRY * P_VIRTUAL_DIE_ENTRY

P_VIRTUAL_DIE_MAP

typedef struct _VIRTUAL_DIE_MAP * P_VIRTUAL_DIE_MAP

P_VIRTUAL_SLICE_ENTRY

typedef struct _VIRTUAL_SLICE_ENTRY * P_VIRTUAL_SLICE_ENTRY

P_VIRTUAL_SLICE_MAP

typedef struct _VIRTUAL_SLICE_MAP * P_VIRTUAL_SLICE_MAP

PHY_BLOCK_ENTRY

typedef struct _PHY_BLOCK_ENTRY PHY_BLOCK_ENTRY

The metadata of the physical block.

PHY_BLOCK_MAP

typedef struct _PHY_BLOCK_MAP PHY_BLOCK_MAP

The metadata table for all the physical blocks.

VIRTUAL_BLOCK_ENTRY

typedef struct _VIRTUAL_BLOCK_ENTRY VIRTUAL_BLOCK_ENTRY

The metadata for this block.

VIRTUAL_BLOCK_MAP

typedef struct _VIRTUAL_BLOCK_MAP VIRTUAL_BLOCK_MAP

The block metadata table for all the blocks.

VIRTUAL_DIE_ENTRY

typedef struct _VIRTUAL_DIE_ENTRY VIRTUAL_DIE_ENTRY

The metadata for this die.

Todo:

There are

VIRTUAL_DIE_MAP

typedef struct _VIRTUAL_DIE_MAP VIRTUAL_DIE_MAP

The metadata table for all user dies.

VIRTUAL_SLICE_ENTRY

typedef struct _VIRTUAL_SLICE_ENTRY VIRTUAL_SLICE_ENTRY

Exactly the Logical Slice Address.

VIRTUAL_SLICE_MAP

typedef struct _VIRTUAL_SLICE_MAP VIRTUAL_SLICE_MAP

The Virtual -> Logical Slice mapping table.

Function Documentation

AddrTransRead()

unsigned int AddrTransRead

(

unsigned int

logicalSliceAddr

)

Get the virtual slice address of the given logical slice.

Parameters

logicalSliceAddr

the logical address of the target slice.

Returns

unsigned int the virtual address of the target slice.

Definition at line 871 of file address_translation.c.

{
    unsigned int virtualSliceAddr;
 
    if (logicalSliceAddr < SLICES_PER_SSD)
    {
        virtualSliceAddr = logicalSliceMapPtr->logicalSlice[logicalSliceAddr].virtualSliceAddr;
 
        if (virtualSliceAddr != VSA_NONE)
            return virtualSliceAddr;
        else
            return VSA_FAIL;
    }
    else
        assert(!"[WARNING] Logical address is larger than maximum logical address served by SSD [WARNING]");
}

Here is the caller graph for this function:

AddrTransWrite()

unsigned int AddrTransWrite

(

unsigned int

logicalSliceAddr

)

Assign a new virtual (physical) page to the specified logical page.

Before issuing the write request, we should allocate a physical page for the specified logical page and invalidate the old physical page if it exists.

Note

In current implementation, if the target page of a write request is not empty, a read request on the target page will be issued automatically before the write request, therefore, we don't have to handle data migration in this function.

See also

ReqTransSliceToLowLevel().

Parameters

logicalSliceAddr

the logical address of the target slice.

Returns

unsigned int the renewed virtual slice address for the given logical slice.

Definition at line 903 of file address_translation.c.

{
    unsigned int virtualSliceAddr;
 
    if (logicalSliceAddr < SLICES_PER_SSD)
    {
        InvalidateOldVsa(logicalSliceAddr);
 
        virtualSliceAddr = FindFreeVirtualSlice();
 
        logicalSliceMapPtr->logicalSlice[logicalSliceAddr].virtualSliceAddr = virtualSliceAddr;
        virtualSliceMapPtr->virtualSlice[virtualSliceAddr].logicalSliceAddr = logicalSliceAddr;
 
        return virtualSliceAddr;
    }
    else
        assert(!"[WARNING] Logical address is larger than maximum logical address served by SSD [WARNING]");
}

Here is the call graph for this function:

Here is the caller graph for this function:

EraseBlock()

void EraseBlock	(	unsigned int	dieNo,
		unsigned int	blockNo
	)

Erase the specified block of the specified die and discard its LSAs.

This function will:

• Send a ERASE request to erase the specified block
• Move the specified block to free block list

• Discard all the logical slice addresses of the origin block

  Todo:

  programmedPageCnt

Note

The specified block may not be invalidated immediately.

Parameters

dieNo	the die number of the specified block.
blockNo	the block number on the specified die.

Definition at line 1122 of file address_translation.c.

{
    unsigned int pageNo, virtualSliceAddr, reqSlotTag;
 
    reqSlotTag = GetFromFreeReqQ();
 
    reqPoolPtr->reqPool[reqSlotTag].reqType                       = REQ_TYPE_NAND;
    reqPoolPtr->reqPool[reqSlotTag].reqCode                       = REQ_CODE_ERASE;
    reqPoolPtr->reqPool[reqSlotTag].reqOpt.nandAddr               = REQ_OPT_NAND_ADDR_VSA;
    reqPoolPtr->reqPool[reqSlotTag].reqOpt.dataBufFormat          = REQ_OPT_DATA_BUF_NONE;
    reqPoolPtr->reqPool[reqSlotTag].reqOpt.rowAddrDependencyCheck = REQ_OPT_ROW_ADDR_DEPENDENCY_CHECK;
    reqPoolPtr->reqPool[reqSlotTag].reqOpt.blockSpace             = REQ_OPT_BLOCK_SPACE_MAIN;
    reqPoolPtr->reqPool[reqSlotTag].nandInfo.virtualSliceAddr     = Vorg2VsaTranslation(dieNo, blockNo, 0);
    reqPoolPtr->reqPool[reqSlotTag].nandInfo.programmedPageCnt =
        virtualBlockMapPtr->block[dieNo][blockNo].currentPage;
 
    SelectLowLevelReqQ(reqSlotTag);
 
    // block map indicated blockNo initialization
    virtualBlockMapPtr->block[dieNo][blockNo].free = 1;
    virtualBlockMapPtr->block[dieNo][blockNo].eraseCnt++;
    virtualBlockMapPtr->block[dieNo][blockNo].invalidSliceCnt = 0;
    virtualBlockMapPtr->block[dieNo][blockNo].currentPage     = 0;
 
    PutToFbList(dieNo, blockNo);
 
    for (pageNo = 0; pageNo < USER_PAGES_PER_BLOCK; pageNo++)
    {
        virtualSliceAddr = Vorg2VsaTranslation(dieNo, blockNo, pageNo);
        virtualSliceMapPtr->virtualSlice[virtualSliceAddr].logicalSliceAddr = LSA_NONE;
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

FindDieForFreeSliceAllocation()

unsigned int FindDieForFreeSliceAllocation

(

)

Update and get the die number to serve the next write request.

To exploit the parallelism, the write request should first be interleaved on different channels to take advantage of the channel parallelism. If all the channels' same way are used, select the next way of each channel to use the die parallelism.

Warning

As paper the mentioned, may not perform well if latency largely varied.

Returns

unsigned int The target die number.

Definition at line 1051 of file address_translation.c.

{
    static unsigned char targetCh  = 0;
    static unsigned char targetWay = 0;
    unsigned int targetDie;
 
    targetDie = Pcw2VdieTranslation(targetCh, targetWay);
 
    if (targetCh != (USER_CHANNELS - 1))
        targetCh = targetCh + 1;
    else
    {
        targetCh  = 0;
        targetWay = (targetWay + 1) % USER_WAYS;
    }
 
    return targetDie;
}

Here is the caller graph for this function:

FindFreeVirtualSlice()

unsigned int FindFreeVirtualSlice

(

)

Select a free physical page (virtual slice).

In current implementation, the target page to serve the write request is determined by checking the following three variables:

• sliceAllocationTargetDie:

  The die where the next request should be issued to.

  To exploit the parallelism of each die, especially under write-intensive workload, the write requests will be interleaved to each die.

  Check FindDieForFreeSliceAllocation() for details.

• VIRTUAL_DIE_ENTRY::currentBlock:

  The current working block of the target die.

  Each die maintains a current working block and will select a page from the current working block of target die to serve the write request. Once all the pages of the current working block are used, the fw will select a new free block from the free block list as the new current working block of that die.

  If there the free block list of that die is empty, the fw will try to release invalid blocks by doing GC.

  Check GetFromFbList() and GarbageCollection() for the details.

• VIRTUAL_BLOCK_ENTRY::currentPage:

  The current working page of the current working block on the die.

  Current implementation just selects the free page sequentially from the current working block.

See also

VIRTUAL_DIE_ENTRY, VIRTUAL_BLOCK_ENTRY, FindDieForFreeSliceAllocation().

Warning

why the currentPage might be full after GC?

why assign dieNo before return? redundant?

Returns

unsigned int the VSA for the request.

Definition at line 965 of file address_translation.c.

{
    unsigned int currentBlock, virtualSliceAddr, dieNo;
 
    dieNo        = sliceAllocationTargetDie;
    currentBlock = virtualDieMapPtr->die[dieNo].currentBlock;
 
    // if the currently used block is full, assign a free block as new current block
    if (virtualBlockMapPtr->block[dieNo][currentBlock].currentPage == USER_PAGES_PER_BLOCK)
    {
        currentBlock = GetFromFbList(dieNo, GET_FREE_BLOCK_NORMAL);
 
        if (currentBlock != BLOCK_FAIL)
            virtualDieMapPtr->die[dieNo].currentBlock = currentBlock;
        else
        {
            GarbageCollection(dieNo);
            currentBlock = virtualDieMapPtr->die[dieNo].currentBlock;
 
            // FIXME: why need to check whether `currentPage` is full?
            if (virtualBlockMapPtr->block[dieNo][currentBlock].currentPage == USER_PAGES_PER_BLOCK)
            {
                currentBlock = GetFromFbList(dieNo, GET_FREE_BLOCK_NORMAL);
                if (currentBlock != BLOCK_FAIL)
                    virtualDieMapPtr->die[dieNo].currentBlock = currentBlock;
                else
                    assert(!"[WARNING] There is no available block [WARNING]");
            }
            else if (virtualBlockMapPtr->block[dieNo][currentBlock].currentPage > USER_PAGES_PER_BLOCK)
                assert(!"[WARNING] Current page management fail [WARNING]");
        }
    }
    else if (virtualBlockMapPtr->block[dieNo][currentBlock].currentPage > USER_PAGES_PER_BLOCK)
        assert(!"[WARNING] Current page management fail [WARNING]");
 
    virtualSliceAddr =
        Vorg2VsaTranslation(dieNo, currentBlock, virtualBlockMapPtr->block[dieNo][currentBlock].currentPage);
    virtualBlockMapPtr->block[dieNo][currentBlock].currentPage++;
    sliceAllocationTargetDie = FindDieForFreeSliceAllocation(); // sliceAllocationTargetDie should be updated
    dieNo                    = sliceAllocationTargetDie;        // don't merge the 2 lines
    return virtualSliceAddr;
}

Here is the call graph for this function:

Here is the caller graph for this function:

FindFreeVirtualSliceForGc()

unsigned int FindFreeVirtualSliceForGc	(	unsigned int	copyTargetDieNo,
		unsigned int	victimBlockNo
	)

Definition at line 1008 of file address_translation.c.

{
    unsigned int currentBlock, virtualSliceAddr, dieNo;
 
    dieNo = copyTargetDieNo;
    if (victimBlockNo == virtualDieMapPtr->die[dieNo].currentBlock)
    {
        virtualDieMapPtr->die[dieNo].currentBlock = GetFromFbList(dieNo, GET_FREE_BLOCK_GC);
        if (virtualDieMapPtr->die[dieNo].currentBlock == BLOCK_FAIL)
            assert(!"[WARNING] There is no available block [WARNING]");
    }
    currentBlock = virtualDieMapPtr->die[dieNo].currentBlock;
 
    if (virtualBlockMapPtr->block[dieNo][currentBlock].currentPage == USER_PAGES_PER_BLOCK)
    {
 
        currentBlock = GetFromFbList(dieNo, GET_FREE_BLOCK_GC);
 
        if (currentBlock != BLOCK_FAIL)
            virtualDieMapPtr->die[dieNo].currentBlock = currentBlock;
        else
            assert(!"[WARNING] There is no available block [WARNING]");
    }
    else if (virtualBlockMapPtr->block[dieNo][currentBlock].currentPage > USER_PAGES_PER_BLOCK)
        assert(!"[WARNING] Current page management fail [WARNING]");
 
    virtualSliceAddr =
        Vorg2VsaTranslation(dieNo, currentBlock, virtualBlockMapPtr->block[dieNo][currentBlock].currentPage);
    virtualBlockMapPtr->block[dieNo][currentBlock].currentPage++;
    return virtualSliceAddr;
}

Here is the call graph for this function:

Here is the caller graph for this function:

GetFromFbList()

unsigned int GetFromFbList	(	unsigned int	dieNo,
		unsigned int	getFreeBlockOption
	)

Pop the first block in the free block list of the specified die.

Note

Each die will reserve some free blocks (VIRTUAL_DIE_ENTRY::freeBlockCnt), so if the number of free blocks is less then the number of preserved blocks, BLOCK_FAIL will be returned.

Todo:

Difference between GET_FREE_BLOCK_NORMAL and GET_FREE_BLOCK_GC.

Parameters

dieNo	The target die number.
getFreeBlockOption	//TODO

Returns

unsigned int The virtual block address of the evicted block.

Definition at line 1194 of file address_translation.c.

{
    unsigned int evictedBlockNo;
 
    evictedBlockNo = virtualDieMapPtr->die[dieNo].headFreeBlock;
 
    if (getFreeBlockOption == GET_FREE_BLOCK_NORMAL)
    {
        if (virtualDieMapPtr->die[dieNo].freeBlockCnt <= RESERVED_FREE_BLOCK_COUNT)
            return BLOCK_FAIL;
    }
    else if (getFreeBlockOption == GET_FREE_BLOCK_GC)
    {
        if (evictedBlockNo == BLOCK_NONE)
            return BLOCK_FAIL;
    }
    else
        assert(!"[WARNING] Wrong getFreeBlockOption [WARNING]");
 
    if (virtualBlockMapPtr->block[dieNo][evictedBlockNo].nextBlock != BLOCK_NONE)
    {
        virtualDieMapPtr->die[dieNo].headFreeBlock = virtualBlockMapPtr->block[dieNo][evictedBlockNo].nextBlock;
        virtualBlockMapPtr->block[dieNo][virtualBlockMapPtr->block[dieNo][evictedBlockNo].nextBlock].prevBlock =
            BLOCK_NONE;
    }
    else
    {
        virtualDieMapPtr->die[dieNo].headFreeBlock = BLOCK_NONE;
        virtualDieMapPtr->die[dieNo].tailFreeBlock = BLOCK_NONE;
    }
 
    virtualBlockMapPtr->block[dieNo][evictedBlockNo].free = 0;
    virtualDieMapPtr->die[dieNo].freeBlockCnt--;
 
    virtualBlockMapPtr->block[dieNo][evictedBlockNo].nextBlock = BLOCK_NONE;
    virtualBlockMapPtr->block[dieNo][evictedBlockNo].prevBlock = BLOCK_NONE;
 
    return evictedBlockNo;
}

Here is the caller graph for this function:

InitAddressMap()

void InitAddressMap

(

)

Initialize the translation related maps.

The following tasks will be finished in the function:

• Initialize logical and virtual slice map (all entries map to NONE)
• Read/Remake the bad block table of each die
• Replace bad blocks with the reserved blocks in the same die
• Initialize V2P table and free block list
• Choose a free block as the current working block for each die

This function, only initialize the base addresses of these maps, the physical block map and some bad blocks info. The other maps will be initialized in InitBlockDieMap() and InitSliceMap(), check the two functions for further initialization.

Todo:

To initialize the physical block map,

Definition at line 82 of file address_translation.c.

{
    unsigned int blockNo, dieNo;
 
    logicalSliceMapPtr = (P_LOGICAL_SLICE_MAP)LOGICAL_SLICE_MAP_ADDR;
    virtualSliceMapPtr = (P_VIRTUAL_SLICE_MAP)VIRTUAL_SLICE_MAP_ADDR;
    virtualBlockMapPtr = (P_VIRTUAL_BLOCK_MAP)VIRTUAL_BLOCK_MAP_ADDR;
    virtualDieMapPtr   = (P_VIRTUAL_DIE_MAP)VIRTUAL_DIE_MAP_ADDR;
    phyBlockMapPtr     = (P_PHY_BLOCK_MAP)PHY_BLOCK_MAP_ADDR;
    bbtInfoMapPtr      = (P_BAD_BLOCK_TABLE_INFO_MAP)BAD_BLOCK_TABLE_INFO_MAP_ADDR;
 
    // reset physical block mapping and bad block info
    for (dieNo = 0; dieNo < USER_DIES; dieNo++)
    {
        // the blocks should not be remapped to any other blocks before remmaping
        for (blockNo = 0; blockNo < TOTAL_BLOCKS_PER_DIE; blockNo++)
            phyBlockMapPtr->phyBlock[dieNo][blockNo].remappedPhyBlock = blockNo;
 
        bbtInfoMapPtr->bbtInfo[dieNo].phyBlock       = 0;
        bbtInfoMapPtr->bbtInfo[dieNo].grownBadUpdate = BBT_INFO_GROWN_BAD_UPDATE_NONE;
    }
 
    // by default, the request start from the first die
    sliceAllocationTargetDie = FindDieForFreeSliceAllocation();
 
    InitSliceMap();
    InitBlockDieMap();
}

Here is the call graph for this function:

Here is the caller graph for this function:

InitBlockDieMap()

void InitBlockDieMap

(

)

Build the bad block table and V2P block mapping of each user die.

To create the V2P mapping, we have to:

1. Build the bad block table by reading or remaking the bad block table
2. Replace bad blocks with reserved blocks
3. Map virtual blocks to available physical blocks
4. Add available virtual blocks into free block list

Definition at line 815 of file address_translation.c.

{
    unsigned int dieNo;
    unsigned char eraseFlag = 1;
 
    xil_printf("Press 'X' to re-make the bad block table.\r\n");
 
    char input = inbyte();
    if (input == 'X')
    {
        xil_printf("[WARNING!!!] Start re-making bad block table\r\n");
        EraseTotalBlockSpace();
        eraseFlag = 0;
    }
    else
    {
        xil_printf("[WARNING!!!] Skip re-making bad block table\r\n");
    }
 
    // empty the free block list of each die
    InitDieMap();
 
    // read bbt from flash [, create bbt, persist new bbt to flash]
    RecoverBadBlockTable(RESERVED_DATA_BUFFER_BASE_ADDR);
 
    /*
     * Since the block specified by `BAD_BLOCK_TABLE_INFO_ENTRY::phyBlock` is used for
     * storing the bbt of that die, so we have to mark that block bad and let it to be
     * remapped to another block for using.
     *
     * And because we have at least one bad block on each die, the remapping process thus
     * should not be skipped.
     */
    for (dieNo = 0; dieNo < USER_DIES; dieNo++)
        phyBlockMapPtr->phyBlock[dieNo][bbtInfoMapPtr->bbtInfo[dieNo].phyBlock].bad = 1;
    RemapBadBlock();
 
    // create V2P table and initialize free block list
    InitBlockMap();
 
    if (eraseFlag)
        EraseUserBlockSpace();
 
    InitCurrentBlockOfDieMap();
}

Here is the call graph for this function:

Here is the caller graph for this function:

InitSliceMap()

void InitSliceMap

(

)

Initialize Logical and Virtual Slick Map.

This function simply initialize all the slice addresses in the both map to NONE.

Definition at line 116 of file address_translation.c.

{
    int sliceAddr;
    for (sliceAddr = 0; sliceAddr < SLICES_PER_SSD; sliceAddr++)
    {
        logicalSliceMapPtr->logicalSlice[sliceAddr].virtualSliceAddr = VSA_NONE;
        virtualSliceMapPtr->virtualSlice[sliceAddr].logicalSliceAddr = LSA_NONE;
    }
}

Here is the caller graph for this function:

InvalidateOldVsa()

void InvalidateOldVsa

(

unsigned int

logicalSliceAddr

)

Invalidate the specified virtual page.

Overwriting cannot perform on physical flash cell, so the fw must handle out-of-place update.

This function is used for invalidate the corresponding physical page of the specified logical page, but in case there was no physical page allocated on the logical page before, we should check if the corresponding physical page exists before doing GC on the invalidated physical page.

Parameters

logicalSliceAddr

LSA that specifies the virtual slice to be invalidated.

Definition at line 1083 of file address_translation.c.

{
    unsigned int virtualSliceAddr, dieNo, blockNo;
 
    virtualSliceAddr = logicalSliceMapPtr->logicalSlice[logicalSliceAddr].virtualSliceAddr;
 
    if (virtualSliceAddr != VSA_NONE)
    {
        if (virtualSliceMapPtr->virtualSlice[virtualSliceAddr].logicalSliceAddr != logicalSliceAddr)
            return;
 
        dieNo   = Vsa2VdieTranslation(virtualSliceAddr);
        blockNo = Vsa2VblockTranslation(virtualSliceAddr);
 
        // unlink
        SelectiveGetFromGcVictimList(dieNo, blockNo);
        virtualBlockMapPtr->block[dieNo][blockNo].invalidSliceCnt++;
        logicalSliceMapPtr->logicalSlice[logicalSliceAddr].virtualSliceAddr = VSA_NONE;
 
        PutToGcVictimList(dieNo, blockNo, virtualBlockMapPtr->block[dieNo][blockNo].invalidSliceCnt);
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

PutToFbList()

void PutToFbList	(	unsigned int	dieNo,
		unsigned int	blockNo
	)

Append the given virtual block to the free block list of its die.

Parameters

dieNo	the die number of the given block.
blockNo	VBN of the specified block.

Definition at line 1161 of file address_translation.c.

{
    if (virtualDieMapPtr->die[dieNo].tailFreeBlock != BLOCK_NONE)
    {
        virtualBlockMapPtr->block[dieNo][blockNo].prevBlock = virtualDieMapPtr->die[dieNo].tailFreeBlock;
        virtualBlockMapPtr->block[dieNo][blockNo].nextBlock = BLOCK_NONE;
        virtualBlockMapPtr->block[dieNo][virtualDieMapPtr->die[dieNo].tailFreeBlock].nextBlock = blockNo;
        virtualDieMapPtr->die[dieNo].tailFreeBlock                                             = blockNo;
    }
    else
    {
        virtualBlockMapPtr->block[dieNo][blockNo].prevBlock = BLOCK_NONE;
        virtualBlockMapPtr->block[dieNo][blockNo].nextBlock = BLOCK_NONE;
        virtualDieMapPtr->die[dieNo].headFreeBlock          = blockNo;
        virtualDieMapPtr->die[dieNo].tailFreeBlock          = blockNo;
    }
 
    virtualDieMapPtr->die[dieNo].freeBlockCnt++;
}

Here is the caller graph for this function:

UpdateBadBlockTableForGrownBadBlock()

void UpdateBadBlockTableForGrownBadBlock

(

unsigned int

tempBufAddr

)

Update the bad block table and persist to the specified block.

A little bit similar to FindBadBlock(), but this function use the bad block flag to mark bad blocks, instead of reading the bad block marks.

Parameters

tempBufAddr

the base address of the bad block tables.

Definition at line 1254 of file address_translation.c.

{
    unsigned int dieNo, phyBlockNo, tempBbtBufBaseAddr, tempBbtBufEntrySize;
    unsigned int tempBbtBufAddr[USER_DIES];
    unsigned char dieState[USER_DIES];
    unsigned char *bbtUpdater;
 
    // data buffer allocation
    tempBbtBufBaseAddr  = tempBufAddr;
    tempBbtBufEntrySize = BYTES_PER_DATA_REGION_OF_PAGE + BYTES_PER_SPARE_REGION_OF_PAGE;
    for (dieNo = 0; dieNo < USER_DIES; dieNo++)
        tempBbtBufAddr[dieNo] =
            tempBbtBufBaseAddr + dieNo * USED_PAGES_FOR_BAD_BLOCK_TABLE_PER_DIE * tempBbtBufEntrySize;
 
    // create new bad block table
    for (dieNo = 0; dieNo < USER_DIES; dieNo++)
    {
        if (bbtInfoMapPtr->bbtInfo[dieNo].grownBadUpdate == BBT_INFO_GROWN_BAD_UPDATE_BOOKED)
        {
            for (phyBlockNo = 0; phyBlockNo < TOTAL_BLOCKS_PER_DIE; phyBlockNo++)
            {
                bbtUpdater = (unsigned char *)(tempBbtBufAddr[dieNo] + phyBlockNo);
 
                if (phyBlockNo != bbtInfoMapPtr->bbtInfo[dieNo].phyBlock)
                    *bbtUpdater = phyBlockMapPtr->phyBlock[dieNo][phyBlockNo].bad;
                else
                    *bbtUpdater = BLOCK_STATE_NORMAL;
            }
 
            dieState[dieNo] = DIE_STATE_BAD_BLOCK_TABLE_UPDATE;
        }
        else
            dieState[dieNo] = DIE_STATE_BAD_BLOCK_TABLE_HOLD;
    }
 
    // update bad block tables in flash
    SaveBadBlockTable(dieState, tempBbtBufAddr, tempBbtBufEntrySize);
}

Here is the call graph for this function:

Here is the caller graph for this function:

UpdatePhyBlockMapForGrownBadBlock()

void UpdatePhyBlockMapForGrownBadBlock	(	unsigned int	dieNo,
		unsigned int	phyBlockNo
	)

Mark the given physical block bad block and update the bbt later.

Parameters

dieNo	the die number of the given block.
phyBlockNo	the physical address of the block to be marked as bad block.

Definition at line 1240 of file address_translation.c.

{
    phyBlockMapPtr->phyBlock[dieNo][phyBlockNo].bad = BLOCK_STATE_BAD;
    bbtInfoMapPtr->bbtInfo[dieNo].grownBadUpdate    = BBT_INFO_GROWN_BAD_UPDATE_BOOKED;
}

Here is the caller graph for this function:

Variable Documentation

bbtInfoMapPtr

P_BAD_BLOCK_TABLE_INFO_MAP bbtInfoMapPtr

extern

Definition at line 59 of file address_translation.c.

logicalSliceMapPtr

P_LOGICAL_SLICE_MAP logicalSliceMapPtr

extern

Definition at line 54 of file address_translation.c.

mbPerbadBlockSpace

unsigned int mbPerbadBlockSpace

extern

Definition at line 62 of file address_translation.c.

phyBlockMapPtr

P_PHY_BLOCK_MAP phyBlockMapPtr

extern

Definition at line 58 of file address_translation.c.

sliceAllocationTargetDie

unsigned char sliceAllocationTargetDie

extern

Definition at line 61 of file address_translation.c.

virtualBlockMapPtr

P_VIRTUAL_BLOCK_MAP virtualBlockMapPtr

extern

Definition at line 56 of file address_translation.c.

virtualDieMapPtr

P_VIRTUAL_DIE_MAP virtualDieMapPtr

extern

Definition at line 57 of file address_translation.c.

virtualSliceMapPtr

P_VIRTUAL_SLICE_MAP virtualSliceMapPtr

extern

Definition at line 55 of file address_translation.c.