1. 19 Jun, 2014 4 commits
  2. 17 Jun, 2014 2 commits
    • Edward Hervey's avatar
      gstvalue: Speed up gst_value_intersect/_subtract · b0b20b44
      Edward Hervey authored
      Both gst_value_intersect and gst_value_subtract will call
      gst_value_compare if one of their arguments isn't a list.
      gst_value_compare will then re-do a check to see if one of
      the arguments is a list (for the special case of comparing a unitary
      value with a list of length 1).
      The problem is that the various G_VALUE_HOLDS represent an expensive
      amount of calling gst_value_compare (almost half of it) to see if
      the provided arguments are list. These checks can be done without
      when we know that the arguments aren't lists.
      * Create a new "nolist" gst_value_compare which avoids that special
        case comparision
       valgrind/callgrind: average speedup in instruction calls for
       gst_value_intersect and gst_value_subtract is around 56% (Makes 63%
       of the calls it used to take previously)
       tests/benchmarks/capsnego: With default settings (depth 4, children 3
       607 elements), time taken for transition from READY to PAUSED:
         Before : 00.391519153
         After  : 00.220397492
          56% of the time previously used, +77% speedup
    • Tim-Philipp Müller's avatar
      tests: remove some cruft from the bufferlist test · 5c62bce8
      Tim-Philipp Müller authored
      Buffers no longer carry caps, and bufferlists don't have
      groups where buffers may need to be merged into one any more.
  3. 16 Jun, 2014 4 commits
  4. 14 Jun, 2014 4 commits
  5. 12 Jun, 2014 2 commits
  6. 10 Jun, 2014 2 commits
    • Nicolas Dufresne's avatar
      bytereader: Use concistant derefence method · d99e6215
      Nicolas Dufresne authored
      This is minor style fix to not mix *var and var[N].
    • Sungho Bae's avatar
      bytereader: Use pointer instead of index access · d3b2f6e4
      Sungho Bae authored
      Currently the scan uses Boyer-moore method and its performance is good.
      but, it can be optimized from an implementation of view.
      The original scan code is implemented by byte array and index-based access.
      In _scan_for_start_code(), the index is increasing from start to end and the
      base address of the byte array is referred to as return value.
      In the case, index-based access can be replaced by pointer access, which
      improve the performance by removing index-related operations.
      Its performace is enhanced by approximately 8% on arm-based embedded devices.
      Although it seems trivial, it can affect the overall performance because the
      _scan_for_start_code() function is very often called when H.264/H.265 video is
      In addition, the technique can apply for all architectures and it is good in
      view of readability and maintainability.
  7. 07 Jun, 2014 4 commits
  8. 06 Jun, 2014 3 commits
  9. 04 Jun, 2014 1 commit
  10. 03 Jun, 2014 10 commits
  11. 01 Jun, 2014 1 commit
  12. 31 May, 2014 1 commit
  13. 30 May, 2014 2 commits