Donate to e Foundation | Murena handsets with /e/OS | Own a part of Murena! Learn more

Commit 76e2d261 authored by Ingo Molnar's avatar Ingo Molnar
Browse files

Merge tag 'perf-core-for-mingo-20161024' of... 

Merge tag 'perf-core-for-mingo-20161024' of git://git.kernel.org/pub/scm/linux/kernel/git/acme/linux

 into perf/core

Pull perf/core improvements and fixes from Arnaldo Carvalho de Melo:

New features:

- Dynamicly change verbosity level by pressing 'V' in the 'perf top/report'
  hists TUI browser (Alexis Berlemont)

- Implement 'perf trace --delay' in the same fashion as in 'perf record --delay',
  to skip sampling workload initialization events (Alexis Berlemont)

- Make vendor named events case insensitive in 'perf list', i.e.
  'perf list LONGEST_LAT' works just the same as  'perf list longest_lat' (Andi Kleen)

- Show instruction bytes and lenght in 'perf script' for Intel PT and BTS (Andi Kleen, Adrian Hunter)

   E.g:

    % perf record -e intel_pt// foo
    % perf script --itrace=i0ns -F ip,insn,insnlen
     ffffffff8101232f ilen: 5 insn: 0f 1f 44 00 00
     ffffffff81012334 ilen: 1 insn: 5b
     ffffffff81012335 ilen: 1 insn: 5d
     ffffffff81012336 ilen: 1 insn: c3
     ffffffff810123e3 ilen: 1 insn: 5b
     ffffffff810123e4 ilen: 2 insn: 41 5c
     ffffffff810123e6 ilen: 1 insn: 5d
     ffffffff810123e7 ilen: 1 insn: c3
     ffffffff810124a6 ilen: 2 insn: 31 c0
     ffffffff810124a8 ilen: 9 insn: 41 83 bc 24 a8 01 00 00 01
     ffffffff810124b1 ilen: 2 insn: 75 87

- Allow enabling the perf_event_attr.branch_type attribute member: (Andi Kleen)

  perf record -e sched:sched_switch,cpu/cpu-cycles,branch_type=any/ ...

- Add unwinding support for jitdump (Stefano Sanfilippo)

Fixes:

- Use raw_syscall:sys_enter timestamp in 'perf trace' (Arnaldo Carvalho de Melo)

Infrastructure:

- Allow jitdump to be built without libdwarf (Maciej Debski)

- Sync x86's syscall table tools/ copy (Arnaldo Carvalho de Melo)

- Fixes to avoid calling die() in library fuctions already propagating other
  errors (Arnaldo Carvalho de Melo)

- Improvements to allow libtraceevent to be properly installed in distro
  packages (Jiri Olsa)

- Removing coresight miscellaneous debug output (Mathieu Poirier)

- Cache align the 'perf bench futex' worker struct (Sebastian Andrzej Siewior)

Documentation:

- Minor improvements on the documentation of event parameters (Andi Kleen)

- Add jitdump format specification document (Stephane Eranian)

Spelling fixes:

- Fix typo "No enough" to "Not enough" (Alexander Alemayhu)

Signed-off-by: default avatarArnaldo Carvalho de Melo <acme@redhat.com>
Signed-off-by: default avatarIngo Molnar <mingo@kernel.org>
parents e9c84892 04b553ad

tools/include/asm-generic/bitops.h

+1 −0
Original line number Diff line number Diff line
@@ -13,6 +13,7 @@ 
 */



#include <asm-generic/bitops/__ffs.h>

#include <asm-generic/bitops/__ffz.h>

#include <asm-generic/bitops/fls.h>

#include <asm-generic/bitops/__fls.h>

#include <asm-generic/bitops/fls64.h>

tools/include/asm-generic/bitops/__ffz.h

0 → 100644
+12 −0
Original line number Diff line number Diff line 
#ifndef _ASM_GENERIC_BITOPS_FFZ_H_

#define _ASM_GENERIC_BITOPS_FFZ_H_



/*

 * ffz - find first zero in word.

 * @word: The word to search

 *

 * Undefined if no zero exists, so code should check against ~0UL first.

 */

#define ffz(x)  __ffs(~(x))



#endif /* _ASM_GENERIC_BITOPS_FFZ_H_ */

tools/include/asm-generic/bitops/find.h

+28 −0
Original line number Diff line number Diff line
@@ -15,6 +15,21 @@ extern unsigned long find_next_bit(const unsigned long *addr, unsigned long 
		size, unsigned long offset);

#endif



#ifndef find_next_zero_bit



/**

 * find_next_zero_bit - find the next cleared bit in a memory region

 * @addr: The address to base the search on

 * @offset: The bitnumber to start searching at

 * @size: The bitmap size in bits

 *

 * Returns the bit number of the next zero bit

 * If no bits are zero, returns @size.

 */

unsigned long find_next_zero_bit(const unsigned long *addr, unsigned long size,

				 unsigned long offset);

#endif



#ifndef find_first_bit



/**
@@ -30,4 +45,17 @@ extern unsigned long find_first_bit(const unsigned long *addr, 


#endif /* find_first_bit */



#ifndef find_first_zero_bit



/**

 * find_first_zero_bit - find the first cleared bit in a memory region

 * @addr: The address to start the search at

 * @size: The maximum number of bits to search

 *

 * Returns the bit number of the first cleared bit.

 * If no bits are zero, returns @size.

 */

unsigned long find_first_zero_bit(const unsigned long *addr, unsigned long size);

#endif



#endif /*_TOOLS_LINUX_ASM_GENERIC_BITOPS_FIND_H_ */

tools/include/linux/bitops.h

+5 −0
Original line number Diff line number Diff line
@@ -39,6 +39,11 @@ extern unsigned long __sw_hweight64(__u64 w); 
	     (bit) < (size);					\

	     (bit) = find_next_bit((addr), (size), (bit) + 1))



#define for_each_clear_bit(bit, addr, size) \

	for ((bit) = find_first_zero_bit((addr), (size));       \

	     (bit) < (size);                                    \

	     (bit) = find_next_zero_bit((addr), (size), (bit) + 1))



/* same as for_each_set_bit() but use bit as value to start with */

#define for_each_set_bit_from(bit, addr, size) \

	for ((bit) = find_next_bit((addr), (size), (bit));	\

tools/lib/find_bit.c

+25 −0
Original line number Diff line number Diff line
@@ -82,3 +82,28 @@ unsigned long find_first_bit(const unsigned long *addr, unsigned long size) 
	return size;

}

#endif



#ifndef find_first_zero_bit

/*

 * Find the first cleared bit in a memory region.

 */

unsigned long find_first_zero_bit(const unsigned long *addr, unsigned long size)

{

	unsigned long idx;



	for (idx = 0; idx * BITS_PER_LONG < size; idx++) {

		if (addr[idx] != ~0UL)

			return min(idx * BITS_PER_LONG + ffz(addr[idx]), size);

	}



	return size;

}

#endif



#ifndef find_next_zero_bit

unsigned long find_next_zero_bit(const unsigned long *addr, unsigned long size,

				 unsigned long offset)

{

	return _find_next_bit(addr, size, offset, ~0UL);

}

#endif