Searched refs:node (Results 26 - 50 of 1808) sorted by relevance

1234567891011>>

/external/v8/src/ast/
H A Dprettyprinter.cc36 void CallPrinter::Find(AstNode* node, bool print) { argument
41 Visit(node);
46 Visit(node);
62 void CallPrinter::VisitBlock(Block* node) { argument
63 FindStatements(node->statements());
67 void CallPrinter::VisitVariableDeclaration(VariableDeclaration* node) {} argument
70 void CallPrinter::VisitFunctionDeclaration(FunctionDeclaration* node) {} argument
73 void CallPrinter::VisitExpressionStatement(ExpressionStatement* node) { argument
74 Find(node->expression());
78 void CallPrinter::VisitEmptyStatement(EmptyStatement* node) {} argument
81 VisitSloppyBlockFunctionStatement( SloppyBlockFunctionStatement* node) argument
87 VisitIfStatement(IfStatement* node) argument
96 VisitContinueStatement(ContinueStatement* node) argument
99 VisitBreakStatement(BreakStatement* node) argument
102 VisitReturnStatement(ReturnStatement* node) argument
107 VisitWithStatement(WithStatement* node) argument
113 VisitSwitchStatement(SwitchStatement* node) argument
128 VisitDoWhileStatement(DoWhileStatement* node) argument
134 VisitWhileStatement(WhileStatement* node) argument
140 VisitForStatement(ForStatement* node) argument
150 VisitForInStatement(ForInStatement* node) argument
157 VisitForOfStatement(ForOfStatement* node) argument
166 VisitTryCatchStatement(TryCatchStatement* node) argument
172 VisitTryFinallyStatement(TryFinallyStatement* node) argument
178 VisitDebuggerStatement(DebuggerStatement* node) argument
181 VisitFunctionLiteral(FunctionLiteral* node) argument
186 VisitClassLiteral(ClassLiteral* node) argument
194 VisitNativeFunctionLiteral(NativeFunctionLiteral* node) argument
197 VisitDoExpression(DoExpression* node) argument
200 VisitConditional(Conditional* node) argument
207 VisitLiteral(Literal* node) argument
212 VisitRegExpLiteral(RegExpLiteral* node) argument
224 VisitObjectLiteral(ObjectLiteral* node) argument
231 VisitArrayLiteral(ArrayLiteral* node) argument
241 VisitVariableProxy(VariableProxy* node) argument
251 VisitAssignment(Assignment* node) argument
257 VisitYield(Yield* node) argument
260 VisitThrow(Throw* node) argument
263 VisitProperty(Property* node) argument
279 VisitCall(Call* node) argument
297 VisitCallNew(CallNew* node) argument
314 VisitCallRuntime(CallRuntime* node) argument
319 VisitUnaryOperation(UnaryOperation* node) argument
331 VisitCountOperation(CountOperation* node) argument
340 VisitBinaryOperation(BinaryOperation* node) argument
351 VisitCompareOperation(CompareOperation* node) argument
362 VisitSpread(Spread* node) argument
369 VisitEmptyParentheses(EmptyParentheses* node) argument
374 VisitThisFunction(ThisFunction* node) argument
377 VisitSuperPropertyReference(SuperPropertyReference* node) argument
380 VisitSuperCallReference(SuperCallReference* node) argument
385 VisitRewritableExpression(RewritableExpression* node) argument
438 FormatSlotNode(Vector<char>* buf, Expression* node, const char* node_name, FeedbackVectorSlot slot) argument
447 Print(AstNode* node) argument
635 PrintIndentedVisit(const char* s, AstNode* node) argument
658 PrintOut(Isolate* isolate, AstNode* node) argument
697 VisitBlock(Block* node) argument
706 VisitVariableDeclaration(VariableDeclaration* node) argument
713 VisitFunctionDeclaration(FunctionDeclaration* node) argument
722 VisitExpressionStatement(ExpressionStatement* node) argument
728 VisitEmptyStatement(EmptyStatement* node) argument
733 VisitSloppyBlockFunctionStatement( SloppyBlockFunctionStatement* node) argument
739 VisitIfStatement(IfStatement* node) argument
749 VisitContinueStatement(ContinueStatement* node) argument
755 VisitBreakStatement(BreakStatement* node) argument
761 VisitReturnStatement(ReturnStatement* node) argument
767 VisitWithStatement(WithStatement* node) argument
774 VisitSwitchStatement(SwitchStatement* node) argument
796 VisitDoWhileStatement(DoWhileStatement* node) argument
806 VisitWhileStatement(WhileStatement* node) argument
816 VisitForStatement(ForStatement* node) argument
828 VisitForInStatement(ForInStatement* node) argument
838 VisitForOfStatement(ForOfStatement* node) argument
850 VisitTryCatchStatement(TryCatchStatement* node) argument
860 VisitTryFinallyStatement(TryFinallyStatement* node) argument
866 PrintTryStatement(TryStatement* node) argument
890 VisitDebuggerStatement(DebuggerStatement* node) argument
895 VisitFunctionLiteral(FunctionLiteral* node) argument
907 VisitClassLiteral(ClassLiteral* node) argument
945 VisitNativeFunctionLiteral(NativeFunctionLiteral* node) argument
951 VisitDoExpression(DoExpression* node) argument
957 VisitConditional(Conditional* node) argument
966 VisitLiteral(Literal* node) argument
971 VisitRegExpLiteral(RegExpLiteral* node) argument
990 VisitObjectLiteral(ObjectLiteral* node) argument
1032 VisitArrayLiteral(ArrayLiteral* node) argument
1047 VisitVariableProxy(VariableProxy* node) argument
1082 VisitAssignment(Assignment* node) argument
1089 VisitYield(Yield* node) argument
1097 VisitThrow(Throw* node) argument
1103 VisitProperty(Property* node) argument
1118 VisitCall(Call* node) argument
1130 VisitCallNew(CallNew* node) argument
1137 VisitCallRuntime(CallRuntime* node) argument
1145 VisitUnaryOperation(UnaryOperation* node) argument
1151 VisitCountOperation(CountOperation* node) argument
1160 VisitBinaryOperation(BinaryOperation* node) argument
1167 VisitCompareOperation(CompareOperation* node) argument
1174 VisitSpread(Spread* node) argument
1180 VisitEmptyParentheses(EmptyParentheses* node) argument
1185 VisitThisFunction(ThisFunction* node) argument
1190 VisitSuperPropertyReference(SuperPropertyReference* node) argument
1195 VisitSuperCallReference(SuperCallReference* node) argument
1200 VisitRewritableExpression(RewritableExpression* node) argument
[all...]
/external/v8/src/compiler/
H A Descape-analysis-reducer.cc34 Reduction EscapeAnalysisReducer::Reduce(Node* node) { argument
35 if (node->id() < static_cast<NodeId>(fully_reduced_.length()) &&
36 fully_reduced_.Contains(node->id())) {
40 switch (node->opcode()) {
43 return ReduceLoad(node);
46 return ReduceStore(node);
48 return ReduceAllocate(node);
50 return ReduceFinishRegion(node);
52 return ReduceReferenceEqual(node);
54 return ReduceObjectIsSmi(node);
117 ReduceLoad(Node* node) argument
137 ReduceStore(Node* node) argument
153 ReduceAllocate(Node* node) argument
168 ReduceFinishRegion(Node* node) argument
196 ReduceReferenceEqual(Node* node) argument
221 ReduceObjectIsSmi(Node* node) argument
233 ReduceFrameStateUses(Node* node) argument
256 ReduceDeoptState(Node* node, Node* effect, bool multiple_users) argument
311 ReduceStateValueInput(Node* node, int node_index, Node* effect, bool node_multiused, bool already_cloned, bool multiple_users) argument
[all...]
H A Dtail-call-optimization.cc10 #include "src/compiler/node-matchers.h"
11 #include "src/compiler/node-properties.h"
17 Reduction TailCallOptimization::Reduce(Node* node) { argument
18 if (node->opcode() != IrOpcode::kReturn) return NoChange();
22 Node* const call = NodeProperties::GetValueInput(node, 1);
25 NodeProperties::GetEffectInput(node) == call &&
27 Node* const control = NodeProperties::GetControlInput(node);
30 DCHECK_EQ(0, Int32Matcher(NodeProperties::GetValueInput(node, 0)).Value());
32 call->OwnedBy(node, control) && control->OwnedBy(node)) {
[all...]
H A Dnode-properties.cc9 #include "src/compiler/node-properties.h"
19 int NodeProperties::PastValueIndex(Node* node) { argument
20 return FirstValueIndex(node) + node->op()->ValueInputCount();
25 int NodeProperties::PastContextIndex(Node* node) { argument
26 return FirstContextIndex(node) +
27 OperatorProperties::GetContextInputCount(node->op());
32 int NodeProperties::PastFrameStateIndex(Node* node) { argument
33 return FirstFrameStateIndex(node) +
34 OperatorProperties::GetFrameStateInputCount(node
39 PastEffectIndex(Node* node) argument
45 PastControlIndex(Node* node) argument
51 GetValueInput(Node* node, int index) argument
58 GetContextInput(Node* node) argument
65 GetFrameStateInput(Node* node) argument
72 GetEffectInput(Node* node, int index) argument
79 GetControlInput(Node* node, int index) argument
87 Node* const node = edge.from(); local
95 Node* const node = edge.from(); local
103 Node* const node = edge.from(); local
111 Node* const node = edge.from(); local
119 Node* const node = edge.from(); local
126 IsExceptionalCall(Node* node) argument
137 ReplaceValueInput(Node* node, Node* value, int index) argument
144 ReplaceValueInputs(Node* node, Node* value) argument
155 ReplaceContextInput(Node* node, Node* context) argument
161 ReplaceControlInput(Node* node, Node* control, int index) argument
168 ReplaceEffectInput(Node* node, Node* effect, int index) argument
175 ReplaceFrameStateInput(Node* node, Node* frame_state) argument
182 RemoveNonValueInputs(Node* node) argument
188 RemoveValueInputs(Node* node) argument
196 MergeControlToEnd(Graph* graph, CommonOperatorBuilder* common, Node* node) argument
205 ReplaceUses(Node* node, Node* value, Node* effect, Node* success, Node* exception) argument
232 ChangeOp(Node* node, const Operator* new_op) argument
239 FindFrameStateBefore(Node* node) argument
251 FindProjection(Node* node, size_t projection_index) argument
263 CollectControlProjections(Node* node, Node** projections, size_t projection_count) argument
316 GetSpecializationContext( Node* node, MaybeHandle<Context> context) argument
341 GetTypeOrAny(Node* node) argument
347 AllValueInputsAreTyped(Node* node) argument
[all...]
H A Dgraph-trimmer.h8 #include "src/compiler/node-marker.h"
19 // Trims dead nodes from the node graph.
33 Node* const node = *begin++; local
34 if (!node->IsDead()) MarkAsLive(node);
40 V8_INLINE bool IsLive(Node* const node) { return is_live_.Get(node); } argument
41 V8_INLINE void MarkAsLive(Node* const node) { argument
42 DCHECK(!node->IsDead());
43 if (!IsLive(node)) {
[all...]
H A Dsimplified-lowering.cc17 #include "src/compiler/node-matchers.h"
18 #include "src/compiler/node-properties.h"
47 // During this phase, the usage information for a node determines the best
159 void ReplaceEffectControlUses(Node* node, Node* effect, Node* control) { argument
160 for (Edge edge : node->use_edges()) {
172 void ChangeToPureOp(Node* node, const Operator* new_op) { argument
173 if (node->op()->EffectInputCount() > 0) {
174 DCHECK_LT(0, node->op()->ControlInputCount());
175 // Disconnect the node from effect and control chains.
176 Node* control = NodeProperties::GetControlInput(node);
192 SetAndCheckInput(Node* node, int index, UseInfo use_info) argument
310 Node* node = current.node; local
332 Node* node = queue_.front(); local
360 TypeOf(Node* node) argument
365 FeedbackTypeOf(Node* node) argument
370 TypePhi(Node* node) argument
379 TypeSelect(Node* node) argument
384 UpdateFeedbackType(Node* node) argument
499 Weaken(Node* node, Type* previous_type, Type* current_type) argument
539 Node* node = queue_.front(); local
559 Node* node = *i; local
571 Node* node = *i; local
583 EnqueueInitial(Node* node) argument
595 Node* node = use_node->InputAt(index); local
632 SetOutput(Node* node, MachineRepresentation representation, Type* restriction_type = Type::Any()) argument
652 GetUpperBound(Node* node) argument
654 InputCannotBe(Node* node, Type* type) argument
659 InputIs(Node* node, Type* type) argument
664 BothInputsAreSigned32(Node* node) argument
668 BothInputsAreUnsigned32(Node* node) argument
672 BothInputsAre(Node* node, Type* type) argument
678 OneInputCannotBe(Node* node, Type* type) argument
684 ConvertInput(Node* node, int index, UseInfo use) argument
708 ProcessInput(Node* node, int index, UseInfo use) argument
721 ProcessRemainingInputs(Node* node, int index) argument
738 VisitInputs(Node* node) argument
752 VisitReturn(Node* node) argument
770 VisitUnused(Node* node) argument
782 VisitBinop(Node* node, UseInfo left_use, UseInfo right_use, MachineRepresentation output, Type* restriction_type = Type::Any()) argument
795 VisitBinop(Node* node, UseInfo input_use, MachineRepresentation output, Type* restriction_type = Type::Any()) argument
800 VisitSpeculativeInt32Binop(Node* node) argument
812 VisitUnop(Node* node, UseInfo input_use, MachineRepresentation output) argument
820 VisitLeaf(Node* node, MachineRepresentation output) argument
826 VisitFloat64Binop(Node* node) argument
830 VisitWord32TruncatingBinop(Node* node) argument
839 GetOutputInfoForPhi(Node* node, Type* type, Truncation use) argument
868 VisitSelect(Node* node, Truncation truncation, SimplifiedLowering* lowering) argument
892 VisitPhi(Node* node, Truncation truncation, SimplifiedLowering* lowering) argument
916 VisitObjectIs(Node* node, Type* type, SimplifiedLowering* lowering) argument
931 VisitCall(Node* node, SimplifiedLowering* lowering) argument
967 VisitStateValues(Node* node) argument
997 VisitObjectState(Node* node) argument
1044 Int32Op(Node* node) argument
1048 Int32OverflowOp(Node* node) argument
1052 Uint32Op(Node* node) argument
1056 Uint32OverflowOp(Node* node) argument
1060 Float64Op(Node* node) argument
1134 LowerToCheckedInt32Mul(Node* node, Truncation truncation, Type* input0_type, Type* input1_type) argument
1150 ChangeToInt32OverflowOp(Node* node) argument
1154 ChangeToUint32OverflowOp(Node* node) argument
1158 VisitSpeculativeAdditiveOp(Node* node, Truncation truncation, SimplifiedLowering* lowering) argument
1219 VisitSpeculativeNumberModulus(Node* node, Truncation truncation, SimplifiedLowering* lowering) argument
1323 VisitOsrGuard(Node* node) argument
1349 VisitNode(Node* node, Truncation truncation, SimplifiedLowering* lowering) argument
2592 DeferReplacement(Node* node, Node* replacement) argument
2612 Kill(Node* node) argument
2676 Node* node; member in struct:v8::internal::compiler::RepresentationSelector::NodeState
2689 GetInfo(Node* node) argument
2711 DoJSToNumberTruncatesToFloat64( Node* node, RepresentationSelector* selector) argument
2795 DoJSToNumberTruncatesToWord32( Node* node, RepresentationSelector* selector) argument
2872 DoLoadBuffer(Node* node, MachineRepresentation output_rep, RepresentationChanger* changer) argument
2935 DoStoreBuffer(Node* node) argument
2942 Float64Round(Node* const node) argument
2958 Float64Sign(Node* const node) argument
2974 Int32Abs(Node* const node) argument
2989 Int32Div(Node* const node) argument
3063 Int32Mod(Node* const node) argument
3161 Int32Sign(Node* const node) argument
3177 Uint32Div(Node* const node) argument
3196 Uint32Mod(Node* const node) argument
3255 DoMax(Node* node, Operator const* op, MachineRepresentation rep) argument
3266 DoMin(Node* node, Operator const* op, MachineRepresentation rep) argument
3277 DoShift(Node* node, Operator const* op, Type* rhs_type) argument
3288 DoStringToNumber(Node* node) argument
3301 DoIntegral32ToBit(Node* node) argument
3311 DoOrderedNumberToBit(Node* node) argument
3320 DoNumberToBit(Node* node) argument
3329 DoIntegerToUint8Clamped(Node* node) argument
3347 DoNumberToUint8Clamped(Node* node) argument
3365 DoSigned32ToUint8Clamped(Node* node) argument
3382 DoUnsigned32ToUint8Clamped(Node* node) argument
[all...]
H A Dgraph-reducer.cc10 #include "src/compiler/node.h"
11 #include "src/compiler/node-properties.h"
46 void GraphReducer::ReduceNode(Node* node) { argument
49 Push(node);
52 // Process the node on the top of the stack, potentially pushing more or
53 // popping the node off the stack.
57 Node* const node = revisit_.top(); local
59 if (state_.Get(node) == State::kRevisit) {
61 Push(node);
79 Reduction GraphReducer::Reduce(Node* const node) { argument
111 Node* node = entry.node; local
165 Replace(Node* node, Node* replacement) argument
170 Replace(Node* node, Node* replacement, NodeId max_id) argument
208 ReplaceWithValue(Node* node, Node* value, Node* effect, Node* control) argument
249 Node* node = stack_.top().node; local
255 Push(Node* const node) argument
262 Recurse(Node* node) argument
269 Revisit(Node* node) argument
[all...]
/external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/
H A DALoopIncCommand.java3 package com.google.clearsilver.jsilver.syntax.node;
67 public void setPosition(PPosition node) argument
74 if(node != null)
76 if(node.parent() != null)
78 node.parent().removeChild(node);
81 node.parent(this);
84 this._position_ = node;
92 public void setVariable(PVariable node) argument
99 if(node !
117 setStart(PExpression node) argument
142 setEnd(PExpression node) argument
167 setIncrement(PExpression node) argument
192 setCommand(PCommand node) argument
[all...]
H A DAEachCommand.java3 package com.google.clearsilver.jsilver.syntax.node;
57 public void setPosition(PPosition node) argument
64 if(node != null)
66 if(node.parent() != null)
68 node.parent().removeChild(node);
71 node.parent(this);
74 this._position_ = node;
82 public void setVariable(PVariable node) argument
89 if(node !
107 setExpression(PExpression node) argument
132 setCommand(PCommand node) argument
[all...]
H A DAIfCommand.java3 package com.google.clearsilver.jsilver.syntax.node;
57 public void setPosition(PPosition node) argument
64 if(node != null)
66 if(node.parent() != null)
68 node.parent().removeChild(node);
71 node.parent(this);
74 this._position_ = node;
82 public void setExpression(PExpression node) argument
89 if(node !
107 setBlock(PCommand node) argument
132 setOtherwise(PCommand node) argument
[all...]
H A DALoopToCommand.java3 package com.google.clearsilver.jsilver.syntax.node;
57 public void setPosition(PPosition node) argument
64 if(node != null)
66 if(node.parent() != null)
68 node.parent().removeChild(node);
71 node.parent(this);
74 this._position_ = node;
82 public void setVariable(PVariable node) argument
89 if(node !
107 setExpression(PExpression node) argument
132 setCommand(PCommand node) argument
[all...]
H A DAWithCommand.java3 package com.google.clearsilver.jsilver.syntax.node;
57 public void setPosition(PPosition node) argument
64 if(node != null)
66 if(node.parent() != null)
68 node.parent().removeChild(node);
71 node.parent(this);
74 this._position_ = node;
82 public void setVariable(PVariable node) argument
89 if(node !
107 setExpression(PExpression node) argument
132 setCommand(PCommand node) argument
[all...]
H A DPCommand.java3 package com.google.clearsilver.jsilver.syntax.node;
H A DPExpression.java3 package com.google.clearsilver.jsilver.syntax.node;
H A DPPosition.java3 package com.google.clearsilver.jsilver.syntax.node;
H A DPVariable.java3 package com.google.clearsilver.jsilver.syntax.node;
H A DSwitch.java3 package com.google.clearsilver.jsilver.syntax.node;
/external/freetype/src/cache/
H A Dftcmru.c30 FTC_MruNode node )
47 if ( cnode == node )
58 first->prev = node;
59 last->next = node;
60 node->next = first;
61 node->prev = last;
65 node->next = node;
66 node->prev = node;
207 FTC_MruNode first, node; local
241 FTC_MruNode node = NULL; local
295 FTC_MruNode node; local
331 FTC_MruNode first, node, next; local
[all...]
/external/v8/src/interpreter/
H A Dbytecode-peephole-optimizer.cc44 void BytecodePeepholeOptimizer::WriteJump(BytecodeNode* node, argument
46 // Handlers for jump bytecodes do not emit |node| as WriteJump()
49 ApplyPeepholeAction(node);
50 next_stage()->WriteJump(node, label);
54 void BytecodePeepholeOptimizer::Write(BytecodeNode* node) { argument
57 ApplyPeepholeAction(node);
75 void BytecodePeepholeOptimizer::SetLast(const BytecodeNode* const node) { argument
79 DCHECK(node->bytecode() != Bytecode::kNop || node->source_info().is_valid());
80 last_ = *node;
143 DefaultAction( BytecodeNode* const node, const PeepholeActionAndData* action_data) argument
152 UpdateLastAction( BytecodeNode* const node, const PeepholeActionAndData* action_data) argument
160 UpdateLastIfSourceInfoPresentAction( BytecodeNode* const node, const PeepholeActionAndData* action_data) argument
170 ElideCurrentAction( BytecodeNode* const node, const PeepholeActionAndData* action_data) argument
185 ElideCurrentIfOperand0MatchesAction( BytecodeNode* const node, const PeepholeActionAndData* action_data) argument
197 ElideLastAction( BytecodeNode* const node, const PeepholeActionAndData* action_data) argument
215 ChangeBytecodeAction( BytecodeNode* const node, const PeepholeActionAndData* action_data) argument
224 TransformLdaSmiBinaryOpToBinaryOpWithSmiAction( BytecodeNode* const node, const PeepholeActionAndData* action_data) argument
240 TransformLdaZeroBinaryOpToBinaryOpWithZeroAction( BytecodeNode* const node, const PeepholeActionAndData* action_data) argument
254 DefaultJumpAction( BytecodeNode* const node, const PeepholeActionAndData* action_data) argument
263 UpdateLastJumpAction( BytecodeNode* const node, const PeepholeActionAndData* action_data) argument
269 ChangeJumpBytecodeAction( BytecodeNode* const node, const PeepholeActionAndData* action_data) argument
279 ElideLastBeforeJumpAction( BytecodeNode* const node, const PeepholeActionAndData* action_data) argument
292 ApplyPeepholeAction(BytecodeNode* const node) argument
[all...]
/external/e2fsprogs/lib/ext2fs/
H A Drbtree.c25 static void __rb_rotate_left(struct rb_node *node, struct rb_root *root) argument
27 struct rb_node *right = node->rb_right;
28 struct rb_node *parent = ext2fs_rb_parent(node);
30 if ((node->rb_right = right->rb_left))
31 ext2fs_rb_set_parent(right->rb_left, node);
32 right->rb_left = node;
38 if (node == parent->rb_left)
45 ext2fs_rb_set_parent(node, right);
48 static void __rb_rotate_right(struct rb_node *node, struct rb_root *root) argument
50 struct rb_node *left = node
71 ext2fs_rb_insert_color(struct rb_node *node, struct rb_root *root) argument
136 __rb_erase_color(struct rb_node *node, struct rb_node *parent, struct rb_root *root) argument
216 ext2fs_rb_erase(struct rb_node *node, struct rb_root *root) argument
283 ext2fs_rb_augment_path(struct rb_node *node, rb_augment_f func, void *data) argument
306 ext2fs_rb_augment_insert(struct rb_node *node, rb_augment_f func, void *data) argument
320 ext2fs_rb_augment_erase_begin(struct rb_node *node) argument
345 ext2fs_rb_augment_erase_end(struct rb_node *node, rb_augment_f func, void *data) argument
378 ext2fs_rb_next(struct rb_node *node) argument
406 ext2fs_rb_prev(struct rb_node *node) argument
[all...]
/external/jsilver/src/com/google/clearsilver/jsilver/syntax/
H A DAutoEscaper.java23 import com.google.clearsilver.jsilver.syntax.node.AAltCommand;
24 import com.google.clearsilver.jsilver.syntax.node.AAutoescapeCommand;
25 import com.google.clearsilver.jsilver.syntax.node.ACallCommand;
26 import com.google.clearsilver.jsilver.syntax.node.AContentTypeCommand;
27 import com.google.clearsilver.jsilver.syntax.node.ACsOpenPosition;
28 import com.google.clearsilver.jsilver.syntax.node.ADataCommand;
29 import com.google.clearsilver.jsilver.syntax.node.ADefCommand;
30 import com.google.clearsilver.jsilver.syntax.node.AEscapeCommand;
31 import com.google.clearsilver.jsilver.syntax.node.AEvarCommand;
32 import com.google.clearsilver.jsilver.syntax.node
143 caseADataCommand(ADataCommand node) argument
150 caseADefCommand(ADefCommand node) argument
155 caseAIfCommand(AIfCommand node) argument
199 caseAEscapeCommand(AEscapeCommand node) argument
207 caseACallCommand(ACallCommand node) argument
212 caseALvarCommand(ALvarCommand node) argument
217 caseAEvarCommand(AEvarCommand node) argument
222 caseALincludeCommand(ALincludeCommand node) argument
227 caseAIncludeCommand(AIncludeCommand node) argument
232 caseAHardLincludeCommand(AHardLincludeCommand node) argument
237 caseAHardIncludeCommand(AHardIncludeCommand node) argument
242 caseAVarCommand(AVarCommand node) argument
247 caseAAltCommand(AAltCommand node) argument
252 caseANameCommand(ANameCommand node) argument
257 caseAUvarCommand(AUvarCommand node) argument
275 caseAContentTypeCommand(AContentTypeCommand node) argument
284 applyAutoEscaping(PCommand node, PPosition position) argument
307 caseACsOpenPosition(ACsOpenPosition node) argument
312 saveAutoEscapingContext(Node node, PPosition position) argument
[all...]
H A DInlineRewriter.java22 import com.google.clearsilver.jsilver.syntax.node.ADataCommand;
23 import com.google.clearsilver.jsilver.syntax.node.AInlineCommand;
24 import com.google.clearsilver.jsilver.syntax.node.ANoopCommand;
25 import com.google.clearsilver.jsilver.syntax.node.PCommand;
26 import com.google.clearsilver.jsilver.syntax.node.TData;
64 public void caseADataCommand(ADataCommand node) {
65 TData data = node.getData();
67 node.replaceBy(new ANoopCommand());
77 public void caseAInlineCommand(AInlineCommand node) {
79 PCommand command = node
101 caseAInlineCommand(AInlineCommand node) argument
[all...]
/external/clang/www/analyzer/scripts/
H A Dmenu.js5 node = navRoot.childNodes[i];
6 if (node.nodeName=="LI") {
7 node.onmouseover=function() {
10 node.onmouseout=function() {
/external/kmod/libkmod/
H A Dlibkmod-list.c30 static inline struct list_node *list_node_init(struct list_node *node) argument
32 node->next = node;
33 node->prev = node;
35 return node;
39 struct list_node *node)
42 list_node_init(node);
46 node->prev = list->prev;
47 list->prev->next = node;
38 list_node_append(struct list_node *list, struct list_node *node) argument
52 list_node_remove(struct list_node *node) argument
63 list_node_insert_after(struct list_node *list, struct list_node *node) argument
77 list_node_insert_before(struct list_node *list, struct list_node *node) argument
191 struct list_node *node; local
209 struct list_node *node; local
[all...]
/external/vboot_reference/firmware/stub/
H A Dvboot_api_stub_sf.c46 struct alloc_node *node; local
54 node = malloc(sizeof(*node));
55 if (!node)
57 node->next = alloc_head;
58 node->ptr = p;
59 node->size = size;
60 node->bt_levels = backtrace(node->bt_buffer, MAX_STACK_LEVELS);
61 alloc_head = node;
107 struct alloc_node *node, *next; local
[all...]

Completed in 430 milliseconds

1234567891011>>