Home
Sort by
last modified time
|
relevance
|
path
Repository(s)
applications
arkcompiler
base
build
commonlibrary
developtools
device
docs
domains
drivers
foundation
ide
interface
kernel
napi_generator
productdefine
test
third_party
vendor
select all
invert selection
clear
Full Search
Search through all text tokens(words,strings,identifiers,numbers) in index.
Definition
Only finds symbol definitions(where e.g a variable(function,...) is defined).
Symbol
Only finds symbol(e.g. methods classes,function,variables).
File Path
Path of the source file(use "/").If you want just exact path,enclose it in "".Source files end with: .jar/.bz2/.a/.h/.java...
History
History log comments.
Type
Any
Bzip(2)
C
Clojure
C#
C++
ELF
Erlang
Image file
Fortran
Golang
GZIP
Haskell
Jar
Java
Java class
JavaScript
Lisp
Lua
Pascal
Perl
PHP
Plain Text
PL/SQL
Python
Rust
Scala
Shell script
SQL
Tar
Tcl
Troff
UUEncoded
Visual Basic
XML
Zip
Type of analyzer used to filter file types include with selected(e.g. just C sources).
Help
Searched
refs:BITS_PER_LONG
(Results
1 - 9
of
9
) sorted by relevance
/third_party/ltp/testcases/kernel/mem/include/
H
A
D
mem.h
22
#define
BITS_PER_LONG
(8 * sizeof(long))
macro
26
array[node /
BITS_PER_LONG
] |= 1UL << (node %
BITS_PER_LONG
);
in set_node()
33
for (i = 0; i < MAXNODES /
BITS_PER_LONG
; i++)
in clean_node()
/third_party/ltp/testcases/kernel/mce-test/hwpoison/kinclude/linux/
H
A
D
percpu.h
3
#define
BITS_PER_LONG
(sizeof(long)*8)
macro
4
#define DECLARE_BITMAP(x,y) unsigned long x[((y) +
BITS_PER_LONG
- 1) /
BITS_PER_LONG
];
/third_party/ltp/testcases/kernel/mce-test/tsrc/kinclude/linux/
H
A
D
percpu.h
3
#define
BITS_PER_LONG
(sizeof(long)*8)
macro
4
#define DECLARE_BITMAP(x,y) unsigned long x[((y) +
BITS_PER_LONG
- 1) /
BITS_PER_LONG
];
/third_party/eudev/src/udev/
H
A
D
udev-builtin-input_id.c
38
#define
BITS_PER_LONG
(sizeof(unsigned long) * 8)
macro
39
#define NBITS(x) ((((x)-1)/
BITS_PER_LONG
)+1)
40
#define OFF(x) ((x)%
BITS_PER_LONG
)
42
#define LONG(x) ((x)/
BITS_PER_LONG
)
135
log_debug(text, i *
BITS_PER_LONG
, bitmask[i]);
in get_cap_mask()
281
for (i = 0; i < BTN_MISC/
BITS_PER_LONG
; ++i) {
in test_key()
283
log_debug("test_key: checking bit block %lu for any keys; found=%i", (unsigned long)i*
BITS_PER_LONG
, found > 0);
in test_key()
/third_party/ltp/testcases/kernel/mem/ksm/
H
A
D
ksm04.c
64
unsigned long nmask[MAXNODES /
BITS_PER_LONG
] = { 0 };
in verify_ksm()
H
A
D
ksm02.c
64
unsigned long nmask[MAXNODES /
BITS_PER_LONG
] = { 0 };
in verify_ksm()
/third_party/ltp/testcases/kernel/mem/cpuset/
H
A
D
cpuset01.c
51
unsigned long nmask[MAXNODES /
BITS_PER_LONG
] = { 0 };
in test_cpuset()
/third_party/f2fs-tools/include/
H
A
D
f2fs_fs.h
573
#define
BITS_PER_LONG
64
macro
575
#define
BITS_PER_LONG
32
macro
578
#define BIT_MASK(nr) (1 << (nr %
BITS_PER_LONG
))
579
#define BIT_WORD(nr) (nr /
BITS_PER_LONG
)
/third_party/ltp/testcases/kernel/mem/lib/
H
A
D
mem.c
171
unsigned long nmask[MAXNODES /
BITS_PER_LONG
] = { 0 };
in set_global_mempolicy()
Completed in 7 milliseconds