Started 6 mo 20 days ago
Took 10 min on green-dragon-20

Failed Build rL:372168 - C:372152 - #643 (Sep 17, 2019 12:30:41 PM)

  • : 372168
  • : 372152
  • : 372143
  • : 364589
  • : 371835
  • : 372034
  • : 372128
  1. Revert "Data Dependence Graph Basics"

    This reverts commit c98ec60993a7aa65073692b62f6d728b36e68ccd, which broke the sphinx-docs build. (detail/ViewSVN)
    by bmahjour
  2. NVPTXAsmPrinter - Don't dereference a dyn_cast result. NFCI. (detail/ViewSVN)
    by rksimon
  3. WasmEmitter - Don't dereference a dyn_cast result. NFCI. (detail/ViewSVN)
    by rksimon
  4. [AArch64][GlobalISel][NFC] Refactor tail call lowering code

    When you begin implementing -tailcallopt, this gets somewhat hairy. Refactor
    the call lowering code so that the tail call lowering stuff gets its own

    Differential Revision: (detail/ViewSVN)
    by paquette
  5. gn build: Merge r372162 (detail/ViewSVN)
    by gnsyncbot
  6. Data Dependence Graph Basics

    This is the first patch in a series of patches that will implement data dependence graph in LLVM. Many of the ideas used in this implementation are based on the following paper:
    D. J. Kuck, R. H. Kuhn, D. A. Padua, B. Leasure, and M. Wolfe (1981). DEPENDENCE GRAPHS AND COMPILER OPTIMIZATIONS.
    This patch contains support for a basic DDGs containing only atomic nodes (one node for each instruction). The edges are two fold: def-use edges and memory-dependence edges.
    The implementation takes a list of basic-blocks and only considers dependencies among instructions in those basic blocks. Any dependencies coming into or going out of instructions that do not belong to those basic blocks are ignored.

    The algorithm for building the graph involves the following steps in order:

      1. For each instruction in the range of basic blocks to consider, create an atomic node in the resulting graph.
      2. For each node in the graph establish def-use edges to/from other nodes in the graph.
      3. For each pair of nodes containing memory instruction(s) create memory edges between them. This part of the algorithm goes through the instructions in lexicographical order and creates edges in reverse order if the sink of the dependence occurs before the source of it.

    Authored By: bmahjour

    Reviewer: Meinersbur, fhahn, myhsu, xtian, dmgreen, kbarton, jdoerfert

    Reviewed By: Meinersbur, fhahn, myhsu

    Subscribers: ychen, arphaman, simoll, a.elovikov, mgorny, hiraditya, jfb, wuzish, llvm-commits, jsji, Whitney, etiotto

    Tag: #llvm

    Differential Revision: (detail/ViewSVN)
    by bmahjour
  7. [docs][Bugpoint] Revert 5584ead50 a5aa3353

    No sure why there are still warnings, revert while I investigate. (detail/ViewSVN)
    by jsji

Started by an SCM change (7 times)

This run spent:

  • 1 hr 3 min waiting;
  • 10 min build duration;
  • 1 hr 14 min total from scheduled to completion.
LLVM/Clang Warnings: 1 warning.

Identified problems

Compile Error

This build failed because of a compile error. Below is a list of all errors in the build log:
Indication 1

Missing test results

The test result file Jenkins is looking for does not exist after the build.
Indication 2

Ninja target failed

Below is a link to the first failed ninja target.
Indication 3