Search Options

Results per page
Sort
Preferred Languages
Advance

Results 41 - 50 of 357 for Dword2 (0.21 sec)

  1. src/vendor/golang.org/x/sys/cpu/cpu_s390x.s

    	XC   $32, (R1), (R1) // clear 4 doublewords (32 bytes)
    	WORD $0xb2b01000     // store facility list extended (STFLE)
    	RET
    
    // func kmQuery() queryResult
    TEXT ·kmQuery(SB), NOSPLIT|NOFRAME, $0-16
    	MOVD $0, R0         // set function code to 0 (KM-Query)
    	MOVD $ret+0(FP), R1 // address of 16-byte return value
    	WORD $0xB92E0024    // cipher message (KM)
    	RET
    
    // func kmcQuery() queryResult
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Oct 19 23:33:33 UTC 2023
    - 2K bytes
    - Viewed (0)
  2. platforms/native/language-native/src/integTest/groovy/org/gradle/language/fixtures/app/DuplicateAssemblerBaseNamesTestApp.groovy

            if (toolChain.isVisualCpp()) {
                return """
    .386
    .model    flat
    
    PUBLIC    _${methodName}
    _TEXT     SEGMENT
    _${methodName}    PROC
    mov    eax, DWORD PTR 4[esp]
    add    eax, DWORD PTR 8[esp]
    ret    0
    _${methodName}    ENDP
    _TEXT   ENDS
    END
    """
            }else{
                return """
    .text
    .globl  _${methodName}
    _${methodName}:
    movl    8(%esp), %eax
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Thu Nov 16 20:20:03 UTC 2023
    - 2.3K bytes
    - Viewed (0)
  3. src/vendor/golang.org/x/sys/cpu/cpu_arm64.s

    TEXT ·getisar0(SB),NOSPLIT,$0-8
    	// get Instruction Set Attributes 0 into x0
    	// mrs x0, ID_AA64ISAR0_EL1 = d5380600
    	WORD	$0xd5380600
    	MOVD	R0, ret+0(FP)
    	RET
    
    // func getisar1() uint64
    TEXT ·getisar1(SB),NOSPLIT,$0-8
    	// get Instruction Set Attributes 1 into x0
    	// mrs x0, ID_AA64ISAR1_EL1 = d5380620
    	WORD	$0xd5380620
    	MOVD	R0, ret+0(FP)
    	RET
    
    // func getpfr0() uint64
    TEXT ·getpfr0(SB),NOSPLIT,$0-8
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 08 16:12:58 UTC 2024
    - 937 bytes
    - Viewed (0)
  4. src/main/java/org/codelibs/fess/suggest/request/popularwords/PopularWordsRequest.java

                final String text = source.get(FieldNames.TEXT).toString();
                words.add(text);
    
                if (detail) {
                    items.add(SuggestItem.parseSource(source));
                }
            }
    
            return new PopularWordsResponse(index, searchResponse.getTook().getMillis(), words, searchResponse.getHits().getTotalHits().value,
                    items);
        }
    Registered: Wed Jun 12 15:38:08 UTC 2024
    - Last Modified: Thu Feb 22 01:36:54 UTC 2024
    - 7K bytes
    - Viewed (0)
  5. src/main/java/org/codelibs/fess/suggest/index/SuggestIndexer.java

                    buf.append(' ');
                }
                prev = c;
            }
            final String[] words = buf.toString().trim().split(" ");
            try {
                final SuggestItem item =
                        contentsParser.parseSearchWords(words, null, fields, tags, roles, num, readingConverter, normalizer, analyzer, langs);
                if (item == null) {
    Registered: Wed Jun 12 15:38:08 UTC 2024
    - Last Modified: Thu Feb 22 01:36:54 UTC 2024
    - 26.1K bytes
    - Viewed (0)
  6. analysis/analysis-api/testData/components/dataFlowInfoProvider/exitPointSnapshot/defaultValues/conditionCheck.txt

    KaDataFlowExitPointSnapshot:
      defaultExpressionInfo = DefaultExpressionInfo:
        expression = words.check { it.length == 5 }
        type = kotlin.Boolean
      hasEscapingJumps = false
      hasJumps = false
      hasMultipleJumpKinds = false
      hasMultipleJumpTargets = false
      jumpExpressions = []
      returnValueType = null
      valuedReturnExpressions = []
    Registered: Wed Jun 12 09:53:16 UTC 2024
    - Last Modified: Wed May 29 17:43:55 UTC 2024
    - 369 bytes
    - Viewed (0)
  7. doc/next/6-stdlib/99-minor/unicode/utf16/44940.md

    The [RuneLen] function returns the number of 16-bit words in
    the UTF-16 encoding of the rune. It returns -1 if the rune
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Apr 12 20:57:18 UTC 2024
    - 162 bytes
    - Viewed (0)
  8. src/main/java/org/codelibs/fess/exec/SuggestCreator.java

            logger.info("Creating new suggest index.");
            suggestHelper.suggester().createNextIndex();
    
            logger.info("Storing all bad words.");
            suggestHelper.storeAllBadWords(true);
    
            logger.info("Storing all elevate words.");
            suggestHelper.storeAllElevateWords(true);
    
            final AtomicInteger exitCode = new AtomicInteger(0);
    
    Registered: Wed Jun 12 13:08:18 UTC 2024
    - Last Modified: Thu Feb 22 01:37:57 UTC 2024
    - 10K bytes
    - Viewed (0)
  9. src/runtime/memmove_loong64.s

    	BNE	R7, out
    
    	// if less than 8 bytes, do byte copying
    	SGTU	$8, R6, R7
    	BNE	R7, out
    
    	// do one byte at a time until 8-aligned
    	AND	$7, R4, R8
    	BEQ	R8, words
    	MOVB	(R5), R7
    	ADDV	$1, R5
    	MOVB	R7, (R4)
    	ADDV	$1, R4
    	JMP	-6(PC)
    
    words:
    	// do 8 bytes at a time if there is room
    	ADDV	$-7, R9, R6 // R6 is end pointer-7
    
    	PCALIGN	$16
    	SGTU	R6, R4, R8
    	BEQ	R8, out
    	MOVV	(R5), R7
    	ADDV	$8, R5
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon May 13 15:04:25 UTC 2024
    - 1.8K bytes
    - Viewed (0)
  10. src/math/big/arith_amd64.s

    	SBBQ CX, CX		// save CF
    
    	ADDQ $1, SI		// i++
    	SUBQ $1, DI		// n--
    	JG L2			// if n > 0 goto L2
    
    E2:	NEGQ CX
    	MOVQ CX, c+72(FP)	// return c
    	RET
    
    
    // func addVW(z, x []Word, y Word) (c Word)
    TEXT ·addVW(SB),NOSPLIT,$0
    	MOVQ z_len+8(FP), DI
    	CMPQ DI, $32
    	JG large
    	MOVQ x+24(FP), R8
    	MOVQ y+48(FP), CX	// c = y
    	MOVQ z+0(FP), R10
    
    	MOVQ $0, SI		// i = 0
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Oct 19 23:33:27 UTC 2023
    - 9.1K bytes
    - Viewed (0)
Back to top