HomeSort by relevance Sort by last modified time
    Searched full:newchain (Results 1 - 25 of 31) sorted by null

1 2

  /libcore/ojluni/src/main/java/sun/security/validator/
PKIXValidator.java 247 X509Certificate[] newChain = new X509Certificate[i];
248 System.arraycopy(chain, 0, newChain, 0, i);
249 return doValidate(newChain, pkixParameters);
269 X509Certificate[] newChain =
271 System.arraycopy(chain, 0, newChain, 0, newChain.length);
282 doValidate(newChain, pkixParameters);
  /external/zopfli/src/zopfli/
katajainen.c 107 Node* newchain; local
113 newchain = GetFreeNode(lists, maxbits, pool);
119 lists[index][1] = newchain;
123 InitNode(leaves[lastcount].weight, lastcount + 1, 0, newchain);
129 newchain);
131 InitNode(sum, lastcount, lists[index - 1][1], newchain);
  /prebuilts/go/darwin-x86/doc/codewalk/
markov.go 81 // NewChain returns a new Chain with prefixes of prefixLen words.
82 func NewChain(prefixLen int) *Chain {
126 c := NewChain(*prefixLen) // Initialize a new Chain.
markov.xml 61 <step title="The NewChain constructor function" src="doc/codewalk/markov.go:/func New/,/\n}/">
64 <code>NewChain</code> constructor function that initializes the
259 <step title="Creating and building a new Chain" src="doc/codewalk/markov.go:/c := NewChain/,/c\.Build/">
260 To create the new <code>Chain</code> we call <code>NewChain</code>
  /prebuilts/go/linux-x86/doc/codewalk/
markov.go 81 // NewChain returns a new Chain with prefixes of prefixLen words.
82 func NewChain(prefixLen int) *Chain {
126 c := NewChain(*prefixLen) // Initialize a new Chain.
markov.xml 61 <step title="The NewChain constructor function" src="doc/codewalk/markov.go:/func New/,/\n}/">
64 <code>NewChain</code> constructor function that initializes the
259 <step title="Creating and building a new Chain" src="doc/codewalk/markov.go:/c := NewChain/,/c\.Build/">
260 To create the new <code>Chain</code> we call <code>NewChain</code>
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/wizards/exportgradle/
ProjectSetupBuilder.java 183 List<GradleModule> newChain = findModule(toFind, child);
185 currentChain = newChain;
186 } else if (newChain != null) {
187 if (currentChain.size() > newChain.size()) {
188 currentChain = newChain;
  /external/llvm/lib/Target/XCore/
XCoreISelDAGToDAG.cpp 250 SDValue NewChain = replaceInChain(CurDAG, Chain, CheckEventChainOut,
252 if (!NewChain.getNode())
254 Chain = NewChain;
  /external/icu/icu4c/source/i18n/
plurrule.cpp 566 RuleChain *newChain = new RuleChain;
567 if (newChain == NULL) {
571 newChain->fKeyword = token;
573 prules->mRules = newChain;
582 newChain->fNext = insertAfter->fNext;
583 insertAfter->fNext = newChain;
586 newChain->ruleHeader = orNode;
588 currentChain = newChain;
    [all...]
  /external/llvm/lib/CodeGen/SelectionDAG/
LegalizeVectorOps.cpp 635 SDValue NewChain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, LoadChains);
640 AddLegalizedOperand(Op.getValue(1), NewChain);
642 return (Op.getResNo() ? NewChain : Value);
    [all...]
LegalizeVectorTypes.cpp     [all...]
DAGCombiner.cpp     [all...]
  /prebuilts/go/darwin-x86/src/text/template/parse/
node.go 453 func (t *Tree) newChain(pos Pos, node Node) *ChainNode {
parse.go 593 chain := t.newChain(t.peek().pos, node)
  /prebuilts/go/linux-x86/src/text/template/parse/
node.go 453 func (t *Tree) newChain(pos Pos, node Node) *ChainNode {
parse.go 593 chain := t.newChain(t.peek().pos, node)
  /external/llvm/lib/Target/X86/
X86ISelDAGToDAG.cpp 479 SDValue NewChain =
482 Ops.push_back(NewChain);
    [all...]
X86ISelLowering.cpp     [all...]
  /external/llvm/lib/Target/SystemZ/
SystemZISelLowering.cpp     [all...]
  /prebuilts/go/darwin-x86/pkg/darwin_amd64/text/template/
parse.a 144 func (@"".t·2 *@"".Tree) @"".newChain (@"".pos·3 @"".Pos, @"".node·4 @"".Node) (? *@"".ChainNode) { return (&@"".ChainNode{ @"".tr:@"".t·2, NodeType:@"".NodeType(0x3), Pos:@"".pos·3, Node:@"".node·4 }) }
    [all...]
  /prebuilts/go/darwin-x86/pkg/darwin_amd64_race/text/template/
parse.a 144 func (@"".t·2 *@"".Tree) @"".newChain (@"".pos·3 @"".Pos, @"".node·4 @"".Node) (? *@"".ChainNode) { return (&@"".ChainNode{ @"".tr:@"".t·2, NodeType:@"".NodeType(0x3), Pos:@"".pos·3, Node:@"".node·4 }) }
    [all...]
  /prebuilts/go/linux-x86/pkg/linux_amd64/text/template/
parse.a 144 func (@"".t·2 *@"".Tree) @"".newChain (@"".pos·3 @"".Pos, @"".node·4 @"".Node) (? *@"".ChainNode) { return (&@"".ChainNode{ @"".tr:@"".t·2, NodeType:@"".NodeType(0x3), Pos:@"".pos·3, Node:@"".node·4 }) }
    [all...]
  /prebuilts/go/linux-x86/pkg/linux_amd64_race/text/template/
parse.a 144 func (@"".t·2 *@"".Tree) @"".newChain (@"".pos·3 @"".Pos, @"".node·4 @"".Node) (? *@"".ChainNode) { return (&@"".ChainNode{ @"".tr:@"".t·2, NodeType:@"".NodeType(0x3), Pos:@"".pos·3, Node:@"".node·4 }) }
    [all...]
  /prebuilts/go/darwin-x86/pkg/darwin_amd64/html/
template.a 159 func (@"text/template/parse".t·2 *@"text/template/parse".Tree) @"text/template/parse".newChain (@"text/template/parse".pos·3 @"text/template/parse".Pos, @"text/template/parse".node·4 @"text/template/parse".Node) (? *@"text/template/parse".ChainNode) { return (&@"text/template/parse".ChainNode{ @"text/template/parse".tr:@"text/template/parse".t·2, NodeType:@"text/template/parse".NodeType(0x3), Pos:@"text/template/parse".pos·3, Node:@"text/template/parse".node·4 }) }
    [all...]
  /prebuilts/go/darwin-x86/pkg/darwin_amd64/text/
template.a 162 func (@"text/template/parse".t·2 *@"text/template/parse".Tree) @"text/template/parse".newChain (@"text/template/parse".pos·3 @"text/template/parse".Pos, @"text/template/parse".node·4 @"text/template/parse".Node) (? *@"text/template/parse".ChainNode) { return (&@"text/template/parse".ChainNode{ @"text/template/parse".tr:@"text/template/parse".t·2, NodeType:@"text/template/parse".NodeType(0x3), Pos:@"text/template/parse".pos·3, Node:@"text/template/parse".node·4 }) }
    [all...]

Completed in 567 milliseconds

1 2