1. 14 Jan, 2016 1 commit
  2. 13 Jan, 2016 1 commit
    • Matthew Waters's avatar
      info: expose debugging printf functions · 347734e5
      Matthew Waters authored
      Other gst libraries and/or elements may want to add some debug logging to an
      external debug system or implement delayed debugging for performance reasons.
      Exposes the internal __gst_vasprintf as gst_info_vasprintf which has a fallback
      to g_vasprintf if the debug system is disabled.
      API: gst_info_vasprintf
      API: gst_info_strdup_vprintf
      API: gst_info_strdup_printf
  3. 08 Jan, 2016 2 commits
  4. 07 Jan, 2016 5 commits
  5. 06 Jan, 2016 7 commits
  6. 05 Jan, 2016 3 commits
  7. 03 Jan, 2016 4 commits
  8. 31 Dec, 2015 1 commit
  9. 29 Dec, 2015 2 commits
  10. 14 Dec, 2015 2 commits
  11. 10 Dec, 2015 2 commits
  12. 09 Dec, 2015 1 commit
  13. 07 Dec, 2015 1 commit
  14. 04 Dec, 2015 1 commit
    • Wim Taymans's avatar
      query: fix docs · 87ab2603
      Wim Taymans authored
      The allocation query has parameters with the meta API, not flags.
  15. 02 Dec, 2015 1 commit
  16. 01 Dec, 2015 1 commit
  17. 30 Nov, 2015 1 commit
  18. 25 Nov, 2015 3 commits
    • Nicolas Dufresne's avatar
      plugin: Add prefix support to dependencies · c47e1383
      Nicolas Dufresne authored
      which allow using the names as prefix for plugin depencies.
    • Nicolas Dufresne's avatar
      plugin: Allow device nodes as dependency · 79b935b3
      Nicolas Dufresne authored
      This is useful for feature that are produced after probing a specific
      node. You want to reload this plugin if the specific node(s) have been
      removed, added, or reloaded.
    • Nicolas Dufresne's avatar
      plugin: Don't do lossy shift on hash · 446b3e6d
      Nicolas Dufresne authored
      In plugin is responsible for calculating a hash of the dependencies
      in order to determine if the cache should be invalidated or not.
      Currently, the hash combining method removes a bit of the original
      have before combining with an addition. As we use 32bits for our hash
      and shift 1 bit for each file and directory, that resulting hash only
      account for the last 32 files. And is more affected by the last file.
      Rotating technique (shifting, and adding back the ending bit), can be
      use to make the addition non-commutative. In a way that different order
      gives different hashes. In this case, I don't preserve this behaviour
      because the order in which the files are provided by the OS is
      In most cases, the XOR operation is used to combine hashes. In this
      code we use the addition. I decided to preserve the addition because
      we make use of non-random hash ((guint) -1) in the algorithm for
      matching files that are not really part of the hash (symlinks, special
      files). Doing successive XOR on this value, will simply switch from
      full ones, to full zero. The XOR used with whitelist has been preserved
      as it's based on a fairly randomized hash (g_str_hash).
  19. 24 Nov, 2015 1 commit