Recherche avancée

Sur d’autres sites (6961)

• Console Log Stream information using ffmpeg node.js

  5 mars 2019, par Matteo

  I have created a work application that links in room encoders to live stream onto Facebook, Twitter and Youtube. I am wondering as to how to properly log the stream quality on the CMD. Below are snippets of the code and where I think the logic should be to properly pull the stream quality and display it in the cmd :

  Pushing Stream :

      if (req.query.french_facebook) {
  
    var streamComplete = req.query.fb_fre_streamURL + req.query.fb_fre_streamKey;
  
    temp = checkValidity('Facebook', 'French', req.query.fb_fre_streamURL, req.query.fb_fre_streamKey, status);
  
    status = temp[0];
  
    valid = temp[1];
  
    if (valid == true) {
  
      var command = `ffmpeg -re -i ${inputURL2('French',req.query.fb_fre_venue)} -c:v copy -acodec aac -ac 1 -ar 44100 -x264-params keyint=60:scenecut=0 -strict -2 -f flv "${streamComplete}"`;
  
      var process = nodeCmd.run(command);
  
      createStream(req.query.username, 'Facebook', 'French', req.query.fb_fre_streamKey, process.pid);
  
    } else {
  
      console.error("ERROR: unable to create stream");
  
    }
  
  }

  App initialization :

      var createError = require('http-errors');
  
  var express = require('express');
  
  var path = require('path');
  
  var cookieParser = require('cookie-parser');
  
  var logger = require('morgan');
  
  
  
  var indexRouter = require('./routes/index');
  
  var usersRouter = require('./routes/users');
  
  
  
  var app = express();
  
  
  
  var fs = require('fs');
  
  
  
  // view engine setup
  
  app.set('views', path.join(__dirname, 'views'));
  
  app.set('view engine', 'ejs');
  
  
  
  // app.use(logger('dev'));
  
  app.use(express.json());
  
  app.use(express.urlencoded({ extended: false }));
  
  app.use(cookieParser());
  
  app.use(express.static(path.join(__dirname, 'public')));
  
  
  
  app.use('/', indexRouter);
  
  app.use('/users', usersRouter);
  
  
  
  // catch 404 and forward to error handler
  
  app.use(function(req, res, next) {
  
    next(createError(404));
  
  });
  
  
  
  // error handler
  
  app.use(function(err, req, res, next) {
  
    // set locals, only providing error in development
  
    res.locals.message = err.message;
  
    res.locals.error = req.app.get('env') === 'development' ? err : {};
  
  
  
    // render the error page
  
    res.status(err.status || 500);
  
    res.render('error');
  
  });
  
  
  
  module.exports = app;

  If there is anything I am not making clear please let me know

