Please explain the code line by line in detail. As im so cobfuse how the code work.

The code below is for Deadlock Prevention Circular Wait

Provide a total ordering on lock acquisition

$$ There are two locks in the system $($L$1$ and L$2)$

$$ We can prevent deadlock by always acquiring L$1$ before L$2.$

Code:

void vector$\_$add $($vector$\_$t $*$v$\_$dst$,$ vector$\_$t $*v_{-}$src$)\{$

Pthread$\_$mutex$\_$lock$($&v$\_$dst$->$lock$)$;

Pthread$\_$mutex$\_$lock$($&v$\_$src$->$lock$)$ ;

int $i$;

for $(i=0$; $i$ VECTOR$\_$SIZE; $i++)\{$

v$\_$dst$->$values$[$i$]=$ v$\_$dst$->$values$[$i$]+$ v$\_$src$->$values$[$i$]$;

$\}$

Pthread$\_$mutex$\_$unlock$($&v$\_$dst$->$lock$)$;

Pthread$\_$mutex$\_$unlock$($&v$\_$src$->$lock$)$;

$\}$