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:next_free
(Results
1 - 8
of
8
) sorted by relevance
/third_party/libdrm/intel/
H
A
D
mm.c
48
for (p = heap->
next_free
; p != heap; p = p->
next_free
) {
in mmDumpMemInfo()
77
heap->
next_free
= block;
in mmInit()
83
block->
next_free
= heap;
in mmInit()
115
newblock->
next_free
= p->
next_free
;
in SliceBlock()
117
p->
next_free
->prev_free = newblock;
in SliceBlock()
118
p->
next_free
= newblock;
in SliceBlock()
140
newblock->
next_free
= p->
next_free
;
in SliceBlock()
[all...]
H
A
D
mm.h
36
struct mem_block *
next_free
, *prev_free;
member
/third_party/mesa3d/src/util/
H
A
D
u_mm.c
58
for (p = heap->
next_free
; p != heap; p = p->
next_free
) {
in u_mmDumpMemInfo()
89
heap->
next_free
= block;
in u_mmInit()
95
block->
next_free
= heap;
in u_mmInit()
128
newblock->
next_free
= p->
next_free
;
in SliceBlock()
130
p->
next_free
->prev_free = newblock;
in SliceBlock()
131
p->
next_free
= newblock;
in SliceBlock()
152
newblock->
next_free
= p->
next_free
;
in SliceBlock()
[all...]
H
A
D
u_mm.h
39
struct mem_block *
next_free
, *prev_free;
member
/third_party/mbedtls/library/
H
A
D
memory_buffer_alloc.c
52
memory_header *
next_free
;
member
94
(size_t) hdr->prev_free, (size_t) hdr->
next_free
);
in debug_header()
120
cur = cur->
next_free
;
in debug_chain()
155
if (hdr->prev_free != NULL && hdr->prev_free == hdr->
next_free
) {
in verify_header()
157
mbedtls_fprintf(stderr, "FATAL: prev_free ==
next_free
\n");
in verify_header()
246
cur = cur->
next_free
;
in buffer_alloc_calloc()
274
cur->prev_free->
next_free
= cur->
next_free
;
in buffer_alloc_calloc()
276
heap.first_free = cur->
next_free
;
in buffer_alloc_calloc()
279
if (cur->
next_free
!
in buffer_alloc_calloc()
[all...]
/third_party/node/deps/v8/src/trap-handler/
H
A
D
handler-outside.cc
95
i = gCodeObjects[i].
next_free
) {
in ValidateCodeObjects()
187
gCodeObjects[j].
next_free
= j + 1;
195
gNextCodeObject = gCodeObjects[i].
next_free
;
225
gCodeObjects[index].
next_free
= gNextCodeObject;
H
A
D
trap-handler-internal.h
43
// entries in the gCodeObjects table. Each entry contains a {
next_free
} field,
51
size_t
next_free
;
member
/third_party/node/deps/v8/src/handles/
H
A
D
global-handles.cc
261
first_free_ = first_free_->
next_free
();
in Acquire()
323
data_.
next_free
= nullptr;
in ~NodeBase()
331
data_.
next_free
= free_list;
in Free()
363
Child*
next_free
() {
in next_free()
function in v8::internal::NodeBase
365
return data_.
next_free
;
in next_free()
414
Child*
next_free
;
member
528
Node*
next_free
() {
in next_free()
function in v8::internal::final
530
return data_.
next_free
;
in next_free()
Completed in 5 milliseconds