• Visualizing Call Graphs Using Gephi

  1er septembre 2014, par Multimedia Mike — General

  When I was at university studying computer science, I took a basic chemistry course. During an accompanying lab, the teaching assistant chatted me up and asked about my major. He then said, “Computer science ? Well, that’s just typing stuff, right ?”

  My impulsive retort : “Sure, and chemistry is just about mixing together liquids and coming up with different colored liquids, as seen on the cover of my high school chemistry textbook, right ?”

  
  
  

  In fact, pure computer science has precious little to do with typing (as is joked in CS circles, computer science is about computers in the same way that astronomy is about telescopes). However, people who study computer science often pursue careers as programmers, or to put it in fancier professional language, software engineers.

  So, what’s a software engineer’s job ? Isn’t it just typing ? That’s where I’ve been going with this overly long setup. After thinking about it for long enough, I like to say that a software engineer’s trade is managing complexity.

  A few years ago, I discovered Gephi, an open source tool for graph and data visualization. It looked neat but I didn’t have much use for it at the time. Recently, however, I was trying to get a better handle on a large codebase. I.e., I was trying to manage the project’s complexity. And then I thought of Gephi again.

  Prior Work
  One way to get a grip on a large C codebase is to instrument it for profiling and extract details from the profiler. On Linux systems, this means compiling and linking the code using the -pg flag. After running the executable, there will be a gmon.out file which is post-processed using the gprof command.

  GNU software development tools have a reputation for being rather powerful and flexible, but also extremely raw. This first hit home when I was learning how to use the GNU tool for code coverage — gcov — and the way it outputs very raw data that you need to massage with other tools in order to get really useful intelligence.

  And so it is with gprof output. The output gives you a list of functions sorted by the amount of processing time spent in each. Then it gives you a flattened call tree. This is arranged as “during the profiled executions, function c was called by functions a and b and called functions d, e, and f ; function d was called by function c and called functions g and h”.

  How can this call tree data be represented in a more instructive manner that is easier to navigate ? My first impulse (and I don’t think I’m alone in this) is to convert the gprof call tree into a representation suitable for interpretation by Graphviz. Unfortunately, doing so tends to generate some enormous and unwieldy static images.

  Feeding gprof Data To Gephi
  I learned of Gephi a few years ago and recalled it when I developed an interest in gaining better perspective on a large base of alien C code. To understand what this codebase is doing for a particular use case, instrument it with gprof, gather execution data, and then study the code paths.

  How could I feed the gprof data into Gephi ? Gephi supports numerous graphing formats including an XML-based format named GEXF.

  Thus, the challenge becomes converting gprof output to GEXF.

  Which I did.

  Demonstration
  I have been absent from FFmpeg development for a long time, which is a pity because a lot of interesting development has occurred over the last 2-3 years after a troubling period of stagnation. I know that 2 big video codec developments have been HEVC (next in the line of MPEG codecs) and VP9 (heir to VP8’s throne). FFmpeg implements them both now.

  I decided I wanted to study the code flow of VP9. So I got the latest FFmpeg code from git and built it using the options "--extra-cflags=-pg --extra-ldflags=-pg". Annoyingly, I also needed to specify "--disable-asm" because gcc complains of some register allocation snafus when compiling inline ASM in profiling mode (and this is on x86_64). No matter ; ASM isn’t necessary for understanding overall code flow.

  After compiling, the binary ‘ffmpeg_g’ will have symbols and be instrumented for profiling. I grabbed a sample from this VP9 test vector set and went to work.

  ./ffmpeg_g -i vp90-2-00-quantizer-00.webm -f null /dev/null
  gprof ./ffmpeg_g > vp9decode.txt
  convert-gprof-to-gexf.py vp9decode.txt > /bigdisk/vp9decode.gexf
  

  Gephi loads vp9decode.gexf with no problem. Using Gephi, however, can be a bit challenging if one is not versed in any data exploration jargon. I recommend this Gephi getting starting guide in slide deck form. Here’s what the default graph looks like :

  
  
  

  Not very pretty or helpful. BTW, that beefy arrow running from mid-top to lower-right is the call from decode_coeffs_b -> iwht_iwht_4x4_add_c. There were 18774 from the former to the latter in this execution. Right now, the edge thicknesses correlate to number of calls between the nodes, which I’m not sure is the best representation.

  Following the tutorial slide deck, I at least learned how to enable the node labels (function symbols in this case) and apply a layout algorithm. The tutorial shows the force atlas layout. Here’s what the node neighborhood looks like for probing file type :

  
  
  

  Okay, so that’s not especially surprising– avprobe_input_format3 calls all of the *_probe functions in order to automatically determine input type. Let’s find that decode_coeffs_b function and see what its neighborhood looks like :

  
  
  

  That’s not very useful. Perhaps another algorithm might help. I select the Fruchterman–Reingold algorithm instead and get a slightly more coherent representation of the decoding node neighborhood :

  
  
  

  Further Work
  Obviously, I’m just getting started with this data exploration topic. One thing I would really appreciate in such a tool is the ability to interactively travel the graph since that’s what I’m really hoping to get out of this experiment– watching the code flows.

  Perhaps someone else can find better use cases for visualizing call graph data. Thus, I have published the source code for this tool at Github.

• Revision 1bb11781e2 : Rework idct8x8_10 SSE2 implementation This commit optimizes the SSE2 implmentat

  3 janvier 2014, par Jingning Han

  Changed Paths :
   Modify /vp9/common/x86/vp9_idct_intrin_sse2.c

  
  
  Rework idct8x8_10 SSE2 implementation

  This commit optimizes the SSE2 implmentation of idct8x8_10. It exploits
  the fact that only top-left 4x4 block contains non-zero coefficients,
  and hence reduces the instructions needed.

  The runtime of idct8x8_10_sse2 goes down from 216 to 198 CPU cycles,
  estimated by averaging over 100000 runs. For pedestrian_area_1080p 300
  frames coded at 4000kbps, the average decoding speed goes up from
  79.3 fps to 79.7 fps.

  Change-Id : I6d277bbaa3ec9e1562667906975bae06904cb180