| /third_party/ninja/src/ |
| H A D | build_test.cc | 758 Node* node = GetNode(path);
in Dirty() local
|
| /third_party/node/deps/cares/src/lib/ |
| H A D | ares__buf.c | 801 ares__llist_node_t *node; in ares__buf_split_isduplicate() local
|
| H A D | ares__hosts_file.c | 326 ares__llist_node_t *node; in ares__hosts_file_merge_entry() local
363 ares__llist_node_t *node; in ares__hosts_file_match() local
393 ares__llist_node_t *node; ares__hosts_file_add() local
455 ares__llist_node_t *node; ares__hosts_entry_isdup() local
865 ares__llist_node_t *node; ares__hosts_entry_to_hostent() local
985 ares__llist_node_t *node; ares__hosts_ai_append_cnames() local
1060 ares__llist_node_t *node; ares__hosts_entry_to_addrinfo() local
[all...] |
| /third_party/mesa3d/src/microsoft/compiler/ |
| H A D | dxil_dump.c | 657 dump_mdnode(struct dxil_dumper *d, const struct dxil_mdnode *node) in dump_mdnode() argument
[all...] |
| /third_party/mesa3d/src/util/ |
| H A D | disk_cache_os.c | 168 struct list_head node; member
|
| H A D | register_allocate.c | 555 struct ra_node* node in ra_realloc_interference_graph() local
[all...] |
| /third_party/libinput/test/ |
| H A D | test-utils.c | 1406 struct list node; in START_TEST() member
1437 struct list node; in START_TEST() member
1467 struct list node; in START_TEST() member
[all...] |
| /third_party/ltp/testcases/kernel/mce-test/tsrc/erst-inj/ |
| H A D | cper.h | 194 __u16 node; member
|
| /third_party/ltp/testcases/kernel/hotplug/memory_hotplug/ |
| H A D | commands.c | 64 static inline int nodemask_isset(nodemask_t * mask, int node) in nodemask_isset() argument
74 static inline void nodemask_set(nodemask_t * mask, int node) in nodemask_set() argument
349 int node; in get_nodemask() local
390 int node, count = 0; get_arg_nodeid_list() local
444 int node; get_current_nodeid_list() local
519 int node = nodeids[i]; numa_info() local
[all...] |
| /third_party/ltp/testcases/kernel/mce-test/hwpoison/erst-inj/ |
| H A D | cper.h | 194 __u16 node; member
|
| /third_party/lwip/src/apps/snmp/ |
| H A D | snmp_core.c | 985 const struct snmp_node *const *node = &mib->root_node; snmp_mib_tree_resolve_exact() local
1020 const struct snmp_node *const *node; snmp_mib_tree_resolve_next() local
[all...] |
| /third_party/libwebsockets/win32port/zlib/ |
| H A D | trees.c | 632 int node; /* new node being created */
local
[all...] |
| /third_party/ltp/tools/sparse/sparse-src/ |
| H A D | flow.c | 194 static bool phi_check(struct instruction *node) in phi_check() argument
848 struct instruction *node in remove_merging_phisrc() local
[all...] |
| /third_party/lzma/C/ |
| H A D | Ppmd7.c | 117 static void Ppmd7_InsertNode(CPpmd7 *p, void *node, unsigned indx)
in Ppmd7_InsertNode() argument
129 CPpmd_Void_Ref *node = (CPpmd_Void_Ref *)Ppmd7_GetPtr(p, p->FreeList[indx]);
in Ppmd7_RemoveNode() local
211 CPpmd7_Node *node in Ppmd7_GlueFreeBlocks() local
235 CPpmd7_Node *node = NODE(n); Ppmd7_GlueFreeBlocks() local
[all...] |
| /third_party/node/deps/v8/src/compiler/ |
| H A D | int64-lowering.cc | 126 void Int64Lowering::LowerWord64AtomicBinop(Node* node, const Operator* op) { in LowerWord64AtomicBinop() argument
136 LowerWord64AtomicNarrowOp(Node* node, const Operator* op) LowerWord64AtomicNarrowOp() argument
164 LowerLoadOperator(Node* node, MachineRepresentation rep, const Operator* load_op) LowerLoadOperator() argument
193 LowerStoreOperator(Node* node, MachineRepresentation rep, const Operator* store_op) LowerStoreOperator() argument
233 LowerNode(Node* node) LowerNode() argument
1060 LowerComparison(Node* node, const Operator* high_word_op, const Operator* low_word_op) LowerComparison() argument
1079 DefaultLowering(Node* node, bool low_word_only) DefaultLowering() argument
1113 HasReplacementLow(Node* node) HasReplacementLow() argument
1117 GetReplacementLow(Node* node) GetReplacementLow() argument
1123 HasReplacementHigh(Node* node) HasReplacementHigh() argument
1127 GetReplacementHigh(Node* node) GetReplacementHigh() argument
1159 ReplaceNodeWithProjections(Node* node) ReplaceNodeWithProjections() argument
1168 LowerMemoryBaseAndIndex(Node* node) LowerMemoryBaseAndIndex() argument
[all...] |
| H A D | node-matchers.h | 33 Node* node() const { return node_; } in node() function
55 inline Node* SkipValueIdentities(Node* node) { in SkipValueIdentities() argument
104 ValueMatcher( Node* node) ValueMatcher() argument
115 ValueMatcher(Node* node) ValueMatcher() argument
128 ValueMatcher( Node* node) ValueMatcher() argument
[all...] |
| H A D | node-properties.cc | 27 Node* const node = edge.from(); in IsValueEdge() local
35 Node* const node = edge.from(); in IsContextEdge() local
43 Node* const node = edge.from(); in IsFrameStateEdge() local
51 Node* const node = edge.from(); IsEffectEdge() local
59 Node* const node = edge.from(); IsControlEdge() local
66 IsExceptionalCall(Node* node, Node** out_exception) IsExceptionalCall() argument
79 FindSuccessfulControlProjection(Node* node) FindSuccessfulControlProjection() argument
92 ReplaceValueInput(Node* node, Node* value, int index) ReplaceValueInput() argument
100 ReplaceValueInputs(Node* node, Node* value) ReplaceValueInputs() argument
111 ReplaceContextInput(Node* node, Node* context) ReplaceContextInput() argument
118 ReplaceControlInput(Node* node, Node* control, int index) ReplaceControlInput() argument
126 ReplaceEffectInput(Node* node, Node* effect, int index) ReplaceEffectInput() argument
134 ReplaceFrameStateInput(Node* node, Node* frame_state) ReplaceFrameStateInput() argument
140 RemoveNonValueInputs(Node* node) RemoveNonValueInputs() argument
146 RemoveValueInputs(Node* node) RemoveValueInputs() argument
154 MergeControlToEnd(Graph* graph, CommonOperatorBuilder* common, Node* node) MergeControlToEnd() argument
161 RemoveControlFromEnd(Graph* graph, CommonOperatorBuilder* common, Node* node) RemoveControlFromEnd() argument
178 ReplaceUses(Node* node, Node* value, Node* effect, Node* success, Node* exception) ReplaceUses() argument
205 ChangeOp(Node* node, const Operator* new_op) ChangeOp() argument
212 FindFrameStateBefore(Node* node, Node* unreachable_sentinel) FindFrameStateBefore() argument
229 FindProjection(Node* node, size_t projection_index) FindProjection() argument
241 CollectValueProjections(Node* node, Node** projections, size_t projection_count) CollectValueProjections() argument
258 CollectControlProjections(Node* node, Node** projections, size_t projection_count) CollectControlProjections() argument
580 GetOuterContext(Node* node, size_t* depth) GetOuterContext() argument
591 GetTypeOrAny(const Node* node) GetTypeOrAny() argument
596 AllValueInputsAreTyped(Node* node) AllValueInputsAreTyped() argument
605 IsFreshObject(Node* node) IsFreshObject() argument
643 HashCode(Node* node) HashCode() argument
[all...] |
| H A D | typed-optimization.cc | 36 Reduction TypedOptimization::Reduce(Node* node) { in Reduce() argument
120 ResolveSameValueRenames(Node* node) ResolveSameValueRenames() argument
142 ReduceConvertReceiver(Node* node) ReduceConvertReceiver() argument
156 ReduceCheckHeapObject(Node* node) ReduceCheckHeapObject() argument
166 ReduceMaybeGrowFastElements(Node* node) ReduceMaybeGrowFastElements() argument
191 ReduceCheckBounds(Node* node) ReduceCheckBounds() argument
208 ReduceCheckNotTaggedHole(Node* node) ReduceCheckNotTaggedHole() argument
218 ReduceCheckMaps(Node* node) ReduceCheckMaps() argument
245 ReduceCheckNumber(Node* node) ReduceCheckNumber() argument
255 ReduceCheckString(Node* node) ReduceCheckString() argument
265 ReduceCheckEqualsInternalizedString(Node* node) ReduceCheckEqualsInternalizedString() argument
277 ReduceCheckEqualsSymbol(Node* node) ReduceCheckEqualsSymbol() argument
287 ReduceLoadField(Node* node) ReduceLoadField() argument
310 ReduceNumberFloor(Node* node) ReduceNumberFloor() argument
346 ReduceNumberRoundop(Node* node) ReduceNumberRoundop() argument
355 ReduceNumberSilenceNaN(Node* node) ReduceNumberSilenceNaN() argument
364 ReduceNumberToUint8Clamped(Node* node) ReduceNumberToUint8Clamped() argument
373 ReducePhi(Node* node) ReducePhi() argument
399 ReduceReferenceEqual(Node* node) ReduceReferenceEqual() argument
510 ReduceStringComparison(Node* node) ReduceStringComparison() argument
553 ReduceStringLength(Node* node) ReduceStringLength() argument
579 ReduceSameValue(Node* node) ReduceSameValue() argument
628 ReduceSelect(Node* node) ReduceSelect() argument
666 ReduceSpeculativeToNumber(Node* node) ReduceSpeculativeToNumber() argument
678 ReduceTypeOf(Node* node) ReduceTypeOf() argument
704 ReduceToBoolean(Node* node) ReduceToBoolean() argument
787 ReduceSpeculativeNumberAdd(Node* node) ReduceSpeculativeNumberAdd() argument
844 ConvertPlainPrimitiveToNumber(Node* node) ConvertPlainPrimitiveToNumber() argument
855 ReduceSpeculativeNumberBinop(Node* node) ReduceSpeculativeNumberBinop() argument
878 ReduceSpeculativeNumberComparison(Node* node) ReduceSpeculativeNumberComparison() argument
[all...] |
| H A D | store-store-elimination.cc | 300 MarkForRevisit(Node* node) MarkForRevisit() argument
308 HasBeenVisited(Node* node) HasBeenVisited() argument
312 RecomputeSet( Node* node, const UnobservablesSet& uses) RecomputeSet() argument
396 CannotObserveStoreField(Node* node) CannotObserveStoreField() argument
404 Visit(Node* node) Visit() argument
425 VisitEffectfulNode(Node* node) VisitEffectfulNode() argument
453 RecomputeUseIntersection(Node* node) RecomputeUseIntersection() argument
[all...] |
| H A D | verifier.cc | 51 void CheckNotTyped(Node* node) { in CheckNotTyped() argument
62 void CheckTypeIs(Node* node, Typ in CheckNotTyped() argument
70 CheckTypeMaybe(Node* node, Type type) CheckTypeMaybe() argument
78 CheckValueInputIs(Node* node, int i, Type type) CheckValueInputIs() argument
89 CheckOutput(Node* node, Node* use, int count, const char* kind) CheckOutput() argument
100 CheckSwitch(Node* node, const AllNodes& all) CheckSwitch() argument
139 Check(Node* node, const AllNodes& all) Check() argument
1886 Node* node = proj->InputAt(0); Run() local
1902 HasDominatingDef(Schedule* schedule, Node* node, BasicBlock* container, BasicBlock* use_block, int use_pos) HasDominatingDef() argument
1933 CheckInputsDominate(Schedule* schedule, BasicBlock* block, Node* node, int use_pos) CheckInputsDominate() argument
2125 Node* node = block->NodeAt(i); Run() local
2135 VerifyNode(Node* node) VerifyNode() argument
[all...] |
| H A D | js-inlining.cc | 250 CreateArtificialFrameState( Node* node, FrameState outer_frame_state, int parameter_count, BytecodeOffset bailout_id, FrameStateType frame_state_type, SharedFunctionInfoRef shared, Node* context) CreateArtificialFrameState() argument
294 DetermineCallTarget( Node* node) DetermineCallTarget() argument
349 DetermineCallContext(Node* node, Node** context_out) DetermineCallContext() argument
392 ReduceJSWasmCall(Node* node) ReduceJSWasmCall() argument
465 ReduceJSCall(Node* node) ReduceJSCall() argument
[all...] |
| H A D | js-inlining-heuristic.cc | 154 Reduction JSInliningHeuristic::Reduce(Node* node) { in Reduce() argument
89 CollectFunctions( Node* node, int functions_size) CollectFunctions() argument
314 Node* node; global() member
318 CollectStateValuesOwnedUses(Node* node, Node* state_values, NodeAndIndex* uses_buffer, size_t* use_count, size_t max_uses) CollectStateValuesOwnedUses() argument
370 CollectFrameStateUniqueUses(Node* node, FrameState frame_state, NodeAndIndex* uses_buffer, size_t* use_count, size_t max_uses) CollectFrameStateUniqueUses() argument
413 TryReuseDispatch(Node* node, Node* callee, Node** if_successes, Node** calls, Node** inputs, int input_count) TryReuseDispatch() argument
648 CreateOrReuseDispatch(Node* node, Node* callee, Candidate const& candidate, Node** if_successes, Node** calls, Node** inputs, int input_count) CreateOrReuseDispatch() argument
704 Node* const node = candidate.node; InlineCandidate() local
[all...] |
| H A D | loop-analysis.cc | 32 Node* node; member
188 IsInLoop(Node* node, int loop_num) IsInLoop() argument
201 Node* node = queue_.front(); PropagateBackward() local
252 CreateLoopInfo(Node* node) CreateLoopInfo() argument
267 SetLoopMark(Node* node, int loop_num) SetLoopMark() argument
273 SetLoopMarkForLoopHeader(Node* node, int loop_num) SetLoopMarkForLoopHeader() argument
328 Node* node = queue_.front(); PropagateForward() local
340 IsLoopHeaderNode(Node* node) IsLoopHeaderNode() argument
344 IsLoopExitNode(Node* node) IsLoopExitNode() argument
362 LoopNum(Node* node) LoopNum() argument
364 info(Node* node) info() argument
370 Queue(Node* node) Queue() argument
568 Node* node = queue.back(); FindSmallInnermostLoopFromHeader() local
720 map(Node* node, uint32_t copy_index) map() argument
[all...] |
| H A D | memory-lowering.cc | 78 Reduction MemoryLowering::Reduce(Node* node) { in Reduce() argument
135 ReduceAllocateRaw( Node* node, AllocationType allocation_type, AllowLargeObjects allow_large_objects, AllocationState const** state_ptr) ReduceAllocateRaw() argument
376 ReduceLoadFromObject(Node* node) ReduceLoadFromObject() argument
398 ReduceLoadElement(Node* node) ReduceLoadElement() argument
409 DecodeExternalPointer( Node* node, ExternalPointerTag external_pointer_tag) DecodeExternalPointer() argument
454 ReduceLoadMap(Node* node) ReduceLoadMap() argument
470 ReduceLoadField(Node* node) ReduceLoadField() argument
501 ReduceStoreToObject(Node* node, AllocationState const* state) ReduceStoreToObject() argument
522 ReduceStoreElement(Node* node, AllocationState const* state) ReduceStoreElement() argument
538 ReduceStoreField(Node* node, AllocationState const* state) ReduceStoreField() argument
573 ReduceStore(Node* node, AllocationState const* state) ReduceStore() argument
630 ReduceAllocateRaw(Node* node) ReduceAllocateRaw() argument
637 ComputeWriteBarrierKind( Node* node, Node* object, Node* value, AllocationState const* state, WriteBarrierKind write_barrier_kind) ComputeWriteBarrierKind() argument
656 AllocationGroup(Node* node, AllocationType allocation, Zone* zone) AllocationGroup() argument
665 AllocationGroup(Node* node, AllocationType allocation, Node* size, Zone* zone) AllocationGroup() argument
674 Add(Node* node) Add() argument
[all...] |
| /third_party/node/deps/v8/src/compiler/backend/ |
| H A D | instruction-selector-impl.h | 82 InstructionOperand DefineAsRegister(Node* node) { in DefineAsRegister() argument
88 InstructionOperand DefineSameAsInput(Node* node, int input_index) { in DefineSameAsInput() argument
92 InstructionOperand DefineSameAsFirst(Node* node) { in DefineSameAsFirst() argument
96 InstructionOperand DefineAsFixed(Node* node, Register reg) { in DefineAsFixed() argument
102 DefineAsFixed(Node* node, FPRegType reg) DefineAsFixed() argument
108 DefineAsConstant(Node* node) DefineAsConstant() argument
115 DefineAsLocation(Node* node, LinkageLocation location) DefineAsLocation() argument
119 DefineAsDualLocation(Node* node, LinkageLocation primary_location, LinkageLocation secondary_location) DefineAsDualLocation() argument
127 Use(Node* node) Use() argument
133 UseAnyAtEnd(Node* node) UseAnyAtEnd() argument
139 UseAny(Node* node) UseAny() argument
145 UseRegisterOrSlotOrConstant(Node* node) UseRegisterOrSlotOrConstant() argument
151 UseUniqueRegisterOrSlotOrConstant(Node* node) UseUniqueRegisterOrSlotOrConstant() argument
157 UseRegister(Node* node) UseRegister() argument
163 UseUniqueSlot(Node* node) UseUniqueSlot() argument
170 UseUnique(Node* node) UseUnique() argument
177 UseUniqueRegister(Node* node) UseUniqueRegister() argument
183 UseRegister(Node* node, RegisterUseKind unique_reg) UseRegister() argument
192 UseFixed(Node* node, Register reg) UseFixed() argument
198 UseFixed(Node* node, FPRegType reg) UseFixed() argument
211 UseImmediate(Node* node) UseImmediate() argument
215 UseNegatedImmediate(Node* node) UseNegatedImmediate() argument
219 UseLocation(Node* node, LinkageLocation location) UseLocation() argument
262 UseRegisterWithMode(Node* node, RegisterMode register_mode) UseRegisterWithMode() argument
322 ToConstant(const Node* node) ToConstant() argument
392 ToNegatedConstant(const Node* node) ToNegatedConstant() argument
404 Define(Node* node, UnallocatedOperand operand) Define() argument
411 Use(Node* node, UnallocatedOperand operand) Use() argument
[all...] |