Lines Matching defs:of
3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
71 cl::desc("perform verification of LLVM instruction encoding/decoding. "
98 "of the tables")),
136 cl::desc("list of functions to print"),
194 // We use the pointer in SMLoc to store an instance of DebugLineTableRowRef,
360 // Make sure the block is removed from the list of predecessors.
491 // Offset of the instruction in function.
663 OS << "End of Function \"" << *this << "\"\n\n";
776 // It could be the branch instruction itself or one of the instructions
777 // setting the value of the register used by the branch.
783 // Address of the table referenced by MemLocInstr. Could be either an
784 // array of function pointers, or a jump table.
798 // Start at the last label as an approximation of the current basic block.
799 // This is a heuristic, since the full set of labels have yet to be
845 // block of the function, it will create a reference to the next function).
850 // proper way of determining the jump table limits.
1007 // For AArch64, check if this address is part of a constant island.
1121 // This is a call regardless of the opcode.
1138 // We actually see calls to address 0 in presence of weak
1241 // Insert a label at the beginning of the function. This will be our first
1247 // the start of a basic block but always to a specific instruction. This is
1287 // Check integrity of LLVM assembler/disassembler.
1353 // Result of __builtin_unreachable().
1457 // Record offset of the instruction for profile matching.
1514 // Set HasAddressTaken for a function regardless of the ICF level.
1535 // List of external references for this function.
1550 // Disassemble contents of the function. Detect code entry points and create
1730 // end of the function, e.g. jump tables.
1734 BC.errs() << "BOLT-WARNING: reference in the middle of instruction "
1818 // A label at the next entry means the end of this jump table.
2063 // the beginning of a basic block.
2064 // * Conditional instruction marks the end of a basic block,
2067 // a destination of another branch. In the latter case, the
2068 // basic block will consist of a single unconditional branch
2077 // Offset of the last non-nop instruction.
2089 // For profiling purposes we need to save the offset of the last instruction
2201 // Remove duplicates branches. We can get a bunch of them from jump tables.
2288 // as non-simple later in the process of discovering extra entry points.
2329 // The final cleanup of intermediate structures.
2403 // Link new BBs to the original input offset of the BB where the CTC
2462 // This is an index of the last processed CFI in FDE CFI program.
2465 // This is an index of RememberState CFI reflecting effective state right
2466 // after execution of RestoreState CFI.
2510 BC.errs() << "BOLT-WARNING: non-empty CFI stack at the end of " << *this
2517 /// Our full interpretation of a DWARF CFI machine state at a given point
2520 /// point, or the number of a rule (CFI state) that computes it with a
2522 /// located in the CIE instead of the FDE.
2526 /// Mapping of rules (CFI states) that define the location of each
2527 /// register. If absent, no rule defining the location of such register
2529 /// located in the CIE instead of the FDE.
2541 /// to recover the location of either the CFA or a specific register
2614 // the same effect of this restore. This is used to ensure remember-
2652 /// A CFI snapshot with the capability of checking if incremental additions to
2915 // same effect of the restore. All remember state are then just ignored.
2939 LLVM_DEBUG(dbgs() << "This is the list of CFI states for each BB of " << *this
2945 // Hot-cold border: at start of each region (with a different FDE) we need
2957 // the effect of all CFI from BB's state to current State.
2963 // beginning of this BB. If this sequence of instructions involve
3200 // analyzeBranch is just used to get the names of the branch
3281 raw_fd_ostream of(Filename, EC, sys::fs::OF_None);
3289 dumpGraph(of);
3293 // Skip the validation of CFG after it is finalized
3458 // fragment, make it the destination of the conditional branch. There
3469 // Cases where the number of successors is 0 (block ends with a
3484 // The current value of DW_CFA_GNU_args_size affects all following
3503 // Add the value of GNU_args_size as an extra operand to invokes.
3686 // NB: we rely on the original order of entries to match.
3755 // The hash is computed by creating a string of all instruction opcodes and
3849 // If start not provided copy new blocks from the beginning of BasicBlocks
3900 // using the same jump table of another jump. Try all our tricks to
4011 // Link new BBs to the original input offset of the From BB, so we can map
4063 // Look for suspicious calls at the end of BB where gcc may optimize it and
4095 // It's okay to have a zero-sized symbol in the middle of non-zero-sized
4300 // input range. Just assign the BB the output address of the
4354 "fragment of non-simple function should also be non-simple");
4383 // Special case for address immediately past the end of the function.
4411 // Special case of an empty range [X, X). Some tools expect X to be updated.
4562 OS << "Total number of loops: " << BLI->TotalLoops << "\n";
4563 OS << "Number of outer loops: " << BLI->OuterLoops << "\n";
4589 "address is outside of the function");