Lint enabled for webrtc/modules/video_coding folder.

webrtc/modules/video_coding/session_info.h

 /*
  *  Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
  *
  *  Use of this source code is governed by a BSD-style license
  *  that can be found in the LICENSE file in the root of the source
  *  tree. An additional intellectual property rights grant can be found
  *  in the file PATENTS.  All contributing project authors may
  *  be found in the AUTHORS file in the root of the source tree.
  */
 
@@ skipping 98 matching lines @@
   // |it| is expected to point to the last packet of the previous partition,
   // or to the first packet of the frame. |packets_skipped| is incremented
   // for each packet found which doesn't have the beginning bit set.
   PacketIterator FindNextPartitionBeginning(PacketIterator it) const;
 
   // Returns an iterator pointing to the last packet of the partition pointed to
   // by |it|.
   PacketIterator FindPartitionEnd(PacketIterator it) const;
   static bool InSequence(const PacketIterator& it,
                          const PacketIterator& prev_it);
-  size_t InsertBuffer(uint8_t* frame_buffer,
-                      PacketIterator packetIterator);
+  size_t InsertBuffer(uint8_t* frame_buffer, PacketIterator packetIterator);
   size_t Insert(const uint8_t* buffer,
                 size_t length,
                 bool insert_start_code,
                 uint8_t* frame_buffer);
   void ShiftSubsequentPackets(PacketIterator it, int steps_to_shift);
   PacketIterator FindNaluEnd(PacketIterator packet_iter) const;
   // Deletes the data of all packets between |start| and |end|, inclusively.
   // Note that this function doesn't delete the actual packets.
-  size_t DeletePacketData(PacketIterator start,
-                          PacketIterator end);
+  size_t DeletePacketData(PacketIterator start, PacketIterator end);
   void UpdateCompleteSession();
 
   // When enabled, determine if session is decodable, i.e. incomplete but
   // would be sent to the decoder.
   // Note: definition assumes random loss.
   // A frame is defined to be decodable when:
   //  Round trip time is higher than threshold
   //  It is not a key frame
   //  It has the first packet: In VP8 the first packet contains all or part of
   //    the first partition, which consists of the most relevant information for
@@ skipping 22 matching lines @@
   // They are not necessarily equal to the front and back packets, as packets
   // may enter out of order.
   // TODO(mikhal): Refactor the list to use a map.
   int first_packet_seq_num_;
   int last_packet_seq_num_;
 };
 
 }  // namespace webrtc
 
 #endif  // WEBRTC_MODULES_VIDEO_CODING_SESSION_INFO_H_