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:NodeMarker
(Results
1 - 11
of
11
) sorted by relevance
/third_party/node/deps/v8/src/compiler/
H
A
D
node-marker.h
44
// A
NodeMarker
assigns a local "state" to every node of a graph in constant
45
// memory. Only one
NodeMarker
per graph is valid at a given time, that is,
46
// after you create a
NodeMarker
you should no longer use NodeMarkers that
50
// When you initialize a
NodeMarker
, all the local states are conceptually
53
// In its current implementation, in debug mode
NodeMarker
will try to
54
// (efficiently) detect invalid use of an older
NodeMarker
. Namely, if you set a
55
// node with a
NodeMarker
, and then get or set that node with an older
56
//
NodeMarker
you will get a crash.
58
// GraphReducer uses a
NodeMarker
, so individual Reducers cannot use a
59
//
NodeMarker
61
class
NodeMarker
: public
NodeMarker
Base {
global()
class
63
V8_INLINE
NodeMarker
(Graph* graph, uint32_t num_states)
NodeMarker()
function in v8::internal::compiler::NodeMarker
[all...]
H
A
D
branch-condition-duplicator.h
78
NodeMarker
<bool> seen_;
H
A
D
graph-trimmer.h
53
NodeMarker
<bool> is_live_;
H
A
D
control-flow-optimizer.h
52
NodeMarker
<bool> queued_;
H
A
D
decompression-optimizer.h
110
NodeMarker
<State> states_;
H
A
D
graph-reducer.h
195
NodeMarker
<State> state_;
H
A
D
escape-analysis.h
74
NodeMarker
<State> state_;
H
A
D
loop-analysis.h
255
NodeMarker
<size_t> node_map_;
H
A
D
loop-variable-optimizer.cc
38
NodeMarker
<bool> queued(graph(), 2);
in Run()
H
A
D
loop-analysis.cc
123
NodeMarker
<bool> queued_;
H
A
D
scheduler.cc
633
NodeMarker
<bool> queued_; // Mark indicating whether node is queued.
Completed in 8 milliseconds