Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 130 for add2 (0.09 seconds)

  1. tensorflow/c/c_api_function_test.cc

      TF_Operation* feed2 = Placeholder(func_graph_, s_, "feed2");
      TF_Operation* feed3 = Placeholder(func_graph_, s_, "feed3");
      TF_Operation* add1 = Add(feed1, feed2, func_graph_, s_, "add1");
      TF_Operation* add2 = Add(add1, feed3, func_graph_, s_, "add2");
      Define(1, {add2}, {add1, feed3}, {add2}, {});
    
      // Use, run, and verify
      TF_Operation* two = ScalarConst(2, host_graph_, s_, "two");
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Mon Nov 17 00:00:38 GMT 2025
    - 63.6K bytes
    - Click Count (1)
  2. lib/fips140/v1.1.0-rc1.zip

    or equal to the dst size. MOVD dst_len+40(FP), R4 CMP R0, R4 BGT crash MOVD R2, R4 MOVD R2, R6 MOVD R2, R8 MOVD R3, R5 MOVD R3, R7 MOVD R3, R9 ADDW $1, R5 ADDW $2, R7 ADDW $3, R9 incr: CMP R0, $64 BLT tail STMG R2, R9, (R1) ADDW $4, R3 ADDW $4, R5 ADDW $4, R7 ADDW $4, R9 MOVD $64(R1), R1 SUB $64, R0 BR incr tail: CMP R0, $0 BEQ crypt STMG R2, R3, (R1) ADDW $1, R3 MOVD $16(R1), R1 SUB $16, R0 BR tail crypt: STMG R2, R3, (R12) // update next counter value MOVD fn+0(FP), R0 // function code (encryption)...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
  3. cmd/net_test.go

    				t.Errorf("error: expected = %v, got = %v", testCase.expectedErr, err)
    			}
    		})
    	}
    }
    
    func TestExtractHostPort(t *testing.T) {
    	testCases := []struct {
    		addr        string
    		host        string
    		port        string
    		expectedErr error
    	}{
    		{"", "", "", errors.New("unable to process empty address")},
    		{"localhost:9000", "localhost", "9000", nil},
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Oct 10 18:57:03 GMT 2025
    - 9.2K bytes
    - Click Count (0)
  4. src/cmd/asm/internal/asm/testdata/arm64error.s

    	ADDS	$0xff, R6, RSP                                   // ERROR "illegal destination register"
    	ADDS	$0xffff0, R6, RSP                                // ERROR "illegal destination register"
    	ADDS	$0x1000100010001000, R6, RSP                     // ERROR "illegal destination register"
    	ADDS	$0x10001000100011, R6, RSP                       // ERROR "illegal destination register"
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Tue Oct 14 19:00:00 GMT 2025
    - 38.4K bytes
    - Click Count (0)
  5. build-logic/integration-testing/src/main/kotlin/gradlebuild/integrationtests/tasks/GenerateAutoTestedSamplesTestTask.kt

    import javax.inject.Inject
    
    /**
     * This task scans the main source set and findd samples in javadoc with `class='autoTested'`,
     * then generates a subclass of AbstractAutoTestedSamplesTest for each class including samples and adds them to the integTest.
     *
     * For example, we have two classes ABC.java and XYZ.groovy that include `class='autoTested'`,
     * there will be two files generated: `ABCAutoTestedSamplesTest.groovy` and `XYZAutoTestedSamplesTest.groovy`
    Created: Wed Dec 31 11:36:14 GMT 2025
    - Last Modified: Fri Dec 19 06:44:41 GMT 2025
    - 3.9K bytes
    - Click Count (0)
  6. cmd/notification.go

    }
    
    func (sys *NotificationSys) addNodeErr(nodeInfo madmin.NodeInfo, peerClient *peerRESTClient, err error) {
    	addr := peerClient.host.String()
    	reqInfo := (&logger.ReqInfo{}).AppendTags("remotePeer", addr)
    	ctx := logger.SetReqInfo(GlobalContext, reqInfo)
    	peersLogOnceIf(ctx, err, "add-node-err-"+addr)
    	nodeInfo.SetAddr(addr)
    	nodeInfo.SetError(err.Error())
    }
    
    // GetSysErrors - Memory information
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 46K bytes
    - Click Count (0)
  7. tensorflow/c/checkpoint_reader.cc

                        string(v2_reader_->key()) /* full var's name */,
                        TensorSlice(slice_proto)))
                    .second);
        }
      }
    
      // Second pass: adds the entries, ignoring the filtered keys.
      std::unique_ptr<TensorSliceReader::VarToShapeMap> var_to_shape_map(
          new TensorSliceReader::VarToShapeMap);
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Sat Nov 08 06:24:11 GMT 2025
    - 5.4K bytes
    - Click Count (0)
  8. src/cmd/asm/internal/asm/asm.go

    		p.errorf("%s: expected register; found %s", op, obj.Dconv(prog, addr))
    	}
    	return addr.Reg
    }
    
    // getSpecial checks that addr represents a special operand and returns its value.
    func (p *Parser) getSpecial(prog *obj.Prog, op obj.As, addr *obj.Addr) int64 {
    	if addr.Type != obj.TYPE_SPECIAL || addr.Name != 0 || addr.Reg != 0 || addr.Index != 0 {
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Tue Oct 21 15:13:08 GMT 2025
    - 26.7K bytes
    - Click Count (0)
  9. cmd/admin-handlers.go

    	anonAddr := func(addr string) string {
    		if anonParam != anonymizeStrict {
    			return addr
    		}
    		newAddr, found := hostAnonymizer[addr]
    		if found {
    			return newAddr
    		}
    
    		// If we reach here, it means that the given addr doesn't contain any of the hosts.
    		// Return it as is. Can happen for drive paths in non-distributed mode
    		return addr
    	}
    
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 99.7K bytes
    - Click Count (0)
  10. src/cmd/asm/internal/asm/parse.go

    	p.addr = p.addr[0:0]
    	p.isJump = p.arch.IsJump(word)
    	for _, op := range operands {
    		addr := p.address(op)
    		if !p.isJump && addr.Reg < 0 { // Jumps refer to PC, a pseudo.
    			p.errorf("illegal use of pseudo-register in %s", word)
    		}
    		p.addr = append(p.addr, addr)
    	}
    	if p.isJump {
    		p.asmJump(op, cond, p.addr)
    		return
    	}
    	p.asmInstruction(op, cond, p.addr)
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Wed Nov 12 03:59:40 GMT 2025
    - 37.3K bytes
    - Click Count (0)
Back to Top