Originally committed as revision 24108 to svn://svn.ffmpeg.org/ffmpeg/trunktags/n0.8
| @@ -365,8 +365,8 @@ static av_cold int cook_decode_close(AVCodecContext *avctx) | |||||
| /** | /** | ||||
| * Fill the gain array for the timedomain quantization. | * Fill the gain array for the timedomain quantization. | ||||
| * | * | ||||
| * @param gb pointer to the GetBitContext | |||||
| * @param gaininfo array of gain indexes | |||||
| * @param gb pointer to the GetBitContext | |||||
| * @param gaininfo[9] array of gain indexes | |||||
| */ | */ | ||||
| static void decode_gain_info(GetBitContext *gb, int *gaininfo) | static void decode_gain_info(GetBitContext *gb, int *gaininfo) | ||||
| @@ -1028,7 +1028,7 @@ static av_always_inline int diamond_search(MpegEncContext * s, int *best, int dm | |||||
| } | } | ||||
| /*! | /*! | ||||
| \param P a list of candidate mvs to check before starting the | |||||
| \param P[10][2] a list of candidate mvs to check before starting the | |||||
| iterative search. If one of the candidates is close to the optimal mv, then | iterative search. If one of the candidates is close to the optimal mv, then | ||||
| it takes fewer iterations. And it increases the chance that we find the | it takes fewer iterations. And it increases the chance that we find the | ||||
| optimal mv. | optimal mv. | ||||
| @@ -55,7 +55,7 @@ static inline unsigned int av_mlfg_get(AVLFG *c){ | |||||
| * Get the next two numbers generated by a Box-Muller Gaussian | * Get the next two numbers generated by a Box-Muller Gaussian | ||||
| * generator using the random numbers issued by lfg. | * generator using the random numbers issued by lfg. | ||||
| * | * | ||||
| * @param out array where the two generated numbers are placed | |||||
| * @param out[2] array where the two generated numbers are placed | |||||
| */ | */ | ||||
| void av_bmg_get(AVLFG *lfg, double out[2]); | void av_bmg_get(AVLFG *lfg, double out[2]); | ||||