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:orph_last
(Results
1 - 10
of
10
) sorted by relevance
/kernel/linux/linux-5.10/fs/ubifs/
H
A
D
orphan.c
355
if (c->ohead_lnum > c->
orph_last
) {
in write_orph_node()
391
ubifs_assert(c, c->ohead_lnum <= c->
orph_last
);
in write_orph_node()
419
for (lnum = c->ohead_lnum + 1; lnum <= c->
orph_last
; lnum++) {
in write_orph_nodes()
563
for (lnum = c->orph_first; lnum <= c->
orph_last
; lnum++) {
in ubifs_clear_orphans()
777
for (lnum = c->orph_first; lnum <= c->
orph_last
; lnum++) {
in kill_orphans()
990
for (lnum = c->orph_first; lnum <= c->
orph_last
; lnum++) {
in dbg_scan_orphans()
H
A
D
sb.c
771
c->
orph_last
= c->orph_first + c->orph_lebs - 1;
in ubifs_read_superblock()
864
for (lnum = c->orph_first; lnum <= c->
orph_last
; lnum++) {
in fixup_free_space()
H
A
D
ubifs.h
1084
* @
orph_last
: last LEB of the orphan area
1335
int
orph_last
;
member
H
A
D
super.c
1583
c->orph_lebs, c->orph_first, c->
orph_last
);
in mount_ubifs()
H
A
D
debug.c
2532
} else if (lnum >= c->orph_first && lnum <= c->
orph_last
) {
in power_cut_emulated()
/kernel/linux/linux-6.6/fs/ubifs/
H
A
D
orphan.c
355
if (c->ohead_lnum > c->
orph_last
) {
in write_orph_node()
391
ubifs_assert(c, c->ohead_lnum <= c->
orph_last
);
in write_orph_node()
419
for (lnum = c->ohead_lnum + 1; lnum <= c->
orph_last
; lnum++) {
in write_orph_nodes()
563
for (lnum = c->orph_first; lnum <= c->
orph_last
; lnum++) {
in ubifs_clear_orphans()
777
for (lnum = c->orph_first; lnum <= c->
orph_last
; lnum++) {
in kill_orphans()
990
for (lnum = c->orph_first; lnum <= c->
orph_last
; lnum++) {
in dbg_scan_orphans()
H
A
D
sb.c
774
c->
orph_last
= c->orph_first + c->orph_lebs - 1;
in ubifs_read_superblock()
867
for (lnum = c->orph_first; lnum <= c->
orph_last
; lnum++) {
in fixup_free_space()
H
A
D
ubifs.h
1105
* @
orph_last
: last LEB of the orphan area
1363
int
orph_last
;
member
H
A
D
super.c
1586
c->orph_lebs, c->orph_first, c->
orph_last
);
in mount_ubifs()
H
A
D
debug.c
2532
} else if (lnum >= c->orph_first && lnum <= c->
orph_last
) {
in power_cut_emulated()
Completed in 33 milliseconds