| /freebsd-12-stable/sys/dev/kbd/ |
| D | kbdtables.h | 106 /*3b*/{{ F( 1), F(13), F(25), F(37), S( 1), S(11), S( 1), S(11),}, 0xFF,0x00 },
107 /*3c*/{{ F( 2), F(14), F(26), F(38), S( 2), S(12), S( 2), S(12),}, 0xFF,0x00 },
108 /*3d*/{{ F( 3), F(15), F(27), F(39), S( 3), S(13), S( 3), S(13),}, 0xFF,0x00 },
109 /*3e*/{{ F( 4), F(16), F(28), F(40), S( 4), S(14), S( 4), S(14),}, 0xFF,0x00 },
110 /*3f*/{{ F( 5), F(17), F(29), F(41), S( 5), S(15), S( 5), S(15),}, 0xFF,0x00 },
111 /*40*/{{ F( 6), F(18), F(30), F(42), S( 6), S(16), S( 6), S(16),}, 0xFF,0x00 },
112 /*41*/{{ F( 7), F(19), F(31), F(43), S( 7), S( 7), S( 7), S( 7),}, 0xFF,0x00 },
113 /*42*/{{ F( 8), F(20), F(32), F(44), S( 8), S( 8), S( 8), S( 8),}, 0xFF,0x00 },
114 /*43*/{{ F( 9), F(21), F(33), F(45), S( 9), S( 9), S( 9), S( 9),}, 0xFF,0x00 },
115 /*44*/{{ F(10), F(22), F(34), F(46), S(10), S(10), S(10), S(10),}, 0xFF,0x00 },
[all …]
|
| /freebsd-12-stable/sys/dev/uart/ |
| D | uart_kbd_sun_tables.h | 18 /*05*/{{ F( 1), F(13), F(25), F(37), S( 1), S(11), S( 1), S(11),}, 0xFF,0x00 },
19 /*06*/{{ F( 2), F(14), F(26), F(38), S( 2), S(12), S( 2), S(12),}, 0xFF,0x00 },
20 /*07*/{{ F(10), F(22), F(34), F(46), S(10), S(10), S(10), S(10),}, 0xFF,0x00 },
21 /*08*/{{ F( 3), F(15), F(27), F(39), S( 3), S(13), S( 3), S(13),}, 0xFF,0x00 },
22 /*09*/{{ F(11), F(23), F(35), F(47), S(11), S(11), S(11), S(11),}, 0xFF,0x00 },
23 /*0a*/{{ F( 4), F(16), F(28), F(40), S( 4), S(14), S( 4), S(14),}, 0xFF,0x00 },
24 /*0b*/{{ F(12), F(24), F(36), F(48), S(12), S(12), S(12), S(12),}, 0xFF,0x00 },
25 /*0c*/{{ F( 5), F(17), F(29), F(41), S( 5), S(15), S( 5), S(15),}, 0xFF,0x00 },
27 /*0e*/{{ F( 6), F(18), F(30), F(42), S( 6), S(16), S( 6), S(16),}, 0xFF,0x00 },
29 /*10*/{{ F( 7), F(19), F(31), F(43), S( 7), S( 7), S( 7), S( 7),}, 0xFF,0x00 },
[all …]
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| D | BuildLibCalls.cpp | 50 static bool setDoesNotAccessMemory(Function &F) { in setDoesNotAccessMemory() argument
51 if (F.doesNotAccessMemory()) in setDoesNotAccessMemory()
53 F.setDoesNotAccessMemory(); in setDoesNotAccessMemory()
58 static bool setOnlyAccessesInaccessibleMemory(Function &F) { in setOnlyAccessesInaccessibleMemory() argument
59 if (F.onlyAccessesInaccessibleMemory()) in setOnlyAccessesInaccessibleMemory()
61 F.setOnlyAccessesInaccessibleMemory(); in setOnlyAccessesInaccessibleMemory()
66 static bool setOnlyReadsMemory(Function &F) { in setOnlyReadsMemory() argument
67 if (F.onlyReadsMemory()) in setOnlyReadsMemory()
69 F.setOnlyReadsMemory(); in setOnlyReadsMemory()
74 static bool setOnlyAccessesArgMemory(Function &F) { in setOnlyAccessesArgMemory() argument
[all …]
|
| /freebsd-12-stable/contrib/binutils/opcodes/ |
| D | mep-opc.c | 175 #define F(f) & mep_cgen_ifld_table[MEP_##f] macro
177 #define F(f) & mep_cgen_ifld_table[MEP_/**/f] macro
184 16, 16, 0xf00f, { { F (F_MAJOR) }, { F (F_RN) }, { F (F_RM) }, { F (F_SUB4) }, { 0 } }
188 16, 16, 0xf00f, { { F (F_MAJOR) }, { F (F_RN) }, { F (F_RM) }, { F (F_SUB4) }, { 0 } }
192 16, 16, 0xf00f, { { F (F_MAJOR) }, { F (F_RN) }, { F (F_RM) }, { F (F_SUB4) }, { 0 } }
196 16, 16, 0xf00f, { { F (F_MAJOR) }, { F (F_RN) }, { F (F_RM) }, { F (F_SUB4) }, { 0 } }
200 16, 16, 0xf00f, { { F (F_MAJOR) }, { F (F_RN) }, { F (F_RM) }, { F (F_SUB4) }, { 0 } }
204 …16, 16, 0xf083, { { F (F_MAJOR) }, { F (F_RN) }, { F (F_8) }, { F (F_7U9A4) }, { F (F_SUB2) }, { 0…
208 16, 16, 0xf880, { { F (F_MAJOR) }, { F (F_4) }, { F (F_RN3) }, { F (F_8) }, { F (F_7U9) }, { 0 } }
212 …16, 16, 0xf881, { { F (F_MAJOR) }, { F (F_4) }, { F (F_RN3) }, { F (F_8) }, { F (F_7U9A2) }, { F (…
[all …]
|
| /freebsd-12-stable/contrib/bmake/filemon/ |
| D | filemon_ktrace.c | 196 struct filemon *F; in filemon_open() local
201 F = calloc(1, sizeof(*F)); in filemon_open()
202 if (F == NULL) in filemon_open()
212 if ((F->in = fdopen(ktrpipe[0], "r")) == NULL) { in filemon_open()
222 F->ktrfd = ktrpipe[1]; in filemon_open()
223 rb_tree_init(&F->active, &filemon_rb_ops); in filemon_open()
226 return F; in filemon_open()
229 (void)fclose(F->in); in filemon_open()
232 fail0: free(F); in filemon_open()
246 filemon_closefd(struct filemon *F) in filemon_closefd() argument
[all …]
|
| D | filemon_dev.c | 63 struct filemon *F; in filemon_open() local
68 F = calloc(1, sizeof(*F)); in filemon_open()
69 if (F == NULL) in filemon_open()
73 for (i = 0; (F->fd = open(_PATH_FILEMON, O_RDWR|O_CLOEXEC)) == -1; i++) { in filemon_open()
81 return F; in filemon_open()
83 fail0: free(F); in filemon_open()
89 filemon_setfd(struct filemon *F, int fd) in filemon_setfd() argument
93 if (ioctl(F->fd, FILEMON_SET_FD, &fd) == -1) in filemon_setfd()
104 filemon_setpid_parent(struct filemon *F, pid_t pid) in filemon_setpid_parent() argument
110 filemon_setpid_child(const struct filemon *F, pid_t pid) in filemon_setpid_child() argument
[all …]
|
| /freebsd-12-stable/crypto/openssh/ |
| D | verify.c | 15 #define F(i) differentbits |= x[i] ^ y[i]; in crypto_verify_32() macro
16 F(0) in crypto_verify_32()
17 F(1) in crypto_verify_32()
18 F(2) in crypto_verify_32()
19 F(3) in crypto_verify_32()
20 F(4) in crypto_verify_32()
21 F(5) in crypto_verify_32()
22 F(6) in crypto_verify_32()
23 F(7) in crypto_verify_32()
24 F(8) in crypto_verify_32()
[all …]
|
| /freebsd-12-stable/sys/contrib/octeon-sdk/ |
| D | cvmx-debug.h | 101 F(remote_controlled); \
104 F(regs[i]); \
106 F(lo); \
107 F(hi);
126 F(cop0.index); \
127 F(cop0.entrylo[0]); \
128 F(cop0.entrylo[1]); \
129 F(cop0.entryhi); \
130 F(cop0.pagemask); \
131 F(cop0.status); \
[all …]
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
| D | PreISelIntrinsicLowering.cpp | 30 static bool lowerLoadRelative(Function &F) { in lowerLoadRelative() argument
31 if (F.use_empty()) in lowerLoadRelative()
35 Type *Int32Ty = Type::getInt32Ty(F.getContext()); in lowerLoadRelative()
37 Type *Int8Ty = Type::getInt8Ty(F.getContext()); in lowerLoadRelative()
39 for (auto I = F.use_begin(), E = F.use_end(); I != E;) { in lowerLoadRelative()
42 if (!CI || CI->getCalledOperand() != &F) in lowerLoadRelative()
63 static CallInst::TailCallKind getOverridingTailCallKind(const Function &F) { in getOverridingTailCallKind() argument
64 objcarc::ARCInstKind Kind = objcarc::GetFunctionClass(&F); in getOverridingTailCallKind()
72 static bool lowerObjCCall(Function &F, const char *NewFn, in lowerObjCCall() argument
74 if (F.use_empty()) in lowerObjCCall()
[all …]
|
| /freebsd-12-stable/contrib/googletest/googlemock/test/ |
| D | gmock-generated-internal-utils_test.cc | 74 typedef Function<int()> F; // NOLINT in TEST() typedef
75 CompileAssertTypesEqual<int, F::Result>(); in TEST()
76 CompileAssertTypesEqual<tuple<>, F::ArgumentTuple>(); in TEST()
77 CompileAssertTypesEqual<tuple<>, F::ArgumentMatcherTuple>(); in TEST()
78 CompileAssertTypesEqual<void(), F::MakeResultVoid>(); in TEST()
79 CompileAssertTypesEqual<IgnoredValue(), F::MakeResultIgnoredValue>(); in TEST()
83 typedef Function<int(bool)> F; // NOLINT in TEST() typedef
84 CompileAssertTypesEqual<int, F::Result>(); in TEST()
85 CompileAssertTypesEqual<bool, F::Argument1>(); in TEST()
86 CompileAssertTypesEqual<tuple<bool>, F::ArgumentTuple>(); in TEST()
[all …]
|
| /freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| D | TargetLibraryInfo.h | 62 void setState(LibFunc F, AvailabilityState State) { in setState() argument
63 AvailableArray[F/4] &= ~(3 << 2*(F&3)); in setState()
64 AvailableArray[F/4] |= State << 2*(F&3); in setState()
66 AvailabilityState getState(LibFunc F) const { in getState() argument
67 return static_cast<AvailabilityState>((AvailableArray[F/4] >> 2*(F&3)) & 3); in getState()
78 bool isValidProtoForLibFunc(const FunctionType &FTy, LibFunc F,
111 bool getLibFunc(StringRef funcName, LibFunc &F) const;
118 bool getLibFunc(const Function &FDecl, LibFunc &F) const;
121 void setUnavailable(LibFunc F) { in setUnavailable() argument
122 setState(F, Unavailable); in setUnavailable()
[all …]
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
| D | FunctionAttrs.cpp | 112 static MemoryAccessKind checkFunctionMemoryAccess(Function &F, bool ThisBody, in checkFunctionMemoryAccess() argument
115 FunctionModRefBehavior MRB = AAR.getModRefBehavior(&F); in checkFunctionMemoryAccess()
134 for (inst_iterator II = inst_begin(F), E = inst_end(F); II != E; ++II) { in checkFunctionMemoryAccess()
236 MemoryAccessKind llvm::computeFunctionBodyMemoryAccess(Function &F, in computeFunctionBodyMemoryAccess() argument
238 return checkFunctionMemoryAccess(F, /*ThisBody=*/true, AAR, {}); in computeFunctionBodyMemoryAccess()
248 for (Function *F : SCCNodes) { in addReadAttrs()
250 AAResults &AAR = AARGetter(*F); in addReadAttrs()
255 switch (checkFunctionMemoryAccess(*F, F->hasExactDefinition(), in addReadAttrs()
280 for (Function *F : SCCNodes) { in addReadAttrs()
281 if (F->doesNotAccessMemory()) in addReadAttrs()
[all …]
|
| D | SCCP.cpp | 27 auto GetTLI = [&FAM](Function &F) -> const TargetLibraryInfo & { in run() argument
28 return FAM.getResult<TargetLibraryAnalysis>(F); in run()
30 auto getAnalysis = [&FAM](Function &F) -> AnalysisResultsForFn { in run() argument
31 DominatorTree &DT = FAM.getResult<DominatorTreeAnalysis>(F); in run()
33 std::make_unique<PredicateInfo>(F, DT, FAM.getResult<AssumptionAnalysis>(F)), in run()
34 &DT, FAM.getCachedResult<PostDominatorTreeAnalysis>(F)}; in run()
66 auto GetTLI = [this](Function &F) -> const TargetLibraryInfo & { in runOnModule() argument
67 return this->getAnalysis<TargetLibraryInfoWrapperPass>().getTLI(F); in runOnModule()
69 auto getAnalysis = [this](Function &F) -> AnalysisResultsForFn { in runOnModule() argument
71 this->getAnalysis<DominatorTreeWrapperPass>(F).getDomTree(); in runOnModule()
[all …]
|
| D | DeadArgumentElimination.cpp | 330 static unsigned NumRetVals(const Function *F) { in NumRetVals() argument
331 Type *RetTy = F->getReturnType(); in NumRetVals()
345 static Type *getRetComponentType(const Function *F, unsigned Idx) { in getRetComponentType() argument
346 Type *RetTy = F->getReturnType(); in getRetComponentType()
389 const Function *F = RI->getParent()->getParent(); in SurveyUse() local
391 RetOrArg Use = CreateRet(F, RetValNum); in SurveyUse()
396 for (unsigned Ri = 0; Ri < NumRetVals(F); ++Ri) { in SurveyUse()
397 RetOrArg Use = CreateRet(F, Ri); in SurveyUse()
430 const Function *F = CB->getCalledFunction(); in SurveyUse() local
431 if (F) { in SurveyUse()
[all …]
|
| D | MergeFunctions.cpp | 177 mutable AssertingVH<Function> F; member in __anon7347ae460111::FunctionNode
182 FunctionNode(Function *F) in FunctionNode() argument
183 : F(F), Hash(FunctionComparator::functionHash(*F)) {} in FunctionNode()
185 Function *getFunc() const { return F; } in getFunc()
191 F = G; in replaceBy()
243 void remove(Function *F);
256 void mergeTwoFunctions(Function *F, Function *G);
273 void writeThunk(Function *F, Function *G);
276 void writeAlias(Function *F, Function *G);
280 bool writeThunkOrAlias(Function *F, Function *G);
[all …]
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| D | AMDGPUPropagateAttributes.cpp | 73 explicit FnProperties(const TargetMachine &TM, const Function &F) { in FnProperties() argument
74 Features = TM.getSubtargetImpl(F)->getFeatureBits(); in FnProperties()
77 if (F.hasFnAttribute(AttributeNames[I])) in FnProperties()
78 Attributes[I] = F.getFnAttribute(AttributeNames[I]); in FnProperties()
128 Function *cloneWithProperties(Function &F, const FnProperties &NewProps);
131 void setFeatures(Function &F, const FeatureBitset &NewFeatures);
134 void setAttributes(Function &F, const ArrayRef<Optional<Attribute>> NewAttrs);
146 bool process(Function &F);
168 bool runOnFunction(Function &F) override;
214 for (auto &F : M.functions()) in process() local
[all …]
|
| /freebsd-12-stable/sbin/growfs/ |
| D | debug.h | 71 #define DBG_DUMP_HEX(F,C,M) dbg_dump_hex((F),(C),(M)) argument
72 #define DBG_DUMP_FS(F,C) dbg_dump_fs((F),(C)) argument
73 #define DBG_DUMP_CG(F,C,M) dbg_dump_cg((C),(M)) argument
74 #define DBG_DUMP_CSUM(F,C,M) dbg_dump_csum((C),(M)) argument
75 #define DBG_DUMP_INO(F,C,M) (F)->fs_magic == FS_UFS1_MAGIC \ argument
76 ? dbg_dump_ufs1_ino((F),(C),(struct ufs1_dinode *)(M)) \
77 : dbg_dump_ufs2_ino((F),(C),(struct ufs2_dinode *)(M))
78 #define DBG_DUMP_IBLK(F,C,M,L) dbg_dump_iblk((F),(C),(M),(L)) argument
79 #define DBG_DUMP_INMAP(F,C,M) dbg_dump_inmap((F),(C),(M)) argument
80 #define DBG_DUMP_FRMAP(F,C,M) dbg_dump_frmap((F),(C),(M)) argument
[all …]
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| D | SCCP.cpp | 133 Function *F = CB->getCalledFunction(); in tryToReplaceWithConstant() local
136 if (F) in tryToReplaceWithConstant()
137 Solver.addToMustPreserveReturnsInFunctions(F); in tryToReplaceWithConstant()
188 static bool runSCCP(Function &F, const DataLayout &DL, in runSCCP() argument
190 LLVM_DEBUG(dbgs() << "SCCP on function '" << F.getName() << "'\n"); in runSCCP()
192 DL, [TLI](Function &F) -> const TargetLibraryInfo & { return *TLI; }, in runSCCP() argument
193 F.getContext()); in runSCCP()
196 Solver.markBlockExecutable(&F.front()); in runSCCP()
199 for (Argument &AI : F.args()) in runSCCP()
207 ResolvedUndefs = Solver.resolvedUndefsIn(F); in runSCCP()
[all …]
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/ |
| D | CFGPrinter.cpp | 62 static void writeCFGToDotFile(Function &F, BlockFrequencyInfo *BFI, in writeCFGToDotFile() argument
66 (CFGDotFilenamePrefix + "." + F.getName() + ".dot").str(); in writeCFGToDotFile()
72 DOTFuncInfo CFGInfo(&F, BFI, BPI, MaxFreq); in writeCFGToDotFile()
84 static void viewCFG(Function &F, const BlockFrequencyInfo *BFI, in viewCFG() argument
87 DOTFuncInfo CFGInfo(&F, BFI, BPI, MaxFreq); in viewCFG()
92 ViewGraph(&CFGInfo, "cfg." + F.getName(), CFGOnly); in viewCFG()
102 bool runOnFunction(Function &F) override { in runOnFunction()
103 if (!CFGFuncName.empty() && !F.getName().contains(CFGFuncName)) in runOnFunction()
107 viewCFG(F, BFI, BPI, getMaxFreq(F, BFI)); in runOnFunction()
126 PreservedAnalyses CFGViewerPass::run(Function &F, FunctionAnalysisManager &AM) { in run() argument
[all …]
|
| /freebsd-12-stable/crypto/openssl/crypto/sm3/ |
| D | sm3.c | 23 c->F = SM3_F; in sm3_init()
32 register unsigned MD32_REG_T A, B, C, D, E, F, G, H; in sm3_block_data_order() local
44 F = ctx->F; in sm3_block_data_order()
69 R1(A, B, C, D, E, F, G, H, 0x79CC4519, W00, W00 ^ W04); in sm3_block_data_order()
71 R1(D, A, B, C, H, E, F, G, 0xF3988A32, W01, W01 ^ W05); in sm3_block_data_order()
73 R1(C, D, A, B, G, H, E, F, 0xE7311465, W02, W02 ^ W06); in sm3_block_data_order()
75 R1(B, C, D, A, F, G, H, E, 0xCE6228CB, W03, W03 ^ W07); in sm3_block_data_order()
77 R1(A, B, C, D, E, F, G, H, 0x9CC45197, W04, W04 ^ W08); in sm3_block_data_order()
79 R1(D, A, B, C, H, E, F, G, 0x3988A32F, W05, W05 ^ W09); in sm3_block_data_order()
81 R1(C, D, A, B, G, H, E, F, 0x7311465E, W06, W06 ^ W10); in sm3_block_data_order()
[all …]
|
| /freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/IR/ |
| D | InstIterator.h | 131 inline inst_iterator inst_begin(Function *F) { return inst_iterator(*F); } in inst_begin() argument
132 inline inst_iterator inst_end(Function *F) { return inst_iterator(*F, true); } in inst_end() argument
133 inline inst_range instructions(Function *F) { in instructions() argument
134 return inst_range(inst_begin(F), inst_end(F)); in instructions()
136 inline const_inst_iterator inst_begin(const Function *F) { in inst_begin() argument
137 return const_inst_iterator(*F); in inst_begin()
139 inline const_inst_iterator inst_end(const Function *F) { in inst_end() argument
140 return const_inst_iterator(*F, true); in inst_end()
142 inline const_inst_range instructions(const Function *F) { in instructions() argument
143 return const_inst_range(inst_begin(F), inst_end(F)); in instructions()
[all …]
|
| /freebsd-12-stable/contrib/bc/tests/bc/ |
| D | lib2_results.txt | 255 F
269 7F
271 7F
285 FF 7F
299 7F FF
301 7F FF
315 FF FF 7F FF
329 7F FF FF FF
331 7F FF FF FF
348 FF FF FF FF 7F FF FF FF
[all …]
|
| /freebsd-12-stable/crypto/openssl/crypto/sha/asm/ |
| D | sha1-c64xplus.pl | 40 ($A,$B,$C,$D,$E, $Arot,$F,$F0,$T,$K) = map("A$_",(16..20, 21..25));
103 || AND $C,$B,$F
107 XOR $F0,$F,$F ; F_00_19(B,C,D)
113 ADD $F,$T,$T ; T+=F_00_19(B,C,D)
125 || AND $C,$B,$F
129 XOR $F0,$F,$F ; F_00_19(B,C,D)
135 ADD $F,$T,$T ; T+=F_00_19(B,C,D)
151 || AND $C,$B,$F
155 XOR $F0,$F,$F ; F_00_19(B,C,D)
160 ADD $F,$T,$T ; T+=F_00_19(B,C,D)
[all …]
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
| D | WebAssemblyFixFunctionBitcasts.cpp | 66 static void findUses(Value *V, Function &F, in findUses() argument
71 findUses(BC, F, Uses, ConstantBCs); in findUses()
73 findUses(A, F, Uses, ConstantBCs); in findUses()
74 else if (U.get()->getType() != F.getType()) { in findUses()
89 Uses.push_back(std::make_pair(&U, &F)); in findUses()
117 static Function *createWrapper(Function *F, FunctionType *Ty) { in createWrapper() argument
118 Module *M = F->getParent(); in createWrapper()
121 F->getName() + "_bitcast", M); in createWrapper()
129 FunctionType::param_iterator PI = F->getFunctionType()->param_begin(); in createWrapper()
130 FunctionType::param_iterator PE = F->getFunctionType()->param_end(); in createWrapper()
[all …]
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Bitcode/Writer/ |
| D | ValueEnumerator.cpp | 122 for (const Function &F : M) { in orderModule() local
123 for (const Use &U : F.operands()) in orderModule()
137 for (const Function &F : M) { in orderModule() local
138 if (F.isDeclaration()) in orderModule()
140 for (const BasicBlock &BB : F) in orderModule()
165 for (const Function &F : M) in orderModule() local
166 orderValue(&F, OM); in orderModule()
175 for (const Function &F : M) { in orderModule() local
176 if (F.isDeclaration()) in orderModule()
181 for (const BasicBlock &BB : F) in orderModule()
[all …]
|